112 search results - page 1 / 23 » Faster deterministic dictionaries |
SODA
2000
ACM
13 years 6 months ago
2000
ACM
WIA
2001
Springer
13 years 9 months ago
2001
Springer
Abstract. We present a reflection on the evolution of the different methods for constructing minimal deterministic acyclic finite-state automata from a finite set of words. We ...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
We describe a new construction of an incoherent dictionary, referred to as the oscillator dictionary, which is based on considerations in the representation theory of finite groups...
SWAT
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. We study the gossiping problem in directed ad-hoc radio networks. Our main result is a deterministic algorithm that solves this problem in an n-node network in time O(n4/...
ICTCS
2005
Springer
13 years 10 months ago
2005
Springer
We consider the fundamental problem of waking up n processors sharing a multiple access channel. We assume the weakest model of synchronization, the locally synchronous model, in ...