Sergio Rajsbaum

From MaRDI portal
Revision as of 14:33, 24 September 2023 by Import230924090903 (talk | contribs) (Created automatically from import230924090903)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:360276

Available identifiers

zbMath Open rajsbaum.sergioMaRDI QIDQ360276

List of research outcomes

PublicationDate of PublicationType
A Speedup Theorem for Asynchronous Computation with Applications to Consensus and Approximate Agreement2024-03-26Paper
A Distributed Combinatorial Topology Approach to Arrow's Impossibility Theorem2024-03-26Paper
The solvability of consensus in iterated models extended with safe-consensus2023-10-30Paper
Set-linearizable implementations from read/write operations: sets, fetch \& increment, stacks and queues with multiplicity2023-06-19Paper
Synchronous \(t\)-resilient consensus in arbitrary graphs2023-05-19Paper
On mixed connectivity certificates2023-05-08Paper
Decentralized Asynchronous Crash-resilient Runtime Verification2023-04-27Paper
Information Exchange in the Russian Cards Problem2023-04-21Paper
A distributed computing perspective of unconditionally secure information transmission in Russian cards problems2023-03-24Paper
k-Immediate Snapshot and x-Set Agreement: How Are They Related?2023-03-21Paper
Brief Announcement: Leader Election in the ADD Communication Model2023-03-21Paper
Wait-free solvability of equality negation tasks2023-02-03Paper
Communication Complexity of Wait-Free Computability in Dynamic Networks2022-09-01Paper
An Eventually Perfect Failure Detector for Networks of Arbitrary Topology Connected with ADD Channels Using Time-To-Live Values2022-07-08Paper
Distributed computability: relating \(k\)-immediate snapshot and \(x\)-set agreement2022-06-08Paper
A distributed computing perspective of unconditionally secure information transmission in Russian cards problems2022-03-22Paper
https://portal.mardi4nfdi.de/entity/Q33848792021-12-17Paper
A Simplicial Model for $KB4_n$: Epistemic Logic with Agents that May Die2021-08-23Paper
A dynamic epistemic logic analysis of equality negation and other epistemic covering tasks2021-08-03Paper
A simplicial complex model for dynamic epistemic logic to study distributed task computability2021-06-03Paper
A topological perspective on distributed network algorithms2020-12-15Paper
Perfect failure detection with very few bits2020-12-15Paper
Condition-based consensus solvability: a hierarchy of conditions and efficient protocols2020-12-04Paper
The BG distributed simulation algorithm2020-12-03Paper
https://portal.mardi4nfdi.de/entity/Q33051902020-08-06Paper
A dynamic epistemic logic analysis of the equality negation task2020-07-08Paper
A lower bound on the number of opinions needed for fault-tolerant decentralized run-time monitoring2020-03-06Paper
A topological perspective on distributed network algorithms2020-03-03Paper
Untangling Partial Agreement: Iterated x-consensus Simulations2020-01-14Paper
Making local algorithms wait-free: the case of ring coloring2019-11-22Paper
Perfect failure detection with very few bits2019-11-22Paper
The topology of look-compute-move robot wait-free algorithms with hard termination2019-07-11Paper
https://portal.mardi4nfdi.de/entity/Q49671532019-07-03Paper
Making local algorithms wait-free: the case of ring coloring2019-06-21Paper
Unifying Concurrent Objects and Distributed Tasks2019-02-25Paper
A characterization of \(t\)-resilient colorless task anonymous solvability2019-01-30Paper
Specifying concurrent problems: beyond linearizability and up to tasks (extended abstract)2018-08-24Paper
Asynchronous Agreement and Its Relation with Error-Correcting Codes2018-06-12Paper
https://portal.mardi4nfdi.de/entity/Q46086682018-03-21Paper
Optimal clock synchronization under different delay assumptions2017-09-29Paper
Set consensus using arbitrary objects (preliminary version)2017-09-29Paper
Algebraic spans2017-09-29Paper
Brief Announcement2017-09-29Paper
From wait-free to arbitrary concurrent solo executions in colorless distributed computing2017-05-22Paper
Asynchronous Coordination Under Preferences and Constraints2016-12-01Paper
t-Resilient Immediate Snapshot Is Impossible2016-12-01Paper
Bit complexity of breaking and achieving symmetry in chains and rings (extended abstract)2016-09-29Paper
A theory of clock synchronization (extended abstract)2016-09-01Paper
Stability of Multi-Valued Continuous Consensus11Preliminary Version, Some proofs are omitted from this version.2016-06-06Paper
An Axiomatic Approach to Computing the Connectivity of Synchronous and Asynchronous Systems2016-06-06Paper
Minimizing the Number of Opinions for Fault-Tolerant Distributed Decision Using Well-Quasi Orderings2016-05-03Paper
Generalized Symmetry Breaking Tasks and Nondeterminism in Concurrent Objects2016-04-25Paper
A hierarchy of conditions for consensus solvability2016-03-04Paper
The unified structure of consensus2016-03-02Paper
Unifying synchronous and asynchronous message-passing models2016-03-02Paper
Conditions on input vectors for consensus solvability in asynchronous distributed systems2015-11-12Paper
An Inductive-style Procedure for Counting Monochromatic Simplexes of Symmetric Subdivisions with Applications to Distributed Computing2015-03-18Paper
An Introduction to the Topological Theory of Distributed Computing with Safe-consensus2015-03-18Paper
The combined power of conditions and failure detectors to solve asynchronous set agreement2015-03-10Paper
Irreducibility and additivity of set agreement-oriented failure detector classes2015-03-10Paper
Stability of long-lived consensus (extended abstract)2015-03-03Paper
The topology of shared-memory adversaries2015-03-02Paper
Conditions on input vectors for consensus solvability in asynchronous distributed systems2015-02-27Paper
https://portal.mardi4nfdi.de/entity/Q54987552015-02-11Paper
An equivariance theorem with applications to renaming2015-01-19Paper
New combinatorial topology upper and lower bounds for renaming2014-12-12Paper
Brief announcement2014-12-05Paper
Simulations and reductions for colorless tasks2014-12-05Paper
Linear space bootstrap communication schemes2014-12-02Paper
The renaming problem in shared memory systems: an introduction2014-10-24Paper
Reliable Shared Memory Abstraction on Top of Asynchronous Byzantine Message-Passing Systems2014-08-07Paper
The Complexity Gap between Consensus and Safe-Consensus2014-08-07Paper
Computing in the Presence of Concurrent Solo Executions2014-03-31Paper
Locality and checkability in wait-free computing2014-03-25Paper
Failure detectors are schedulers2014-03-13Paper
New combinatorial topology bounds for renaming2014-02-17Paper
Power and limits of distributed computing shared memory models2014-01-13Paper
The topology of distributed adversaries2013-08-26Paper
The \(k\)-simultaneous consensus problem2013-06-28Paper
On the computability power and the robustness of set agreement-oriented failure detector classes2013-06-28Paper
Synchronous condition-based consensus2013-06-13Paper
An Equivariance Theorem with Applications to Renaming2012-06-29Paper
Renaming Is Weaker Than Set Agreement But for Perfect Renaming: A Map of Sub-consensus Tasks2012-06-29Paper
Locality and Checkability in Wait-Free Computing2011-10-28Paper
Some problems in distributed computational geometry2011-10-10Paper
The impossibility of boosting distributed service resilience2011-07-08Paper
Cycle-pancyclism in multipartite tournaments. I2011-02-08Paper
Concurrent Computing and Shellable Complexes2010-09-10Paper
New combinatorial topology bounds for renaming: the lower bound2010-09-09Paper
An impossibility about failure detectors in the iterated immediate snapshot model2010-06-09Paper
Average long-lived binary consensus: quantifying the stabilizing role played by memory2010-04-06Paper
Distributed Computing2010-02-23Paper
The Combined Power of Conditions and Information on Failures to Solve Asynchronous Set Agreement2009-08-20Paper
Bit complexity of breaking and achieving symmetry in chains and rings2008-12-21Paper
The Committee Decision Problem2008-09-18Paper
Subconsensus Tasks: Renaming Is Weaker Than Set Agreement2008-09-09Paper
Stability of Multivalued Continuous Consensus2008-08-14Paper
The Iterated Restricted Immediate Snapshot Model2008-07-10Paper
Average Binary Long-Lived Consensus: Quantifying the Stabilizing Role Played by Memory2008-07-10Paper
From \(\diamond \mathcal W\) to \(\omega\) : A simple bounded quiescent reliable broadcast-based transformation2007-02-19Paper
Distributed Computing2006-11-01Paper
Structural Information and Communication Complexity2005-11-30Paper
The Synchronous Condition-Based Consensus Hierarchy2005-08-17Paper
Exact communication costs for consensus and leader in a tree2004-08-06Paper
https://portal.mardi4nfdi.de/entity/Q44371142003-12-07Paper
https://portal.mardi4nfdi.de/entity/Q44371152003-12-07Paper
https://portal.mardi4nfdi.de/entity/Q44360472003-11-23Paper
Stability of long-lived consensus.2003-08-19Paper
https://portal.mardi4nfdi.de/entity/Q44133952003-07-17Paper
https://portal.mardi4nfdi.de/entity/Q44133992003-07-17Paper
A classification of wait-free loop agreement tasks2003-05-14Paper
A simple proof of the uniform consensus synchronous lower bound.2003-01-21Paper
The Combinatorial Structure of Wait-Free Solvable Tasks2002-09-29Paper
A Layered Analysis of Consensus2002-04-23Paper
https://portal.mardi4nfdi.de/entity/Q27037232001-05-07Paper
https://portal.mardi4nfdi.de/entity/Q45270262001-02-28Paper
Algebraic spans2000-10-10Paper
https://portal.mardi4nfdi.de/entity/Q49418992000-07-10Paper
Tentative and definite distributed computations: An optimistic approach to network synchronization2000-06-21Paper
A conjecture on cycle-pancyclism in tournaments2000-01-09Paper
On mixed connectivity certificates1999-01-12Paper
The use of a synchronizer yields the maximum computation rate in distributed networks1997-09-28Paper
Cycle-pancyclism in tournaments. III1997-08-18Paper
Cycle-pancyclism in tournaments. I1997-05-06Paper
Optimal Clock Synchronization under Different Delay Assumptions1996-08-18Paper
Cycle-pancyclism in tournaments. II1996-06-06Paper
Upper and lower bounds for stochastic marked graphs1996-04-16Paper
Unison, canon, and sluggish clocks in networks controlled by a synchronizer1995-10-09Paper
https://portal.mardi4nfdi.de/entity/Q42063831990-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Sergio Rajsbaum