Michael Merritt

Marios Mavronicolas, Michael Merritt, Gadi Taubenfeld: Sequentially consistent versus linearizable counting networks. Distributed Computing 21(4): 249-269 (2008)

Yehuda Afek, Iftah Gamzu, Irit Levy, Michael Merritt, Gadi Taubenfeld: Group Renaming. OPODIS 2008: 58-72

Noga Alon, Michael Merritt, Omer Reingold, Gadi Taubenfeld, Rebecca N. Wright: Tight bounds for shared memory systems accessed by Byzantine processes. Distributed Computing 18(2): 99-109 (2005)

Dahlia Malkhi, Michael Merritt, Michael K. Reiter, Gadi Taubenfeld: Objects shared by Byzantine processes. Distributed Computing 16(1): 37-48 (2003)

Michael J. Fischer, Michael Merritt: Appraising two decades of distributed computing theory research. Distributed Computing 16(2-3): 239-247 (2003)

Michael Merritt, Gadi Taubenfeld: Resilient Consensus for Infinitely Many Processes. DISC 2003: 1-15

Yehuda Afek, Anat Bremler-Barr, Haim Kaplan, Edith Cohen, Michael Merritt: Restoration by path concatenation: fast recovery of MPLS paths. Distributed Computing 15(4): 273-283 (2002)

Michael Merritt, Omer Reingold, Gadi Taubenfeld, Rebecca N. Wright: Tight Bounds for Shared Memory Systems Accessed by Byzantine Processes. DISC 2002: 222-236

Anat Bremler-Barr, Yehuda Afek, Haim Kaplan, Edith Cohen, Michael Merritt: Restoration by path concatenation: fast recovery of MPLS paths. PODC 2001: 43-52

Eli Gafni, Michael Merritt, Gadi Taubenfeld: The concurrency hierarchy, and algorithms for unbounded concurrency. PODC 2001: 161-169

Anat Bremler-Barr, Yehuda Afek, Haim Kaplan, Edith Cohen, Michael Merritt: Restoration path concatenation: fast recovery of MPLS paths. SIGMETRICS/Performance 2001: 316-317

Dahlia Malkhi, Michael Merritt, Ohad Rodeh: Secure Reliable Multicast Protocols in a WAN. Distributed Computing 13(1): 19-28 (2000)

Michael Merritt, Gadi Taubenfeld: Computing with Infinitely Many Processes. DISC 2000: 164-178

Dahlia Malkhi, Michael Merritt, Michael K. Reiter, Gadi Taubenfeld: Objects Shared by Byzantine Processes. DISC 2000: 345-359

Michael Merritt: Introduction. Distributed Computing 12(2-3): 55-56 (1999)

Robert P. Kurshan, Michael Merritt, Ariel Orda, Sonia R. Sachs: Modelling Asynchrony with a Synchronous Model. Formal Methods in System Design 15(3): 175-199 (1999)

Yehuda Afek, Michael Merritt, Gadi Taubenfeld: The Power of Multiobjects. Inf. Comput. 153(1): 117-138 (1999)

Yehuda Afek, Michael Merritt: Fast, Wait-Free (2k)-Renaming. PODC 1999: 105-112

Marios Mavronicolas, Michael Merritt, Gadi Taubenfeld: Sequentially Consistent versus Linearizable Counting Networks. PODC 1999: 133-142

Dahlia Malkhi, Michael Merritt, Ohad Rodeh: Secure Multicast in a WAN. CoRR cs.CR/9908008 (1999)

Michael Merritt, Gadi Taubenfeld: Fairness of Shared Objects. DISC 1998: 303-317

Michael Merritt, Ariel Orda, Sonia R. Sachs: Formal Verification of a Distributed Computer System. Formal Methods in System Design 10(1): 93-125 (1997)

Ariel Orda, Michael Merritt: Efficient Test & Set Constructions for Faulty Shared Memory. Inf. Process. Lett. 62(1): 41-46 (1997)

Dahlia Malkhi, Michael Merritt, Ohad Rodeh: Secure Reliable Multicast Protocols in a WAN. ICDCS 1997: 0-

Yehuda Afek, Michael Merritt, Gadi Taubenfeld, Dan Touitou: Disentangling Multi-Object Operations (Extended Abstract). PODC 1997: 111-120

Yehuda Afek, Michael Merritt, Gadi Taubenfeld: The Power of Multi-objects (Extended Abstract). PODC 1996: 213-222

Yehuda Afek, David S. Greenberg, Michael Merritt, Gadi Taubenfeld: Computing With Faulty Shared Objects. J. ACM 42(6): 1231-1274 (1995)

Robert P. Kurshan, Michael Merritt, Ariel Orda, Sonia R. Sachs: Modelling Asynchrony with a Synchronous Model. CAV 1995: 339-352

Michael Merritt, Gadi Taubenfeld: Atomic m-Register Operations. Distributed Computing 7(4): 213-221 (1994)

Robert P. Kurshan, Michael Merritt, Ariel Orda, Sonia R. Sachs: A Structural Linearization Principle for Processes. Formal Methods in System Design 5(3): 227-244 (1994)

Steven M. Bellovin, Michael Merritt: An attack on the Interlock Protocol when used for authentication. IEEE Transactions on Information Theory 40(1): 273-275 (1994)

Yehuda Afek, Danny Dolev, Eli Gafni, Michael Merritt, Nir Shavit: A Bounded First-In, First-Enabled Solution to the l-Exclusion Problem. ACM Trans. Program. Lang. Syst. 16(3): 939-953 (1994)

Nancy A. Lynch, Michael Merritt, William E. Weihl, Alan Fekete: Atomic Transactions. Morgan Kaufmann 1993, isbn 1-55860-104-X

