13306 search results - page 410 / 2662 » Theoretical Computer Science |
155
click to vote
STACS
2005
Springer
16 years 10 days ago
2005
Springer
Abstract. We consider data structures and algorithms for preprocessing a labelled list of length n so that, for any given indices i and j we can answer queries of the form: What is...
158
click to vote
STACS
2005
Springer
16 years 10 days ago
2005
Springer
Abstract. In this paper we determine some limit distributions of pattern statistics in rational stochastic models, defined by means of nondeterministic weighted finite automata. ...
187
click to vote
STACS
2005
Springer
16 years 10 days ago
2005
Springer
Abstract. It is well known that one-dimensional cellular automata working on the usual neighborhood are Turing complete, and many acceleration theorems are known. However very litt...
185
click to vote
STACS
2005
Springer
16 years 10 days ago
2005
Springer
Abstract. It is well-known that no classical algorithm can solve exactly (i.e., in bounded time without error) the leader election problem in anonymous networks. This paper propose...
172
click to vote
STACS
2005
Springer
16 years 10 days ago
2005
Springer
Dynamic complexity investigates the required effort to maintain knowledge about a property of a structure under changing operations. This article introduces a refined notion of ...