Massachusetts Insitute for Technology
6.895 Advanced Distributed Algorithms, Fall Term 2002
Professor Nancy Lynch
Handout 2 - Course Reading List - Fall Term 2002
Stuart A. Friedberg, Gary L. Peterson. An efficient solution to the mutual exclusion problem using weak semaphores. Information Processing Letters, 25(5):343-348, 1987.
H. Attiya and A. Fouren. Adaptive and efficient algorithms for lattice agreement and renaming. Siam Journal on Computing, 31(2):642-664, 2001. Prelminary version in PODC98. .ps
H. Attiya and A. Fouren, Polynomial and adaptive long-lived (2k-1)-renaming. In Proceedings of the 14th International Symposium on Distributed Computing (DISC 2000), Toledo, Spain, October 2000. (Best student paper). .ps
H. Attiya, A. Fouren and E. Gafni. An adaptive collect algorithm with applications. To appear in Distributed Computing. .ps
Eli Gafni, Michael Merritt, and Gadi Taubenfeld. The concurrency hierarchy, and algorithms for unbounded concurrency. In 20th Symposium on Principles of Distributed Computing (PODC 2001), pages 170--179, Newport, RI, August 2001. .ps
Prasad Jayanti, Tushar Deepak Chandra, and Sam Toueg. Fault-tolerant wait-free shared objects. Journal of the ACM, 45(3):451--500, May 1998. .pdf
Dahlia Malkhi, Michael Reiter, and Rebecca Wright. Probabilistic quorum systems. In Proceedings of the 16th Annual ACM Symposium on the Principles of Distributed Computing (PODC 97), pages 267--273, Santa Barbara, CA, August 1997. .ps
Dahlia Malkhi and Michael Reiter. Secure and scalable replication in Phalanx. In 17th IEEE Symposium on Reliable Distributed Systems (SRDS98), pages 51--60, West Lafayette, Indiana, October 1998. .ps
Lorenzo Alvisi, Dahlia Malkhi, Evelyn Pierce, Michael Reiter, and Rebecca Wright. Dynamic Byzantine quorum systems. In International Conference on Dependable Systems and Networks (DSN, FTCS-30 and DCCA-8), New York, 2000. .ps
G. Chockler and D. Malkhi. Active Disk Paxos with infinitely many processes. In Proceedings of the Twenty-First ACM Symposium on Principles of Distributed Computing (PODC 2002), Monterey, CA, July 2002. .ps
Rodrigo Rodrigues, Miguel Castro, and Barbara Liskov. BASE: Using abstraction to improve fault tolerance. In Proceedings of the 18th ACM Symposium on Operating Systems Principles (SOSP), Banff, Canada, October 2001. .ps
Colin Fidge. Logical time in distributed computing systems. IEEE Computer, 24(8):28--33, August 1991. .pdf
R. Schwarz and F. Mattern. Detecting causal relationships in distributed computations: In search of the holy grail. Distributed computing, 7(3):149-174, 1994. .ps
Leslie Lamport and P. M. Melliar-Smith. Synchronizing clocks in the presence of faults. Journal of the ACM, 32(1):52--78, January 1985. .pdf
Jennifer Lundelius and Nancy Lynch. An upper and lower bound for clock synchronization. Information and Control, 62(2-3):190--204, August/September 1984.
Danny Dolev, Joseph Y. Halpern, H. Raymond Strong. On the possibility and impossibility of achieving clock synchronization. Journal of Computer and System Sciences, 32(2): 230-250, 1986.
Michael J. Fischer and Nancy A. Lynch and Michael Merritt. Easy impossibility proofs for distributed consensus problems. Distributed Computing, 1(1):26-39, January 1986.
T. K. Srikanth and Sam Toueg. Optimal clock synchronization. Journal of the ACM, 34(3):626--645, July 1987. .pdf
Jennifer Lundelius Welch and Nancy A. Lynch. A new fault-tolerance algorithm for clock synchronization. Information and Computation, 77(1):1-36, April 1988.
Danny Dolev, Joseph Y. Halpern, Barbara Simons, H. Raymond Strong. Dynamic fault-tolerant clock synchronization. Journal of the ACM, 42(1): 143-185, 1995. .ps
Hagit Attiya and Jennifer Welch. Distributed computing: fundamentals, simulations and advanced topics. McGraw-Hill Publishing Company, UK, 1998.
S. Biaz and J. L. Welch. Closed form bounds for clock synchronization under simple uncertainty assumptions. Information Processing Letters. To appear. .ps
Tushar Deepak Chandra, Vassos Hadzilacos, and Sam Toueg. The weakest failure detector for solving consensus. Journal of the ACM, 43(4):685--722, July 1996. .pdf
Eli Gafni. A round-by-round failure detector - unifying synchrony and asynchrony. In Proceedings of the 17th Annual ACM Symposium on Principles of Distributed Computing, pages 143--152, Puerto Vallarta, Mexico, June 1998. .pdf
M. Aguilera, W. Chen, and S. Toueg. Using the heartbeat failure detector for quiescent reliable communication and consensus in partitionable networks. Theoretical Computer Science, 220(1):3-30, June 1999. (Special issue on Distributed Algorithms) .ps
Wei Chen, Sam Toueg, and Marcos Kawazoe Aguilera. On the quality of service of failure detectors. In International Conference on Dependable Systems and Networks (DSN), New York, NY, June 2000. Technical Report in preparation. .ps
R. Guerraoui. Indulgent algorithms. In Proceedings of the 19th Annual ACM Symposium on Principles of Distributed Computing (PODC'00), Portland, Oregon, pages 289-298, July 2000. Technical Report SSC-2000-007, Swiss Federal institute of Technology, Lausanne, 2000. .ps
J. M. Helary, M. Hurfin, A. Mostefaoui, M. Raynal, and F. Tronel. Computing global functions on asynchronous distributed systems with perfect failure detectors. IEEE Transactions on Parallel and Distributed Systems, 11(9):897-909, September 2000. .pdf
Marcos Kawazoe Aguilera and Wei Chen and Sam Toueg. Failure detection and consensus in the crash-recovery model. To appear in Distributed Computing. .ps
Marcos Kawazoe Aguilera, Wei Chen, and Sam Toueg. On quiescent reliable communication. To appear in the SIAM Journal on Computing. .ps
Indranil Gupta, Tushar D. Chandra, and German Goldszmidt. On scalable and efficient distributed failure detectors. In 20th Symposium on Principles of Distributed Computing (PODC 2001), pages 170--179, Newport, RI, August 2001. .pdf
V. Hadzilacos and S. Toueg. A modular approach to the specification and implementation of fault-tolerant broadcasts. Technical Report TR94-1425, Department of Computer Science, Cornell University, Ithaca NY, May 1994. .ps
Roberto DePrisco, Nancy Lynch, Alex Shvartsman, Nicole Immorlica, and Toh Ne Win. A Formal Treatment of Lamport's Paxos Algorithm. In progress, 2002. .ps
Achour Mostefaoui and Michel Raynal. Solving consensus using Chandra-Toueg's unreliable failure detectors: a general quorum-based approach. IRISA Publication number 1254, July 1999. .ps
Marcos Kawazoe Aguilera and Sam Toueg. A simple bivalency proof t resilient consensus requires t+1 rounds. Information Processing Letters, 71(3-4):155-158, August 1999. .ps
Kenneth Birman, Mark Hayden, Oznur Ozkasap, Zhen Xiao, Mihai Budiu, and Yaron Minsky. Bimodal multicast. ACM Transactions on Computer Systems, 17(2):41-88, May 1999. .pdf
Leslie Lamport. Paxos made simple. ACM SIGACT NEWS (Distributed Computing Column), 32(4):18--25, December 2001. .ps
R. Boichat, P. Dutta, S. Frolund, and R. Guerraoui. Deconstructing Paxos. Submitted for publication. Also, Technical Report, Distributed Programming Laboratory, Swiss Federal Institute of Technology, Lausanne, January 2001. .pdf
R. Guerraoui. Revisiting the relationship between non-blocking atomic commitment and consensus. In Jean-Michel H\'elary and Michel Raynal, editors, 9th International Workshop on Distributed Algorithms (WDAG), volume 972 of Lecture Notes in Computer Science, pages 87--100. Springer Verlag, September 1995. .ps
A. Schiper. Early consensus in an asynchronous system with a weak failure detector. Distributed Computing, 10(3):149-157, 1997. .pdf
Michael Hurfin and Michel Raynal. A simple and fast asynchronous consensus protocol based on a weak failure detector. Distributed Computing, 12(4):409-223, 1999. .pdf
R. Guerraoui and A. Schiper. The generic consensus service. IEEE Transactions on Software Engineering, 2000. Technical Report 98/282, École Polytechnique Fédérale de Lausanne, Switzerland, July 1998. .ps
Idit Keidar and Sergio Rajsbaum. On the cost of fault-tolerant consensus when there are no faults -a tutorial. Technical Report MIT-LCS-TR-821, May 2001. Preliminary version in SIGACT News, 32(2):45-63, Distributed Computing column, June 2001 (published in May 15th). .ps and PODC Tutorial Slides
Achour Mostefaoui, Sergio Rajsbaum, Michel Raynal, and Matthieu Roy. A hierarchy of conditions for consensus solvability. In Nir Shavit, editor, Proceedings of the Twentieth ACM Symposium on Principles of Distributed Computing, pages 151--160, Newport, Rhode Island, August 2001. .pdf
A. Mostefauoi and M. Raynal. Leader-based consensus. Parallel Processing Letters, 11(1):95--107, 2001. .ps
Partha Dutta and Rachid Guerraoui. The inherent price of indulgence. In Proceedings of the Twenty-First ACM Symposium on Principles of Distributed Computing (PODC 2002), Monterey, CA, July 2002. IC Technical Report ID: 200231, LPD Distributed Programming Laboratory, Swiss Federal Institute of Technology in Lausanne, 2002. .pdf
H. Attiya and J. L. Welch. Sequential consistency versus linearizability. ACM Transactions on Computer Systems, 12(1):91--122, May 1994. An earlier version appeared in Proc. 3rd ACM Symposium on Parallel Algorithms and Architectures, pages 304-315, Hilton Head, South Carolina, July 1991. .ps
Rivka Ladin, Barbara Liskov, Liuba Shrira, and Sanjay Ghemawat. Providing high availability using lazy replication. ACM Transactions on Computer Systems, 10(4):360--391, 1992. .pdf
Alan Fekete, David Gupta, Victor Luchangco, Nancy Lynch, and Alex Shvartsman. Eventually-serializable data service. Theoretical Computer Science, 220(1):113--156, June 1999. Special Issue on Distributed Algorithms. .ps
S. Frolund and R. Guerraoui. X-Ability: a theory of replication. Distributed Computing, 14(4), 2001. An extension of our PODC'00 ACM Symposium on Principles of Distributed Computing paper, July 2000. IC Technical Report ID: 200009, LPD Distributed Programming Laboratory, wiss Federal Institute of Technology in Lausanne, January 2000. .ps
B. S. Chlebus, R. De Prisco, and A. A. Shvartsman. Performing tasks on restartable message-passing processors. Distributed Computing, Vol. 14, series 1, pages 49-64, 2001. .pdf
C. Georgiou and A. Shvartsman. Cooperative computing with fragmentable and mergeable groups. In Proceedings of the 7th International Colloquium on Structural Information and Communication Complexity, pages 141--156, 2000. Also, Accepted for publication in J. of Discrete Alg-s. .ps
G. G. Malewicz, A. Russell, and A. A. Shvartsman. Distributed cooperation in the absence of communication. In Proceedings of the 14th International Conference on Distributed Computing, DISC, Toledo, Spain, pages 119-133, 2000. .ps
C. Georgiou, A. Russell, and A.A. Shvartsman. The complexity of synchronous iterative do-all with crashes. Distributed algorithms (DISC 2001), in volume 2180 of Lecture Notes in Computer Science, pages 151-165, 2001. .ps
A. Arora and M. Gouda. Distributed reset. IEEE Transactions on Computers, 43(9):1026--1038, 1994. .pdf
A. Arora and S. Kulkarni. Designing masking fault-tolerance via nonmasking fault-tolerance. IEEE Transactions on Software Engineering, 24(6):435--450, 1998. .pdf
A. Arora and A. Singhai. Fault-tolerant reconfiguration of trees and rings in distributed systems. Journal of High Integrity Systems, 1(4):375c--384, 1995. .ps
A. Arora and S. Kulkarni. Detectors and correctors: A theory of fault-tolerance components. In Proceedings of the 18th International Conference on Distributed Computing Systems, 1998. .pdf
George Varghese and Mahesh Jayaram. The fault span of crash failures. Journal of the ACM, 47(2):244-293, March, 2000. .pdf
Baruch Awerbuch, Boaz Patt-Shamir, and George Varghese. Self-stabilization by local checking and correction. Submitted for publication. Based on FOCS 91 paper and Ph.D. thesis. .ps
George Varghese Lecture 23: Self-Stabilization. Lecture notes from 6.852, Distributed Algorithms, Massachusetts Institute of Technology, Cambridge, MA, December 1992. .ps
Baruch Awerbuch, Boaz Patt-Shamir, George Varghese, and Shlomi Dolev. Self-stabilization by local checking and network reset. Proceedings of the 8th International Workshop on Distributed Algorithms, WDAG'94, Terschelling, The Netherlands, pages 326-339. October 1994. .ps
George Varghese. Self-stabilization by counter flushing. SIAM Journal on Computing, 30(2):486-510, 2000. Society for Industrial and Applied Mathematics. .ps
Adam M. Costello and George Varghese. Self-stabilization by window washing. Proceedings of the 15th Annual ACM Symposium on Principles of Distributed Computing (PODC '96), Philadelphia, Pa., USA, pages 35-44, May 1996. .ps
George Varghese. Dijkstra's protocols as examples of local checking and counter flushing. Manuscript, July 11, 1994. .ps
Shlomi Dolev. Self-Stabilization. MIT Press, 2000.
Mohamed G. Gouda. Multiphase stabilization. IEEE
Transactions on Software Engineering, 28(2):201-208, February 2002.
.pdf
Shmuel Katz, Kenneth J. Perry: Self-Stabilizing Extensions for Message-Passing
Systems. Distributed Computing 7(1): 17-26 (1993). Conference version, PODC,
1990 .pdf
Y. Afek, B. Awerbuch, E. Gafni, Y. Mansour, A. Rosen, and N. Shavit. Slide: The key to polynomial end-to-end communication. Journal of Algorithms, 22:158--186, 1997. .pdf
Costas Busch, Maurice Herlihy, and Roger Wattenhofer. Routing without flow control. In the Proceedings of the Thirteenth ACM Symposium on Parallel Algorithms and Architectures (SPAA), Crete Island, Greece, July 2001. .pdf
B. Awerbuch and D. Peleg. Sparse partitions. In In 31st Annual IEEE Symposium on Foundations of Computer Science, pages 503--513, 1990. .pdf
David Peleg. Distributed Computing: A Locality-Sensitive Approach. SIAM Monographs on Discrete Mathematics and Applications, 2000.
B. Awerbuch and D. Peleg. Online tracking of mobile users. Journal of the ACM, 42(5):1021--1058, 1995. .pdf
D. Peleg and V. Rubinovich, A near-tight lower bound on the time complexity of distributed MST construction, SIAM J. on Computing, 30(5):1427--1442, 2000. .ps
Zvi Lotker, Boaz Patt-Shamir, David Peleg. Distributed MST for constant diameter graphs. In Proceedings of the 20th ACM Symposium on Principles of Distributed Computing (PODC 2001), Newport, RI, pages 63-71, August 2001. .pdf
Subhendu Chattopadhyay, Lisa Higham, and Karen Seyffarth. Dynamic and self-stabilizing distributed matching. In Twenty-First ACM Symposium on Principles of Distributed Computing (PODC 2002), Monterey, CA, July 2002. Technical Report in progress. .ps (long version)
B. Englert, L. Rudolph, and A.A. Shvartsman. Developing and refining an adaptive token-passing strategy. In Proceedings of the 21st IEEE International Conference on Distributed Computer Systems (ICDCS-21), Phoenix, Arizona, April 2001.
Flaviu Cristian and Frank Schmuck. Agreeing on processor group membership in asynchronous distributed systems. Technical Report CSE95-428, University of California-San Diego, La Jolla, CA 92093-0114, 1995. .ps
I. Keidar and D. Dolev. Efficient message ordering in dynamic networks. In 15th ACM Symposium on Principles of Distributed Computing (PODC), Philadelphia, PA, pages 68--76, May 1996. .ps
Idit Keidar and Danny Dolev. Totally ordered broadcast in the face of network partitions. In D. Avresky, editor, Chapter 3 of Dependable Network Computing, pages 51-75, Kluwer Academic, 2000. .ps
D. Dolev and D. Malki. The Transis approach to high availability cluster communications. Communications of the ACM, 39(4):64--70, 1996. .ps
Y. Amir, G. V. Chockler, D. Dolev, and R. Vitenberg. Efficient state transfer in partitionable environments. In 2nd European Research Seminar on Advances in Distributed Systems (ERSADS'97), pages 183--192. BROADCAST (ESPRIT WG 22455), Operating Systems Laboratory, Swiss Federal Institute of Technology, Lausanne, March 1997. .ps
Alan Fekete, Nancy Lynch, and Alex Shvartsman. Specifying and using a partitionable group communication service. ACM Transactions on Computer Systems, 19(2):171--216, May 2001. .ps
Gregory Chockler, Idit Keidar, and Roman Vitenberg. Group communication specifications: A comprehensive study. ACM Computing Surveys, 33(4):1--43, December 2001. .ps
E. Yeger Lotem, I. Keidar, and Dolev, D. Dynamic voting for consistent primary components. In Proceedings of the Sixteenth Annual ACM Symposium on Principles of Distributed Computing, pages 63--71, Santa Barbara, CA, August 1997. .pdf
R. De Prisco, A. Fekete, N. Lynch, and A. Shvartsman. A dynamic view-oriented group communication service. In 17th ACM Symposium on Principles of Distributed Computing (PODC), pages 227--236, June 1998. .pdf
R. De Prisco, A. Fekete, N. Lynch, and A.A. Shvartsman. A dynamic primary configuration group communication service. In Prasad Jayanti, editor, Distributed Computing (Proceedings of DISC'99 - 13th International Symposium on Distributed Computing, Bratislava, Slovak Republic, September 1999), volume 1693 of Lecture Notes in Computer Science, pages 64--78, Springer-Verlag-Heidelberg. .ps
Dolev, S., Segala, R., Shvartsman, A.: Dynamic load balancing with group communication. In Proceedings of the 6th International Colloquium on Structural Information and Communication Complexity (1999), pages 111-125. (Accepted for publication in TCS.) .ps
I. Keidar, J. Sussman, K. Marzullo, and D. Dolev. A client-server oriented algorithm for virtually synchronous group membership in WANs. In 20th International Conference on Distributed Computing Systems (ICDCS), pages 356--365, Taipei, Taiwan, April 2000. .ps Full version: MIT Technical Memorandum MIT-LCS-TM-593. .ps
Bettina Kemme, Alberto Bartoli, and Ozalp Babaoglu. Online reconfiguration in replicated databases based on group communication. In Proceedings of the Int. Conf. on Dependable Systems and Networks (DSN 2001), Goteborg, Sweden, June 2001. .pdf
Ziv Bar-Joseph, Idit Keidar, and Nancy Lynch. Early-delivery dynamic atomic broadcast. In Proceedings of the 16th International Symposium on DIStributed Computing (DISC), Toulouse, France, October 2002. To appear. .ps
C. Greg Plaxton, Rajmohan Rajaraman, and Andrea W. Richa. Accessing nearby copies of replicated objects in a distributed environment. In Proceedings of the 9th Annual ACM Symposium on Parallel Algorithms and Architectures, Newport, RI, June 1997. .ps
David R. Karger and Matthias Ruhl. Finding nearest neighbors in growth restricted metrics. In Proceedings of the 34th ACM Symposium on Theory of Computing, Montreal, Canada, May 2002. .ps
Ben Y. Zhao, John D. Kubiatowicz, and Anthony Joseph. Tapestry: An infrastructure for fault-tolerant wide-area location and routing. Technical Report UCB/CSD-01-1141, Univerisity of California Berkeley, CA 94720, April 2001. .ps
Kirsten Hildrum, John Kubiatowicz, Satish Rao, and Ben Y. Zhao. Distributed object location in a dynamic network. In Proceedings of the Fourteenth ACM Symposium on Parallel Algorithms and Architectures (SPAA 2002), Winnipeg, Manitoba, Canada, August 2002. .ps
Ion Stoica, Robert Morris, David Karger, M. Frans Kaashoek, and Hari Balakrishnan. Chord: A scalable peer-to-peer lookup service for internet applications. To appear in IEEE/ACM Transactions on Networking. Also, in Proceedings of the ACM SIGCOMM '01 Conference, San Diego, California, August 2001. .ps
David Liben-Nowell, Hari Balakrishnan, and David Karger. Analysis of the evolution of peer-to-peer systems. In Proceedings of the 21st ACM Symposium on Principles of Distributed Computing (PODC 2002), Monterey, CA, July 2002. .ps
Frank Dabek, M. Frans Kaashoek, David Karger, Robert Morris, and Ion Stoica. Wide-area cooperative storage with CFS In Proceedings of the 18th ACM Symposium on Operating Systems Principles (SOSP '01), Chateau Lake Louise, Banff, Canada. October 2001. .ps
Frank Dabek, Emma Brunskill, M. Frans Kaashoek, David Karger, Robert Morris, Ion Stoica, and Hari Balakrishnan. Building peer-to-peer systems with Chord, a distributed lookup service. In Proceedings of the 8th Workshop on Hot Topics in Operating Systems (HotOS-VIII), Schloss Elmau, Germany, May 2001. .ps
Silvia Ratnasamy, Paul Francis, Mark Handley, Richard Karp, and Scott Shenker. A scalable content-addressable network. In Proceedings of the ACM SIGCOMM' 01 Conference, San Diego, CA, pages 161-172, August 2001. .pdf
A. Rowstron and P. Druschel. Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms (Middleware), Heidelberg, Germany, pages 329-350, November 2001. .ps
D. Malkhi, M. Naor, and David Ratajczak. Viceroy: A scalable and dynamic emulation of the Butterfly. In Twenty-First ACM Symposium on Principles of Distributed Computing (PODC 2002), Monterey, CA, July 2002. .ps
David Mazières and Dennis Shasha. Building secure file systems out of Byzantine storage. In Proceedings of the Twenty-First ACM Symposium on Principles of Distributed Computing (PODC 2002), July 2002. .ps
John R. Douceur. The Sybil attack. In Proceedings for the 1st International Workshop on Peer-to-Peer Systems (IPTPS'02), MIT, Cambridge, March 2002. .pdf
James Aspnes, Zoë Diamadi, and Gauri Shah.
Fault-tolerant routing in peer-to-peer systems. In Proceedings
of the Twenty-First ACM Symposium on Principles of Distributed Computing,
Monterey, CA, pages 223-232, July 2002. .ps.
Also, longer
version.
A. Rowstron and P. Druschel. Storage Management and Caching in PAST, A Large-scale, Persistent Peer-to-peer Storage Utility, ACM SOSP, October 2001. .ps
N. Lynch, D. Malkhi, and D. Ratajczak.
Atomic Data Access in Content Addressable Networks: A Position Paper. First
International Workshop on Peer-to-Peer Computing (IPTPS 2002), Cambridge,
MA, March 2002. .pdf
Maurice Herlihy and Michael Demmer. The Arrow distributed directory protocol. In 12th International Symposium on DIStributed Computing (DISC98), pages 119--133, Andros, Greece, September 1998. .ps
Maurice Herlihy, Srikanta Tirthapura, and Roger Wattenhofer. Competitive concurrent distributed queuing. In Proceedings of the 20th Annual ACM Symposium on Principles of Distributed Computing (PODC 2001), Newport, RI, pages 127-133, August 2001. .ps
Nancy Lynch and Alex Shvartsman. RAMBO: A Reconfigurable Atomic Memory
Service for Dynamic Networks. In D. Malkhi, editor, Distributed Computing
(Proceedings of the 16th International Symposium on DIStributed Computing
(DISC) October 2002, Toulouse, France), volume 2508 of Lecture Notes in
Computer Science, pages 173-190, 2002. Springer-Verlag. .pdf
.
Nancy Lynch and Alex Shvartsman. RAMBO: A Reconfigurable Atomic Memory Service for Dynamic Networks. Technical Report MIT Laboratory for Computer Science, Technical Report MIT-LCS-TR-856, Cambridge, MA 2002. .ps
M. T. Hajiaghayi, M. Bahramgiri, and V. S. Mirrokni. Fault-tolerant and 3-Dimensional distributed topology control algorithms in wireless multi-hop networks. Proceedings of the 11th IEEE International Conference on Computer Communications and Networks (IC3N), pages 392-398, October 14-16, 2002, Miami, Floria. .ps
Charles E. Perkins and Elizabeth M. Royer. Ad hoc on-demand distance vector routing. In Proceedings of the 2nd IEEE Workshop on Mobile Computing Systems and Applications, New Orleans, LA, pages 90-100, February 1999. .ps
Young-Bae Ko and Nitin H. Vaidya. Location-aided routing (LAR) in mobile ad hoc networks. ACM/Baltzer Wireless Networks (WINET), Vol.6-4, 2000. .pdf
Young-Bae Ko and Nitin H. Vaidya. Geocasting in mobile ad-hoc netowrks: location-based multicast algorithms. In Proceedings of the 2nd IEEE Workshop on Mobile Computer Systems and Applications, (WMCSA), New Orleans, LA, February 1999. .pdf
Yih-Chun Hu and David B. Johnson. Caching strategies in on-demand routing protocols for wireless ad-hoc networks. In Proceedings of the sixth Annual International Conference on Mobile Computing and Networking, Boston, MA, pages 231-242, Aug. 2000. .pdf
Brad Karp and H. T. Kung. GPSR: Greedy-perimeter stateless routing for wireless networks. In MobiCom 2000, Proceedings of the Sixth Annual International Conference on Mobile Computing and Networking, Boston, MA, August 2000. .ps
Xiangchuan Chen and Amy L. Murphy. Enabling disconnected transitive communication in mobile ad hoc networks. In Proceedings of POMC 2001, Workshop on Principles of Mobile Computing, Newport, RI, August 2001. .pdf
I. Chatzigiannakis, S. Nikoletseas, and P. Spirakis. On the average and worst-case efficiency of some new distributed communication and control algorithms for ad-hoc mobile networks. Invited Paper in Proceedings of the 1st Workshop on Principles of Mobile Computing (POMC'2001), Newport, Rhode Island, USA, August 29-30, 2001. .ps
I. Chatzigiannakis, S. Nikoletseas and P. Spirakis. An efficient communication strategy for ad-hoc mobile networks. In Proceedings of 15th Symposium on Distributed Computing (DISC'2001), Informatics Department, Faculty of Sciences, University of Lisbon, Portugal, October 2-5, 2001, volume 2180 of Lecture Notes in Computer Science, Springer-Verlag, 2001. .ps
I. Chatzigiannakis, S. Nikoletseas, and P. Spirakis. An efficient routing protocol for hierarchical ad-hoc mobile networks. In Proceedings of the 1st IEEE/ACM International Workshop on Parallel and Distributed Computing Issues in Wireless networks and Mobile Computing (PDCIWNMC'2001), IPDPS 2001 Workshops, Hyatt Regency, San Francisco, USA, April 23-27, 2001. .ps
Navneet Malpani, Jennifer L. Welch, and Nitin Vaidya. Leader election algorithms for mobile ad hoc networks. In Fourth International Workshop on Discrete Algorithms and Methods forMobile Computing and Communications (DIAL-M), Boston, MA, August 2000. .ps
Shailaja Bulgannawar and Nitin H. Vaidya. A distributed k-mutual exclusion algorithm. In Proceedings of the 15th International Conference on Distributed Computing Systems (ICDCS), Vancouver, British Columbia, Canada, pages 153-150, May 30 - June 2, 1995, IEEE Computer Society Press, 1995. .pdf
J. Walter, G Cao, and M Mohanty. A k-mutual exclusion algorithm for wireless ad hoc networks. In Proceedings of the First Workshop on Principles of Mobile Computing (POMC 2001), Newport, Rhode Island, USA, August 2001. .pdf
J. Walter, J. Welch, and N. Amato. Concurrent metamorphosis of haxagonal robot chains into simple connected configurations. To appear in IEEE Transactions on Robotics and Automation, 2002. .pdf
Ichiro Suzuki, Masafumi Yamashita. Distributed Anonymous Mobile Robots: Formation of Geometric Patterns. SIAM Journal on Computing, Volume 28, Number 4 pp. 1347-1363 1999 Society for Industrial and Applied Mathematics .psP. Flocchini, G. Prencipe, N. Santoro, P. Widmayer. Gathering of asynchronous mobile robots with limited visibility, Proc. of International Symposium Theoretical Aspects of Computed Science (STACS 2001), Lecture Notes in Computer Science, Vol. 2010, 247-258, Dresden, 2001.