Sciweavers

79
Voted
STOC
2002
ACM
124views Algorithms» more  STOC 2002»
15 years 9 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