Search

Your search keyword '"Rajsbaum, Sergio"' showing total 815 results

Search Constraints

Start Over You searched for: Author "Rajsbaum, Sergio" Remove constraint Author: "Rajsbaum, Sergio"
815 results on '"Rajsbaum, Sergio"'

Search Results

1. A Generalization of Arrow's Impossibility Theorem Through Combinatorial Topology

2. Invited Paper: The Smart Contract Model

3. Simplicial Models for the Epistemic Logic of Faulty Agents

5. The Computational Power of Distributed Shared-Memory Models with Bounded-Size Registers

6. One Step Forward, One Step Back: FLP-Style Proofs and the Round-Reduction Technique for Colorless Tasks

7. Semi-simplicial Set Models for Distributed Knowledge

8. Non-negotiating Distributed Computing

10. A Speedup Theorem for Asynchronous Computation with Applications to Consensus and Approximate Agreement

12. Continuous Tasks and the Chromatic Simplicial Approximation Theorem

13. A Simplicial Model for $KB4_n$: Epistemic Logic with Agents that May Die

14. Leader Election in Arbitrarily Connected Networks with Process Crashes and Weak Channel Reliability

16. Locally Solvable Tasks and the Limitations of Valency Arguments

17. $t$-Resilient $k$-Immediate Snapshot and its Relation with Agreement Problems

18. A Distributed Computing Perspective of Unconditionally Secure Information Transmission in Russian Cards Problems

19. Relaxed Queues and Stacks from Read/Write Operations

20. Knowledge and simplicial complexes

21. A dynamic epistemic logic analysis of the equality negation task

22. A Topological Perspective on Distributed Network Algorithms

24. A Snapshot-Based Introduction to the Linearizability Hierarchy

25. Knowledge and Simplicial Complexes

27. Mastering Concurrent Computing Through Sequential Thinking: A Half-century Evolution

28. A Simplicial Complex Model for Dynamic Epistemic Logic to study Distributed Task Computability

30. A characterization of colorless anonymous $t$-resilient task computability

31. Models of fault-tolerant distributed computation via dynamic epistemic logic

32. A simplicial complex model of dynamic epistemic logic for fault-tolerant distributed computing

33. Information Exchange in the Russian Cards Problem

34. A Distributed Computing Perspective of Unconditionally Secure Information Transmission in Russian Cards Problems

36. k-Immediate Snapshot and x-Set Agreement: How Are They Related?

37. Brief Announcement: Leader Election in the ADD Communication Model

38. Communication Complexity of Wait-Free Computability in Dynamic Networks

39. A Dynamic Epistemic Logic Analysis of the Equality Negation Task

44. The read/write protocol complex is collapsible

45. Specifying Concurrent Problems: Beyond Linearizability

46. The solvability of consensus in iterated models extended with safe-consensus

47. Synchronous t-Resilient Consensus in Arbitrary Graphs

48. A Topological View of Partitioning Arguments: Reducing k-Set Agreement to Consensus

49. An Anonymous Wait-Free Weak-Set Object Implementation

Catalog

Books, media, physical & digital resources