The following pages link to Sergio Rajsbaum (Q360276):
Displaying 50 items.
- The topology of distributed adversaries (Q360277) (← links)
- Power and limits of distributed computing shared memory models (Q392187) (← links)
- The renaming problem in shared memory systems: an introduction (Q465682) (← links)
- Linear space bootstrap communication schemes (Q477099) (← links)
- An equivariance theorem with applications to renaming (Q486986) (← links)
- The impossibility of boosting distributed service resilience (Q550250) (← links)
- Cycle-pancyclism in multipartite tournaments. I (Q624155) (← links)
- Cycle-pancyclism in tournaments. III (Q675888) (← links)
- Some problems in distributed computational geometry (Q719317) (← links)
- A dynamic epistemic logic analysis of the equality negation task (Q777882) (← links)
- From \(\diamond \mathcal W\) to \(\omega\) : A simple bounded quiescent reliable broadcast-based transformation (Q868046) (← links)
- Average long-lived binary consensus: quantifying the stabilizing role played by memory (Q962162) (← links)
- An impossibility about failure detectors in the iterated immediate snapshot model (Q975436) (← links)
- New combinatorial topology bounds for renaming: the lower bound (Q992504) (← links)
- On mixed connectivity certificates (Q1274334) (← links)
- Upper and lower bounds for stochastic marked graphs (Q1321817) (← links)
- Tentative and definite distributed computations: An optimistic approach to network synchronization (Q1330420) (← links)
- (Q1364127) (redirect page) (← links)
- The use of a synchronizer yields the maximum computation rate in distributed networks (Q1364128) (← links)
- Stability of long-lived consensus. (Q1401978) (← links)
- Specifying concurrent problems: beyond linearizability and up to tasks (extended abstract) (Q1664155) (← links)
- A characterization of \(t\)-resilient colorless task anonymous solvability (Q1713909) (← links)
- Exact communication costs for consensus and leader in a tree (Q1827285) (← links)
- A simple proof of the uniform consensus synchronous lower bound. (Q1853174) (← links)
- A classification of wait-free loop agreement tasks (Q1870526) (← links)
- Cycle-pancyclism in tournaments. I (Q1900518) (← links)
- Cycle-pancyclism in tournaments. II (Q1911236) (← links)
- The topology of look-compute-move robot wait-free algorithms with hard termination (Q2002056) (← links)
- A simplicial complex model for dynamic epistemic logic to study distributed task computability (Q2029604) (← links)
- A dynamic epistemic logic analysis of equality negation and other epistemic covering tasks (Q2043796) (← links)
- A lower bound on the number of opinions needed for fault-tolerant decentralized run-time monitoring (Q2304020) (← links)
- Synchronous condition-based consensus (Q2375299) (← links)
- The \(k\)-simultaneous consensus problem (Q2377137) (← links)
- On the computability power and the robustness of set agreement-oriented failure detector classes (Q2377255) (← links)
- From wait-free to arbitrary concurrent solo executions in colorless distributed computing (Q2397607) (← links)
- Locality and checkability in wait-free computing (Q2441537) (← links)
- Distributed computability: relating \(k\)-immediate snapshot and \(x\)-set agreement (Q2672233) (← links)
- (Q2703723) (← links)
- A Layered Analysis of Consensus (Q2784490) (← links)
- A hierarchy of conditions for consensus solvability (Q2787677) (← links)
- The unified structure of consensus (Q2790107) (← links)
- Unifying synchronous and asynchronous message-passing models (Q2790108) (← links)
- Generalized Symmetry Breaking Tasks and Nondeterminism in Concurrent Objects (Q2802146) (← links)
- Minimizing the Number of Opinions for Fault-Tolerant Distributed Decision Using Well-Quasi Orderings (Q2802963) (← links)
- Stability of Multi-Valued Continuous Consensus11Preliminary Version, Some proofs are omitted from this version. (Q2810955) (← links)
- An Axiomatic Approach to Computing the Connectivity of Synchronous and Asynchronous Systems (Q2810958) (← links)
- A theory of clock synchronization (extended abstract) (Q2817677) (← links)
- Bit complexity of breaking and achieving symmetry in chains and rings (extended abstract) (Q2819553) (← links)
- Asynchronous Coordination Under Preferences and Constraints (Q2835020) (← links)
- t-Resilient Immediate Snapshot Is Impossible (Q2835025) (← links)
