Sergio Rajsbaum

According to our database1, Sergio Rajsbaum authored at least 203 papers between 1990 and 2020.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2020
60 Years of Mastering Concurrent Computing through Sequential Thinking.
SIGACT News, 2020

An Eventually Perfect Failure Detector for Networks of Arbitrary Topology Connected with ADD Channels Using Time-To-Live Values.
Parallel Process. Lett., 2020

Geometric and Topological Methods in Computer Science (special 10th anniversary GETCO conference, 2018).
J. Appl. Comput. Topol., 2020

A lower bound on the number of opinions needed for fault-tolerant decentralized run-time monitoring.
J. Appl. Comput. Topol., 2020

What Can Be Done with Consensus Number One: Relaxed Queues and Stacks.
CoRR, 2020

Knowledge and simplicial complexes.
CoRR, 2020

Mastering concurrent computing through sequential thinking.
Commun. ACM, 2020

Indistinguishability.
Commun. ACM, 2020

Communication Complexity of Wait-Free Computability in Dynamic Networks.
Proceedings of the Structural Information and Communication Complexity, 2020

2019
Making Local Algorithms Wait-Free: the Case of Ring Coloring.
Theory Comput. Syst., 2019

The topology of look-compute-move robot wait-free algorithms with hard termination.
Distributed Comput., 2019

Wait-Free Solvability of Equality Negation Tasks.
Proceedings of the 33rd International Symposium on Distributed Computing, 2019

A Dynamic Epistemic Logic Analysis of the Equality Negation Task.
Proceedings of the Dynamic Logic. New Trends and Applications, 2019

A Topological View of Partitioning Arguments: Reducing k-Set Agreement to Consensus.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2019

Synchronous t-Resilient Consensus in Arbitrary Graphs.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2019

A Topological Perspective on Distributed Network Algorithms.
Proceedings of the Structural Information and Communication Complexity, 2019

An Eventually Perfect Failure Detector for Networks of Arbitrary Topology Connected with ADD Channels Using Time-To-Live Values.
Proceedings of the 49th Annual IEEE/IFIP International Conference on Dependable Systems and Networks, 2019

2018
Implementing Snapshot Objects on Top of Crash-Prone Asynchronous Message-Passing Systems.
IEEE Trans. Parallel Distrib. Syst., 2018

Convergence and covering on graphs for wait-free robots.
J. Braz. Comput. Soc., 2018

Collapsibility of read/write models using discrete morse theory.
J. Appl. Comput. Topol., 2018

Unifying Concurrent Objects and Distributed Tasks: Interval-Linearizability.
J. ACM, 2018

Formal Methods and Fault-Tolerant Distributed Comp.: Forging an Alliance (Dagstuhl Seminar 18211).
Dagstuhl Reports, 2018

Mastering Concurrent Computing Through Sequential Thinking: A Half-century Evolution.
CoRR, 2018

A Simplicial Complex Model for Dynamic Epistemic Logic to study Distributed Task Computability.
Proceedings of the Proceedings Ninth International Symposium on Games, 2018

A Characterization of t-Resilient Colorless Task Anonymous Solvability.
Proceedings of the Structural Information and Communication Complexity, 2018

2018 Edsger W. Dijkstra Prize in Distributed Computing.
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, 2018

An Anonymous Wait-Free Weak-Set Object Implementation.
Proceedings of the Networked Systems - 6th International Conference, 2018

2017
Preface.
Theor. Comput. Sci., 2017

From wait-free to arbitrary concurrent solo executions in colorless distributed computing.
Theor. Comput. Sci., 2017

A characterization of colorless anonymous t-resilient task computability.
CoRR, 2017

Models of fault-tolerant distributed computation via dynamic epistemic logic.
CoRR, 2017

A simplicial complex model of dynamic epistemic logic for fault-tolerant distributed computing.
CoRR, 2017

Long-Lived Tasks.
Proceedings of the Networked Systems - 5th International Conference, 2017

Fault-Tolerant Robot Gathering Problems on Graphs With Arbitrary Appearing Times.
Proceedings of the 2017 IEEE International Parallel and Distributed Processing Symposium, 2017

2016
Distributed Algorithms for Minimum Spanning Trees.
Encyclopedia of Algorithms, 2016

Generalized Symmetry Breaking Tasks and Nondeterminism in Concurrent Objects.
SIAM J. Comput., 2016

Read/write shared memory abstraction on top of asynchronous Byzantine message-passing systems.
J. Parallel Distributed Comput., 2016

Neighbor Discovery in a Sensor Network with Directional Antennae.
Ad Hoc Sens. Wirel. Networks, 2016

