Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Hadzilacos, Vassos - Department of Computer Science, University of Toronto
THE FAILURE DISCOVERY PROBLEM Vassos Hadzilacos
ON THE MESSAGE COMPLEXITY OF BINARY BYZANTINE AGREEMENT
A FIRST COME FIRST SERVED MUTUAL EXCLUSION ALGORITHM
ON THE RELATIONSHIP BETWEEN THE ATOMIC COMMITMENT AND CONSENSUS PROBLEMS
Using Failure Detectors to Solve Consensus in Asynchronous SharedMemory Systems
The Weakest Failure Detector for Solving Consensus \Lambda Tushar Deepak Chandra y Vassos Hadzilacos z Sam Toueg x
On the power of shared object types to implement oneresilient Consensus \Lambda
Local-Spin Group Mutual Exclusion Algorithms ? (Extended Abstract)
GENERALIZED IRREDUCIBILITY OF CONSENSUS AND THE EQUIVALENCE OF t-RESILIENT AND WAIT-FREE
The Weakest Failure Detectors to Solve Certain Fundamental Problems
On the robustness of the h r hierarchy \Lambda
Waitfreedom vs. tresiliency and the robustness of waitfree hierarchies
A note on group mutual exclusion [Extended Abstract]
MESSAGEOPTIMAL PROTOCOLS FOR BYZANTINE AGREEMENT
On the Impossibility of Group Membership \Lambda Tushar Deepak Chandra y Vassos Hadzilacos z Sam Toueg x
Safe Locking Policies for Dynamic Databases \Lambda Vinay K. Chaudhri
Asynchronous Group Membership with Oracles Kal Lin and Vassos Hadzilacos
A Modular Approach to FaultTolerant Broadcasts
TRANSACTION SYNCHRONISATION IN OBJECT BASESy Thanasis Hadzilacos
ALL OF US ARE SMARTER THAN ANY OF US: NONDETERMINISTIC WAITFREE HIERARCHIES ARE NOT
