35 search results - page 3 / 7 » stacs 2005 |
167
click to vote
STACS
2005
Springer
15 years 11 months 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...
164
click to vote
STACS
2005
Springer
15 years 11 months ago
2005
Springer
Speed scaling is a power management technique that involves dynamically changing the speed of a processor. We study policies for setting the speed of the processor for both of the ...
156
click to vote
STACS
2005
Springer
15 years 11 months 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 ...
135
click to vote
STACS
2005
Springer
15 years 11 months 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...
170
click to vote
STACS
2005
Springer
15 years 11 months 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...