A Time-Randomness Trade-Off for Oblivious Routing

DOI10.1137/0219017zbMath0693.68029OpenAlexW2030160477MaRDI QIDQ3468611

Eli Upfal, David Peleg

Publication date: 1990

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0219017

zbMATH Keywords

communication networksrandomized algorithmspermutation routingresource trade-off

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99) Theory of software (68N99)

Related Items

Safe and efficient traffic laws for mobile robots ⋮ Quasi-random rumor spreading: reducing randomness can be costly ⋮ On the theory of interconnection networks for parallel computers ⋮ Bounds on tradeoffs between randomness and communication complexity ⋮ A Time-Randomness Tradeoff for Quasi-Random Rumour Spreading

This page was built for publication: A Time-Randomness Trade-Off for Oblivious Routing