2084 search results - page 203 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
166
Voted
STOC
1994
ACM
15 years 10 months ago
1994
ACM
Shannon's Coding Theorem shows that in order to reliably transmit a message of T bits over a noisy communication channel, only a constant slowdown factor is necessary in the ...
156
click to vote
SODA
2001
ACM
15 years 7 months ago
2001
ACM
Point location is the problem of preprocessing a planar polygonal subdivision S into a data structure in order to determine efficiently the cell of the subdivision that contains a...
149
Voted
CONCUR
2007
Springer
16 years 9 days ago
2007
Springer
Abstract. We propose a new model for timed games, based on concurrent game structures (CGSs). Compared to the classical timed game automata of Asarin et al. [8], our timed CGSs are...
161
Voted
COCOON
2006
Springer
15 years 9 months ago
2006
Springer
In a recent article, Nakhleh, Ringe and Warnow introduced perfect phylogenetic networks--a model of language evolution where languages do not evolve via clean speciation--and form...
174
Voted
LATIN
2010
Springer
16 years 29 days ago
2010
Springer
Many divide-and-conquer algorithms employ the fact that the vertex set of a graph of bounded treewidth can be separated in two roughly balanced subsets by removing a small subset o...