List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| On Register Linearizability and Termination Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
| scientific article; zbMATH DE number 7650878 (Why is no real title available?) | 2023-02-07 | Paper |
| Byzantine-Tolerant Set-Constrained Delivery Broadcast | 2023-02-07 | Paper |
| On the number of objects with distinct power and the linearizability of set agreement objects | 2023-02-03 | Paper |
| On atomic registers and randomized consensus in m\&m systems Distributed Computing | 2022-04-01 | Paper |
| Randomized consensus with regular registers Information Processing Letters | 2021-12-14 | Paper |
| On the power of shared object types to implement one-resilient consensus Distributed Computing | 2020-12-03 | Paper |
| Life beyond set agreement Distributed Computing | 2020-06-15 | Paper |
| Bounded disagreement Theoretical Computer Science | 2020-05-26 | Paper |
| On the Classification of Deterministic Objects via Set Agreement Power Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing | 2019-09-19 | Paper |
| Bounded disagreement | 2018-07-18 | Paper |
| Life beyond set agreement Proceedings of the ACM Symposium on Principles of Distributed Computing | 2017-10-11 | Paper |
| Wait-freedom vs. <i>t</i>-resiliency and the robustness of wait-free hierarchies (extended abstract) Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing - PODC '94 | 2017-09-29 | Paper |
| An algorithm for replicated objects with efficient reads (extended abstract) Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing | 2017-09-29 | Paper |
| The weakest failure detector for solving consensus Proceedings of the eleventh annual ACM symposium on Principles of distributed computing - PODC '92 | 2017-08-21 | Paper |
| On the impossibility of group membership Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing - PODC '96 | 2015-09-11 | Paper |
| The weakest failure detectors to solve certain fundamental problems in distributed computing Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing | 2015-08-03 | Paper |
| Message-optimal protocols for byzantine agreement (extended abstract) Proceedings of the tenth annual ACM symposium on Principles of distributed computing - PODC '91 | 2015-06-19 | Paper |
| The weakest failure detector to solve nonuniform consensus Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing | 2015-03-10 | Paper |
| A scheme for load balancing in heterogenous distributed hash tables Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing | 2015-03-10 | Paper |
| On deterministic abortable objects Proceedings of the 2013 ACM symposium on Principles of distributed computing | 2015-03-02 | Paper |
| Constant-RMR implementations of CAS and other synchronization primitives using read and write operations Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing | 2014-03-13 | Paper |
| Abortable and query-abortable objects and their efficient implementation Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing | 2014-03-13 | Paper |
| On the complexity of greedy routing in ring-based peer-to-peer networks Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing | 2014-03-13 | Paper |
| The weakest failure detector to solve nonuniform consensus Distributed Computing | 2013-06-20 | Paper |
| The weakest failure detectors to solve quittable consensus and nonblocking atomic commit SIAM Journal on Computing | 2013-03-19 | Paper |
| RMR-efficient implementations of comparison primitives using read and write operations Distributed Computing | 2013-02-04 | Paper |
| Local-Spin Group Mutual Exclusion Algorithms Lecture Notes in Computer Science | 2005-08-17 | Paper |
| Generalized Irreducibility of Consensus and the Equivalence of <i>t</i>-Resilient and Wait-Free Implementations of Consensus SIAM Journal on Computing | 2005-02-21 | Paper |
| scientific article; zbMATH DE number 1559573 (Why is no real title available?) | 2001-02-28 | Paper |
| All of Us Are Smarter than Any of Us: Nondeterministic Wait-Free Hierarchies Are Not Robust SIAM Journal on Computing | 2000-10-18 | Paper |
| Safe locking policies for dynamic databases Journal of Computer and System Sciences | 1999-02-21 | Paper |
| The weakest failure detector for solving consensus Journal of the ACM | 1998-01-22 | Paper |
| The weakest failure detector for solving consensus Journal of the ACM | 1998-01-22 | Paper |
| Message-optimal protocols for Byzantine Agreement Mathematical Systems Theory | 1993-04-01 | Paper |
| The Failure Discovery problem Mathematical Systems Theory | 1993-04-01 | Paper |
| On the message complexity of binary Byzantine agreement under crash failures Distributed Computing | 1992-09-27 | Paper |
| A theory of reliability in database systems Journal of the ACM | 1992-06-25 | Paper |
| Transaction synchronisation in object bases Journal of Computer and System Sciences | 1992-06-25 | Paper |
Research outcomes over time
This page was built for person: Vassos Hadzilacos