Perfect Failure Detection with Very Few Bits.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2016

t-Resilient Immediate Snapshot Is Impossible.
Proceedings of the Structural Information and Communication Complexity, 2016

Asynchronous Coordination Under Preferences and Constraints.
Proceedings of the Structural Information and Communication Complexity, 2016

Brief Announcement: Asynchronous Coordination with Constraints and Preferences.
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, 2016

Minimizing the Number of Opinions for Fault-Tolerant Distributed Decision Using Well-Quasi Orderings.
Proceedings of the LATIN 2016: Theoretical Informatics, 2016

The Read/Write Protocol Complex Is Collapsible.
Proceedings of the LATIN 2016: Theoretical Informatics, 2016

Two Convergence Problems for Robots on Graphs.
Proceedings of the 2016 Seventh Latin-American Symposium on Dependable Computing, 2016

Challenges in Fault-Tolerant Distributed Runtime Verification.
Proceedings of the Leveraging Applications of Formal Methods, Verification and Validation: Discussion, Dissemination, Applications, 2016

Decentralized Asynchronous Crash-Resilient Runtime Verification.
Proceedings of the 27th International Conference on Concurrency Theory, 2016

2015
Linear space bootstrap communication schemes.
Theor. Comput. Sci., 2015

The solvability of consensus in iterated models extended with safe-consensus.
CoRR, 2015

Specifying Concurrent Problems: Beyond Linearizability.
CoRR, 2015

Specifying Concurrent Problems: Beyond Linearizability and up to Tasks - (Extended Abstract).
Proceedings of the Distributed Computing - 29th International Symposium, 2015

Untangling Partial Agreement: Iterated x-consensus Simulations.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2015

2014
An Equivariance Theorem with Applications to Renaming.
Algorithmica, 2014

Automatically Adjusting Concurrency to the Level of Synchrony.
Proceedings of the Distributed Computing - 28th International Symposium, 2014

Reliable Shared Memory Abstraction on Top of Asynchronous Byzantine Message-Passing Systems.
Proceedings of the Structural Information and Communication Complexity, 2014

The Complexity Gap between Consensus and Safe-Consensus - (Extended Abstract).
Proceedings of the Structural Information and Communication Complexity, 2014

On the Number of Opinions Needed for Fault-Tolerant Run-Time Monitoring in Distributed Systems.
Proceedings of the Runtime Verification - 5th International Conference, 2014

The Opinion Number of Set-Agreement.
Proceedings of the Principles of Distributed Systems - 18th International Conference, 2014

Computing in the Presence of Concurrent Solo Executions.
Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

2013
Power and limits of distributed computing shared memory models.
Theor. Comput. Sci., 2013

An Introductory Tutorial to Concurrency-Related Distributed Recursion.
Bull. EATCS, 2013

The topology of distributed adversaries.
Distributed Comput., 2013

Locality and checkability in wait-free computing.
Distributed Comput., 2013

Black Art: Obstruction-Free k-set Agreement with |MWMR registers| < |proccesses|.
Proceedings of the Networked Systems - First International Conference, 2013

Agreement via Symmetry Breaking: On the Structure of Weak Subconsensus Tasks.
Proceedings of the 27th IEEE International Symposium on Parallel and Distributed Processing, 2013

Distributed Computing Through Combinatorial Topology
Morgan Kaufmann, ISBN: 978-0-12-404578-1, 2013

2012
Computability in distributed computing: a Tutorial.
SIGACT News, 2012

New combinatorial topology bounds for renaming: The upper bound.
J. ACM, 2012

An Introduction to the Topological Theory of Distributed Computing with Safe-consensus.
Electron. Notes Theor. Comput. Sci., 2012

An Inductive-style Procedure for Counting Monochromatic Simplexes of Symmetric Subdivisions with Applications to Distributed Computing.
Electron. Notes Theor. Comput. Sci., 2012

Simulations and reductions for colorless tasks.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2012

Brief announcement: there are plenty of tasks weaker than perfect renaming and stronger than set agreement.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2012

Renaming Is Weaker Than Set Agreement But for Perfect Renaming: A Map of Sub-consensus Tasks.
Proceedings of the LATIN 2012: Theoretical Informatics, 2012

Keynote speakers.
Proceedings of the 9th International Conference on Electrical Engineering, 2012

2011
Some problems in distributed computational geometry.
Theor. Comput. Sci., 2011

The impossibility of boosting distributed service resilience.
Inf. Comput., 2011

The renaming problem in shared memory systems: An introduction.
Comput. Sci. Rev., 2011

