C. Greg Plaxton
- 1.B. Awerbuch, Y. Bartal, and A. Fiat. Distributed paging for general networks. In Proceedings of the 7th Annual A CM-SIAM Symposium on Discrete Algorithms, pages 574-583, January 1996. Google Scholar
Digital Library
- 2.B. Awerbuch and D. Peleg. Routing with polynomial communication space tradeoff. SIAM Journal of Discrete Mathematics, 5:151-162, 1990. Google ScholarDigital Library
- 3.B. Awerbuch and D. Peleg. Sparse partitions. In Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science, pages 503- 513, 1990.Google ScholarDigital Library
- 4.Y. Bartal, A. Fiat, and Y. Rabani. Competitive algorithms for distributed data management. In Proceedings of the 2#th Annual A CM Symposium on Theory of Computing, pages 39-47, May 1992. Google ScholarDigital Library
- 5.S. Dolev, E. Kranakis, D. Krizanc, and D. Peleg. Bubbles: Adaptative routing scheme for high-speed dynamic networks. In Proceedings of the 27th Annual A CM Symposium on the Theory of Computing, pages 528-537, 1995. Google ScholarDigital Library
- 6.R. L. Graham, D. E. Knuth, and O. Patashnik. Concrete Mathematics. Addison-Wesley, Reading, MA, 1989. Google ScholarDigital Library
- 7.J. D. Guyton and M. F. Schwartz. Locating nearby copies of replicated Internet servers. In Proceedings o/A CM SIGCOMM, pages 288-298, 1995. Google ScholarDigital Library
- 8.D. Karger, E. Lehman, T. Leighton, M. Levine, D. Lewin, and R. Panigrahy. Relieving hot spots on the World Wide Web. In Proceedings of the 29th Annual A CM Symposium on the Theory of Computing, May 1997. Google ScholarDigital Library
- 9.R. Karp, M. Luby, and F. Meyer auf der Heide. Efficient PI:tAM simulation on a distributed memory machine. In Proceedings of the #Ith Annual A CM Symposium on Theory o/Computing, pages 318-326, May 1992. Google ScholarDigital Library
- 10.S. J. Mullender, editor. Distributed Systems. Addison-Wesley, 1993.Google Scholar
- 11.S. J. Mullender and P. M. B. Vitgnyi. Distributed match-making. Algorithmica, 3:367-391, 1988.Google ScholarDigital Library
- 12.C. G. Plaxton and R. Rajaraman. Fast faulttolerant concurrent access to shared objects. In Proceedings o/the 37th Annual IEEE Symposium on Foundations of Computer Science, pages 570- 579, October 1996. Google ScholarDigital Library
- 13.C. G. Plaxton, R. Rajaraman, and A. W. Richa. Accessing nearby copies of replicated objects in a distributed environment. Technical Report TR-97- 11, Department of Computer Science, University of Texas at Austin, April 1997. Google ScholarDigital Library
- 14.A. G. Ranade. How to emulate shared memory. Journal of Computer and System Sciences, 42:307- 326, 1991. Google ScholarDigital Library
- 15.G. N. Raney. Functional composition patterns and power series reversion. Transactions American Mathematical Society, 94:441-451, 1960.Google ScholarCross Ref
- 16.E. Upfal and A. Wigderson. How to share memory in a distributed system. JACM, 34:116-127, 1987. Google ScholarDigital Library
- 17.M. Van Steen, F. J. Hauck, and A. S. Tanenbaum. A model for worldwide tracking of distributed objects. In Proceedings of TINA '96, pages 203-212, September 1996.Google Scholar
Index Terms
- Accessing nearby copies of replicated objects in a distributed environment
Comments