A Time-Randomness Trade-Off for Oblivious Routing
- 1 April 1990
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 19 (2) , 256-266
- https://doi.org/10.1137/0219017
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- On the power of two-point based samplingJournal of Complexity, 1989
- Routing, merging, and sorting on parallel models of computationJournal of Computer and System Sciences, 1985
- Efficient Schemes for Parallel CommunicationJournal of the ACM, 1984
- A Scheme for Fast Parallel CommunicationSIAM Journal on Computing, 1982
- Universal classes of hash functionsJournal of Computer and System Sciences, 1979
- Interconnections Between Processors and Memory Modules Using the Shuffle-Exchange NetworkIEEE Transactions on Computers, 1976