Nancy A. Lynch. Multivalued possibilities mappings. In J.W. deBakker, W.P. de Roever, and G. Rozenberg, editors, Stepwise Refinementof Distributed Systems: Models, Formalisms, Correctness (REX Workshop,Mook, The Netherlands, May/June 1989), volume 430 of Lecture Notes in ComputerScience, pages 519--543. Springer-Verlag, 1990. .pdf Nancy Lynch. Multivalued possibilities mappings. TechnicalMemo MIT/LCS/TM-422, Laboratory for Computer Science, Massachusetts Instituteof Technology, Cambridge, MA, 02139, August 1990. .pdf B. Simons, Jennifer L. Welch, and Nancy Lynch. An overview of clock synchronization. In B. Simons and A. Spector, editors, Fault-tolerant Distributed Computing (Proceedings of of the Asilomar Workshop on Fault-Tolerant Distributed Computing, March, 1986), volume 448 of Lecture Notes in Computer Science, pages 84-96, 1990. Springer-Verlag. .pdf Ken Streeter. A partitioned computation machine. Master's thesis,Department of Electrical Engineering and Computer Science, MassachusettsInstitute of Technology, Cambridge, MA 02139, August 1990. .pdfGreg Troxel. A hierarchical proof of an algorithm for deadlock recoveryin a system using remote procedure calls. Master's thesis, Departmentof Electrical Engineering and Computer Science, Massachusetts Instituteof Technology, Cambridge, MA 02139, January 1990. Technical ReportMIT/LCS/TR-474, Cambridge, MA 02139, 1990. .pdf Mark R. Tuttle. Knowledge and distributed computation. TechnicalMemo MIT/LCS/TR-477, Laboratory for Computer Science, MassachusettsInstitute of Technology, Cambridge, MA, 02139, 1990. .pdf1989Hagit Attiya, Danny Dolev, and Nir Shavit. Bounded polynomial randomized consensus. In Proceedings of the Eighth Annual ACM Symposium on Principles of Distributed Computing, pages 281--293, Edmonton, Alberta, Canada, August 1989. .pdfHagit Attiya, Danny Dolev, and Nir Shavit. Bounded polynomial randomized consensus. Technical MemoMIT-LCS-TM-392, MIT Laboratory for Computer Science, Cambridge, MA02139, June 1989. pdfHagit Attiya and Nancy Lynch. Time bounds for real-time process control in the presence of timing uncertainty. In Proceedings of the 10th IEEE Real-Time Systems Symposium, pages 268-284, Santa Monica, CA, December 1989. pdfHagit Attiya and Nancy Lynch. Time bounds for real-time process control in the presence of timing uncertainty. Technical Memo MIT/LCS/TM-403, Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA, 02139, July 1989. .pdfHagit Attiya and Mark Tuttle. Bounds for slotted $ell-exclusion$. Unpublished manuscript, February 1989.Christopher P. Colby. Correctness Proofs of thePeterson-Fischer Mutual Exclusion Algorithms. Technical MemoMIT/LCS/TM-399, Laboratory for Computer Science, MassachusettsInstitute of Technology Cambridge, MA, June 1989. Bachelors thesis. .pdfDanny Dolev and Nir Shavit. Bounded concurrent time-stamp systems are constructible. In Proceedings of the Twenty-first Annual ACM Symposium on Theory of Computing, pages 454--466, Seattle, Washington, May 1989. .pdfDanny Dolev and Nir Shavit. Bounded concurrent time-stampsystems are constructible. Technical MemoMIT/LCS/TM-393, Laboratory for Computer Science, MassachusettsInstitute of Technology Cambridge, MA, June 1989. .pdfAlan Fekete, Nancy Lynch, Yishay Mansour, and John Spinelli.The Data link layer: The impossibility of implementing reliable communication in the face of crashes.Technical Memo MIT/LCS/TM-355.b, Massachusetts Institute of Technology, Laboratory for Computer Science, Cambridge, MA 02139, August 1989. Later version is MIT-LCS-TM-355.d, 1992.Alan Fekete, Nancy Lynch, Michael Merritt, and William Weihl. Commutativity-based locking for nested transactions. Technical Memo MIT/LCS/TM-370.b, Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA, 02139, 1989. .pdfMichael J. Fischer, Nancy A. Lynch, James E. Burns, and Allan Borodin. Distributed FIFO allocation of identical resources using small shared space. ACM Transactions on Programming Languages and Systems, 11(1):90--114, January 1989. pdfKenneth J. Goldman. Highly concurrent logically synchronous multicast. In Proceedings of the 3rd International Workshop on Distributed Algorithms, volume 392 of Lecture Notes in Computer Science, Nice, France, September 1989. Springer-Verlag. .pdfKenneth J. Goldman. Highly concurrent logically synchronous multicast. Technical Memo MIT/LCS/TM-401, Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA, July 1989. .pdfKenneth J. Goldman. Paralation views: Abstractions for efficient scientific computing on the connection machine. Technical Memo MIT/LCS/TM-398, Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA, August 1989. .pdfJoseph Halpern and Mark Tuttle. Knowledge, probability, and adversaries. In Proceedings of the Eighth Annual ACM Symposium on Principles of Distributed Computing, pages 103--118, August 1989. Also, IBM Research Report RJ 7045, September 1989. .pdfMaurice Herlihy, Nancy Lynch, Michael Merritt, and William Weihl. On the correctness of orphan management algorithms. Technical Memo MIT/LCS/TM-406, Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA 02139, August 1989. pdfLeslie Lamport and Nancy Lynch. Chapter on distributed computing. Technical Memo MIT/LCS/TM-384, Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA, 02139, February 1989. pdfNancy Lynch. A hundred impossiblility proofs for distributed computing. In Proceedings of the Eighth Annual ACM Symposium on Principles of Distributed Computing, Edmonton, Alberta, Canada, August 1989. PDFNancy Lynch. A hundred impossiblility proofs for distributed computing. Technical Memo MIT/LCS/TM-394, Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA, 02139, 1989. PDFNancy Lynch and Hagit Attiya. Using mappings to prove timing properties.Technical Memo MIT/LCS/TM-412.b, Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA, 02139, December 1989. .pdfNancy Lynch and Kenneth J. Goldman. Distributed algorithms. MIT/LCS/RSS 5, Laboratory for Computer Science, Massachusetts Institute of Technology, 1989. Lecture notes for 6.852. .pdfNancy Lynch and Eugene Stark. A proof of the Kahn principle for Input/Output automata. Information and Computation, 82(1):81--92, July 1989. .pdfNancy Lynch and MarkTuttle. An introduction to Input/Output automata. CWI-Quarterly,2(3):219--246, September 1989. Centrum voor Wiskunde en Informatica, Amsterdam,The Netherlands. .pdf Also, Technical Memo MIT/LCS/TM-373, Laboratory for ComputerScience, Massachusetts Institute of Technology. .pdfMagda F. Nour. An Automata-Theoretic Model for Unity.Technical Memo MIT/LCS/TM-400, Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA 02139, June 1989. Bachelors thesis. .pdfMark R. Tuttle. Knowlege and Distributed Computation. Ph.D thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technolgy, September 1989. .pdfJennifer Welch and Nancy Lynch. Synthesis of efficient drinking philosophers algorithms. Technical Memo MIT/LCS/TM-417, Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA, November, 1989. .pdf1988James Aspnes, Alan Fekete, Nancy Lynch, Michael Merritt, and William Weihl. A theory of timestamp-based concurrency control for nested transactions. In Proceedings of 14th International Conference on Very Large Data Bases, pages 431--444, Los Angeles, CA., August 1988. .pdfBard Bloom. Constructing two-writer registers. IEEE Transactions on Computers, 37(12):1506--1514, December 1988. .pdfBrian A. Coan. A compiler that increases the fault-tolerance of asynchronous protocols. IEEE Transactions on Computers, (Special Issue on Parallel and Distributed Algorithms), 37(12):1541--1553, December 1988. .pdfBrian Coan and Jennifer Lundelius. Transaction commit in a realistic timing model. Technical Memo MIT/LCS/TM-360, Laboratory for Computer Science, Massachuetts Institute of Technology, Cambridge, MA, June 1988. .pdf Cynthia Dwork, Nancy Lynch, and Larry Stockmeyer. Consensus in the presence of partial synchrony. Journal of the ACM, 35(2):288--323, April 1988. .pdfA. Fekete, N. Lynch, and L. Shrira. A modular proof of correctness for a network synchronizer. In J. van Leeuwen, editor, Distributed Algorithms (2nd International Workshop, Amsterdam, The Netherlands, July 1987), volume 312 of Lecture Notes in Computer Science, pages 219--256. Springer-Verlag, 1988. .pdfAlan Fekete, Nancy Lynch, Michael Merritt, and William Weihl.Commutativity-based locking for nested transactions.Technical Memo MIT/LCS/TM-370, Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA, 02139, August 1988. Superseded by MIT/LCS/TM-370b..pdfHector Garcia-Molina, Boris Kogan, and Nancy Lynch. Reliable broadcast in networks with nonprogrammable servers. In 8th International Conference on Distributed Computing Systems, pages 428-437, San Jose, CA, June 1988. pdfNancy Lynch, Yishay Mansour, and Alan Fekete. The data link layer:Two impossibility results. Technical Memo MIT/LCS/TM-355,Laboratory for Computer Science, Massachusetts Institute ofTechnology, Cambridge, MA, 02139, May 1988. pdf (Later version is MIT-LCS-TM-355.d, 1992.)Joseph Halpern, Yoram Moses, and Mark Tuttle. A knowledge-based analysis of zero knowledge. In Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, pages 132--147, May 1988. .pdfNancy Lynch. Modelling real-time systems. In Foundations of Real-Time Computing Research Initiative, Fall Church, Virginia, November 1988. Office of Naval Research Kickoff Workshop. pdf Nancy Lynch. I/O Automata: A model for discrete event systems. In 22nd Annual Conference on Information Sciences and Systems, pages 29-38, Princeton University, Princeton, N.J., March 1988. pdfNancy Lynch. I/O Automata: A model for discrete event systems. Technical Memo MIT/LCS/TM-351, Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA, 02139, March 1988. pdf Nancy Lynch, Yishay Mansour, and Alan Fekete. The data link layer: Two impossibility results. In Proceedings of the Seventh Annual ACM Symposium on Principles of Distributed Computing, pages 149--170, Toronto, Ontario, Canada, August 1988. .pdfNancy Lynch, Michael Merritt, William Weihl, and Alan Fekete. A theory of atomic transactions. In M. Gyssens, J. Paredaens,D. Van Gucht, editors ICDT'88 (Proceedings of the 2ndInternational Conference on Database Theory, Bruges, Belgium,August/September 1988), volume 326 of Lecture Notes inComputer Science, pages 41--71, Springer-Verlag, 1988. .pdfNancy Lynch, Michael Merritt, William Weihl, and Alan Fekete. A theory of atomic transactions. Technical Memo MIT/LCS/TM-362, Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA, 02139, June 1988. .pdfNancy Lynch and Michael Merritt. Introduction to the theory of nested transactions. Theoretical Computer Science, 62(1,2):123--186, December 1988..pdfNancy Lynch and Eugene Stark. A proof of the Kahn principle for Input/Output automata. Technical Memo MIT/LCS/TM-349, Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA, 02139, January 1988. .pdfNancy Lynch and Mark Tuttle. An introduction to Input/Output automata. Technical Memo MIT/LCS/TM-373, Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA, 02139, November 1988. .pdfYoram Moses and Mark R. Tuttle. Programming simultaneous actions using common knowledge. Algorithmica, 3(1):121--169, 1988. Special Issue on Parallel and Distributed Computing, Part 1. .pdfSape Mullender and Paul M.B. Vitanyi. Distributed match-making. Algorithmica, 3:367--391, 1988. Special issue on Distributed Computing. .pdfRussel Schaffer. On the correctness of atomic multi-writer registers. Technical Memo MIT/LCS/TM-364, Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA, 02139, June 1988. (Revised January 1989). .pdfRussel W. Schaffer. Peterson-Burns multi-writer, multi-reader atomic register algorithm. Bachelor's Thesis, June 1988, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, Cambridge, MA 02139. .pdfBarbara Simons, Jennifer Lundelius Welch, and Nancy Lynch. An overview of clock synchronization.Research Report RJ 6505 (63306), IBM Research Division, Yorktown Heights, New York, October 1988. .pdfE. W. Stark. Proving entailment between conceptual state specifications. Theoretical Computer Science, 56(1):135--154, January 1988. .pdfMark R. Tuttle. A game-theoretic characterization of eventual common knowledge. Unpublished manuscript., October 1988.P.M.B. Vitanyi. Locality, communication and interconnect length in multicomputers. SIAM Journal on Computing, 17:659--672, 1988. .pdfJennifer Lundelius Welch and Nancy Lynch.A new fault-tolerant algorithm for clock synchronization. Information and Computation, 77(1):1--36, April 1988. .pdf Jennifer Lundelius Welch. Simulating Synchronous Processors.Technical Memo MIT/LCS/TM-359, MIT Laboratory for Computer Science, Massachusetts Instituteof Technology, Cambridge, MA, June 1988. .pdfJennifer Lundelius Welch. Topics in Distributed Computing: The Impact of Partial Synchrony, and Modular Decomposition of Algorithms. Ph.D thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, Cambridge, MA 02139, March 1988. .pdfJennifer Lundelius Welch, Leslie Lamport, and Nancy Lynch. A lattice-structured proof technique applied to a minimum spanning tree algorithm. In Proceedings of the Seventh Annual ACM Symposium on Principles of Distributed Computing, pages 28--43, Toronto, Ontario, Canada, August 1988. .pdfJennifer Lundelius Welch, Leslie Lamport, and Nancy Lynch. A lattice-structured proof technique applied to a minimum spanning tree algorithm. Technical Memo MIT/LCS/TM-361, Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA, 02139, June 1988. .pdf1987James Aspnes. Timestamp ordering and nested transactions. Master's thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, Cambridge, MA 02139, May 1987. .pdfBard Bloom. Constructing two-writer atomic registers. In Proceedings of the Sixth Annual ACM Symposium on Principles of Distributed Computing, pages 249--259, Vancouver, British Columbia, Canada, August 1987. .pdf James E. Burns and Nancy A. Lynch.The Byzantine firing squad problem. Advances in ComputingResearch, 4:147--161, 1987. .pdfBrian A. Coan. Achieving Consensus in Fault-Tolerant Distributed Computer Systems: Protocols, Lower Bounds, and Simulations. Ph.D thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, Cambridge, MA 02139, June 1987. .pdfAnthony P. DiPesa Jr. Real-time extensions to a relational database. Master's thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, Cambridge, MA 02139, June 1987. .pdfDanny Dolev, Cynthia Dwork, and Larry Stockmeyer. On the minimal synchronism needed for distributed consensus. Journal of the ACM, 34(1):77--97, January 1987. .pdfAlan Fekete. Topics in Distributed Algorithms. Ph.D thesis, Department of Mathematics, Harvard University, Cambridge, MA, August 1987.Alan Fekete. Asynchronous approximate agreement. In Proceedings of the Sixth Annual ACM Symposium on Principles of Distributed Computing, pages 64--76, August 1987. .pdfAlan Fekete. Approximate agreement. Technical Memo MIT/LCS/TM-342, Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA 02139, September 1987. .pdfAlan Fekete, Nancy Lynch, Michael Merritt, and William Weihl. Nested transactions and read/write locking. In Proceedings of the 6th ACM Symposium on Principle of Database Systems, pages 97--111, San Diego, California, March 1987. .pdf Alan Fekete, Nancy Lynch, Michael Merritt, and William Weihl. Nested transactions and read/write locking. Technical Memo MIT/LCS/TM-324, Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA, 02139, April 1987. .pdfAlan Fekete, Nancy Lynch, Michael Merritt, and William Weihl. Nested transactions, conflict-based locking and dynamic atomicity. Technical Memo MIT/LCS/TM-340, Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA 02139, September 1987. .pdfAlan Fekete, Nancy Lynch, and Luiba Shrira. A modular proof of correctness for a network synchronizer. Technical Memo MIT/LCS/TM-341, Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA, 02139, September 1987. .pdfGreg N. Frederickson and Nancy A. Lynch. Electing a leader in a synchronous ring. Journal of the ACM, 34(1):98--115, January 1987. .pdfHector Garcia-Molina, Boris Kogan, and Nancy Lynch. Reliable broadcast in networks with nonprogrammable servers. Technical Report CS-TR-123-87, Princeton University, November 1987. .pdfKenneth J. Goldman and Nancy Lynch. Quorum consensus in nested transaction. In Proceedings of the Sixth Annual ACM Symposium on Principles of Distributed Computing, pages 27--41, August 1987. .pdf Kenneth J. Goldman. Data replication in nested transaction systems. Masters Thesis. Technical Report MIT/LCS/TR-390, MIT Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA, May 1987..pdfMaurice Herlihy, Nancy Lynch, Michael Merritt, and William Weihl. On the correctness of orphan elimination algorithms. Technical Memo MIT/LCS/TM-329, Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA, 02139, May 1987. .pdfMaurice Herlihy, Nancy Lynch, Michael Merritt, and William Weihl. On the correctness of orphan elimination algorithms. In 17th IEEE Symposium on Fault-Tolerant Computing, pages 8--13, 1987. .pdf Nancy A. Lynch and Mark R. Tuttle. Hierarchical correctness proofs for distributed algorithms. In Proceedings of the Sixth Annual ACM Symposium on Principles of Distributed Computing, pages 137--151, Vancouver, British Columbia, Canada, August 1987. .pdf Nancy A. Lynch and MarkR. Tuttle. Hierarchical correctness proofs for distributed algorithms.Master of Science Thesis, Dept. of Electrical Engineering and ComputerScience, Massachusetts Institute of Technology, April 1987. Also, TechnicalReport MIT/LCS/TR-387, Laboratory for Computer Science, Massachusetts Instituteof Technology. .pdfYoram Moses and Mark R. Tuttle.Programming simultaneous actions using common knowledge.Technical Report MIT/LCS/TR-369, Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA 02139, February 1987..pdfS. K. Sarin and Nancy Lynch. Discarding obsolete information in a replicated database system. IEEE Transactions on Software Engineering, SE-13(1):39--47, January 1987. .pdfJennifer L. Welch. Simulating Synchronous Processors. Information and Computation, 74(2):159-170, 1987. .pdf1986Christopher W. Clifton. Dynamic load balancing. Master's thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, Cambridge, MA 02139, June 1986. .pdfBrian Coan and Cynthia Dwork. Simultaneity is harder than agreement. In Proceedings of the 5th Symposium on Reliability in Distributed Software and Database Systems, pages 141--150, Los Angeles, CA, January 1986.Brian A. Coan. A communication-efficient canonical form for fault-tolerant distributed protocols. In Proceedings of the Fifth Annual ACM Symposium on Principles of Distributed Computing, pages 63--72, Calgary, Alberta, Canada, August 1986. .pdfB. Coan, B. Oki, and E. Kolodner. Limitations on database availability when networks partition. In Proceedings of the 5th Annual ACM Symposium on Principles of Distributed Computing, pages 187--194, Calgary, Alberta, Canada, August 1986. Also, Programming Methodology Group Memo 49, MIT Laboratory for Computer Science, Cambridge, MA 02139. .pdfBrian Coan and Jennifer Welch. Transaction commit in a realistic fault model. In Proceedings of the Fifth Annual ACM Symposium on Principles of Distributed Computing, pages 40--51, Calgary, Alberta, Canada, August 1986. pdf Danny Dolev, Nancy A. Lynch, Shlomit S. Pinter, Eugene W. Stark, and William E. Weihl. Reaching approximate agreement in the presence of faults. Journal of the ACM, 33(3):499--516, July 1986. pdf Cynthia Dwork and Yoram Moses. Knowledge and Common Knowledge in aByzantine Environment: Crash Failures. Technical Memo, MIT/LCS/TM-300,Laboratory for Computer Science, Massachusetts Instituteof Technology, Cambridge, MA, July 1986. pdf Cynthia Dwork and Yoram Moses. Knowledge and common knowledge in a Byzantine Environment I: Crash failures. In Proceedings of Conference on Theoretical Aspects of Reasoning about Knowledge, pages 149-169, March 1986. .pdfAlan Fekete. Asymptotically optimal algorithms for approximate agreement. In Proceedings of the Fifth Annual ACM Symposium on Principles of Distributed Computing, pages 73--87, Calgary, Alberta, Canada, August 1986. .pdfMichael J. Fischer, Nancy A. Lynch, and Michael Merritt. Easy impossibility proofs for distributed consensus problems. Distributed Computing, 1(1):26--39, January 1986. pdf Maurice Herlihy, Nancy Lynch, Michael Merritt, and William Weihl.On the correctness of orphan elimination algorithms.Programming Methodology Group Memo 50, Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA, December 1986. pdf Paris C. Kanellakis, Stavros S. Cosmadakis, and Nicolas Spyratos. Partition semantics for relations. Journal of Computer and System Sciences, 33(2):203-233, October 1986. .pdfE. Kranakis and P.M.B. Vitanyi. Distributed control in computer networks and cross-sections of multidimensional bodies. Technical Memo MIT/LCS/TM-304, Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA 02139, March 1986. .pdfM. Li, L. Longpre, and P.M.B. Vitanyi. The power of the queue. InAlan L. Selman, editor, Proceedings of Structure in Complexity Theory Conference (Berkeley, CA, June 1986), volume 223 of Lecture Notes in Computer Science, pages 218-233, 1986. Spring Verlag. .pdfM. Li, L. Longpre, and P.M.B. Vitanyi. The power of the queue. Technical Memo MIT/LCS/TM-303, Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA, 02139, April 1986. .pdfNancy Lynch, Barbara Blaustein, and Michael Siegel. Correctness conditions for highly available replicated databases. In Proceedings of the Fifth Annual ACM Symposium on Principles of Distributed Computing, pages 11--28, Calgary, Alberta, Canada, August 1986. .pdf Nancy Lynch, Barbara Blaustein, and Michael Siegel. Correctness conditions for highly available replicated databases. Technical Report MIT/LCS/TR-364, Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA, 02139, June 1986. .pdf Nancy A. Lynch, Nancy D. Griffeth, Michael J. Fischer, and Leonidas J. Guibas. Probabilistic analysis of a network resource allocation algorithm. Information and Computation, 68(1-3):47--85, January-February-March 1986. .pdf (Note, abstract in AMS Workshop on Probabilistic Algorithms, June 1985). Nancy Lynch and Michael Merritt. Introduction to the theory of nested transactions. In Giorgio Ausiello and Paolo Atzeni, editors, ICDT'86 (Proceedings of the International Conference on Database Theory, Rome, Italy, September 1986), volume 243 of Lecture Notes in Computer Science, pages 278-305, 1986. Springer-Verlag. .pdfNancy Lynch and Michael Merritt. Introduction to the theory of nested transactions. Technical Memo MIT/LCS/TM-367, Laboratory for Computer Science, Massachusetts Institute of of Technology, July 1986. pdfNancy A. Lynch. Concurrency control for resilient nested transactions. Advances in Computing Research, 3:335--373, 1986. .pdfYoram Moses and Mark R. Tuttle. Programming simultaneous actions using common knowledge. In Proceedings of the 27th Annual Symposium on Foundations of Computer Science, pages 208--221, Toronto, Ontario, Canada, October 1986. .pdfEugene W. Stark. Proving entailment between conceptual state specifications. In Proceedings of the 1986 European Symposium on Programming, volume 213 of Lecture Notes in Computer Science, pages 197--209, Saarbrucken, West Germany, March 1986. Springer-Verlag. .pdf Sape J. Mullender and Paul M.B. Vitanyi. Distributed match-making for processes in computer networks. Operating Systems Review, 20(2): 54-64, 1986. Earlier verison in PODC 1985. .pdfPaul Vitanyi. Non-sequential computation and laws of nature. In VLSI Algorithms and Architectures: Proceedings of Aegean Workshop on Computing, (Loutraki, Greece, July 1986), volume 227 of Lecture Notes in Computer Science, pages 108-120, 1986. .pdfPaul Vitanyi. Non-sequential computation and laws of nature. Technical Memo MIT/LCS/TM-306, Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA, 02139, May 1986. .pdfPaul M.B. Vitanyi. Archirithmics or algotecture? Mathematics and Computer Science II, 4:139--161, 1986. CWI Monographs, M. Hazewinkel, J.K. Lenstra and L.G.L.T. Meertens, Eds., North-Holland.1985Baruch Awerbuch and Robert G. Gallager. Distributed BFS algorithms. In 26th Annual Symposium on Foundations of Computer Science. IEEE, October 1985. .pdfBaruch Awerbuch. Complexity of network synchronization. Journal of the ACM, 32(4):804--823, October 1985. .pdfBaruch Awerbuch. A new distributed depth-first-search algorithm. Information Processing Letters, 20:147--150, April 1985. .pdfJames Burns and Nancy Lynch. The Byzantine firing squad problem. Technical Memo MIT/LCS/TM-275, Laboratory for Computer Science, Massachusetts Institute of of Technology, Cambridge, MA, 02139, April 1985. pdfBenny Chor and Brian A. Coan. A simple and efficient randomized Byzantine agreement algorithm. IEEE Transactions on Software Engineering, SE-11(6):531--539, June 1985. .pdf Reprinted from IEEE 1984 Proceedings of the Fourth Symposium on Reliability in Distributed Software and Database Systems. Benny Chor, Michael Merritt, and David B. Shmoys. Simple constant-time consensus protocols in realistic failure models. In Proceedings of the Fourth Annual ACM Symposium on Principles of Distributed Computing, pages 152--162, 1985. pdfBrian Coan, Danny Dolev, Cynthia Dwork, and Larry Stockmeyer. The distributed firing squad problem. In Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing, pages 335--345, Providence, Rhode Island, May 1985. pdfNachum Dershowitz and Shmuel Zaks. Patterns in trees.Technical Memo MIT/LCS/TM-271, Laboratory forComputer Science, Massachusetts Institute of Technology, Cambridge,MA, January 1985. pdfDanny Dolev, Nancy A. Lynch, Shlomit S. Pinter, Eugene W. Stark,and William E. Weihl. Reaching Approximate Agreement in thePresence of Faults Technical Memo MIT/LCS/TM-251, Laboratory forComputer Science, Massachusetts Institute of Technology, Cambridge,MA, October 1985. .pdfDanny Dolev, Nancy A. Lynch, Shlomit S. Pinter, Eugene W. Stark, and William E. Weihl. Reaching approximate agreement in the presence of faults. Technical Memo MIT/LCS/TM-276, Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge MA 02139, February 1985. .pdfCynthia Dwork, Nancy Lynch, and Larry Stockmeyer. Consensus in the presence of partial synchrony. Technical Memo MIT/LCS/TM-270, Laboratory for Computer Science, Massachusetts Institute of Technology, October 1985. Revision of MIT/LCS/TM-270 (October 1984). .pdfMichael J. Fischer, Nancy D. Griffeth, Leonidas J. Guibas, andNancy A. Lynch.Probabilistic analysis of a network resource allocation algorithm.Technical Memo MIT/LCS/TM-278, Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA, 02139, April 1985. .pdfMichael Fischer, Nancy Lynch, James Burns, and Allan Borodin. Distributed FIFO allocation of identical resources using small shared space. Technical Memo MIT/LCS/TM-290, Laboratory for Computer Science, Massachusetts Institute of Technology, June 1985. .pdf Michael Fischer, Nancy Lynch, and Michael Merritt. Easy impossibility proofs for distributed consensus problems. In Proceedings of the Fourth Annual ACM Symposium on Principles of Distributed Computing, pages 59--70, August 1985. pdf Michael Fischer, Nancy Lynch, and Michael Merritt. Easy impossibility proofs for distributed consensus problems. Technical Memo MIT/LCS/TM-279, Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA, 02139, June 1985. pdfMichael J. Fischer, Nancy A. Lynch, and Michael S. Paterson. Impossibility of distributed consensus with one faulty process. Journal of the ACM, 32(2):374--382, April 1985. pdfGreg N. Frederickson and Nancy Lynch. Electing a leader in a synchronous ring. Technical Memo MIT/LCS/TM-277, Laboratory for Computer Science, Massachusetts Institute of of Technology, Cambridge, MA 02139, July 1985. Earlier version dated March, 1985 entitled ``A General Lower Bound for Electing a Leader in a Ring''. pdfHector Garcia-Molina, Nancy Lynch, B. Blaustein, C. Kaufman, S. Sarin, and O. Schmueli. Notes on a reliable broadcast protocol. Technical Memorandum CCA-85-08, Computer Corporation of America, Cambridge, MA, December 1985. pdf Paris .C. Kanellakis and Stavros S. Cosmadakis. Equational theories and database constraints. Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing, Providence, Rhode Island, May 1985. .pdfParis C. Kanellakis and Stavros S. Cosmadakis. Two applications of equational theories to database theory. In Jean-Pierre Jouannaud, editor, Proceedings of First International Conference on Rewriting Techniques and Applications (RTA'85), Dijon France, May 1985,, volume 202 of Lecture Notes in Computer Science, 1985. Springer. .pdfStavros S. Cosmadakis, Paris C. Kanellakis, and Nicolas Spyratos. Partition semantics for relations. In Proceedings of the Fourth ACM Symposium on Principles of Database Systems (PODS'85), Portland, Oregon, March 1985. .pdfParis C. Kanellakis, Kenneth J. Goldman, Sally A. Goldman, and Stanley B. Zdonik. ISIS: Interface for a semantic information system. In Proceedings of the 1985 ACM SIGMOD International Conference on Management of Data, Austin, Texas, May 1985. .pdfParis C. Kanellakis and Christos H. Papadimitriou. The complexity of distributed concurrency control. SIAM Journal on Computing, 14(1):52--75, February 1985. .pdfParis C. Kanellakis and Scott .A. Smolka. On the analysis of cooperation and antagonism in networks of communicating processes. In Proceedings of the Fourth Annual ACM Symposium on Principles of Distributed Computing, August 1985. .pdfNancy A. Lynch. Concurrency control for resilient nested transactions. Technical Report MIT/LCS/TR-285, Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA 02139, October 1985. .pdfNancy Lynch and Greg N. Frederickson.Electing a leader in a synchronous ring.Technical Memo MIT/LCS/TM-277, Laboratory for Computer Science, Massachusetts Institute of of Technology, Cambridge, MA 02139, July 1985.Note earlier version dated March, 1985 entitled ``A General Lower Bound for Electing a Leader in a Ring''. pdfEverett Norcross McKay. A methodology for software implemented transient error recovery in spacecraft computation. SB/SM thesis, MIT, Department of Electrical Engineering and Computer Science, Cambridge, MA, January 1985. pdfSape J. Mullender and Paul M.B. Vitanyi. Distributed match-making for processes in computer networks. In Proceedings of the Fourth Annual ACM Symposium on Principles of Distributed Computing, pages 261--271, Minaki, Ontario, Canada, August 1985. Also, CWI Report CS-R8513. Reprinted in Operating Systems Review, 1986. .pdfEugene W. Stark. A proof technique for rely/guarantee properties. In Proceedings of the 5th Conference on Foundations of Software Technology and Theoretical Computer Science, volume 206 of Lecture Notes in Computer Science, pages 369--391, New Delhi, India, December 1985. Springer-Verlag. .pdf1984Benny Chor and Brian A. Coan. A simple and efficient randomized Byzantine agreement algorithm. Technical Memo MIT/LCS/TM-266, Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA 02139, August 1984. .pdf Brian A. Coan and Russell Turpin. Extending Binary Byzantine Agreement to Multivalued Byzantine agreement. Technical Memo MIT/LCS/TR-315, Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA, 02139, April 1984. .pdfCynthia Dwork, Paris C. Kanellakis, and John C. Mitchell. On the sequential nature of unification. Technical Memo MIT/LCS/TM-257, Massachusetts Institute of Technology, Cambridge, MA 02139, March 1984. .pdfC. Dwork, P. Kanellakis, and J. Mitchell. On the sequential nature of unification. Journal of Logic Programming, 1(1), pages 35-50, 1984. .pdfCynthia Dwork, Nancy Lynch, and Larry Stockmeyer. Consensus in the presence of partial synchrony. Proceedings of the Third Annual ACM Symposium on Principles of Distributed Computing (PODC), Vancouver, B.C., Canada, pages 103-118, August 1984. .pdfCynthia Dwork, Nancy Lynch, and Larry Stockmeyer. Consensus in the presence of partial synchrony(preliminary version). Technical Memo MIT/LCS/TM-270, Laboratory for Computer Science, Massachusetts Institute of Technology, October 1984. Revised MIT/LCS/TM-270 (See October 1985). .pdfCynthia Dwork and Dale Skeen. Patterns of communication in consensus protocols. In Proceedings of the Third Annual ACM Symposium on Principles of Distributed Computing, pages 143-153, Vancouver, BC, Canada, August 1984. .pdfN. Dershowitz and S. Zaks. Patterns in trees. In Proceedings of the 9th Colloquium on Trees in Algebra and Programming, Bordeaux, France, March 1984.Greg N. Frederickson and Nancy Lynch. The impact of synchronous communication on the problem of electing a leader in a ring. In Proceedings of the Sixteenth Annual ACM Symposium on Theory of Computing, pages 493--503, April 1984. .pdfJoseph Y. Halpern and Yoram Moses. Knowledge and common knowledge in a distributed environment. Proceedings of the 3rd ACM Symposium on Principles of Distributed Computing, pages 50-61, Vancouver, BC, Canada, August 1984. Preliminary version. .pdf Jennifer Lundelius. Synchronizing Clocks in a DistributedSystem. Masters thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, Cambridge, MA 02139. TechnicalReport MIT/LCS/TR-335, Cambridge, MA, August 1984. .pdfJennifer Lundelius and Nancy Lynch. An upper and lower bound for clock synchronization. Information and Control, 62(2-3):190--204, August/September 1984. .pdfJennifer Lundelius and Nancy Lynch. A new fault-tolerant algorithm for clock synchronization. In Proceedings of the Third Annual ACM Symposium on Principles of Distributed Computing, pages 75--88, Vancouver, B.C., Canada, August 1984. .pdfJennifer Lundelius and Nancy Lynch. A new fault-tolerant algorithm for clock synchronization. Technical Memo MIT/LCS/TM-265, Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA, 02139, July 1984. .pdf Nancy Lynch and Greg N. Frederickson. The impact of synchronous communication on the problem of electing a leader in a ring. Technical Memo MIT/LCS/TM-259, Laboratory for Computer Science, Massachusetts Institute of Technology, April 1984. .pdfMichael Merritt. Elections in the presence of faults. In Proceedings of the Third Annual ACM Symposium on Principles of Distributed Computing, pages 134--142, Vancouver, B.C., Canada, August 1984. .pdfM. Merritt and J. Mitchell. A distributed algorithm for deadlock detection and resolution. In Proceedings of the Third Annual ACM Symposium on Principles of Distributed Computing, pages 282--284, Vancouver, B.C., Canada, August 1984. .pdfNeil Joseph Savasta II. Implementation of a compiler-compiler. Bachelor's Thesis, June 1984, Massachusetts Institute of Technology. .pdfE. W. Stark. Foundations of a Theory of Specification for Distributed Systems. Ph.D thesis, Massachusetts Institute of Technology, Laboratory for Computer Science, Cambridge, MA 02139, August 1984. Technical Report MIT/LCS/TR-342, Massachusetts Institute of Technology, Laboratory for Computer Science, Cambridge, MA 02139, August 1984. .pdfRussell Turpin and Brian A. Coan. Extending binary Byzantine agreement to multivalued Byzantine agreement. Information Processing Letters, 18(2):73--76, February 1984. .pdfShmuel Zaks. Optimal Distributed Algorithms for Sorting and Ranking. Technical Report MIT-LCS-TM-261, Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA, May 1984..pdf1983Baruch Awerbuch and Shimon Even. A formal approach to a communication-network protocol; broadcast as a case study. Technical Report TR-284, Electrical Engineering Department, Technion-I.I.T., Haifa, June 1983. pdfEshrat Arjomandi, Michael J. Fischer, and Nancy A. Lynch. Efficiency of synchronous versus asynchronous distributed systems. Journal of the ACM, 30(3):449--456, July 1983. pdfDanny Dolev, Cynthia Dwork, and Larry Stockmeyer. On the minimal synchronism needed for distributed consensus. In 24th Annual Symposium on Foundations of Computer Science, pages 393--402, Tucson, Arizona, 1983. pdfDanny Dolev, Nancy A. Lynch, Shlomit S. Pinter, Eugene W. Stark, and William E. Weihl. Reaching approximate agreement in the presence of faults. In Proceedings of 3rd Symposium on Reliability in Distributed Software and Database Systems, pagesd 145--154, October 1983. pdfDanny Dolev and Nancy A. Lynch and Shlomit S. Pinter andEugene W. Stark and William E. Weihl. Reaching Approximate Agreementin the Presence of Faults, Technical Memo MIT/LCS/TM-251,Massachusetts Institute of Technology, Laboratory for Computer Science,Cambridge, MA 02139, December 1983. pdfCynthia Dwork and Dale Skeen. The inherent cost of nonblocking commitment. In Proceedings of the Second Annual ACM Symposium on Principles of Distributed Computing, pages 1--11, Montreal, Quebec, Canada, August 1983. pdfMichael Fischer, Nancy Lynch, James Burns, and Allan Borodin. The colored ticket algorithm. Technical Memo MIT/LCS/TM-269, Laboratory for Computer Science, Massachusetts Institute of Technology, August 1983. .pdfMichael Fischer, Nancy Lynch, and Michael S. Paterson. Impossibility of distributed consensus with one faulty process. In Proceedings of the 2nd ACM Symposium on Principles of Database Systems, pages 1--7, Atlanta, GA, March 1983. .pdfJ. Goree. Internal consistency of a distributed transaction system with orphan detection. Master's thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, Cambridge, MA 02139, January 1983. Technical Memo MIT/LCS/TR-286, Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA, 1983. .pdfNancy Lynch and Michael Fischer. A technique for decomposing algorithms which use a single shared variable. Journal of Computer and System Sciences, 27(3):350--377, December 1983. .pdfNancy Lynch. Concurrency control for resilient nested transactions. In Proceedings of the Second ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, pages 166--181, Atlanta, Georgia, March 1983. .pdfNancy A. Lynch. Concurrency control for resilient nestedtransactions. MIT Laboratory for Computer Science TechnicalReport MIT/LCS/TR-285, Cambridge, MA 02139, February 1983. (Note,same TR number was used in 1985). .pdfNancy Lynch. Multilevel atomicity--a new correctness criterion for database concurrency control. ACM Transactions on Database Systems, 8(4):484--502, December 1983. .pdf1982James E. Burns, Paul Jackson, Nancy A. Lynch, Michael J. Fischer, and Gary L. Peterson. Data requirements for implementation of N-process mutual exclusion using a single shared variable. Journal of the ACM, 29(1):183--205, January 1982.pdfDanny Dolev, Michael J. Fischer, Rob Fowler, Nancy A. Lynch, and H. Raymond Strong. An efficient algorithm for Byzantine agreement without authentication. Information and Control, 52(3):257--274, March 1982. .pdfDanny Dolev, Michael J. Fischer, Rob Fowler, Nancy A. Lynch, and H. Raymond Strong. An efficient Byzantine agreement without authentication. IBM Research Report RJ3428 (40914), Computer Science, IBM Research Division, Yorktown Heights, NY, March 22, 1982. .pdfRichard A. DeMillo, Nancy A. Lynch, and Michael J. Merritt. Cryptographic protocols. In Proceedings of the Fourteenth Annual ACM Symposium on Theory of Computing, pages 383--400, San Francisco, California, May 1982. pdfMichael J. Fischer, Nancy D. Griffeth, and Nancy A. Lynch. Global states of a distributed system. IEEE Transactions on Software Engineering, SE-8(3):198--202, May 1982..pdfMichael J. Fischer and Nancy A. Lynch. A lower bound for the time to assure interactive consistency. Information Processing Letters, 14(4):183--186, June 1982. .pdfMichael J. Fischer, Nancy A. Lynch, and Michael S. Paterson. Impossibility of distributed consensus with one faulty process. Technical Report MIT/LCS/TR-282, Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA, 02139, September 1982.pdfNancy Lynch, Michael Fischer, and Rob Fowler. A simple and efficient Byzantine generals algorithm. In Proceedings of the 2nd Symposium on Reliability in Distributed Software and Database Systems, pages 46--52, Pittsburgh, PA, July 1982. .pdfNancy Lynch, Michael Fischer, and Rob Fowler. A simple and efficient Byzantine generals algorithm. Technical Report GIT-ICS-82/02, School of Information and Computer Science, Georgia Institute of Technology, February, 1982. pdfNancy Lynch. Accessibility of values as a determinant of relative complexity of algebras. Journal of Computer and System Sciences, 24(1):101--113, February 1982. pdfNancy Lynch. Multilevel atomicity--a new correctness criterion for database concurrency control. Technical Report MIT/LCS/TR-281, Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA, 02139, August 1982. pdfNancy A. Lynch. Multilevel atomicity. In Proceedings of the First ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, pages 63--69, Los Angeles, CA, March 1982. .pdf1981Eshrat Arjomandi, Michael J. Fischer, and Nancy A. Lynch. Adifference in efficiency between synchronous and asynchronoussystems. Technical Report GIT-ICS-81/07, School of Information andComputer Science, Georgia Institute of Technology, June, 1981. .pdfAllan Borodin, Michael J. Fischer, David G. Kirkpatrick, Nancy A. Lynch, and Martin Tompa. A time-space tradeoff for sorting on non-oblivious machines. Journal of Computer and System Sciences, 22(3):351--364, June 1981. .pdfA. Borodin, L. Guibas, N. Lynch, and A. Yao. Efficientsearching using partial ordering. Information ProcessingLetters, 12(2):71--75, April 1981. .pdfMichael J. Fischer, Leonidas Guibas, Nancy D. Griffeth, and Nancy Lynch. Optimal placement of identical resources in a distributed network. In Proceedings of the 2nd IEEE International Conference on Distributed Computing Systems, pages 324--336, April 1981. .pdfMichael Fischer, Nancy Griffeth, and Nancy Lynch. Global states of a distributed system. In Proceedings of IEEE Symposium on Reliability in Distributed Software and Database Systems, pages 33--38, Pittsburgh, PA, July 1981. .pdfNancy Lynch. Multilevel atomicity--a new correctness criterion for database concurrency control. Technical Report GIT-ICS-81/05, School of Information and Computer Science, Georgia Institute of Technology, May, 1981. .pdf Michael Fischer, Nancy Griffeth, and Nancy Lynch. Global states of a distributed system. Technical ReportGIT-ICS-81/06, School of Information and Computer Science, GeorgiaInstitute of Technology, June, 1981. .pdfMichael J. Fischer and Nancy A. Lynch. A lower bound for the time to assure interactive consistency. Technical ReportGIT-ICS-81/13, School of Information and Computer Science, GeorgiaInstitute of Technology, September, 1981. .pdfNancy A. Lynch. Upper bounds for static resource allocation in a distributed system. Journal of Computer and System Sciences, 23(2):254--278, October 1981. .pdfNancy Lynch and Edward K. Blum. Relative complexity of algebras.Mathematical Systems Theory 14, pages 193--214, 1981. .pdfNancy A. Lynch and Michael J. Fischer. On describing the behavior and implementation of distributed systems. Theoretical Computer Science, 13(1):17--43, 1981. Special issue on Semantics of Concurrent Computation. .pdf1980James Burns and Nancy A. Lynch. Mutual exclusion using indivisiblereads and writes. In Proceedings of the 18th AllertonConference on Communication, Control and Computing, pages 833--842,Monticello, IL, October 1980. .pdfMichael J. Fischer, Leonidas Guibas, Nancy D. Griffeth, and Nancy Lynch. Optimal placement of identical resources in a distributed network. Technical Report GIT-ICS-80/13, School of Information and Computer Science, Georgia Institute of Technology, October, 1980. .pdfNancy A. Lynch. Fast allocation of nearby resources in a distributedsystem. In Proceedings of the Twelfth Annual ACM Symposium onTheory of Computing, pages 70--81, Los Angeles, CA., April 1980.Chosen for submission to special issue of Journal Computer andSystem Sciences.pdfNancy A. Lynch and Michael J. Fischer. On describing the behaviorand implementation of distributed systems. Technical ReportGIT-ICS-79/03, School of Information and Computer Science, GeorgiaInstitute of Technology, March, 1980. Revised edition. pdfNancy Lynch and Michael Fischer. A technique for decomposing algorithms which use a single shared variable. Technical Report GIT-ICS-80/14, School of Information and Computer Science, Georgia Institute of Technology, October, 1980. pdfNancy A. Lynch. Straight-line program length as a parameter forcomplexity analysis. Journal of Computer and SystemSciences, 21(3):251--280, December 1980. .pdfNancy A. Lynch and Edward K. Blum. Relative complexity of operations onnumeric and bit-string algebras. Mathematical Systems Theory13, pages 187--207, 1980. .pdf
solution manual of introduction to computer theory by daniel cohen pdf.948
2ff7e9595c
Comments