614 search results - page 25 / 123 » Local Computation: Lower and Upper Bounds |
ICALP
2005
Springer
14 years 28 days ago
2005
Springer
This paper presents several advances in the understanding of dynamic data structures in the bit-probe model: – We improve the lower bound record for dynamic language membership p...
ACL
2012
11 years 9 months ago
2012
Many researchers have attempted to predict the Enron corporate hierarchy from the data. This work, however, has been hampered by a lack of data. We present a new, large, and freel...
ICALP
2005
Springer
14 years 28 days ago
2005
Springer
We study interval coloring problems and present new upper and lower bounds for several variants. We are interested in four problems, online coloring of intervals with and without b...
TIT
2008
13 years 7 months ago
2008
This paper derives an improved sphere-packing (ISP) bound for finite-length error-correcting codes whose transmission takes place over symmetric memoryless channels, and the codes...
ICALP
2004
Springer
14 years 23 days ago
2004
Springer
Quantum algorithms for graph problems are considered, both in the adjacency matrix model and in an adjacency list-like array model. We give almost tight lower and upper bounds for ...