Michael Merritt, Gadi Taubenfeld: Knowledge in Shared Memory Systems. Distributed Computing 7(2): 99-109 (1993)

Michael Merritt, Gadi Taubenfeld: Speeding Lamport's Fast Mutual Exclusion Algorithm. Inf. Process. Lett. 45(3): 137-142 (1993)

Yehuda Afek, Hagit Attiya, Danny Dolev, Eli Gafni, Michael Merritt, Nir Shavit: Atomic Snapshots of Shared Memory. J. ACM 40(4): 873-890 (1993)

Yehuda Afek, Geoffrey M. Brown, Michael Merritt: Lazy Caching. ACM Trans. Program. Lang. Syst. 15(1): 182-205 (1993)

Robert P. Kurshan, Michael Merritt, Ariel Orda, Sonia R. Sachs: A Structural Linearization Principle for Processes. CAV 1993: 491-504

Steven M. Bellovin, Michael Merritt: Augmented Encrypted Key Exchange: A Password-Based Protocol Secure against Dictionary Attacks and Password File Compromise. ACM Conference on Computer and Communications Security 1993: 244-250

Yehuda Afek, Michael Merritt, Gadi Taubenfeld: Benign Failure Models for Shared Memory (Preliminary Version). WDAG 1993: 69-83

Maurice Herlihy, Nancy A. Lynch, Michael Merritt, William E. Weihl: On the Correctness of Orphan Management Algorithms. J. ACM 39(4): 881-930 (1992)

Yehuda Afek, David S. Greenberg, Michael Merritt, Gadi Taubenfeld: Computing with Faulty Shared Memory (Extended Abstract). PODC 1992: 47-58

Phillip B. Gibbons, Michael Merritt: Specifying Non-Blocking Shared Memories (Extended Abstract). SPAA 1992: 306-315

Michael Merritt, Francesmary Modugno, Marc R. Tuttle: Time-Constrained Automata (Extended Abstract). CONCUR 1991: 408-423

Michael Merritt, Gadi Taubenfeld: Knowledge in Shared Memory Systems (Preliminary Version). PODC 1991: 189-200

Phillip B. Gibbons, Michael Merritt, Kourosh Gharachorloo: Proving Sequential Consistency of High-Performance Shared Memories (Extended Abstract). SPAA 1991: 292-303

Steven M. Bellovin, Michael Merritt: Limitations of the Kerberos Authentication System. USENIX Winter 1991: 253-268

Michael Merritt, Gadi Taubenfeld: Atomic m-Register Operations (Extended Abstract). WDAG 1991: 289-294

Alan Fekete, Nancy A. Lynch, Michael Merritt, William E. Weihl: Commutativity-Based Locking for Nested Transactions. J. Comput. Syst. Sci. 41(1): 65-156 (1990)

Yehuda Afek, Danny Dolev, Hagit Attiya, Eli Gafni, Michael Merritt, Nir Shavit: Atomic Snapshots of Shared Memory. PODC 1990: 1-13

Benny Chor, Michael Merritt, David B. Shmoys: Simple constant-time consensus protocols in realistic failure models. J. ACM 36(3): 591-614 (1989)

Alan Fekete, Nancy A. Lynch, Michael Merritt, William E. Weihl: Commutativity-Based Locking for Nested Transactions. POS 1989: 319-340

Michael Merritt: Completeness Theorems for Automata. REX Workshop 1989: 544-560

Yehuda Afek, Geoffrey M. Brown, Michael Merritt: A Lazy Cache Algorithm. SPAA 1989: 209-222

Nancy A. Lynch, Michael Merritt: Introduction to the Theory of Nested Transactions. Theor. Comput. Sci. 62(1-2): 123-185 (1988)

Nancy A. Lynch, Michael Merritt, William E. Weihl, Alan Fekete: A Theory of Atomic Transactions. ICDT 1988: 41-71

James Aspnes, Alan Fekete, Nancy A. Lynch, Michael Merritt, William E. Weihl: A Theory of Timestamp-Based Concurrency Control for Nested Transactions. VLDB 1988: 431-444

Alan Fekete, Nancy A. Lynch, Michael Merritt, William E. Weihl: Nested Transactions and Read/Write Locking. PODS 1987: 97-111

Michael J. Fischer, Nancy A. Lynch, Michael Merritt: Easy Impossibility Proofs for Distributed Consensus Problems. Distributed Computing 1(1): 26-39 (1986)

Michael J. Fischer, Nancy A. Lynch, Michael Merritt: Easy Impossibility Proofs for Distributed Consensus Problems. Fault-Tolerant Distributed Computing 1986: 147-170

Nancy A. Lynch, Michael Merritt: Introduction to the Theory of Nested Transactions. ICDT 1986: 278-305

Michael J. Fischer, Nancy A. Lynch, Michael Merritt: Easy Impossibility Proofs for Distributed Consensus Problems. PODC 1985: 59-70

Benny Chor, Michael Merritt, David B. Shmoys: Simple Constant-Time Consensus Protocols in Realistic Failure Models (Extended Abstract). PODC 1985: 152-162

Steven Fortune, Michael Merritt: Poker Protocols. CRYPTO 1984: 454-464

Michael Merritt: Elections in the Presence of Faults. PODC 1984: 134-142

Don P. Mitchell, Michael Merritt: A Distributed Algorithm for Deadlock Detection and Resolution. PODC 1984: 282-284

Michael Merritt: Key Reconstruction. CRYPTO 1982: 321-322

Richard A. DeMillo, Nancy A. Lynch, Michael Merritt: Cryptographic Protocols. STOC 1982: 383-400

Richard A. DeMillo, Nancy A. Lynch, Michael Merritt: The Design and Analysis of Cryptographic Protocols. CRYPTO 1981: 71-72