The following pages link to Vassos Hadzilacos (Q1176281):
Displaying 38 items.
- Transaction synchronisation in object bases (Q1176282) (← links)
- On the message complexity of binary Byzantine agreement under crash failures (Q1189856) (← links)
- Safe locking policies for dynamic databases (Q1278036) (← links)
- RMR-efficient implementations of comparison primitives using read and write operations (Q1938362) (← links)
- The weakest failure detector to solve nonuniform consensus (Q1954210) (← links)
- Randomized consensus with regular registers (Q2059870) (← links)
- On atomic registers and randomized consensus in m\&m systems (Q2121060) (← links)
- Bounded disagreement (Q2182645) (← links)
- Life beyond set agreement (Q2189171) (← links)
- On the impossibility of group membership (Q2942744) (← links)
- (Q3174926) (← links)
- Message-optimal protocols for Byzantine Agreement (Q4031321) (← links)
- The Failure Discovery problem (Q4031322) (← links)
- The weakest failure detector for solving consensus (Q4371681) (← links)
- All of Us Are Smarter than Any of Us: Nondeterministic Wait-Free Hierarchies Are Not Robust (Q4507370) (← links)
- (Q4527025) (← links)
- Generalized Irreducibility of Consensus and the Equivalence of <i>t</i>-Resilient and Wait-Free Implementations of Consensus (Q4651538) (← links)
- A theory of reliability in database systems (Q4711346) (← links)
- The Weakest Failure Detectors to Solve Quittable Consensus and Nonblocking Atomic Commit (Q4910568) (← links)
- On the power of shared object types to implement one-resilient Consensus (Q5137906) (← links)
- On deterministic abortable objects (Q5176077) (← links)
- The weakest failure detector to solve nonuniform consensus (Q5177241) (← links)
- A scheme for load balancing in heterogenous distributed hash tables (Q5177253) (← links)
- On the Classification of Deterministic Objects via Set Agreement Power (Q5197669) (← links)
- Message-optimal protocols for byzantine agreement (extended abstract) (Q5255829) (← links)
- The weakest failure detector for solving consensus (Q5348846) (← links)
- Wait-freedom vs. <i>t</i>-resiliency and the robustness of wait-free hierarchies (extended abstract) (Q5361425) (← links)
- An Algorithm for Replicated Objects with Efficient Reads (Q5361951) (← links)
- Life Beyond Set Agreement (Q5368982) (← links)
- Constant-RMR implementations of CAS and other synchronization primitives using read and write operations (Q5401387) (← links)
- Abortable and query-abortable objects and their efficient implementation (Q5401389) (← links)
- On the complexity of greedy routing in ring-based peer-to-peer networks (Q5401398) (← links)
- Local-Spin Group Mutual Exclusion Algorithms (Q5464212) (← links)
- The weakest failure detectors to solve certain fundamental problems in distributed computing (Q5501514) (← links)
- Byzantine-Tolerant Set-Constrained Delivery Broadcast (Q5874247) (← links)
- (Q5874262) (← links)
- On Register Linearizability and Termination (Q6201980) (← links)
- On the number of objects with distinct power and the linearizability of set agreement objects (Q6487483) (← links)