An Equivariance Theorem with Applications to Renaming (Preliminary Version)
CoRR, 2011

A Survey on Some Recent Advances in Shared Memory Models.
Proceedings of the Structural Information and Communication Complexity, 2011

The universe of symmetry breaking tasks.
Proceedings of the 30th Annual ACM Symposium on Principles of Distributed Computing, 2011

A Theory-Oriented Introduction to Wait-Free Synchronization Based on the Adaptive Renaming Problem.
Proceedings of the 25th IEEE International Conference on Advanced Information Networking and Applications, 2011

2010
Average long-lived binary consensus: Quantifying the stabilizing role played by memory.
Theor. Comput. Sci., 2010

New combinatorial topology bounds for renaming: the lower bound.
Distributed Comput., 2010

The <i>k</i>-simultaneous consensus problem.
Distributed Comput., 2010

Concurrent Computing and Shellable Complexes.
Proceedings of the Distributed Computing, 24th International Symposium, 2010

Recursion in Distributed Computing.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2010

The topology of shared-memory adversaries.
Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, 2010

Distributed Programming with Tasks.
Proceedings of the Principles of Distributed Systems - 14th International Conference, 2010

Iterated Shared Memory Models.
Proceedings of the LATIN 2010: Theoretical Informatics, 2010

2009
An Axiomatic Approach to Computing the Connectivity of Synchronous and Asynchronous Systems.
Electron. Notes Theor. Comput. Sci., 2009

Stability of Multi-Valued Continuous Consensus.
Electron. Notes Theor. Comput. Sci., 2009

Brief announcement: weakest failure detectors via an egg-laying simulation.
Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, 2009

2008
Distributed Algorithms for Minimum Spanning Trees.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

The Combined Power of Conditions and Information on Failures to Solve Asynchronous Set Agreement.
SIAM J. Comput., 2008

Bit complexity of breaking and achieving symmetry in chains and rings.
J. ACM, 2008

An impossibility about failure detectors in the iterated immediate snapshot model.
Inf. Process. Lett., 2008

On the computability power and the robustness of set agreement-oriented failure detector classes.
Distributed Comput., 2008

Average Binary Long-Lived Consensus: Quantifying the Stabilizing Role Played by Memory.
Proceedings of the Structural Information and Communication Complexity, 2008

New combinatorial topology upper and lower bounds for renaming.
Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, 2008

The Iterated Restricted Immediate Snapshot Model.
Proceedings of the Computing and Combinatorics, 14th Annual International Conference, 2008

2007
Computing with Mobile Agents in Distributed Networks.
Proceedings of the Handbook of Parallel Computing - Models, Algorithms and Applications., 2007

Asynchronous Agreement and Its Relation with Error-Correcting Codes.
IEEE Trans. Computers, 2007

Stability of Multivalued Continuous Consensus.
SIAM J. Comput., 2007

From omega to Omega: A simple bounded quiescent reliable broadcast-based transformation.
J. Parallel Distributed Comput., 2007

Failure detectors are schedulers.
Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, 2007

2006
Cyclic Storage for Fault-Tolerant Distributed Executions.
IEEE Trans. Parallel Distrib. Syst., 2006

ACM SIGACT news distributed computing column 24.
SIGACT News, 2006

ACM SIGACT news distributed computing column 22.
SIGACT News, 2006

Synchronous condition-based consensus.
Distributed Comput., 2006

Algorithmic problems in distributed systems.
Comput. Networks, 2006

Subconsensus Tasks: Renaming Is Weaker Than Set Agreement.
Proceedings of the Distributed Computing, 20th International Symposium, 2006

Mobile Agent Rendezvous: A Survey.
Proceedings of the Structural Information and Communication Complexity, 2006

Irreducibility and additivity of set agreement-oriented failure detector classes.
Proceedings of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing, 2006

The Committee Decision Problem.
Proceedings of the LATIN 2006: Theoretical Informatics, 2006

Simultaneous Consensus Tasks: A Tighter Characterization of Set-Consensus.
Proceedings of the Distributed Computing and Networking, 8th International Conference, 2006

The Reduced Automata Technique for Graph Exploration Space Lower Bounds.
Proceedings of the Theoretical Computer Science, 2006

From Failure Detectors with Limited Scope Accuracy to System-wide Leadership.
Proceedings of the 20th International Conference on Advanced Information Networking and Applications (AINA 2006), 2006

2005
ACM SIGACT news distributed computing column 20.
SIGACT News, 2005

ACM SIGACT news distributed computing column 19.
SIGACT News, 2005

Object-oriented algorithm analysis and design with Java.
Sci. Comput. Program., 2005

