Michael Merritt

According to our database1, Michael Merritt authored at least 69 papers between 1981 and 2024.

Collaborative distances:
  • Dijkstra number2 of two.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
On-manifold projected gradient descent.
Frontiers Comput. Sci., 2024

A Framework for Variational Inference of Lightweight Bayesian Neural Networks with Heteroscedastic Uncertainties.
CoRR, 2024

2021
Multiscale Global Sensitivity Analysis for Stochastic Chemical Systems.
Multiscale Model. Simul., 2021

Global sensitivity analysis of rare event probabilities.
CoRR, 2021

2016
A reconfigurable architecture to support dynamic communications, radar, and sensing.
Proceedings of the 2016 IEEE Military Communications Conference, 2016

2013
Computing with infinitely many processes.
Inf. Comput., 2013

Plenary talk.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2013

2008
Sequentially consistent versus linearizable counting networks.
Distributed Comput., 2008

Group Renaming.
Proceedings of the Principles of Distributed Systems, 12th International Conference, 2008

2005
Tight bounds for shared memory systems accessed by Byzantine processes.
Distributed Comput., 2005

2003
Objects shared by Byzantine processes.
Distributed Comput., 2003

Appraising two decades of distributed computing theory research.
Distributed Comput., 2003

Resilient Consensus for Infinitely Many Processes.
Proceedings of the Distributed Computing, 17th International Conference, 2003

2002
Restoration by path concatenation: fast recovery of MPLS paths.
Distributed Comput., 2002

Tight Bounds for Shared Memory Systems Accessed by Byzantine Processes.
Proceedings of the Distributed Computing, 16th International Conference, 2002

2001
Restoration path concatenation: fast recovery of MPLS paths.
Proceedings of the Joint International Conference on Measurements and Modeling of Computer Systems, 2001

The concurrency hierarchy, and algorithms for unbounded concurrency.
Proceedings of the Twentieth Annual ACM Symposium on Principles of Distributed Computing, 2001

2000
Secure Reliable Multicast Protocols in a WAN.
Distributed Comput., 2000

1999
The Power of Multiobjects.
Inf. Comput., 1999

Modelling Asynchrony with a Synchronous Model.
Formal Methods Syst. Des., 1999

Introduction.
Distributed Comput., 1999

Secure Multicast in a WAN
CoRR, 1999

Fast, Wait-Free (2<i>k</i>)-Renaming.
Proceedings of the Eighteenth Annual ACM Symposium on Principles of Distributed Computing, 1999

1998
Fairness of Shared Objects.
Proceedings of the Distributed Computing, 12th International Symposium, 1998

1997
Efficient Test & Set Constructions for Faulty Shared Memory.
Inf. Process. Lett., 1997

Formal Verification of a Distributed Computer System.
Formal Methods Syst. Des., 1997

Disentangling Multi-Object Operations (Extended Abstract).
Proceedings of the Sixteenth Annual ACM Symposium on Principles of Distributed Computing, 1997

1996
The Power of Multi-objects (Extended Abstract).
Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing, 1996

1995
Computing With Faulty Shared Objects.
J. ACM, 1995

1994
A Bounded First-In, First-Enabled Solution to the l-Exclusion Problem.
ACM Trans. Program. Lang. Syst., 1994

An attack on the Interlock Protocol when used for authentication.
IEEE Trans. Inf. Theory, 1994

A Structural Linearization Principle for Processes.
Formal Methods Syst. Des., 1994

Atomic m-Register Operations.
Distributed Comput., 1994

Composing system integrity using I/O automata.
Proceedings of the 10th Annual Computer Security Applications Conference, 1994

1993
Lazy Caching.
ACM Trans. Program. Lang. Syst., 1993

Atomic Snapshots of Shared Memory.
J. ACM, 1993

Speeding Lamport's Fast Mutual Exclusion Algorithm.
Inf. Process. Lett., 1993

Knowledge in Shared Memory Systems.
Distributed Comput., 1993

