61 search results - page 12 / 13 » soda 2001 |
166
click to vote
AIIA
2001
Springer
15 years 10 months ago
2001
Springer
The exponential growth of documents available in the World Wide Web makes it increasingly difficult to discover relevant information on a specific topic. In this context, growing ...
178
click to vote
SODA
2012
ACM
13 years 8 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...
164
click to vote
JACM
2007
15 years 5 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...
232
click to vote
ALGORITHMICA
2011
15 years 1 months ago
2011
Let G = (V, E, w) be a directed graph, where w : V → R is an arbitrary weight function defined on its vertices. The bottleneck weight, or the capacity, of a path is the smalles...
163
click to vote
FOCS
2009
IEEE
16 years 21 days ago
2009
IEEE
— We show that for every fixed k, there is a linear time algorithm that decides whether or not a given graph has a vertex set X of order at most k such that G − X is planar (w...