Distributed Dynamic Storage in Wireless Networks.
Int. J. Distributed Sens. Networks, 2005

Introduction.
Distributed Comput., 2005

Musical Benches.
Proceedings of the Distributed Computing, 19th International Conference, 2005

Space Lower Bounds for Graph Exploration via Reduced Automata.
Proceedings of the Structural Information and Communication Complexity, 2005

The combined power of conditions and failure detectors to solve asynchronous set agreement.
Proceedings of the Twenty-Fourth Annual ACM Symposium on Principles of Distributed Computing, 2005

2004
Preface.
Theor. Comput. Sci., 2004

Larry Stockmeyer: 1948-2004.
SIGACT News, 2004

ACM SIGACT news distributed computing column 16.
SIGACT News, 2004

ACM SIGACT news distributed computing column 15.
SIGACT News, 2004

Condition-based consensus solvability: a hierarchy of conditions and efficient protocols.
Distributed Comput., 2004

The Synchronous Condition-Based Consensus Hierarchy.
Proceedings of the Distributed Computing, 18th International Conference, 2004

Brief announcement: the synchronous condition-based consensus hierarchy.
Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, 2004

2003
A classification of wait-free loop agreement tasks.
Theor. Comput. Sci., 2003

ACM SIGACT news distributed computing column 13.
SIGACT News, 2003

ACM SIGACT News distributed computing column 12.
SIGACT News, 2003

ACM SIGACT news distributed computing column 11.
SIGACT News, 2003

Exact communication costs for consensus and leader in a tree.
J. Discrete Algorithms, 2003

Stability of long-lived consensus.
J. Comput. Syst. Sci., 2003

Conditions on input vectors for consensus solvability in asynchronous distributed systems.
J. ACM, 2003

A simple proof of the uniform consensus synchronous lower bound.
Inf. Process. Lett., 2003

Introduction.
Distributed Comput., 2003

Using Conditions to Expedite Consensus in Synchronous Distributed Systems.
Proceedings of the Distributed Computing, 17th International Conference, 2003

A case for OO -- Java -- in teaching algorithm analysis.
Proceedings of the 2nd International Symposium on Principles and Practice of Programming in Java, 2003

A Hierarchy of Conditions for Asynchronous Interactive Consistency.
Proceedings of the Parallel Computing Technologies, 2003

Cyclic Strategies for Balanced and Fault-Tolerant Distributed Storage.
Proceedings of the Dependable Computing, First Latin-American Symposium, 2003

On the Cost of Fault-Tolerant Consensus When There Are No Faults - A Tutorial.
Proceedings of the Dependable Computing, First Latin-American Symposium, 2003

A Flexible Simulator for Distributed Algorithms.
Proceedings of the 4th Mexican International Conference on Computer Science (ENC 2003), 2003

Open Questions on Consensus Performance in Well-Behaved Runs.
Proceedings of the Future Directions in Distributed Computing, 2003

Using Error-Correcting Codes to Solve Distributed Agreement Problems: A Future Direction in Distributed Computing?
Proceedings of the Future Directions in Distributed Computing, 2003

2002
ACM SIGACT news distributed computing column 9.
SIGACT News, 2002

ACM SIGACT news distributed computing column 8.
SIGACT News, 2002

ACM SIGACT news distributed computing column 7.
SIGACT News, 2002

ACM SIGACT news Distributed Computing Column 6.
SIGACT News, 2002

A Layered Analysis of Consensus.
SIAM J. Comput., 2002

The Combinatorial Structure of Wait-Free Solvable Tasks.
SIAM J. Comput., 2002

Condition-Based Protocols for Set Agreement Problems.
Proceedings of the Distributed Computing, 16th International Conference, 2002

Distributed Agreement and Its Relation with Error-Correcting Codes.
Proceedings of the Distributed Computing, 16th International Conference, 2002

Asynchronous interactive consistency and its relation with error-correcting codes.
Proceedings of the Twenty-First Annual ACM Symposium on Principles of Distributed Computing, 2002

A Versatile and Modular Consensus Protoco.
Proceedings of the 2002 International Conference on Dependable Systems and Networks (DSN 2002), 2002

2001
ACM SIGACT news distributed computing column 5.
SIGACT News, 2001

Distributed Computing.
SIGACT News, 2001

ACM SIGACT News distributed computing column 3.
SIGACT News, 2001

ACM SIGACT news distributed computing column 2.
SIGACT News, 2001

On the cost of fault-tolerant consensus when there are no faults: preliminary version.
SIGACT News, 2001

An Overview of Synchronous Message-Passing and Topology.
Electron. Notes Theor. Comput. Sci., 2001

