David Yu Cheng Chan

George Giakkoupis

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

2021

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

[BibT_eX]

[DOI]

CoRR, 2021

Tight Lower Bounds for the RMR Complexity of Recoverable Mutual Exclusion.

[BibT_eX]

[DOI]

CoRR, 2021

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

[BibT_eX]

[DOI]

CoRR, 2021

Tight Lower Bound for the RMR Complexity of Recoverable Mutual Exclusion.

[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

Recoverable Mutual Exclusion with Constant Amortized RMR Complexity from Standard Primitives.

[BibT_eX]

[DOI]

Proceedings of the PODC '20: ACM Symposium on Principles of Distributed Computing, 2020

2019

Classifications of Asynchronous Shared Memory Objects.

[BibT_eX]

[DOI]

PhD thesis, 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

2014

Multi-Path Algorithms for minimum-colour path problems with applications to approximating barrier resilience.

[BibT_eX]

[DOI]

David G. Kirkpatrick

Theor. Comput. Sci., 2014

2012

Approximating Barrier Resilience for Arrangements of Non-identical Disk Sensors.

[BibT_eX]

[DOI]