119 search results - page 11 / 24 » On finite alphabets and infinite bases |
STOC
2002
ACM
14 years 10 months ago
2002
ACM
A randomized algorithm is given that solves the wait-free consensus problem for a shared-memory model with infinitely many processes. The algorithm is based on a weak shared coin ...
EPEW
2006
Springer
13 years 11 months ago
2006
Springer
This paper discusses five different ways to approximate the loss rate in a fundamental two class priority system, where each class has its own finite capacity buffer, as well as an...
ATVA
2008
Springer
13 years 11 months ago
2008
Springer
Abstract. Non-freely generated data types are widely used in case studies carried out in the theorem prover KIV. The most common examples are stores, sets and arrays. We present an...
CORR
2010
Springer
13 years 10 months ago
2010
Springer
The usual way to investigate the statistical properties of finitely generated subgroups of free groups, and of finite presentations of groups, is based on the so-called word-based ...
CLEIEJ
2008
13 years 10 months ago
2008
A lot of material has been written about wavelet theory. Most of these texts provide an elegant framework from the functional and real analysis point of view. The complete infinit...