328 search results - page 10 / 66 » An O(log n log log n) space algorithm for undirected st-conn... |
EUROCRYPT
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. We present a technique for Merkle tree traversal which requires only logarithmic space and time1 . For a tree with N nodes, our algorithm computes sequential tree leaves ...
ESA
2004
Springer
14 years 2 months ago
2004
Springer
We obtain the following results related to dynamic versions of the shortest-paths problem: (i) Reductions that show that the incremental and decremental singlesource shortest-paths...
DCG
2010
13 years 8 months ago
2010
We show that the cyclic lamplighter group C2 Cn embeds into Hilbert space with distortion O log n . This matches the lower bound proved by Lee, Naor and Peres in [14], answering a...
TALG
2010
13 years 7 months ago
2010
We establish the first nontrivial lower bounds on timespace tradeoffs for the selection problem. We prove that any comparison-based randomized algorithm for finding the median ...
DAM
2008
13 years 8 months ago
2008
: We consider a problem of searching an element in a partially ordered set (poset). The goal is to find a search strategy which minimizes the number of comparisons. Ben-Asher, Farc...