Sciweavers

SODA
2012
ACM
174views Algorithms» more  SODA 2012»
11 years 11 months ago
Using hashing to solve the dictionary problem
We consider the dictionary problem in external memory and improve the update time of the wellknown buffer tree by roughly a logarithmic factor. For any λ ≥ max{lg lg n, logM/B(...
John Iacono, Mihai Patrascu
SODA
2012
ACM
200views Algorithms» more  SODA 2012»
11 years 11 months ago
The shifting sands algorithm
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 ...
Andrew McGregor, Paul Valiant
SODA
2012
ACM
195views Algorithms» more  SODA 2012»
11 years 11 months ago
Concentration and moment inequalities for polynomials of independent random variables
In this work we design a general method for proving moment inequalities for polynomials of independent random variables. Our method works for a wide range of random variables incl...
Warren Schudy, Maxim Sviridenko
SODA
2012
ACM
224views Algorithms» more  SODA 2012»
11 years 11 months ago
Algorithms for the transportation problem in geometric settings
R. Sharathkumar, Pankaj K. Agarwal
SODA
2012
ACM
218views Algorithms» more  SODA 2012»
11 years 11 months ago
Linear kernels for (connected) dominating set on H-minor-free graphs
We give the first linear kernels for DOMINATING SET and CONNECTED DOMINATING SET problems on graphs excluding a fixed graph H as a minor. In other words, we give polynomial time...
Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, ...
SODA
2012
ACM
185views Algorithms» more  SODA 2012»
11 years 11 months ago
On a linear program for minimum-weight triangulation
ABSTRACT∗ Arman Yousefi† Neal E. Young‡ Minimum-weight triangulation (MWT) is NP-hard. It has a polynomial-time constant-factor approximation algorithm, and a variety of e...
Arman Yousefi, Neal E. Young
SODA
2012
ACM
177views Algorithms» more  SODA 2012»
11 years 11 months ago
Stochastic coalescence in logarithmic time
The following distributed coalescence protocol was introduced by Dahlia Malkhi in 2006 motivated by applications in social networking. Initially there are n agents wishing to coal...
Po-Shen Loh, Eyal Lubetzky
SODA
2012
ACM
191views Algorithms» more  SODA 2012»
11 years 11 months ago
Submatrix maximum queries in Monge matrices and Monge partial matrices, and their applications
We describe a data structure for submatrix maximum queries in Monge matrices or Monge partial matrices, where a query specifies a contiguous submatrix of the given matrix, and it...
Haim Kaplan, Shay Mozes, Yahav Nussbaum, Micha Sha...
SODA
2012
ACM
229views Algorithms» more  SODA 2012»
11 years 11 months ago
Approximation algorithms for stochastic orienteering
In the Stochastic Orienteering problem, we are given a metric, where each node also has a job located there with some deterministic reward and a random size. (Think of the jobs as...
Anupam Gupta, Ravishankar Krishnaswamy, Viswanath ...
SODA
2012
ACM
212views Algorithms» more  SODA 2012»
11 years 11 months ago
Parallelism and time in hierarchical self-assembly
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...
Ho-Lin Chen, David Doty