2252 search results - page 423 / 451 » Lower Bounds for Dynamic Algorithms |
SOFSEM
2009
Springer
14 years 5 months ago
2009
Springer
Cuckoo hashing was introduced by Pagh and Rodler in 2001 [12]. A set S of n keys is stored in two tables T1 and T2 each of which has m cells of capacity 1 such that constant access...
FOCS
2009
IEEE
14 years 3 months ago
2009
IEEE
In the classical balls-and-bins paradigm, where n balls are placed independently and uniformly in n bins, typically the number of bins with at least two balls in them is Θ(n) and ...
WINE
2009
Springer
14 years 3 months ago
2009
Springer
Recent results regarding games with congestion-averse utilities (or, congestion-averse games—CAGs) have shown they possess some very desirable properties. Specifically, they hav...
STACS
2007
Springer
14 years 2 months ago
2007
Springer
A coloring of a graph is convex if it induces a partition of the vertices into connected subgraphs. Besides being an interesting property from a theoretical point of view, tests f...
SP
2006
IEEE
14 years 2 months ago
2006
IEEE
The MIX technique forms the basis of many popular services that offer anonymity of communication in open and shared networks such as the Internet. In this paper, fundamental limit...