328 search results - page 5 / 66 » An O(log n log log n) space algorithm for undirected st-conn... |
PODC
2006
ACM
14 years 2 months ago
2006
ACM
We consider the problem of name-independent routing in doubling metrics. A doubling metric is a metric space whose doubling dimension is a constant, where the doubling dimension o...
CORR
2010
Springer
13 years 3 months ago
2010
Springer
We study the edge-coloring problem in the message-passing model of distributed computing. This is one of the most fundamental problems in this area. Currently, the best-known dete...
JACM
2007
13 years 8 months ago
2007
We introduce exponential search trees as a novel technique for converting static polynomial space search structures for ordered sets into fully-dynamic linear space data structure...
SODA
2012
ACM
11 years 11 months ago
2012
ACM
We study the role that parallelism plays in time complexariants of Winfree’s abstract Tile Assembly Model (aTAM), a model of molecular algorithmic self-assembly. In the “hiera...
CPM
2008
Springer
13 years 10 months ago
2008
Springer
Abstract. We present a deterministic black box solution for online approximate matching. Given a pattern of length m and a streaming text of length n that arrives one character at ...