default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichael Merritt
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j30]Aaron Mahler, Tyrus Berry, Tom Stephens, Harbir Antil, Michael Merritt, Jeanie Schreiber, Ioannis G. Kevrekidis:
On-manifold projected gradient descent. Frontiers Comput. Sci. 6 (2024)- [i5]David J. Schodt, Ryan C. Brown, Michael Merritt, Samuel Park, Delsin Menolascino, Mark A. Peot:
A Framework for Variational Inference of Lightweight Bayesian Neural Networks with Heteroscedastic Uncertainties. CoRR abs/2402.14532 (2024) - 2023
- [i4]Aaron Mahler, Tyrus Berry, Tom Stephens, Harbir Antil, Michael Merritt, Jeanie Schreiber, Ioannis G. Kevrekidis:
On-Manifold Projected Gradient Descent. CoRR abs/2308.12279 (2023) - 2021
- [j29]Michael Merritt, Alen Alexanderian, Pierre-Alain Gremaud:
Multiscale Global Sensitivity Analysis for Stochastic Chemical Systems. Multiscale Model. Simul. 19(1): 440-459 (2021) - [i3]Michael Merritt, Alen Alexanderian, Pierre-Alain Gremaud:
Global sensitivity analysis of rare event probabilities. CoRR abs/2110.13974 (2021) - 2020
- [i2]Michael Merritt, Alen Alexanderian, Pierre-Alain Gremaud:
Multiscale global sensitivity analysis for stochastic chemical systems. CoRR abs/2003.07842 (2020)
2010 – 2019
- 2016
- [c48]Michael Merritt, Timothy Brothers, Andrew Stark, Jeffrey Rada, Debbie Nielsen, Kyle Davis, Benjamin B. Yang, Chris Ward, Margaret Quiggle:
A reconfigurable architecture to support dynamic communications, radar, and sensing. MILCOM 2016: 867-871 - 2013
- [j28]Michael Merritt, Gadi Taubenfeld:
Computing with infinitely many processes. Inf. Comput. 233: 12-31 (2013) - [c47]Michael Merritt:
Plenary talk. PODC 2013: 1
2000 – 2009
- 2008
- [j27]Marios Mavronicolas
, Michael Merritt, Gadi Taubenfeld:
Sequentially consistent versus linearizable counting networks. Distributed Comput. 21(4): 249-269 (2008) - [c46]Yehuda Afek, Iftah Gamzu, Irit Levy, Michael Merritt, Gadi Taubenfeld:
Group Renaming. OPODIS 2008: 58-72 - 2005
- [j26]Noga Alon, Michael Merritt, Omer Reingold, Gadi Taubenfeld, Rebecca N. Wright:
Tight bounds for shared memory systems accessed by Byzantine processes. Distributed Comput. 18(2): 99-109 (2005) - 2003
- [j25]Dahlia Malkhi, Michael Merritt, Michael K. Reiter, Gadi Taubenfeld:
Objects shared by Byzantine processes. Distributed Comput. 16(1): 37-48 (2003) - [j24]Michael J. Fischer, Michael Merritt:
Appraising two decades of distributed computing theory research. Distributed Comput. 16(2-3): 239-247 (2003) - [c45]Michael Merritt, Gadi Taubenfeld:
Resilient Consensus for Infinitely Many Processes. DISC 2003: 1-15 - 2002
- [j23]Yehuda Afek, Anat Bremler-Barr, Haim Kaplan, Edith Cohen, Michael Merritt:
Restoration by path concatenation: fast recovery of MPLS paths. Distributed Comput. 15(4): 273-283 (2002) - [c44]Michael Merritt, Omer Reingold, Gadi Taubenfeld, Rebecca N. Wright:
Tight Bounds for Shared Memory Systems Accessed by Byzantine Processes. DISC 2002: 222-236 - 2001
- [c43]Anat Bremler-Barr, Yehuda Afek, Haim Kaplan, Edith Cohen, Michael Merritt:
Restoration by path concatenation: fast recovery of MPLS paths. PODC 2001: 43-52 - [c42]Eli Gafni, Michael Merritt, Gadi Taubenfeld:
The concurrency hierarchy, and algorithms for unbounded concurrency. PODC 2001: 161-169 - [c41]Anat Bremler-Barr, Yehuda Afek, Haim Kaplan, Edith Cohen, Michael Merritt:
Restoration path concatenation: fast recovery of MPLS paths. SIGMETRICS/Performance 2001: 316-317 - 2000
- [j22]Dahlia Malkhi, Michael Merritt, Ohad Rodeh:
Secure Reliable Multicast Protocols in a WAN. Distributed Comput. 13(1): 19-28 (2000) - [c40]Michael Merritt, Gadi Taubenfeld:
Computing with Infinitely Many Processes. DISC 2000: 164-178 - [c39]Dahlia Malkhi, Michael Merritt, Michael K. Reiter, Gadi Taubenfeld:
Objects Shared by Byzantine Processes. DISC 2000: 345-359
1990 – 1999
- 1999
- [j21]Michael Merritt:
Introduction. Distributed Comput. 12(2-3): 55-56 (1999) - [j20]Robert P. Kurshan, Michael Merritt, Ariel Orda, Sonia R. Sachs:
Modelling Asynchrony with a Synchronous Model. Formal Methods Syst. Des. 15(3): 175-199 (1999) - [j19]Yehuda Afek, Michael Merritt, Gadi Taubenfeld:
The Power of Multiobjects. Inf. Comput. 153(1): 117-138 (1999) - [c38]Yehuda Afek, Michael Merritt:
Fast, Wait-Free (2k)-Renaming. PODC 1999: 105-112 - [c37]Marios Mavronicolas, Michael Merritt, Gadi Taubenfeld:
Sequentially Consistent versus Linearizable Counting Networks. PODC 1999: 133-142 - [e2]Marios Mavronicolas, Michael Merritt, Nir Shavit:
Networks in Distributed Computing, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, October 27-29, 1997. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 45, DIMACS/AMS 1999, ISBN 978-0-8218-0992-1 [contents] - [i1]Dahlia Malkhi, Michael Merritt, Ohad Rodeh:
Secure Multicast in a WAN. CoRR cs.CR/9908008 (1999) - 1998
- [c36]Michael Merritt, Gadi Taubenfeld:
Fairness of Shared Objects. DISC 1998: 303-317 - 1997
- [j18]Michael Merritt, Ariel Orda, Sonia R. Sachs:
Formal Verification of a Distributed Computer System. Formal Methods Syst. Des. 10(1): 93-125 (1997) - [j17]Ariel Orda, Michael Merritt:
Efficient Test & Set Constructions for Faulty Shared Memory. Inf. Process. Lett. 62(1): 41-46 (1997) - [c35]Dahlia Malkhi, Michael Merritt, Ohad Rodeh:
Secure Reliable Multicast Protocols in a WAN. ICDCS 1997: 87-94 - [c34]Yehuda Afek, Michael Merritt, Gadi Taubenfeld, Dan Touitou:
Disentangling Multi-Object Operations (Extended Abstract). PODC 1997: 111-120 - 1996
- [c33]Yehuda Afek, Michael Merritt, Gadi Taubenfeld:
The Power of Multi-objects (Extended Abstract). PODC 1996: 213-222 - 1995
- [j16]Yehuda Afek, David S. Greenberg, Michael Merritt, Gadi Taubenfeld:
Computing With Faulty Shared Objects. J. ACM 42(6): 1231-1274 (1995) - [c32]Robert P. Kurshan, Michael Merritt, Ariel Orda, Sonia R. Sachs:
Modelling Asynchrony with a Synchronous Model. CAV 1995: 339-352 - 1994
- [j15]Michael Merritt, Gadi Taubenfeld:
Atomic m-Register Operations. Distributed Comput. 7(4): 213-221 (1994) - [j14]Robert P. Kurshan, Michael Merritt, Ariel Orda, Sonia R. Sachs:
A Structural Linearization Principle for Processes. Formal Methods Syst. Des. 5(3): 227-244 (1994) - [j13]Steven M. Bellovin, Michael Merritt:
An attack on the Interlock Protocol when used for authentication. IEEE Trans. Inf. Theory 40(1): 273-275 (1994) - [j12]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) - [c31]Edward Amoroso, Michael Merritt:
Composing system integrity using I/O automata. ACSAC 1994: 34-43 - 1993
- [b1]Nancy A. Lynch, Michael Merritt, William E. Weihl, Alan D. Fekete:
Atomic Transactions. Morgan Kaufmann series in data management systems, Morgan Kaufmann 1993, ISBN 1-55860-104-X, pp. I-XXI, 1-500 - [j11]Michael Merritt, Gadi Taubenfeld:
Knowledge in Shared Memory Systems. Distributed Comput. 7(2): 99-109 (1993) - [j10]Michael Merritt, Gadi Taubenfeld:
Speeding Lamport's Fast Mutual Exclusion Algorithm. Inf. Process. Lett. 45(3): 137-142 (1993) - [j9]Yehuda Afek, Hagit Attiya, Danny Dolev, Eli Gafni, Michael Merritt, Nir Shavit:
Atomic Snapshots of Shared Memory. J. ACM 40(4): 873-890 (1993) - [j8]Yehuda Afek, Geoffrey M. Brown, Michael Merritt:
Lazy Caching. ACM Trans. Program. Lang. Syst. 15(1): 182-205 (1993) - [c30]Robert P. Kurshan, Michael Merritt, Ariel Orda, Sonia R. Sachs:
A Structural Linearization Principle for Processes. CAV 1993: 491-504 - [c29]Steven M. Bellovin, Michael Merritt:
Augmented Encrypted Key Exchange: A Password-Based Protocol Secure against Dictionary Attacks and Password File Compromise. CCS 1993: 244-250 - [c28]Yehuda Afek, Michael Merritt, Gadi Taubenfeld:
Benign Failure Models for Shared Memory (Preliminary Version). WDAG 1993: 69-83 - 1992
- [j7]Maurice Herlihy, Nancy A. Lynch, Michael Merritt, William E. Weihl:
On the Correctness of Orphan Management Algorithms. J. ACM 39(4): 881-930 (1992) - [c27]Yehuda Afek, David S. Greenberg, Michael Merritt, Gadi Taubenfeld:
Computing with Faulty Shared Memory (Extended Abstract). PODC 1992: 47-58 - [c26]Steven M. Bellovin, Michael Merritt:
Encrypted key exchange: password-based protocols secure against dictionary attacks. S&P 1992: 72-84 - [c25]Phillip B. Gibbons, Michael Merritt:
Specifying Non-Blocking Shared Memories (Extended Abstract). SPAA 1992: 306-315 - 1991
- [c24]Michael Merritt, Francesmary Modugno, Marc R. Tuttle:
Time-Constrained Automata (Extended Abstract). CONCUR 1991: 408-423 - [c23]Michael Merritt, Gadi Taubenfeld:
Knowledge in Shared Memory Systems (Preliminary Version). PODC 1991: 189-200 - [c22]Phillip B. Gibbons, Michael Merritt, Kourosh Gharachorloo:
Proving Sequential Consistency of High-Performance Shared Memories (Extended Abstract). SPAA 1991: 292-303 - [c21]Steven M. Bellovin, Michael Merritt:
Limitations of the Kerberos Authentication System. USENIX Winter 1991: 253-268 - [c20]Michael Merritt, Gadi Taubenfeld:
Atomic m-Register Operations (Extended Abstract). WDAG 1991: 289-294 - [e1]Joan Feigenbaum, Michael Merritt:
Distributed Computing And Cryptography, Proceedings of a DIMACS Workshop, Princeton, New Jersey, USA, October 4-6, 1989. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 2, DIMACS/AMS 1991, ISBN 978-0-8218-6590-3 [contents] - 1990
- [j6]Steven M. Bellovin, Michael Merritt:
Limitations of the Kerberos authentication system. Comput. Commun. Rev. 20(5): 119-132 (1990) - [j5]Alan D. Fekete, Nancy A. Lynch, Michael Merritt, William E. Weihl:
Commutativity-Based Locking for Nested Transactions. J. Comput. Syst. Sci. 41(1): 65-156 (1990) - [c19]Yehuda Afek, Danny Dolev, Hagit Attiya, Eli Gafni, Michael Merritt, Nir Shavit:
Atomic Snapshots of Shared Memory. PODC 1990: 1-13
1980 – 1989
- 1989
- [j4]Benny Chor, Michael Merritt, David B. Shmoys:
Simple constant-time consensus protocols in realistic failure models. J. ACM 36(3): 591-614 (1989) - [c18]Joan Feigenbaum, Michael Merritt:
Open Questions, Talk Abstracts, and Summary of Discussions. Distributed Computing And Cryptography 1989: 1-46 - [c17]Michael Merritt:
Towards a Theory of Cryptographic Systems: A Critique of Crypto-Complexity. Distributed Computing And Cryptography 1989: 203-212 - [c16]Alan D. Fekete, Nancy A. Lynch, Michael Merritt, William E. Weihl:
Commutativity-Based Locking for Nested Transactions. POS 1989: 319-340 - [c15]Michael Merritt:
Completeness Theorems for Automata. REX Workshop 1989: 544-560 - [c14]Yehuda Afek, Geoffrey M. Brown, Michael Merritt:
A Lazy Cache Algorithm. SPAA 1989: 209-222 - 1988
- [j3]Nancy A. Lynch, Michael Merritt:
Introduction to the Theory of Nested Transactions. Theor. Comput. Sci. 62(1-2): 123-185 (1988) - [c13]Nancy A. Lynch, Michael Merritt, William E. Weihl, Alan D. Fekete:
A Theory of Atomic Transactions. ICDT 1988: 41-71 - [c12]James Aspnes, Alan D. Fekete, Nancy A. Lynch, Michael Merritt, William E. Weihl:
A Theory of Timestamp-Based Concurrency Control for Nested Transactions. VLDB 1988: 431-444 - 1987
- [c11]Alan D. Fekete, Nancy A. Lynch, Michael Merritt, William E. Weihl:
Nested Transactions and Read/Write Locking. PODS 1987: 97-111 - 1986
- [j2]Michael J. Fischer, Nancy A. Lynch, Michael Merritt:
Easy Impossibility Proofs for Distributed Consensus Problems. Distributed Comput. 1(1): 26-39 (1986) - [c10]Michael J. Fischer, Nancy A. Lynch, Michael Merritt:
Easy Impossibility Proofs for Distributed Consensus Problems. Fault-Tolerant Distributed Computing 1986: 147-170 - [c9]Nancy A. Lynch, Michael Merritt:
Introduction to the Theory of Nested Transactions. ICDT 1986: 278-305 - 1985
- [c8]Michael J. Fischer, Nancy A. Lynch, Michael Merritt:
Easy Impossibility Proofs for Distributed Consensus Problems. PODC 1985: 59-70 - [c7]Benny Chor, Michael Merritt, David B. Shmoys:
Simple Constant-Time Consensus Protocols in Realistic Failure Models (Extended Abstract). PODC 1985: 152-162 - 1984
- [c6]Steven Fortune, Michael Merritt:
Poker Protocols. CRYPTO 1984: 454-464 - [c5]Michael Merritt:
Elections in the Presence of Faults. PODC 1984: 134-142 - [c4]Don P. Mitchell, Michael Merritt:
A Distributed Algorithm for Deadlock Detection and Resolution. PODC 1984: 282-284 - 1983
- [j1]Richard A. DeMillo, Michael Merritt:
Protocols for Data Security. Computer 16(2): 39-51 (1983) - 1982
- [c3]Michael Merritt:
Key Reconstruction. CRYPTO 1982: 321-322 - [c2]Richard A. DeMillo, Nancy A. Lynch, Michael Merritt:
Cryptographic Protocols. STOC 1982: 383-400 - 1981
- [c1]Richard A. DeMillo, Nancy A. Lynch, Michael Merritt:
The Design and Analysis of Cryptographic Protocols. CRYPTO 1981: 71-72
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 12:48 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
