3415 search results - page 210 / 683 » Lower bounds on kernelization |
156
click to vote
MFCS
2005
Springer
15 years 11 months ago
2005
Springer
We study online interval coloring problems with bandwidth. We are interested in some variants motivated by bin packing problems. Specifically we consider open-end coloring, cardin...
191
click to vote
IPTPS
2003
Springer
15 years 11 months ago
2003
Springer
Koorde1 is a new distributed hash table (DHT) based on Chord [15] and the de Bruijn graphs [2]. While inheriting the simplicity of Chord, Koorde meets various lower bounds, such a...
185
click to vote
SPW
1997
Springer
15 years 10 months ago
1997
Springer
Abstract. This paper first extends the result of Blakley and Kabatianski [3] to general non-perfect SSS using information-theoretic arguments. Furthermore, we refine Okada and Ku...
194
click to vote
ICALP
1994
Springer
15 years 10 months ago
1994
Springer
A hash table is a representation of a set in a linear size data structure that supports constanttime membership queries. We show how to construct a hash table for any given set of...
191
click to vote
PODS
1992
ACM
15 years 10 months ago
1992
ACM
: We study the problem of determining whether a given recursive Datalog program is equivalent to a given nonrecursive Datalog program. Since nonrecursive Datalog programs are equiv...