151 search results - page 17 / 31 » Tight Bounds for Graph Problems in Insertion Streams |
263
Voted
STOC
2012
ACM
13 years 6 months ago
2012
ACM
In this paper we develop a new technique for proving lower bounds on the update time and query time of dynamic data structures in the cell probe model. With this technique, we pro...
159
click to vote
FCT
2005
Springer
15 years 9 months ago
2005
Springer
We present several results on the complexity of various forms of Sperner’s Lemma in the black-box model of computing. We give a deterministic algorithm for Sperner problems over ...
134
click to vote
CORR
2006
Springer
15 years 4 months ago
2006
Springer
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set ...
162
click to vote
SODA
2012
ACM
13 years 6 months ago
2012
ACM
We resolve the problem of small-space approximate selection in random-order streams. Specifically, we present an algorithm that reads the n elements of a set in random order and ...
154
Voted
CORR
2010
Springer
15 years 4 months ago
2010
Springer
In this paper we show how the complexity of performing nearest neighbor (NNS) search on a metric space is related to the expansion of the metric space. Given a metric space we loo...