The BG distributed simulation algorithm.
Distributed Comput., 2001

A New Synchronous Lower Bound for Set Agreement.
Proceedings of the Distributed Computing, 15th International Conference, 2001

Efficient Condition-Based Consensus.
Proceedings of the SIROCCO 8, 2001

A hierarchy of conditions for consensus solvability.
Proceedings of the Twentieth Annual ACM Symposium on Principles of Distributed Computing, 2001

2000
Principles of distributed computing: an exciting challenge.
SIGACT News, 2000

Algebraic spans.
Math. Struct. Comput. Sci., 2000

Stability of long-lived consensus (extended abstract).
Proceedings of the Nineteenth Annual ACM Symposium on Principles of Distributed Computing, 2000

1999
Bit Complexity of Breaking and Achieving Symmetry in Chains and Rings (Extended Abstract).
Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, 1999

New Perspectives in Distributed Computing.
Proceedings of the Mathematical Foundations of Computer Science 1999, 1999

1998
On Mixed Connectivity Certificates.
Theor. Comput. Sci., 1998

A conjecture on cycle-pancyclism in tournaments.
Discuss. Math. Graph Theory, 1998

A Wait-Free Classification of Loop Agreement Tasks.
Proceedings of the Distributed Computing, 12th International Symposium, 1998

The Unified Structure of Consensus: A <i>Layered Analysis</i> Approach.
Proceedings of the Seventeenth Annual ACM Symposium on Principles of Distributed Computing, 1998

Unifying Synchronous and Asynchronous Message-Passing Models.
Proceedings of the Seventeenth Annual ACM Symposium on Principles of Distributed Computing, 1998

1997
The Use of a Synchronizer Yields the Maximum Computation Rate in Distributed Networks.
Theory Comput. Syst., 1997

Cycle-pancyclism in tournaments III.
Graphs Comb., 1997

The Decidability of Distributed Decision Tasks (Extended Abstract).
Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, 1997

1996
Optimal Clock Synchronization under Different Delay Assumptions.
SIAM J. Comput., 1996

Cycle-pancyclism in tournaments II.
Graphs Comb., 1996

The Combinatorial Structure of Wait-free Solvable Tasks (Extended Abstract).
Proceedings of the Distributed Algorithms, 10th International Workshop, 1996

On the Borowsky-Gafni Simulation Algorithm (Abstract).
Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing, 1996

On the Decidability of Distributed Decision Tasks (Brief Announcement).
Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing, 1996

On the Borowsky-Gafni Simulation Algorithm.
Proceedings of the Fourth Israel Symposium on Theory of Computing and Systems, 1996

1995
Unison, Canon, and Sluggish Clocks in Networks Controlled by a Synchronizer.
Math. Syst. Theory, 1995

Cycle-pancyclism in tournaments I.
Graphs Comb., 1995

Algebraic Spans (Preliminary Version).
Proceedings of the Fourteenth Annual ACM Symposium on Principles of Distributed Computing, 1995

On Mixed Connectivity Certificates (Extended Abstract).
Proceedings of the Algorithms, 1995

Algebraic Topology and Distributed Computing: A Primer.
Proceedings of the Computer Science Today: Recent Trends and Developments, 1995

1994
On the Performance of Synchronized Programs in Distributed Networks with Random Processing Times and Transmission Delays.
IEEE Trans. Parallel Distrib. Syst., 1994

Tentative and Definite Distributed Computations: An Optimistic Approach to Network Synchronization.
Theor. Comput. Sci., 1994

Upper and Lower Bounds for Stochastic Marked Graphs.
Inf. Process. Lett., 1994

A theory of clock synchronization (extended abstract).
Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 1994

Set Consensus Using Arbitrary Objects (Preliminary Version).
Proceedings of the Thirteenth Annual ACM Symposium on Principles of Distributed Computing, 1994

1993
Optimal Clock Synchronization under Different Delay Assumptions (Preliminary Version).
Proceedings of the Twelth Annual ACM Symposium on Principles of Distributed Computing, 1993

1991
Analysis of Distributed Algorithms based on Recurrence Relations (Preliminary Version).
Proceedings of the Distributed Algorithms, 5th International Workshop, 1991

Stochastic Marked Graphs.
Proceedings of the Fourth International Workshop on Petri Nets and Performance Models, 1991

1990
On the Average Performance of Synchronized Programs in Distributed Networks (Preliminary Version).
Proceedings of the Distributed Algorithms, 4th International Workshop, 1990

The Use of a Synchronizer Yields Maximum Computation Rate in Distributed Networks (Extended Abstract)
Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, 1990


  Loading...