Benign Failure Models for Shared Memory (Preliminary Version).
Proceedings of the Distributed Algorithms, 7th International Workshop, 1993

Augmented Encrypted Key Exchange: A Password-Based Protocol Secure against Dictionary Attacks and Password File Compromise.
Proceedings of the CCS '93, 1993

Atomic Transactions
Morgan Kaufmann series in data management systems, Morgan Kaufmann, ISBN: 1-55860-104-X, 1993

1992
On the Correctness of Orphan Management Algorithms.
J. ACM, 1992

Specifying Non-Blocking Shared Memories (Extended Abstract).
Proceedings of the 4th Annual ACM Symposium on Parallel Algorithms and Architectures, 1992

Encrypted key exchange: password-based protocols secure against dictionary attacks.
Proceedings of the 1992 IEEE Computer Society Symposium on Research in Security and Privacy, 1992

Computing with Faulty Shared Memory (Extended Abstract).
Proceedings of the Eleventh Annual ACM Symposium on Principles of Distributed Computing, 1992

1991
Atomic m-Register Operations (Extended Abstract).
Proceedings of the Distributed Algorithms, 5th International Workshop, 1991

Proving Sequential Consistency of High-Performance Shared Memories (Extended Abstract).
Proceedings of the 3rd Annual ACM Symposium on Parallel Algorithms and Architectures, 1991

Knowledge in Shared Memory Systems (Preliminary Version).
Proceedings of the Tenth Annual ACM Symposium on Principles of Distributed Computing, 1991

Time-Constrained Automata (Extended Abstract)
Proceedings of the CONCUR '91, 1991

1990
Commutativity-Based Locking for Nested Transactions.
J. Comput. Syst. Sci., 1990

Limitations of the Kerberos authentication system.
Comput. Commun. Rev., 1990

1989
Simple constant-time consensus protocols in realistic failure models.
J. ACM, 1989

A Lazy Cache Algorithm.
Proceedings of the ACM Symposium on Parallel Algorithms and Architectures, 1989

Completeness Theorems for Automata.
Proceedings of the Stepwise Refinement of Distributed Systems, 1989

Towards a Theory of Cryptographic Systems: A Critique of Crypto-Complexity.
Proceedings of the Distributed Computing And Cryptography, 1989

Open Questions, Talk Abstracts, and Summary of Discussions.
Proceedings of the Distributed Computing And Cryptography, 1989

1988
Introduction to the Theory of Nested Transactions.
Theor. Comput. Sci., 1988

A Theory of Timestamp-Based Concurrency Control for Nested Transactions.
Proceedings of the Fourteenth International Conference on Very Large Data Bases, August 29, 1988

A Theory of Atomic Transactions.
Proceedings of the ICDT'88, 2nd International Conference on Database Theory, Bruges, Belgium, August 31, 1988

1987
Nested Transactions and Read/Write Locking.
Proceedings of the Sixth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1987

1986
Easy Impossibility Proofs for Distributed Consensus Problems.
Distributed Comput., 1986

1985
Simple Constant-Time Consensus Protocols in Realistic Failure Models (Extended Abstract).
Proceedings of the Fourth Annual ACM Symposium on Principles of Distributed Computing, 1985

1984
A Distributed Algorithm for Deadlock Detection and Resolution.
Proceedings of the Third Annual ACM Symposium on Principles of Distributed Computing, 1984

Elections in the Presence of Faults.
Proceedings of the Third Annual ACM Symposium on Principles of Distributed Computing, 1984

Poker Protocols.
Proceedings of the Advances in Cryptology, 1984

1983
Protocols for Data Security.
Computer, 1983

1982
Cryptographic Protocols
Proceedings of the 14th Annual ACM Symposium on Theory of Computing, 1982

Key Reconstruction.
Proceedings of the Advances in Cryptology: Proceedings of CRYPTO '82, 1982

1981
The Design and Analysis of Cryptographic Protocols.
Proceedings of the Advances in Cryptology: A Report on CRYPTO 81, 1981


  Loading...