Sciweavers

STOC
2002
ACM
119views Algorithms» more  STOC 2002»
14 years 11 months ago
Space-efficient approximate Voronoi diagrams
Given a set S of n points in IRd , a (t, )-approximate Voronoi diagram (AVD) is a partition of space into constant complexity cells, where each cell c is associated with t represe...
Sunil Arya, Theocharis Malamatos, David M. Mount
STOC
2002
ACM
81views Algorithms» more  STOC 2002»
14 years 11 months ago
Cache-oblivious priority queue and graph algorithm applications
Lars Arge, Michael A. Bender, Erik D. Demaine, Bry...
STOC
2002
ACM
115views Algorithms» more  STOC 2002»
14 years 11 months ago
Stability of load balancing algorithms in dynamic adversarial systems
In the dynamic load balancing problem, we seek to keep the job load roughly evenly distributed among the processors of a given network. The arrival and departure of jobs is modeled...
Elliot Anshelevich, David Kempe, Jon M. Kleinberg
STOC
2002
ACM
84views Algorithms» more  STOC 2002»
14 years 11 months ago
Random sampling and approximation of MAX-CSP problems
Noga Alon, Wenceslas Fernandez de la Vega, Ravi Ka...
STOC
2002
ACM
101views Algorithms» more  STOC 2002»
14 years 11 months ago
An exponential separation between regular and general resolution
: This paper gives two distinct proofs of an exponential separation between regular resolution and unrestricted resolution. The previous best known separation between these systems...
Michael Alekhnovich, Jan Johannsen, Toniann Pitass...
STOC
2002
ACM
141views Algorithms» more  STOC 2002»
14 years 11 months ago
Combinatorial optimization problems in self-assembly
Leonard M. Adleman, Qi Cheng, Ashish Goel, Ming-De...
STOC
2002
ACM
109views Algorithms» more  STOC 2002»
14 years 11 months ago
Approximate counting of inversions in a data stream
Miklós Ajtai, T. S. Jayram, Ravi Kumar, D. ...
STOC
2002
ACM
121views Algorithms» more  STOC 2002»
14 years 11 months ago
Almost all graphs with average degree 4 are 3-colorable
We analyze a randomized version of the Brelaz heuristic on sparse random graphs. We prove that almost all graphs with average degree dp4:03; i.e., G?n; p ? d=n?; are 3-colorable a...
Dimitris Achlioptas, Cristopher Moore