The following pages link to Sergio Rajsbaum (Q360276):
Displayed 50 items.
- An Equivariance Theorem with Applications to Renaming (Q2894460) (← links)
- Renaming Is Weaker Than Set Agreement But for Perfect Renaming: A Map of Sub-consensus Tasks (Q2894461) (← links)
- Simulations and reductions for colorless tasks (Q2933802) (← links)
- New combinatorial topology upper and lower bounds for renaming (Q2934354) (← links)
- Locality and Checkability in Wait-Free Computing (Q3095336) (← links)
- The Combinatorial Structure of Wait-Free Solvable Tasks (Q3149868) (← links)
- (Q3305190) (← links)
- (Q3384879) (← links)
- The Combined Power of Conditions and Information on Failures to Solve Asynchronous Set Agreement (Q3395045) (← links)
- Conditions on input vectors for consensus solvability in asynchronous distributed systems (Q3452512) (← links)
- The Iterated Restricted Immediate Snapshot Model (Q3511360) (← links)
- Average Binary Long-Lived Consensus: Quantifying the Stabilizing Role Played by Memory (Q3511388) (← links)
- Stability of Multivalued Continuous Consensus (Q3519388) (← links)
- Subconsensus Tasks: Renaming Is Weaker Than Set Agreement (Q3524315) (← links)
- The Committee Decision Problem (Q3525785) (← links)
- Bit complexity of breaking and achieving symmetry in chains and rings (Q3546359) (← links)
- Concurrent Computing and Shellable Complexes (Q3588299) (← links)
- (Q4206383) (← links)
- A conjecture on cycle-pancyclism in tournaments (Q4254308) (← links)
- (Q4413395) (← links)
- (Q4413399) (← links)
- (Q4436047) (← links)
- (Q4437114) (← links)
- (Q4437115) (← links)
- Algebraic spans (Q4507893) (← links)
- (Q4527026) (← links)
- Asynchronous Agreement and Its Relation with Error-Correcting Codes (Q4564181) (← links)
- (Q4608668) (← links)
- Unifying Concurrent Objects and Distributed Tasks (Q4625665) (← links)
- Unison, canon, and sluggish clocks in networks controlled by a synchronizer (Q4850331) (← links)
- Optimal Clock Synchronization under Different Delay Assumptions (Q4877524) (← links)
- (Q4941899) (← links)
- (Q4967153) (← links)
- An Eventually Perfect Failure Detector for Networks of Arbitrary Topology Connected with ADD Channels Using Time-To-Live Values (Q5087072) (← links)
- Communication Complexity of Wait-Free Computability in Dynamic Networks (Q5100966) (← links)
- The BG distributed simulation algorithm (Q5138357) (← links)
- Condition-based consensus solvability: a hierarchy of conditions and efficient protocols (Q5138500) (← links)
- Conditions on input vectors for consensus solvability in asynchronous distributed systems (Q5175963) (← links)
- The topology of shared-memory adversaries (Q5176193) (← links)
- Stability of long-lived consensus (extended abstract) (Q5176792) (← links)
- The combined power of conditions and failure detectors to solve asynchronous set agreement (Q5177240) (← links)
- Irreducibility and additivity of set agreement-oriented failure detector classes (Q5177276) (← links)
- An Inductive-style Procedure for Counting Monochromatic Simplexes of Symmetric Subdivisions with Applications to Distributed Computing (Q5179018) (← links)
- An Introduction to the Topological Theory of Distributed Computing with Safe-consensus (Q5179019) (← links)
- Untangling Partial Agreement: Iterated x-consensus Simulations (Q5207909) (← links)
- Optimal clock synchronization under different delay assumptions (Q5361371) (← links)
- Set consensus using arbitrary objects (preliminary version) (Q5361424) (← links)
- Algebraic spans (Q5361442) (← links)
- Brief Announcement (Q5361948) (← links)
- Distributed Computing (Q5395137) (← links)