Selected papers that cite this one
- Miltos D. Grammatikakis, D. Frank Hsu, and Jop F. Sibeyn. Packet routing in fixed-connection networks: A survey. Journal of Parallel and Distributed Computing, 54(2):77-132, 1 November 1998.
- M. Luby. Introduction to special issue on randomized and derandomized algorithms. Algorithmica, 16(4/5):359-366, October/November 1996.
- Ji\v{r}í Matou\v{s}ek. Derandomization in computational geometry. Journal of Algorithms, 20(3):545-580, May 1996.
Selected references
- Abhiram G. Ranade. How to emulate shared memory (preliminary version). In 28th Annual Symposium on Foundations of Computer Science, pages 185-194, Los Angeles, California, 12-14 October 1987. IEEE.
- L. G. Valiant and G. J. Brebner. Universal schemes for parallel communication. In Conference Proceedings of the Thirteenth Annual ACM Symposium on Theory of Computation, pages 263-277, Milwaukee, Wisconsin, 11-13 May 1981.