Algorithms | Sciweavers

49

STOC
2002
ACM

112views Algorithms» more STOC 2002»

Wait-free consensus with infinite arrivals

15 years 6 months ago

A randomized algorithm is given that solves the wait-free consensus problem for a shared-memory model with infinitely many processes. The algorithm is based on a weak shared coin ...

James Aspnes, Gauri Shah, Jatin Shah

claim paper

Read More »

48

click to vote

STOC
2002
ACM

119views Algorithms» more STOC 2002»

Space-efficient approximate Voronoi diagrams

15 years 6 months ago

Download www.cs.ust.hk

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

claim paper

Read More »

24

click to vote

STOC
2002
ACM

81views Algorithms» more STOC 2002»

Cache-oblivious priority queue and graph algorithm applications

15 years 6 months ago

Download erikdemaine.org

Lars Arge, Michael A. Bender, Erik D. Demaine, Bry...

claim paper

Read More »

53

click to vote

STOC
2002
ACM

115views Algorithms» more STOC 2002»

Stability of load balancing algorithms in dynamic adversarial systems

15 years 6 months ago

Download www-rcf.usc.edu

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

claim paper

Read More »

37

click to vote

STOC
2002
ACM

79views Algorithms» more STOC 2002»

Computing the betti numbers of arrangements

15 years 6 months ago

Download www.math.purdue.edu

Saugata Basu

claim paper

Read More »

30

click to vote

STOC
2002
ACM

84views Algorithms» more STOC 2002»

Random sampling and approximation of MAX-CSP problems

15 years 6 months ago

Download www.math.tau.ac.il

Noga Alon, Wenceslas Fernandez de la Vega, Ravi Ka...

claim paper

Read More »

38

click to vote

STOC
2002
ACM

101views Algorithms» more STOC 2002»

An exponential separation between regular and general resolution

15 years 6 months ago

Download cs.anu.edu.au

: 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...

claim paper

Read More »

49

click to vote

STOC
2002
ACM

92views Algorithms» more STOC 2002»

Tradeoffs in probabilistic packet marking for IP traceback

15 years 6 months ago

Download www-net.cs.umass.edu

Micah Adler

claim paper