STOC 2001 | Sciweavers

We study two fundamental static data structure problems, membership and perfect hashing, in Yao's cell probe model. The first space and bit probe optimal worst case upper bou...

Rasmus Pagh

claim paper

Read More »

13

click to vote

STOC
2001
ACM

123views Algorithms» more STOC 2001»

On optimal slicing of parallel programs

14 years 5 months ago

Download cs.uni-muenster.de

Optimal program slicing determines for a statement S in a program whether or not S affects a specified set of statements, given that all conditionals in are interpreted as non-d...

Markus Müller-Olm, Helmut Seidl

claim paper

Read More »

17

click to vote

STOC
2001
ACM

147views Algorithms» more STOC 2001»

Conditions on input vectors for consensus solvability in asynchronous distributed systems

14 years 5 months ago

Download www.cs.utexas.edu

This article introduces and explores the condition-based approach to solve the consensus problem in asynchronous systems. The approach studies conditions that identify sets of inpu...

Achour Mostéfaoui, Michel Raynal, Sergio Ra...

claim paper

Read More »

11

click to vote

STOC
2001
ACM

132views Algorithms» more STOC 2001»

Edge isoperimetry and rapid mixing on matroids and geometric Markov chains

14 years 5 months ago

Download faculty.uml.edu

We show how to bound the mixing time and log-Sobolev constants of Markov chains by bounding the edge-isoperimetry of their underlying graphs. To do this we use two recent techniqu...

Ravi Montenegro, Jung-Bae Son

claim paper

Read More »

8

click to vote

STOC
2001
ACM

131views Algorithms» more STOC 2001»

Profit-earning facility location

14 years 5 months ago

Download www.cs.ucla.edu

Adam Meyerson

claim paper