19. SODA 2008:
San Francisco, California, USA
(Ed.): Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008.
: Estimators and tail bounds for dimension reduction in lα (0 < α ≤ 2) using stable random projections.
Mark A. Iwen
: A deterministic sub-linear time sparse fourier algorithm via non-adaptive compressed sensing methods.
: Explicit constructions for compressed sensing of sparse signals.
: On allocations that maximize fairness.
: On the value of coordination in network design.
: Nondecreasing paths in a weighted graph or: how to optimally read a train schedule.
: Balls and bins with structure: balanced allocations on hypergraphs.
Nicholas J. A. Harvey
: Matroid intersection, pointer chasing, and Young's seminormal representation of Sn.
: Shuffling cards, adding numbers, and symmetric functions.
: Improved algorithmic versions of the Lovász Local Lemma.
: A constant factor approximation algorithm for k-median clustering with outliers.
Guy E. Blelloch
: Space-efficient dynamic orthogonal point location, segment intersection, and range reporting.
Kenneth L. Clarkson
: Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm.
: A local algorithm for finding dense subgraphs.
: On the approximability of influence in social networks.
: Splay trees, Davenport-Schinzel sequences, and the deque conjecture.
, Hamid Nazerzadeh
: Price based protocols for fair resource allocation: convergence time analysis and extension to Leontief utilities.
: Recognizing partial cubes in quadratic time.