Sciweavers

STOC
2001
ACM
140views Algorithms» more  STOC 2001»
14 years 5 months ago
Compatible sequences and a slow Winkler percolation
Two infinite 0-1 sequences are called compatible when it is possible to cast out 0's from both in such a way that they become complementary to each other. Answering a question...
Péter Gács
STOC
2002
ACM
124views Algorithms» more  STOC 2002»
14 years 5 months ago
Clairvoyant scheduling of random walks
Two infinite walks on the same finite graph are called compatible if it is possible to introduce delays into them in such a way that they never collide. Years ago, Peter Winkler a...
Péter Gács