Journal of the ACM Bibliography

Selected papers that cite this one

• Yehuda Afek, Baruch Awerbuch, Eli Gafni, Yishay Mansour, Adi Rosén, and Nir Shavit. Slide -- the key to polynomial end-to-end communication. Journal of Algorithms, 22(1):158-186, January 1997.

• Matthew Andrews, Tom Leighton, P. Takis Metaxas, and Lisa Zhang. Automatic methods for hiding latency in high bandwidth networks (extended abstract). In Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, pages 257-265, Philadelphia, Pennsylvania, 22-24 May 1996.

• Yonatan Aumann and Michael A. Bender. Fault tolerant data structures. In 37th Annual Symposium on Foundations of Computer Science, pages 580-589, Burlington, Vermont, 14-16 October 1996. IEEE.

• Baruch Awerbuch and Tom Leighton. Improved approximation algorithms for the multi-commodity flow problem and local competitive routing in dynamic networks. In Proceedings of the Twenty-Sixth Annual ACM Symposium on the Theory of Computing, pages 487-496, Montréal, Québec, Canada, 23-25 May 1994.

• Paul Bay and Gianfranco Bilardi. Deterministic on-line routing on area-universal networks. Journal of the ACM, 42(3):614-640, May 1995.

• Philippe Béguin and Antonella Cresti. General information dispersal algorithms. Theoretical Computer Science, 209(1-2):87-105, 6 December 1998.

• Bonnie Berger and John Rompel. Simulating (log^c n)-wise independence in NC. Journal of the ACM, 38(4):1026-1046, October 1991.

• Carlo Blundo, Alfredo De Santis, and Ugo Vaccaro. Randomness in distribution protocols. Information and Computation, 131(2):111-139, 15 December 1996.

• Richard J. Cole, Bruce Maggs, and Ramesh K. Sitaraman. Reconfiguring arrays with faults part I: Worst-case faults. SIAM Journal on Computing, 26(6):1581-1611, December 1997.

• Bhaskar Ghosh and S. Muthukrishnan. Dynamic load balancing by random matchings. Journal of Computer and System Sciences, 53(3):357-370, December 1996.

• 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.

• Qian-Ping Gu and Shietung Peng. Node-to-set disjoint paths problem in star graphs. Information Processing Letters, 62(4):201-207, 28 May 1997.

• Torben Hagerup. A lower bound for the emulation of PRAM memories on processor networks. Information and Computation, 119(1):124-128, 15 May 1995.

• David Karger, Eric Lehman, Tom Leighton, Matthew Levine, Daniel Lewin, and Rina Panigrahy. Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the World Wide Web. In Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, pages 654-663, El Paso, Texas, 4-6 May 1997.

• Seongyeol Kim and Ilyong Chung. Application of the special Latin square to a parallel routing algorithm on a recursive circulant network. Information Processing Letters, 66(3):141-147, 15 May 1998.

• F. Thomson Leighton, Bruce M. Maggs, and Ramesh K. Sitaraman. On the fault tolerance of some popular bounded-degree networks. SIAM Journal on Computing, 27(5):1303-1333, October 1998.

• Dahlia Malkhi and Michael Reiter. Byzantine quorum systems. In Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, pages 569-578, El Paso, Texas, 4-6 May 1997.

• Antoine N. Mourad, W. Kent Fuchs, and Daniel G. Saab. Site partitioning for redundant arrays of distributed disks. Journal of Parallel and Distributed Computing, 33(1):1-11, 25 February 1996.

• Moni Naor and Ron M. Roth. Optimal file sharing in distributed networks. SIAM Journal on Computing, 24(1):158-183, February 1995.

• C. Greg Plaxton and Rajmohan Rajaraman. Fast fault-tolerant concurrent access to shared objects. In 37th Annual Symposium on Foundations of Computer Science, pages 570-579, Burlington, Vermont, 14-16 October 1996. IEEE.

Shortcuts: