The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Michael Merritt: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Alan Fekete, Nancy A. Lynch, Michael Merritt, William E. Weihl
    Commutativity-Based Locking for Nested Transactions. [Citation Graph (9, 0)][DBLP]
    J. Comput. Syst. Sci., 1990, v:41, n:1, pp:65-156 [Journal]
  2. Alan Fekete, Nancy A. Lynch, Michael Merritt, William E. Weihl
    Nested Transactions and Read/Write Locking. [Citation Graph (6, 12)][DBLP]
    PODS, 1987, pp:97-111 [Conf]
  3. Nancy A. Lynch, Michael Merritt
    Introduction to the Theory of Nested Transactions. [Citation Graph (5, 11)][DBLP]
    ICDT, 1986, pp:278-305 [Conf]
  4. Don P. Mitchell, Michael Merritt
    A Distributed Algorithm for Deadlock Detection and Resolution. [Citation Graph (5, 0)][DBLP]
    PODC, 1984, pp:282-284 [Conf]
  5. James Aspnes, Alan Fekete, Nancy A. Lynch, Michael Merritt, William E. Weihl
    A Theory of Timestamp-Based Concurrency Control for Nested Transactions. [Citation Graph (5, 7)][DBLP]
    VLDB, 1988, pp:431-444 [Conf]
  6. Nancy A. Lynch, Michael Merritt
    Introduction to the Theory of Nested Transactions. [Citation Graph (5, 0)][DBLP]
    Theor. Comput. Sci., 1988, v:62, n:1-2, pp:123-185 [Journal]
  7. Alan Fekete, Nancy A. Lynch, Michael Merritt, William E. Weihl
    Commutativity-Based Locking for Nested Transactions. [Citation Graph (4, 0)][DBLP]
    POS, 1989, pp:319-340 [Conf]
  8. Nancy A. Lynch, Michael Merritt, William E. Weihl, Alan Fekete
    A Theory of Atomic Transactions. [Citation Graph (3, 8)][DBLP]
    ICDT, 1988, pp:41-71 [Conf]
  9. Maurice Herlihy, Nancy A. Lynch, Michael Merritt, William E. Weihl
    On the Correctness of Orphan Management Algorithms. [Citation Graph (2, 0)][DBLP]
    J. ACM, 1992, v:39, n:4, pp:881-930 [Journal]
  10. Richard A. DeMillo, Nancy A. Lynch, Michael Merritt
    Cryptographic Protocols [Citation Graph (1, 0)][DBLP]
    STOC, 1982, pp:383-400 [Conf]
  11. Robert P. Kurshan, Michael Merritt, Ariel Orda, Sonia R. Sachs
    A Structural Linearization Principle for Processes. [Citation Graph (0, 0)][DBLP]
    CAV, 1993, pp:491-504 [Conf]
  12. Robert P. Kurshan, Michael Merritt, Ariel Orda, Sonia R. Sachs
    Modelling Asynchrony with a Synchronous Model. [Citation Graph (0, 0)][DBLP]
    CAV, 1995, pp:339-352 [Conf]
  13. Steven M. Bellovin, Michael Merritt
    Augmented Encrypted Key Exchange: A Password-Based Protocol Secure against Dictionary Attacks and Password File Compromise. [Citation Graph (0, 0)][DBLP]
    ACM Conference on Computer and Communications Security, 1993, pp:244-250 [Conf]
  14. Michael Merritt, Francesmary Modugno, Marc R. Tuttle
    Time-Constrained Automata (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    CONCUR, 1991, pp:408-423 [Conf]
  15. Steven Fortune, Michael Merritt
    Poker Protocols. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1984, pp:454-464 [Conf]
  16. Richard A. DeMillo, Nancy A. Lynch, Michael Merritt
    The Design and Analysis of Cryptographic Protocols. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1981, pp:71-72 [Conf]
  17. Michael Merritt
    Key Reconstruction. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1982, pp:321-322 [Conf]
  18. Michael J. Fischer, Nancy A. Lynch, Michael Merritt
    Easy Impossibility Proofs for Distributed Consensus Problems. [Citation Graph (0, 0)][DBLP]
    Fault-Tolerant Distributed Computing, 1986, pp:147-170 [Conf]
  19. Dahlia Malkhi, Michael Merritt, Ohad Rodeh
    Secure Reliable Multicast Protocols in a WAN. [Citation Graph (0, 0)][DBLP]
    ICDCS, 1997, pp:0-0 [Conf]
  20. Yehuda Afek, Danny Dolev, Hagit Attiya, Eli Gafni, Michael Merritt, Nir Shavit
    Atomic Snapshots of Shared Memory. [Citation Graph (0, 0)][DBLP]
    PODC, 1990, pp:1-13 [Conf]
  21. Yehuda Afek, David S. Greenberg, Michael Merritt, Gadi Taubenfeld
    Computing with Faulty Shared Memory (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    PODC, 1992, pp:47-58 [Conf]
  22. Yehuda Afek, Michael Merritt
    Fast, Wait-Free (2k)-Renaming. [Citation Graph (0, 0)][DBLP]
    PODC, 1999, pp:105-112 [Conf]
  23. Yehuda Afek, Michael Merritt, Gadi Taubenfeld
    The Power of Multi-objects (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    PODC, 1996, pp:213-222 [Conf]
  24. Yehuda Afek, Michael Merritt, Gadi Taubenfeld, Dan Touitou
    Disentangling Multi-Object Operations (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    PODC, 1997, pp:111-120 [Conf]
  25. Benny Chor, Michael Merritt, David B. Shmoys
    Simple Constant-Time Consensus Protocols in Realistic Failure Models (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    PODC, 1985, pp:152-162 [Conf]
  26. Anat Bremler-Barr, Yehuda Afek, Haim Kaplan, Edith Cohen, Michael Merritt
    Restoration by path concatenation: fast recovery of MPLS paths. [Citation Graph (0, 0)][DBLP]
    PODC, 2001, pp:43-52 [Conf]
  27. Michael J. Fischer, Nancy A. Lynch, Michael Merritt
    Easy Impossibility Proofs for Distributed Consensus Problems. [Citation Graph (0, 0)][DBLP]
    PODC, 1985, pp:59-70 [Conf]
  28. Eli Gafni, Michael Merritt, Gadi Taubenfeld
    The concurrency hierarchy, and algorithms for unbounded concurrency. [Citation Graph (0, 0)][DBLP]
    PODC, 2001, pp:161-169 [Conf]
  29. Marios Mavronicolas, Michael Merritt, Gadi Taubenfeld
    Sequentially Consistent versus Linearizable Counting Networks. [Citation Graph (0, 0)][DBLP]
    PODC, 1999, pp:133-142 [Conf]
  30. Michael Merritt
    Elections in the Presence of Faults. [Citation Graph (0, 0)][DBLP]
    PODC, 1984, pp:134-142 [Conf]
  31. Michael Merritt, Gadi Taubenfeld
    Knowledge in Shared Memory Systems (Preliminary Version). [Citation Graph (0, 0)][DBLP]
    PODC, 1991, pp:189-200 [Conf]
  32. Michael Merritt
    Completeness Theorems for Automata. [Citation Graph (0, 0)][DBLP]
    REX Workshop, 1989, pp:544-560 [Conf]
  33. Anat Bremler-Barr, Yehuda Afek, Haim Kaplan, Edith Cohen, Michael Merritt
    Restoration path concatenation: fast recovery of MPLS paths. [Citation Graph (0, 0)][DBLP]
    SIGMETRICS/Performance, 2001, pp:316-317 [Conf]
  34. Yehuda Afek, Geoffrey M. Brown, Michael Merritt
    A Lazy Cache Algorithm. [Citation Graph (0, 0)][DBLP]
    SPAA, 1989, pp:209-222 [Conf]
  35. Phillip B. Gibbons, Michael Merritt
    Specifying Non-Blocking Shared Memories (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    SPAA, 1992, pp:306-315 [Conf]
  36. Phillip B. Gibbons, Michael Merritt, Kourosh Gharachorloo
    Proving Sequential Consistency of High-Performance Shared Memories (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    SPAA, 1991, pp:292-303 [Conf]
  37. Steven M. Bellovin, Michael Merritt
    Limitations of the Kerberos Authentication System. [Citation Graph (0, 0)][DBLP]
    USENIX Winter, 1991, pp:253-268 [Conf]
  38. Yehuda Afek, Michael Merritt, Gadi Taubenfeld
    Benign Failure Models for Shared Memory (Preliminary Version). [Citation Graph (0, 0)][DBLP]
    WDAG, 1993, pp:69-83 [Conf]
  39. Michael Merritt, Omer Reingold, Gadi Taubenfeld, Rebecca N. Wright
    Tight Bounds for Shared Memory Systems Accessed by Byzantine Processes. [Citation Graph (0, 0)][DBLP]
    DISC, 2002, pp:222-236 [Conf]
  40. Michael Merritt, Gadi Taubenfeld
    Computing with Infinitely Many Processes. [Citation Graph (0, 0)][DBLP]
    DISC, 2000, pp:164-178 [Conf]
  41. Michael Merritt, Gadi Taubenfeld
    Resilient Consensus for Infinitely Many Processes. [Citation Graph (0, 0)][DBLP]
    DISC, 2003, pp:1-15 [Conf]
  42. Michael Merritt, Gadi Taubenfeld
    Atomic m-Register Operations (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    WDAG, 1991, pp:289-294 [Conf]
  43. Michael Merritt, Gadi Taubenfeld
    Fairness of Shared Objects. [Citation Graph (0, 0)][DBLP]
    DISC, 1998, pp:303-317 [Conf]
  44. Dahlia Malkhi, Michael Merritt, Michael K. Reiter, Gadi Taubenfeld
    Objects Shared by Byzantine Processes. [Citation Graph (0, 0)][DBLP]
    DISC, 2000, pp:345-359 [Conf]
  45. Dahlia Malkhi, Michael Merritt, Ohad Rodeh
    Secure Multicast in a WAN [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  46. Yehuda Afek, Anat Bremler-Barr, Haim Kaplan, Edith Cohen, Michael Merritt
    Restoration by path concatenation: fast recovery of MPLS paths. [Citation Graph (0, 0)][DBLP]
    Distributed Computing, 2002, v:15, n:4, pp:273-283 [Journal]
  47. Noga Alon, Michael Merritt, Omer Reingold, Gadi Taubenfeld, Rebecca N. Wright
    Tight bounds for shared memory systems accessed by Byzantine processes. [Citation Graph (0, 0)][DBLP]
    Distributed Computing, 2005, v:18, n:2, pp:99-109 [Journal]
  48. Michael J. Fischer, Nancy A. Lynch, Michael Merritt
    Easy Impossibility Proofs for Distributed Consensus Problems. [Citation Graph (0, 0)][DBLP]
    Distributed Computing, 1986, v:1, n:1, pp:26-39 [Journal]
  49. Michael J. Fischer, Michael Merritt
    Appraising two decades of distributed computing theory research. [Citation Graph (0, 0)][DBLP]
    Distributed Computing, 2003, v:16, n:2-3, pp:239-247 [Journal]
  50. Dahlia Malkhi, Michael Merritt, Ohad Rodeh
    Secure Reliable Multicast Protocols in a WAN. [Citation Graph (0, 0)][DBLP]
    Distributed Computing, 2000, v:13, n:1, pp:19-28 [Journal]
  51. Dahlia Malkhi, Michael Merritt, Michael K. Reiter, Gadi Taubenfeld
    Objects shared by Byzantine processes. [Citation Graph (0, 0)][DBLP]
    Distributed Computing, 2003, v:16, n:1, pp:37-48 [Journal]
  52. Michael Merritt
    Introduction. [Citation Graph (0, 0)][DBLP]
    Distributed Computing, 1999, v:12, n:2-3, pp:55-56 [Journal]
  53. Michael Merritt, Gadi Taubenfeld
    Knowledge in Shared Memory Systems. [Citation Graph (0, 0)][DBLP]
    Distributed Computing, 1993, v:7, n:2, pp:99-109 [Journal]
  54. Michael Merritt, Gadi Taubenfeld
    Atomic m-Register Operations. [Citation Graph (0, 0)][DBLP]
    Distributed Computing, 1994, v:7, n:4, pp:213-221 [Journal]
  55. Robert P. Kurshan, Michael Merritt, Ariel Orda, Sonia R. Sachs
    A Structural Linearization Principle for Processes. [Citation Graph (0, 0)][DBLP]
    Formal Methods in System Design, 1994, v:5, n:3, pp:227-244 [Journal]
  56. Robert P. Kurshan, Michael Merritt, Ariel Orda, Sonia R. Sachs
    Modelling Asynchrony with a Synchronous Model. [Citation Graph (0, 0)][DBLP]
    Formal Methods in System Design, 1999, v:15, n:3, pp:175-199 [Journal]
  57. Michael Merritt, Ariel Orda, Sonia R. Sachs
    Formal Verification of a Distributed Computer System. [Citation Graph (0, 0)][DBLP]
    Formal Methods in System Design, 1997, v:10, n:1, pp:93-125 [Journal]
  58. Yehuda Afek, Michael Merritt, Gadi Taubenfeld
    The Power of Multiobjects. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1999, v:153, n:1, pp:117-138 [Journal]
  59. Michael Merritt, Gadi Taubenfeld
    Speeding Lamport's Fast Mutual Exclusion Algorithm. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1993, v:45, n:3, pp:137-142 [Journal]
  60. Ariel Orda, Michael Merritt
    Efficient Test & Set Constructions for Faulty Shared Memory. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1997, v:62, n:1, pp:41-46 [Journal]
  61. Yehuda Afek, Hagit Attiya, Danny Dolev, Eli Gafni, Michael Merritt, Nir Shavit
    Atomic Snapshots of Shared Memory. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1993, v:40, n:4, pp:873-890 [Journal]
  62. Yehuda Afek, David S. Greenberg, Michael Merritt, Gadi Taubenfeld
    Computing With Faulty Shared Objects. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1995, v:42, n:6, pp:1231-1274 [Journal]
  63. Benny Chor, Michael Merritt, David B. Shmoys
    Simple constant-time consensus protocols in realistic failure models. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1989, v:36, n:3, pp:591-614 [Journal]
  64. Steven M. Bellovin, Michael Merritt
    An attack on the Interlock Protocol when used for authentication. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1994, v:40, n:1, pp:273-0 [Journal]
  65. Yehuda Afek, Geoffrey M. Brown, Michael Merritt
    Lazy Caching. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Program. Lang. Syst., 1993, v:15, n:1, pp:182-205 [Journal]
  66. Yehuda Afek, Danny Dolev, Eli Gafni, Michael Merritt, Nir Shavit
    A Bounded First-In, First-Enabled Solution to the l-Exclusion Problem. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Program. Lang. Syst., 1994, v:16, n:3, pp:939-953 [Journal]

  67. Group Renaming. [Citation Graph (, )][DBLP]


  68. Sequentially consistent versus linearizable counting networks. [Citation Graph (, )][DBLP]


Search in 0.001secs, Finished in 0.004secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002