Clairvoyant scheduling of random walks

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2002, Pages 99-108

  Gács, Peter ^a  

^a BOSTON UNIVERSITY   (United States)

Author keywords

Dependent percolation; Distributed computing; Scheduling

Indexed keywords

COMPUTER SIMULATION; DISTRIBUTED COMPUTER SYSTEMS; GRAPH THEORY; PERCOLATION (COMPUTER STORAGE); POLYNOMIALS; SCHEDULING; STATISTICAL METHODS;

CLAIRVOYANT SCHEDULING; DEPENDENT PERCOLATION; RANDOM WALKS;

PROBABILITY;

EID: 0036039019     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/509923.509925     Document Type: Conference Paper

References (6)

1. Dependent percolation in two dimensions
2. Collisions among random walks on a graph
3. The clairvoyant demon has a hard task
4. Compatible sequences and a slow Winkler percolation
5. Clairvoyant scheduling of random walks
6. Dependent percolation and colliding random walks