default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVassos Hadzilacos
Person information
- affiliation: University of Toronto, Canada
- award (2010): Dijkstra Prize
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i8]Vassos Hadzilacos, Myles Thiessen, Sam Toueg:
Generalized Compare and Swap. CoRR abs/2410.19102 (2024)- 2022
- [j20]Vassos Hadzilacos, Xing Hu
, Sam Toueg:
On atomic registers and randomized consensus in M&M systems. Distributed Comput. 35(1): 81-103 (2022) - [j19]Vassos Hadzilacos, Xing Hu, Sam Toueg:
Randomized consensus with regular registers. Inf. Process. Lett. 174: 106173 (2022) - [i7]Changyu Bi, Vassos Hadzilacos, Sam Toueg:
Parameterized algorithm for replicated objects with local reads. CoRR abs/2204.01228 (2022) - 2021
- [c39]Vassos Hadzilacos, Xing Hu, Sam Toueg:
On Register Linearizability and Termination. PODC 2021: 521-531 - [i6]Vassos Hadzilacos, Xing Hu, Sam Toueg:
On Register Linearizability and Termination. CoRR abs/2102.13242 (2021) - [i5]David Yu Cheng Chan, Shucheng Chi, Vassos Hadzilacos, Sam Toueg:
Differentiated nonblocking: a new progress condition and a matching queue algorithm. CoRR abs/2103.11926 (2021) - [i4]David Yu Cheng Chan, Vassos Hadzilacos, Xing Hu, Sam Toueg:
An Impossibility Result on Strong Linearizability in Message-Passing Systems. CoRR abs/2108.01651 (2021) - 2020
- [j18]David Yu Cheng Chan, Vassos Hadzilacos, Sam Toueg:
Life beyond set agreement. Distributed Comput. 33(3-4): 255-277 (2020) - [j17]David Yu Cheng Chan, Vassos Hadzilacos, Sam Toueg:
Bounded disagreement. Theor. Comput. Sci. 826-827: 12-24 (2020) - [i3]Vassos Hadzilacos, Xing Hu, Sam Toueg:
Randomized Consensus with Regular Registers. CoRR abs/2006.06771 (2020) - [i2]Vassos Hadzilacos, Xing Hu, Sam Toueg:
On Linearizability and the Termination of Randomized Algorithms. CoRR abs/2010.15210 (2020)
2010 – 2019
- 2019
- [c38]Felipe de Azevedo Piovezan, Vassos Hadzilacos, Sam Toueg:
On Deterministic Linearizable Set Agreement Objects. OPODIS 2019: 16:1-16:15 - [c37]Vassos Hadzilacos, Xing Hu, Sam Toueg:
Optimal Register Construction in M&M Systems. OPODIS 2019: 28:1-28:16 - [i1]Vassos Hadzilacos, Xing Hu, Sam Toueg:
Optimal Register Construction in M&M Systems. CoRR abs/1906.00298 (2019) - 2018
- [c36]David Yu Cheng Chan, Vassos Hadzilacos, Sam Toueg:
On the Classification of Deterministic Objects via Set Agreement Power. PODC 2018: 71-80 - 2017
- [c35]David Yu Cheng Chan, Vassos Hadzilacos, Sam Toueg:
Life Beyond Set Agreement. PODC 2017: 345-354 - [c34]David Yu Cheng Chan, Vassos Hadzilacos, Sam Toueg:
On the Number of Objects with Distinct Power and the Linearizability of Set Agreement Objects. DISC 2017: 12:1-12:14 - 2016
- [c33]David Yu Cheng Chan, Vassos Hadzilacos, Sam Toueg:
Bounded Disagreement. OPODIS 2016: 5:1-5:16 - [c32]Tushar Deepak Chandra, Vassos Hadzilacos, Sam Toueg:
An Algorithm for Replicated Objects with Efficient Reads. PODC 2016: 325-334 - [c31]Naama Ben-David, David Yu Cheng Chan, Vassos Hadzilacos, Sam Toueg:
k-Abortable Objects: Progress Under High Contention. DISC 2016: 298-312 - 2015
- [j16]Vassos Hadzilacos:
A Quarter-Century of Wait-Free Synchronization. SIGACT News 46(2): 79-88 (2015) - 2013
- [c30]Vassos Hadzilacos, Sam Toueg:
On deterministic abortable objects. PODC 2013: 4-12 - 2012
- [j15]Wojciech M. Golab, Vassos Hadzilacos, Danny Hendler, Philipp Woelfel:
RMR-efficient implementations of comparison primitives using read and write operations. Distributed Comput. 25(2): 109-162 (2012) - [j14]Rachid Guerraoui, Vassos Hadzilacos, Petr Kuznetsov, Sam Toueg:
The Weakest Failure Detectors to Solve Quittable Consensus and Nonblocking Atomic Commit. SIAM J. Comput. 41(6): 1343-1379 (2012)
2000 – 2009
- 2007
- [j13]Jonathan Eisler, Vassos Hadzilacos, Sam Toueg:
The weakest failure detector to solve nonuniform consensus. Distributed Comput. 19(4): 335-359 (2007) - [c29]Wojciech M. Golab, Vassos Hadzilacos, Danny Hendler, Philipp Woelfel:
Constant-RMR implementations of CAS and other synchronization primitives using read and write operations. PODC 2007: 3-12 - [c28]Marcos Kawazoe Aguilera, Svend Frølund, Vassos Hadzilacos, Stephanie Lorraine Horn, Sam Toueg:
Abortable and query-abortable objects and their efficient implementation. PODC 2007: 23-32 - [c27]George Giakkoupis, Vassos Hadzilacos:
On the complexity of greedy routing in ring-based peer-to-peer networks. PODC 2007: 99-108 - 2006
- [c26]Marcos Kawazoe Aguilera, Svend Frølund, Vassos Hadzilacos, Stephanie Lorraine Horn, Sam Toueg:
Brief Announcement: Abortable and Query-Abortable Objects. DISC 2006: 534-536 - 2005
- [c25]Jonathan Eisler, Vassos Hadzilacos, Sam Toueg:
The weakest failure detector to solve nonuniform consensus. PODC 2005: 189-196 - [c24]George Giakkoupis, Vassos Hadzilacos:
A scheme for load balancing in heterogenous distributed hash tables. PODC 2005: 302-311 - 2004
- [j12]Tushar Deepak Chandra, Vassos Hadzilacos, Prasad Jayanti, Sam Toueg:
Generalized Irreducibility of Consensus and the Equivalence of t-Resilient and Wait-Free Implementations of Consensus. SIAM J. Comput. 34(2): 333-357 (2004) - [c23]Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui, Vassos Hadzilacos, Petr Kouznetsov, Sam Toueg:
The weakest failure detectors to solve certain fundamental problems in distributed computing. PODC 2004: 338-346 - [c22]Robert Danek, Vassos Hadzilacos:
Local-Spin Group Mutual Exclusion Algorithms. DISC 2004: 71-85 - 2001
- [c21]Vassos Hadzilacos:
A note on group mutual exclusion. PODC 2001: 100-106 - 2000
- [j11]Wai-Kau Lo, Vassos Hadzilacos:
On the power of shared object types to implement one-resilient Consensus. Distributed Comput. 13(4): 219-238 (2000) - [j10]Wai-Kau Lo, Vassos Hadzilacos:
All of Us Are Smarter than Any of Us: Nondeterministic Wait-Free Hierarchies Are Not Robust. SIAM J. Comput. 30(3): 689-728 (2000)
1990 – 1999
- 1999
- [c20]Kal Lin, Vassos Hadzilacos:
Asynchronous Group Membership with Oracles. DISC 1999: 79-93 - 1998
- [j9]Vinay K. Chaudhri, Vassos Hadzilacos:
Safe Locking Policies for Dynamic Databases. J. Comput. Syst. Sci. 57(3): 260-271 (1998) - 1997
- [c19]Wai-Kau Lo, Vassos Hadzilacos:
On the Power of Shared Object Types to Implement One-Resilient Consensus. PODC 1997: 101-110 - [c18]Wai-Kau Lo, Vassos Hadzilacos:
All of Us are Smarter Than Any of Us: Wait-Free Hierarchies are not Robust. STOC 1997: 579-588 - 1996
- [j8]Tushar Deepak Chandra, Vassos Hadzilacos, Sam Toueg:
The Weakest Failure Detector for Solving Consensus. J. ACM 43(4): 685-722 (1996) - [c17]Tushar Deepak Chandra, Vassos Hadzilacos, Sam Toueg, Bernadette Charron-Bost:
On the Impossibility of Group Membership. PODC 1996: 322-330 - 1995
- [c16]Vinay K. Chaudhri, Vassos Hadzilacos:
Safe Locking Policies for Dynamic Databases. PODS 1995: 233-244 - 1994
- [c15]Vinay K. Chaudhri, Vassos Hadzilacos, John Mylopoulos, Kenneth C. Sevcik:
Quantitative Evaluation of a Transaction Facility for a Knowledge Base Management System. CIKM 1994: 122-131 - [c14]Tushar Deepak Chandra, Vassos Hadzilacos, Prasad Jayanti, Sam Toueg:
Wait-Freedom vs. t-Resiliency and the Robustness of Wait-Free Hierarchies. PODC 1994: 334-343 - [c13]Wai-Kau Lo, Vassos Hadzilacos:
Using Failure Detectors to Solve Consensus in Asynchronous Sharde-Memory Systems (Extended Abstract). WDAG 1994: 280-295 - 1993
- [j7]Vassos Hadzilacos, Joseph Y. Halpern:
Message-Optimal Protocols for Byzantine Agreement. Math. Syst. Theory 26(1): 41-102 (1993) - [j6]Vassos Hadzilacos, Joseph Y. Halpern:
The Failure Discovery Problem. Math. Syst. Theory 26(1): 103-129 (1993) - [c12]Vinay K. Chaudhri, Vassos Hadzilacos, John Mylopoulos:
Concurrency Control for Knowledge Bases. HPTS 1993 - [c11]Efthymios Anagnostou, Vassos Hadzilacos:
Tolerating Transient and Permanent Failures (Extended Abstract). WDAG 1993: 174-188 - 1992
- [j5]Eugene S. Amdur, Samuel M. Weber, Vassos Hadzilacos:
On the Message Complexity of Binary Byzantine Agreement under Crash Failures. Distributed Comput. 5(4): 175-186 (1992) - [c10]Vinay K. Chaudhri, Vassos Hadzilacos, John Mylopoulos:
Concurrency Control for Knowledge Bases. KR 1992: 762-773 - [c9]Tushar Deepak Chandra, Vassos Hadzilacos, Sam Toueg:
The Weakest Failure Detector for Solving Consensus. PODC 1992: 147-158 - [c8]Efthymios Anagnostou, Ran El-Yaniv, Vassos Hadzilacos:
Memory Adaptive Self-Stabilizing Protocols (Extended Abstract). WDAG 1992: 203-220 - 1991
- [j4]Thanasis Hadzilacos, Vassos Hadzilacos:
Transaction Synchronisation in Object Bases. J. Comput. Syst. Sci. 43(1): 2-24 (1991) - [j3]Edward A. Lycklama, Vassos Hadzilacos:
A First-Come-First-Served Mutual-Exclusion Algorithm with Small Communication Variables. ACM Trans. Program. Lang. Syst. 13(4): 558-576 (1991) - [c7]Vassos Hadzilacos, Joseph Y. Halpern:
Message-Optimal Protocols for Byzantine Agreement (Extended Abstract). PODC 1991: 309-323
1980 – 1989
- 1988
- [j2]Vassos Hadzilacos:
A theory of reliability in database systems. J. ACM 35(1): 121-145 (1988) - [c6]Thanasis Hadzilacos, Vassos Hadzilacos:
Transaction Synchronisation in Object Bases. PODS 1988: 193-200 - 1987
- [b1]Philip A. Bernstein, Vassos Hadzilacos, Nathan Goodman:
Concurrency Control and Recovery in Database Systems. Addison-Wesley 1987, ISBN 0-201-10715-5 - [j1]Vassos Hadzilacos:
Connectivity Requirements for Byzantine Agreement under Restricted Types of Failures. Distributed Comput. 2(2): 95-103 (1987) - [c5]Vassos Hadzilacos:
A Knowledge Theoretic Analysis of Atomic Commitment Protocols. PODS 1987: 129-134 - 1986
- [c4]Vassos Hadzilacos:
On the Relationship Between the Atomic Commitment and Consensus Problems. Fault-Tolerant Distributed Computing 1986: 201-208 - 1983
- [c3]Philip A. Bernstein, Nathan Goodman, Vassos Hadzilacos:
Recovery Algorithms for Database Systems. IFIP Congress 1983: 799-807 - [c2]Vassos Hadzilacos:
An Operational Model for Database System Reliability. PODS 1983: 244-257 - 1982
- [c1]Vassos Hadzilacos:
An Algorithm for Minimizing Roll Back Cost. PODS 1982: 93-97
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 2024-11-30 01:13 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:
