113 results on '"Vassos Hadzilacos"'
Search Results
2. On atomic registers and randomized consensus in M&M systems.
3. On Register Linearizability and Termination.
4. Parameterized algorithm for replicated objects with local reads.
5. On Deterministic Linearizable Set Agreement Objects.
6. Optimal Register Construction in M&M Systems.
7. Life beyond set agreement.
8. Bounded disagreement.
9. On the Classification of Deterministic Objects via Set Agreement Power.
10. Differentiated nonblocking: a new progress condition and a matching queue algorithm.
11. An Impossibility Result on Strong Linearizability in Message-Passing Systems.
12. Randomized consensus with regular registers.
13. On the Number of Objects with Distinct Power and the Linearizability of Set Agreement Objects.
14. Life Beyond Set Agreement.
15. Randomized Consensus with Regular Registers.
16. On Linearizability and the Termination of Randomized Algorithms.
17. k-Abortable Objects: Progress Under High Contention.
18. An Algorithm for Replicated Objects with Efficient Reads.
19. Bounded Disagreement.
20. On deterministic abortable objects.
21. A Quarter-Century of Wait-Free Synchronization.
22. Abortable and query-abortable objects and their efficient implementation.
23. On the complexity of greedy routing in ring-based peer-to-peer networks.
24. Constant-RMR implementations of CAS and other synchronization primitives using read and write operations.
25. A scheme for load balancing in heterogenous distributed hash tables.
26. The weakest failure detector to solve nonuniform consensus.
27. Local-Spin Group Mutual Exclusion Algorithms.
28. The weakest failure detectors to solve certain fundamental problems in distributed computing.
29. A note on group mutual exclusion.
30. RMR-efficient implementations of comparison primitives using read and write operations.
31. The Weakest Failure Detectors to Solve Quittable Consensus and Nonblocking Atomic Commit.
32. Asynchronous Group Membership with Oracles.
33. Brief Announcement: Abortable and Query-Abortable Objects.
34. All of Us are Smarter Than Any of Us: Wait-Free Hierarchies are not Robust.
35. On the Power of Shared Object Types to Implement One-Resilient Consensus.
36. The weakest failure detector to solve nonuniform consensus.
37. On the Impossibility of Group Membership.
38. Safe Locking Policies for Dynamic Databases.
39. Using Failure Detectors to Solve Consensus in Asynchronous Sharde-Memory Systems (Extended Abstract).
40. Wait-Freedom vs. t-Resiliency and the Robustness of Wait-Free Hierarchies.
41. Quantitative Evaluation of a Transaction Facility for a Knowledge Base Management System.
42. Generalized Irreducibility of Consensus and the Equivalence of t-Resilient and Wait-Free Implementations of Consensus.
43. Tolerating Transient and Permanent Failures (Extended Abstract).
44. Memory Adaptive Self-Stabilizing Protocols (Extended Abstract).
45. The Weakest Failure Detector for Solving Consensus.
46. Concurrency Control for Knowledge Bases.
47. Message-Optimal Protocols for Byzantine Agreement (Extended Abstract).
48. On the power of shared object types to implement one-resilient Consensus.
49. All of Us Are Smarter than Any of Us: Nondeterministic Wait-Free Hierarchies Are Not Robust.
50. Safe Locking Policies for Dynamic Databases.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.