Journal of the ACM Bibliography
Eli
Upfal. Efficient schemes for parallel communication. Journal
of the ACM, 31(3):507-517, July 1984.
[BibTeX entry]
Selected papers that cite this one
- Paul Bay and Gianfranco Bilardi. Deterministic on-line routing on
area-universal networks. Journal of the ACM,
42(3):614-640, May 1995.
- Allan Borodin, Prabhakar Raghavan, Baruch Schieber, and Eli Upfal. How much can hardware
help routing? Journal of the ACM, 44(5):726-741,
September 1997.
- Andrei Z. Broder, Alan M. Frieze, and Eli Upfal. A general approach to
dynamic packet routing with bounded buffers (extended abstract). In
37th Annual Symposium on Foundations of Computer Science,
pages 390-399, Burlington, Vermont, 14-16 October 1996. IEEE.
- Artur Czumaj, Friedhelm Meyer auf der Heide, and Volker Stemann. Simulating shared memory in real
time: On the computation power of reconfigurable architectures.
Information and Computation, 137(2):103-120, 15 September
1997.
- Martin Dietzfelbinger and Friedhelm Meyer auf der Heide. An optimal parallel
dictionary. Information and Computation,
102(2):196-217, February 1993.
- 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.
- Mor Harchol-Balter and David Wolfe. Bounding delays in
packet-routing networks. In Proceedings of the Twenty-Seventh
Annual ACM Symposium on the Theory of Computing, pages 248-257,
Las Vegas, Nevada, 29 May-1 June 1995.
- R. K. Karp, M. Luby, and F. Meyer auf der Heide. Efficient
PRAM simulation on a distributed memory machine.
Algorithmica, 16(4/5):517-542, October/November 1996.
- Danny Krizanc. Time-randomness
trade-offs in parallel computation. Journal of
Algorithms, 20(1):1-19, January 1996.
Shortcuts: