Vassos Hadzilacos

Inf. Process. Lett., 2022

On atomic registers and randomized consensus in M&M systems.

[BibT_eX]

[DOI]

Distributed Comput., 2022

Parameterized algorithm for replicated objects with local reads.

[BibT_eX]

[DOI]

Changyu Bi

CoRR, 2022

2021

An Impossibility Result on Strong Linearizability in Message-Passing Systems.

[BibT_eX]

[DOI]

CoRR, 2021

Differentiated nonblocking: a new progress condition and a matching queue algorithm.

[BibT_eX]

[DOI]

CoRR, 2021

On Register Linearizability and Termination.

[BibT_eX]

[DOI]

Proceedings of the PODC '21: ACM Symposium on Principles of Distributed Computing, 2021

2020

Bounded disagreement.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Life beyond set agreement.

[BibT_eX]

[DOI]

Distributed Comput., 2020

On Linearizability and the Termination of Randomized Algorithms.

[BibT_eX]

[DOI]

Felipe de Azevedo Piovezan

CoRR, 2020

2019

On Deterministic Linearizable Set Agreement Objects.

[BibT_eX]

[DOI]

Proceedings of the 23rd International Conference on Principles of Distributed Systems, 2019

Optimal Register Construction in M&M Systems.

[BibT_eX]

[DOI]

Proceedings of the 23rd International Conference on Principles of Distributed Systems, 2019

2018

On the Classification of Deterministic Objects via Set Agreement Power.

[BibT_eX]

[DOI]

Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, 2018

2017

On the Number of Objects with Distinct Power and the Linearizability of Set Agreement Objects.

[BibT_eX]

[DOI]

Proceedings of the 31st International Symposium on Distributed Computing, 2017

2016

k-Abortable Objects: Progress Under High Contention.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing - 30th International Symposium, 2016

An Algorithm for Replicated Objects with Efficient Reads.

[BibT_eX]

[DOI]

Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, 2016

2015

A Quarter-Century of Wait-Free Synchronization.

[BibT_eX]

[DOI]

SIGACT News, 2015

2013

On deterministic abortable objects.

[BibT_eX]

[DOI]

Proceedings of the ACM Symposium on Principles of Distributed Computing, 2013

2012

The Weakest Failure Detectors to Solve Quittable Consensus and Nonblocking Atomic Commit.

[BibT_eX]

[DOI]

SIAM J. Comput., 2012

RMR-efficient implementations of comparison primitives using read and write operations.

[BibT_eX]

[DOI]

Distributed Comput., 2012

2007

The weakest failure detector to solve nonuniform consensus.

[BibT_eX]

[DOI]

Jonathan Eisler

Distributed Comput., 2007

Constant-RMR implementations of CAS and other synchronization primitives using read and write operations.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, 2007

On the complexity of greedy routing in ring-based peer-to-peer networks.

[BibT_eX]

[DOI]

George Giakkoupis

Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, 2007

Abortable and query-abortable objects and their efficient implementation.

[BibT_eX]

[DOI]

Marcos Kawazoe Aguilera

Svend Frølund

Stephanie Lorraine Horn

Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, 2007

2006

Brief Announcement: Abortable and Query-Abortable Objects.

[BibT_eX]

[DOI]

Marcos Kawazoe Aguilera

Svend Frølund

Stephanie Lorraine Horn

Proceedings of the Distributed Computing, 20th International Symposium, 2006

2005

A scheme for load balancing in heterogenous distributed hash tables.

[BibT_eX]

[DOI]

George Giakkoupis

Proceedings of the Twenty-Fourth Annual ACM Symposium on Principles of Distributed Computing, 2005

2004

Generalized Irreducibility of Consensus and the Equivalence of t-Resilient and Wait-Free Implementations of Consensus.

[BibT_eX]

[DOI]

Prasad Jayanti

SIAM J. Comput., 2004

Local-Spin Group Mutual Exclusion Algorithms.

[BibT_eX]

[DOI]

Robert Danek

Proceedings of the Distributed Computing, 18th International Conference, 2004

The weakest failure detectors to solve certain fundamental problems in distributed computing.

[BibT_eX]

[DOI]

Carole Delporte-Gallet

Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, 2004

2001

A note on group mutual exclusion.

[BibT_eX]

[DOI]

Proceedings of the Twentieth Annual ACM Symposium on Principles of Distributed Computing, 2001

2000

All of Us Are Smarter than Any of Us: Nondeterministic Wait-Free Hierarchies Are Not Robust.

[BibT_eX]

[DOI]

SIAM J. Comput., 2000

On the power of shared object types to implement one-resilient Consensus.

[BibT_eX]

[DOI]

Distributed Comput., 2000

1999

Asynchronous Group Membership with Oracles.

[BibT_eX]

[DOI]

Kal Lin

Proceedings of the Distributed Computing, 1999

1998

Safe Locking Policies for Dynamic Databases.

[BibT_eX]

[DOI]

Vinay K. Chaudhri

J. Comput. Syst. Sci., 1998

1997

All of Us are Smarter Than Any of Us: Wait-Free Hierarchies are not Robust.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, 1997

1996

The Weakest Failure Detector for Solving Consensus.

[BibT_eX]

[DOI]

J. ACM, 1996

On the Impossibility of Group Membership.

[BibT_eX]

[DOI]

Bernadette Charron-Bost

Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing, 1996

1994

Using Failure Detectors to Solve Consensus in Asynchronous Sharde-Memory Systems (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Distributed Algorithms, 8th International Workshop, 1994

Wait-Freedom vs. t-Resiliency and the Robustness of Wait-Free Hierarchies.

[BibT_eX]

[DOI]

Prasad Jayanti

Proceedings of the Thirteenth Annual ACM Symposium on Principles of Distributed Computing, 1994

Quantitative Evaluation of a Transaction Facility for a Knowledge Base Management System.

[BibT_eX]

[DOI]

Proceedings of the Third International Conference on Information and Knowledge Management (CIKM'94), Gaithersburg, Maryland, USA, November 29, 1994

1993

The Failure Discovery Problem.

[BibT_eX]

[DOI]

Joseph Y. Halpern

Math. Syst. Theory, 1993

Message-Optimal Protocols for Byzantine Agreement.

[BibT_eX]

[DOI]

Joseph Y. Halpern

Math. Syst. Theory, 1993

Tolerating Transient and Permanent Failures (Extended Abstract).

[BibT_eX]

[DOI]

Efthymios Anagnostou

Proceedings of the Distributed Algorithms, 7th International Workshop, 1993

Concurrency Control for Knowledge Bases.

[BibT_eX]

Vinay K. Chaudhri

John Mylopoulos

Proceedings of the International Workshop on High-Performance Transaction Systems, 1993

1992

On the Message Complexity of Binary Byzantine Agreement under Crash Failures.

[BibT_eX]

[DOI]

Eugene S. Amdur

Samuel M. Weber

Distributed Comput., 1992

Memory Adaptive Self-Stabilizing Protocols (Extended Abstract).

[BibT_eX]

[DOI]

Efthymios Anagnostou

Ran El-Yaniv

Proceedings of the Distributed Algorithms, 6th International Workshop, 1992

1991

A First-Come-First-Served Mutual-Exclusion Algorithm with Small Communication Variables.

[BibT_eX]

[DOI]

Edward A. Lycklama

ACM Trans. Program. Lang. Syst., 1991

Transaction Synchronisation in Object Bases.

[BibT_eX]

[DOI]

Thanasis Hadzilacos

J. Comput. Syst. Sci., 1991

Message-Optimal Protocols for Byzantine Agreement (Extended Abstract).

[BibT_eX]

[DOI]

Joseph Y. Halpern

Proceedings of the Tenth Annual ACM Symposium on Principles of Distributed Computing, 1991

1988

A theory of reliability in database systems.

[BibT_eX]

[DOI]

J. ACM, 1988

1987

Connectivity Requirements for Byzantine Agreement under Restricted Types of Failures.

[BibT_eX]

[DOI]

Distributed Comput., 1987

A Knowledge Theoretic Analysis of Atomic Commitment Protocols.

[BibT_eX]

[DOI]

Proceedings of the Sixth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1987

Concurrency Control and Recovery in Database Systems.

[BibT_eX]

[DOI]

Philip A. Bernstein

Nathan Goodman

Addison-Wesley, ISBN: 0-201-10715-5, 1987

1986

On the Relationship Between the Atomic Commitment and Consensus Problems.

[BibT_eX]

[DOI]

Proceedings of the Fault-Tolerant Distributed Computing [Asilomar Workshop 1986], 1986

1983

An Operational Model for Database System Reliability.

[BibT_eX]

[DOI]

Proceedings of the Second ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, 1983

Recovery Algorithms for Database Systems.

[BibT_eX]

Philip A. Bernstein

Nathan Goodman

Proceedings of the Information Processing 83, 1983

1982

An Algorithm for Minimizing Roll Back Cost.

[BibT_eX]

[DOI]