83 results on '"Fauconnier, Hugues"'
Search Results
2. The Computational Power of Distributed Shared-Memory Models with Bounded-Size Registers
3. Optimal Algorithms for Synchronous Byzantine k-Set Agreement
4. Byzantine k-Set Agreement
5. Optimal algorithms for synchronous Byzantine k-set agreement
6. Communication Complexity of Wait-Free Computability in Dynamic Networks
7. k-Immediate Snapshot and x-Set Agreement: How Are They Related?
8. On the Weakest Failure Detector for Read/Write-Based Mutual Exclusion
9. An Anonymous Wait-Free Weak-Set Object Implementation
10. Brief Announcement: Distributed Computing in the Asynchronous LOCAL Model
11. Towards Synthesis of Distributed Algorithms with SMT Solvers
12. Participant-Restricted Consensus in Asynchronous Crash-Prone Read/Write Systems and Its Weakest Failure Detector
13. A Characterization of t-Resilient Colorless Task Anonymous Solvability
14. When is Recoverable Consensus Harder Than Consensus?
15. Distributed computability: Relating k-immediate snapshot and x-set agreement
16. Making Local Algorithms Wait-Free: The Case of Ring Coloring
17. Implementing Snapshot Objects on Top of Crash-Prone Asynchronous Message-Passing Systems
18. Asynchronous Consensus with Bounded Memory
19. t-Resilient Immediate Snapshot Is Impossible
20. A TLA+ Formal Proof of a Cross-Chain Swap
21. A Separation of n-consensus and (n + 1)-consensus Based on Process Scheduling
22. The assignment problem
23. On the weakest information on failures to solve mutual exclusion and consensus in asynchronous crash-prone read/write systems
24. Leader Election in Rings with Homonyms
25. Uniform Consensus with Homonyms and Omission Failures
26. Linear Space Bootstrap Communication Schemes
27. Adaptive Register Allocation with a Linear Number of Registers
28. Black Art: Obstruction-Free k-set Agreement with |MWMR registers| < |proccesses|
29. Byzantine Agreement with Homonyms in Synchronous Systems
30. Homonyms with Forgeable Identifiers
31. Brief Announcement: On the Meaning of Solving a Task with a Failure Detector
32. Approximation of δ-Timeliness
33. Algorithms for Extracting Timeliness Graphs
34. Brief Announcement: The Minimum Failure Detector for Non-Local Tasks in Message-Passing Systems
35. The Minimum Information about Failures for Solving Non-local Tasks in Message-Passing Systems
36. The Disagreement Power of an Adversary
37. Two Consensus Algorithms with Atomic Registers and Failure Detector Ω
38. With Finite Memory Consensus Is Easier Than Reliable Broadcast
39. When Birds Die: Making Population Protocols Fault-Tolerant
40. (Almost) All Objects Are Universal in Message Passing Systems
41. Revisiting Failure Detection and Consensus in Omission Failure Environments
42. Failure Detection Lower Bounds on Registers and Consensus
43. Stable Leader Election
44. Thrifty Generic Broadcast
45. Editorial, special issue of NETYS 2015
46. Implementing Snapshot Objects on Top of Crash-Prone Asynchronous Message-Passing Systems
47. The Assignment Problem
48. Making Local Algorithms Wait-Free: the Case of Ring Coloring
49. On the Space Complexity of Set Agreement?
50. Linear space bootstrap communication schemes
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.