Sergio Rajsbaum

Theory Comput. Syst., October, 2023

Locally solvable tasks and the limitations of valency arguments.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., June, 2023

Synchronous t-resilient consensus in arbitrary graphs.

[BibT_eX]

[DOI]

Inf. Comput., June, 2023

Set-Linearizable Implementations from Read/Write Operations: Sets, Fetch &Increment, Stacks and Queues with Multiplicity.

[BibT_eX]

[DOI]

Distributed Comput., June, 2023

A distributed computing perspective of unconditionally secure information transmission in Russian cards problems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., March, 2023

Simplicial Models for the Epistemic Logic of Faulty Agents.

[BibT_eX]

[DOI]

CoRR, 2023

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

[BibT_eX]

[DOI]

CoRR, 2023

A Linearizability-based Hierarchy for Concurrent Specifications.

[BibT_eX]

[DOI]

Commun. ACM, 2023

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

[BibT_eX]

[DOI]

Proceedings of the 37th International Symposium on Distributed Computing, 2023

Semi-Simplicial Set Models for Distributed Knowledge.

[BibT_eX]

[DOI]

LICS, 2023

2022

Formal Methods and Distributed Computing: Stronger Together (Dagstuhl Seminar 22492).

[BibT_eX]

[DOI]

Dagstuhl Reports, December, 2022

Decentralized Asynchronous Crash-resilient Runtime Verification.

[BibT_eX]

[DOI]

J. ACM, 2022

Distributed computability: Relating k-immediate snapshot and x-set agreement.

[BibT_eX]

[DOI]

Inf. Comput., 2022

Two-Agent Approximate Agreement from an Epistemic Logic Perspective.

[BibT_eX]

[DOI]

Jorge Armenta-Segura

Computación y Sistemas, 2022

A Simplicial Model for KB4_n: Epistemic Logic with Agents That May Die.

[BibT_eX]

[DOI]

Éric Goubault

Proceedings of the 39th International Symposium on Theoretical Aspects of Computer Science, 2022

A Distributed Combinatorial Topology Approach to Arrow's Impossibility Theorem.

[BibT_eX]

[DOI]

Armajac Raventós-Pujol

Proceedings of the PODC '22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25, 2022

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

[BibT_eX]

[DOI]

Ami Paz

Proceedings of the PODC '22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25, 2022

A Snapshot-Based Introduction to the Linearizability Hierarchy.

[BibT_eX]

[DOI]

Proceedings of the Networked Systems - 10th International Conference, 2022

Continuous Tasks and the Asynchronous Computability Theorem.

[BibT_eX]

[DOI]

Hugo Rincon Galeana

Ulrich Schmid

Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

Distributed Decision Problems: Concurrent Specifications Beyond Binary Relations (Invited Talk).

[BibT_eX]

[DOI]

Proceedings of the 33rd International Conference on Concurrency Theory, 2022

2021

A topological perspective on distributed network algorithms.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

A dynamic epistemic logic analysis of equality negation and other epistemic covering tasks.

[BibT_eX]

[DOI]

J. Log. Algebraic Methods Program., 2021

Continuous Tasks and the Chromatic Simplicial Approximation Theorem.

[BibT_eX]

[DOI]

Hugo Rincon Galeana

Ulrich Schmid

CoRR, 2021

A Simplicial Model for KB4n: Epistemic Logic with Agents that May Die.

[BibT_eX]

[DOI]

Eric Goubault

CoRR, 2021

Information Exchange in the Russian Cards Problem.

[BibT_eX]

[DOI]

Zoe Leyva-Acosta

Eduardo Pascual-Aseff

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2021

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

[BibT_eX]

[DOI]

Proceedings of the Networked Systems - 9th International Conference, 2021

2020

60 Years of Mastering Concurrent Computing through Sequential Thinking.

[BibT_eX]

[DOI]

SIGACT News, 2020

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

[BibT_eX]

[DOI]

Karla Vargas

Parallel Process. Lett., 2020

Geometric and Topological Methods in Computer Science (special 10th anniversary GETCO conference, 2018).

[BibT_eX]

[DOI]

Shmuel Weinberger

J. Appl. Comput. Topol., 2020

A lower bound on the number of opinions needed for fault-tolerant decentralized run-time monitoring.

[BibT_eX]

[DOI]

J. Appl. Comput. Topol., 2020

Perfect failure detection with very few bits.

[BibT_eX]

[DOI]

Inf. Comput., 2020

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

[BibT_eX]

[DOI]

CoRR, 2020

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

[BibT_eX]

[DOI]

CoRR, 2020

Knowledge and simplicial complexes.

[BibT_eX]

[DOI]

CoRR, 2020

Mastering concurrent computing through sequential thinking.

[BibT_eX]

[DOI]

Commun. ACM, 2020

A perspective on theoretical computer science in Latin America.

[BibT_eX]

[DOI]

Marcos Kiwi

Yoshiharu Kohayakawa

Francisco Rodríguez-Henríquez

Jayme Luiz Szwarcfiter

Alfredo Viola

Commun. ACM, 2020

A tour of dependable computing research in Latin America.

[BibT_eX]

[DOI]

Elias P. Duarte Jr.

Raimundo J. A. Macêdo

Eliane Martins

Commun. ACM, 2020

Indistinguishability.

[BibT_eX]

[DOI]

Commun. ACM, 2020

Welcome.

[BibT_eX]

[DOI]

Virgílio A. F. Almeida

Gonzalo Navarro

Commun. ACM, 2020

Brief Announcement: Leader Election in the ADD Communication Model.

[BibT_eX]

[DOI]

Karla Vargas

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2020

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

[BibT_eX]

[DOI]

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2020

Communication Complexity of Wait-Free Computability in Dynamic Networks.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2020

Relaxed Queues and Stacks from Read/Write Operations.

[BibT_eX]

[DOI]

Proceedings of the 24th International Conference on Principles of Distributed Systems, 2020

2019

Making Local Algorithms Wait-Free: the Case of Ring Coloring.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2019

The topology of look-compute-move robot wait-free algorithms with hard termination.

[BibT_eX]

[DOI]

Manuel Alcantara

David Flores-Peñaloza

Distributed Comput., 2019

Wait-Free Solvability of Equality Negation Tasks.

[BibT_eX]

[DOI]

Proceedings of the 33rd International Symposium on Distributed Computing, 2019

A Dynamic Epistemic Logic Analysis of the Equality Negation Task.

[BibT_eX]

[DOI]

Proceedings of the Dynamic Logic. New Trends and Applications, 2019

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

[BibT_eX]

[DOI]

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2019

Synchronous t-Resilient Consensus in Arbitrary Graphs.

[BibT_eX]

[DOI]

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2019

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

[BibT_eX]

[DOI]

Karla Vargas

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.

[BibT_eX]

[DOI]

IEEE Trans. Parallel Distributed Syst., 2018

Convergence and covering on graphs for wait-free robots.

[BibT_eX]

[DOI]

Matthieu Roy

J. Braz. Comput. Soc., 2018

Collapsibility of read/write models using discrete morse theory.

[BibT_eX]

[DOI]

Fernando Benavides

J. Appl. Comput. Topol., 2018

Unifying Concurrent Objects and Distributed Tasks: Interval-Linearizability.

[BibT_eX]

[DOI]

J. ACM, 2018

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

[BibT_eX]

[DOI]

Dagstuhl Reports, 2018

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

[BibT_eX]

[DOI]

CoRR, 2018

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

[BibT_eX]

[DOI]

Éric Goubault

Proceedings of the Proceedings Ninth International Symposium on Games, 2018

A Characterization of t-Resilient Colorless Task Anonymous Solvability.

[BibT_eX]

[DOI]

Nayuta Yanagisawa

Proceedings of the Structural Information and Communication Complexity, 2018

2018 Edsger W. Dijkstra Prize in Distributed Computing.

[BibT_eX]

[DOI]

Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, 2018

An Anonymous Wait-Free Weak-Set Object Implementation.

[BibT_eX]

[DOI]

Nayuta Yanagisawa

Proceedings of the Networked Systems - 6th International Conference, 2018

2017

Preface.

[BibT_eX]

[DOI]

Kishore Kothapalli

Theor. Comput. Sci., 2017

From wait-free to arbitrary concurrent solo executions in colorless distributed computing.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

A characterization of colorless anonymous t-resilient task computability.

[BibT_eX]

[DOI]

Nayuta Yanagisawa

CoRR, 2017

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

[BibT_eX]

[DOI]

Eric Goubault

CoRR, 2017

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

[BibT_eX]

[DOI]

Eric Goubault

CoRR, 2017

Long-Lived Tasks.

[BibT_eX]

[DOI]

Proceedings of the Networked Systems - 5th International Conference, 2017

Fault-Tolerant Robot Gathering Problems on Graphs With Arbitrary Appearing Times.

[BibT_eX]

[DOI]

David Flores-Peñaloza

Manuel Alcantara

Proceedings of the 2017 IEEE International Parallel and Distributed Processing Symposium, 2017

2016

Distributed Algorithms for Minimum Spanning Trees.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Generalized Symmetry Breaking Tasks and Nondeterminism in Concurrent Objects.

[BibT_eX]

[DOI]

SIAM J. Comput., 2016

Read/write shared memory abstraction on top of asynchronous Byzantine message-passing systems.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 2016

Neighbor Discovery in a Sensor Network with Directional Antennae.

[BibT_eX]

[DOI]

Ad Hoc Sens. Wirel. Networks, 2016

t-Resilient Immediate Snapshot Is Impossible.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2016

Asynchronous Coordination Under Preferences and Constraints.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2016

Brief Announcement: Asynchronous Coordination with Constraints and Preferences.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2016: Theoretical Informatics, 2016

The Read/Write Protocol Complex Is Collapsible.

[BibT_eX]

[DOI]

Fernando Benavides

Proceedings of the LATIN 2016: Theoretical Informatics, 2016

Two Convergence Problems for Robots on Graphs.

[BibT_eX]

[DOI]

Matthieu Roy

Proceedings of the 2016 Seventh Latin-American Symposium on Dependable Computing, 2016

Challenges in Fault-Tolerant Distributed Runtime Verification.

[BibT_eX]

[DOI]

Proceedings of the Leveraging Applications of Formal Methods, Verification and Validation: Discussion, Dissemination, Applications, 2016

2015

Linear space bootstrap communication schemes.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

Specifying Concurrent Problems: Beyond Linearizability.

[BibT_eX]

[DOI]

CoRR, 2015

Specifying Concurrent Problems: Beyond Linearizability and up to Tasks - (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing - 29th International Symposium, 2015

Untangling Partial Agreement: Iterated x-consensus Simulations.

[BibT_eX]

[DOI]

Damien Imbs

Adrián Valle

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2015

2014

An Equivariance Theorem with Applications to Renaming.

[BibT_eX]

[DOI]

Algorithmica, 2014

Automatically Adjusting Concurrency to the Level of Synchrony.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing - 28th International Symposium, 2014

Reliable Shared Memory Abstraction on Top of Asynchronous Byzantine Message-Passing Systems.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2014

The Complexity Gap between Consensus and Safe-Consensus - (Extended Abstract).

[BibT_eX]

[DOI]

Rodolfo Conde

Proceedings of the Structural Information and Communication Complexity, 2014

On the Number of Opinions Needed for Fault-Tolerant Run-Time Monitoring in Distributed Systems.

[BibT_eX]

[DOI]

Proceedings of the Runtime Verification - 5th International Conference, 2014

The Opinion Number of Set-Agreement.

[BibT_eX]

[DOI]

Proceedings of the Principles of Distributed Systems - 18th International Conference, 2014

Computing in the Presence of Concurrent Solo Executions.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

An Introductory Tutorial to Concurrency-Related Distributed Recursion.

[BibT_eX]

[DOI]

Panagiota Fatourou

Bull. EATCS, 2013

The topology of distributed adversaries.

[BibT_eX]

[DOI]

Distributed Comput., 2013

Locality and checkability in wait-free computing.

[BibT_eX]

[DOI]

Distributed Comput., 2013

Black Art: Obstruction-Free k-set Agreement with |MWMR registers| < |proccesses|.

[BibT_eX]

[DOI]

Proceedings of the Networked Systems - First International Conference, 2013

Agreement via Symmetry Breaking: On the Structure of Weak Subconsensus Tasks.

[BibT_eX]

[DOI]

Proceedings of the 27th IEEE International Symposium on Parallel and Distributed Processing, 2013

Distributed Computing Through Combinatorial Topology

[BibT_eX]

[DOI]

Dmitry N. Kozlov

Morgan Kaufmann, ISBN: 978-0-12-404578-1, 2013

2012

Computability in distributed computing: a Tutorial.

[BibT_eX]

[DOI]

SIGACT News, 2012

New combinatorial topology bounds for renaming: The upper bound.

[BibT_eX]

[DOI]

J. ACM, 2012

Simulations and reductions for colorless tasks.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2012: Theoretical Informatics, 2012

Keynote speakers.

[BibT_eX]

[DOI]

Manuel A. Duarte Mermou

Victor (Young-il) Kwon

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

2011

Some problems in distributed computational geometry.

[BibT_eX]

[DOI]

Jorge Urrutia

Theor. Comput. Sci., 2011

The impossibility of boosting distributed service resilience.

[BibT_eX]

[DOI]

Inf. Comput., 2011

The renaming problem in shared memory systems: An introduction.

[BibT_eX]

[DOI]

Comput. Sci. Rev., 2011

An Equivariance Theorem with Applications to Renaming (Preliminary Version)

[BibT_eX]

[DOI]

CoRR, 2011

A Survey on Some Recent Advances in Shared Memory Models.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2011

The universe of symmetry breaking tasks.

[BibT_eX]

[DOI]

Damien Imbs

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.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2010

An Introduction to the Topological Theory of Distributed Computing with Safe-consensus.

[BibT_eX]

[DOI]

Rodolfo Conde

Proceedings of the workshop on Geometric and Topological Methods in Computer Science, 2010

An Inductive-style Procedure for Counting Monochromatic Simplexes of Symmetric Subdivisions with Applications to Distributed Computing.

[BibT_eX]

[DOI]

Proceedings of the workshop on Geometric and Topological Methods in Computer Science, 2010

New combinatorial topology bounds for renaming: the lower bound.

[BibT_eX]

[DOI]

Distributed Comput., 2010

The k-simultaneous consensus problem.

[BibT_eX]

[DOI]

Distributed Comput., 2010

Concurrent Computing and Shellable Complexes.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing, 24th International Symposium, 2010

Recursion in Distributed Computing.

[BibT_eX]

[DOI]

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2010

The topology of shared-memory adversaries.

[BibT_eX]

[DOI]

Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, 2010

Distributed Programming with Tasks.

[BibT_eX]

[DOI]

Proceedings of the Principles of Distributed Systems - 14th International Conference, 2010

Iterated Shared Memory Models.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2010: Theoretical Informatics, 2010

2009

Brief announcement: weakest failure detectors via an egg-laying simulation.

[BibT_eX]

[DOI]

Antonio Fernández Anta

Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, 2009

2008

Distributed Algorithms for Minimum Spanning Trees.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

The Combined Power of Conditions and Information on Failures to Solve Asynchronous Set Agreement.

[BibT_eX]

[DOI]

SIAM J. Comput., 2008

Bit complexity of breaking and achieving symmetry in chains and rings.

[BibT_eX]

[DOI]

Yefim Dinitz

Shlomo Moran

J. ACM, 2008

An impossibility about failure detectors in the iterated immediate snapshot model.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2008

On the computability power and the robustness of set agreement-oriented failure detector classes.

[BibT_eX]

[DOI]

Distributed Comput., 2008

Average Binary Long-Lived Consensus: Quantifying the Stabilizing Role Played by Memory.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2008

New combinatorial topology upper and lower bounds for renaming.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, 2008

The Iterated Restricted Immediate Snapshot Model.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 14th Annual International Conference, 2008

2007

Computing with Mobile Agents in Distributed Networks.

[BibT_eX]

[DOI]

Evangelos Kranakis

Danny Krizanc

Proceedings of the Handbook of Parallel Computing - Models, Algorithms and Applications., 2007

Asynchronous Agreement and Its Relation with Error-Correcting Codes.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 2007

Stability of Multivalued Continuous Consensus.

[BibT_eX]

[DOI]

Lior Davidovitch

SIAM J. Comput., 2007

From omega to Omega: A simple bounded quiescent reliable broadcast-based transformation.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 2007

Failure detectors are schedulers.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, 2007

2006

Cyclic Storage for Fault-Tolerant Distributed Executions.

[BibT_eX]

[DOI]

Brett Stevens

IEEE Trans. Parallel Distributed Syst., 2006

ACM SIGACT news distributed computing column 24.

[BibT_eX]

[DOI]

SIGACT News, 2006

ACM SIGACT news distributed computing column 22.

[BibT_eX]

[DOI]

SIGACT News, 2006

Synchronous condition-based consensus.

[BibT_eX]

[DOI]

Distributed Comput., 2006

Algorithmic problems in distributed systems.

[BibT_eX]

[DOI]

Roberto De Prisco

Comput. Networks, 2006

Subconsensus Tasks: Renaming Is Weaker Than Set Agreement.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing, 20th International Symposium, 2006

Mobile Agent Rendezvous: A Survey.

[BibT_eX]

[DOI]

Evangelos Kranakis

Danny Krizanc

Proceedings of the Structural Information and Communication Complexity, 2006

Irreducibility and additivity of set agreement-oriented failure detector classes.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing, 2006

The Committee Decision Problem.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2006: Theoretical Informatics, 2006

Simultaneous Consensus Tasks: A Tighter Characterization of Set-Consensus.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing and Networking, 8th International Conference, 2006

The Reduced Automata Technique for Graph Exploration Space Lower Bounds.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Computer Science, 2006

From Failure Detectors with Limited Scope Accuracy to System-wide Leadership.

[BibT_eX]

[DOI]

Proceedings of the 20th International Conference on Advanced Information Networking and Applications (AINA 2006), 2006

2005

ACM SIGACT news distributed computing column 20.

[BibT_eX]

[DOI]

SIGACT News, 2005

ACM SIGACT news distributed computing column 19.

[BibT_eX]

[DOI]

SIGACT News, 2005

Object-oriented algorithm analysis and design with Java.

[BibT_eX]

[DOI]

Elisa Viso

Sci. Comput. Program., 2005

Distributed Dynamic Storage in Wireless Networks.

[BibT_eX]

[DOI]

Constantinos Georgiou

Evangelos Kranakis

Jorge Urrutia

Int. J. Distributed Sens. Networks, 2005

Introduction.

[BibT_eX]

[DOI]

Distributed Comput., 2005

Musical Benches.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing, 19th International Conference, 2005

Space Lower Bounds for Graph Exploration via Reduced Automata.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2005

The combined power of conditions and failure detectors to solve asynchronous set agreement.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fourth Annual ACM Symposium on Principles of Distributed Computing, 2005

2004

Preface.

[BibT_eX]

[DOI]

Juan A. Garay

Theor. Comput. Sci., 2004

Larry Stockmeyer: 1948-2004.

[BibT_eX]

[DOI]

SIGACT News, 2004

ACM SIGACT news distributed computing column 16.

[BibT_eX]

[DOI]

SIGACT News, 2004

ACM SIGACT news distributed computing column 15.

[BibT_eX]

[DOI]

SIGACT News, 2004

An Axiomatic Approach to Computing the Connectivity of Synchronous and Asynchronous Systems.

[BibT_eX]

[DOI]

Proceedings of the Workshops on Geometric and Topological Methods in Concurrency Theory, 2004

Stability of Multi-Valued Continuous Consensus.

[BibT_eX]

[DOI]

Lior Davidovitch

Proceedings of the Workshops on Geometric and Topological Methods in Concurrency Theory, 2004

Condition-based consensus solvability: a hierarchy of conditions and efficient protocols.

[BibT_eX]

[DOI]

Distributed Comput., 2004

The Synchronous Condition-Based Consensus Hierarchy.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing, 18th International Conference, 2004

Brief announcement: the synchronous condition-based consensus hierarchy.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, 2004

2003

A classification of wait-free loop agreement tasks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

ACM SIGACT news distributed computing column 13.

[BibT_eX]

[DOI]

SIGACT News, 2003

ACM SIGACT News distributed computing column 12.

[BibT_eX]

[DOI]

SIGACT News, 2003

ACM SIGACT news distributed computing column 11.

[BibT_eX]

[DOI]

SIGACT News, 2003

Exact communication costs for consensus and leader in a tree.

[BibT_eX]

[DOI]

Yefim Dinitz

Shlomo Moran

J. Discrete Algorithms, 2003

Stability of long-lived consensus.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2003

Conditions on input vectors for consensus solvability in asynchronous distributed systems.

[BibT_eX]

[DOI]

J. ACM, 2003

A simple proof of the uniform consensus synchronous lower bound.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2003

Introduction.

[BibT_eX]

[DOI]

Distributed Comput., 2003

Using Conditions to Expedite Consensus in Synchronous Distributed Systems.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing, 17th International Conference, 2003

A case for OO -- Java -- in teaching algorithm analysis.

[BibT_eX]

[DOI]

Elisa Viso

Proceedings of the 2nd International Symposium on Principles and Practice of Programming in Java, 2003

A Hierarchy of Conditions for Asynchronous Interactive Consistency.

[BibT_eX]

[DOI]

Proceedings of the Parallel Computing Technologies, 2003

Cyclic Strategies for Balanced and Fault-Tolerant Distributed Storage.

[BibT_eX]

[DOI]

Proceedings of the Dependable Computing, First Latin-American Symposium, 2003

On the Cost of Fault-Tolerant Consensus When There Are No Faults - A Tutorial.

[BibT_eX]

[DOI]

Proceedings of the Dependable Computing, First Latin-American Symposium, 2003

A Flexible Simulator for Distributed Algorithms.

[BibT_eX]

[DOI]

Rolando Esquivel-Villafana

Proceedings of the 4th Mexican International Conference on Computer Science (ENC 2003), 2003

Open Questions on Consensus Performance in Well-Behaved Runs.

[BibT_eX]

[DOI]

Proceedings of the Future Directions in Distributed Computing, 2003

Using Error-Correcting Codes to Solve Distributed Agreement Problems: A Future Direction in Distributed Computing?

[BibT_eX]

[DOI]

Proceedings of the Future Directions in Distributed Computing, 2003

2002

ACM SIGACT news distributed computing column 9.

[BibT_eX]

[DOI]

SIGACT News, 2002

ACM SIGACT news distributed computing column 8.

[BibT_eX]

[DOI]

SIGACT News, 2002

ACM SIGACT news distributed computing column 7.

[BibT_eX]

[DOI]

SIGACT News, 2002

ACM SIGACT news Distributed Computing Column 6.

[BibT_eX]

[DOI]

SIGACT News, 2002

A Layered Analysis of Consensus.

[BibT_eX]

[DOI]

Yoram Moses

SIAM J. Comput., 2002

The Combinatorial Structure of Wait-Free Solvable Tasks.

[BibT_eX]

[DOI]

SIAM J. Comput., 2002

Condition-Based Protocols for Set Agreement Problems.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing, 16th International Conference, 2002

Distributed Agreement and Its Relation with Error-Correcting Codes.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing, 16th International Conference, 2002

Asynchronous interactive consistency and its relation with error-correcting codes.

[BibT_eX]

[DOI]

Proceedings of the Twenty-First Annual ACM Symposium on Principles of Distributed Computing, 2002

A Versatile and Modular Consensus Protoco.

[BibT_eX]

[DOI]

Proceedings of the 2002 International Conference on Dependable Systems and Networks (DSN 2002), 2002

2001

ACM SIGACT news distributed computing column 5.

[BibT_eX]

[DOI]

SIGACT News, 2001

Distributed Computing.

[BibT_eX]

[DOI]

SIGACT News, 2001

ACM SIGACT News distributed computing column 3.

[BibT_eX]

[DOI]

SIGACT News, 2001

ACM SIGACT news distributed computing column 2.

[BibT_eX]

[DOI]

SIGACT News, 2001

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

[BibT_eX]

[DOI]

SIGACT News, 2001

The BG distributed simulation algorithm.

[BibT_eX]

[DOI]

Distributed Comput., 2001

A New Synchronous Lower Bound for Set Agreement.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing, 15th International Conference, 2001

Efficient Condition-Based Consensus.

[BibT_eX]

Proceedings of the SIROCCO 8, 2001

A hierarchy of conditions for consensus solvability.

[BibT_eX]

[DOI]

Proceedings of the Twentieth Annual ACM Symposium on Principles of Distributed Computing, 2001

2000

Principles of distributed computing: an exciting challenge.

[BibT_eX]

[DOI]

SIGACT News, 2000

Algebraic spans.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2000

An Overview of Synchronous Message-Passing and Topology.

[BibT_eX]

[DOI]

Proceedings of the 2nd Workshop on Geometry and Topology in Concurrency theory, 2000

Stability of long-lived consensus (extended abstract).

[BibT_eX]

[DOI]

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).

[BibT_eX]

[DOI]

Yefim Dinitz

Shlomo Moran

Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, 1999

New Perspectives in Distributed Computing.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1999, 1999

1998

On Mixed Connectivity Certificates.

[BibT_eX]

[DOI]

Gene Itkis

Theor. Comput. Sci., 1998

A conjecture on cycle-pancyclism in tournaments.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 1998

A Wait-Free Classification of Loop Agreement Tasks.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing, 12th International Symposium, 1998

The Unified Structure of Consensus: A Layered Analysis Approach.

[BibT_eX]

[DOI]

Yoram Moses

Proceedings of the Seventeenth Annual ACM Symposium on Principles of Distributed Computing, 1998

Unifying Synchronous and Asynchronous Message-Passing Models.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Theory Comput. Syst., 1997

Cycle-pancyclism in tournaments III.

[BibT_eX]

[DOI]

Graphs Comb., 1997

The Decidability of Distributed Decision Tasks (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, 1997

1996

Optimal Clock Synchronization under Different Delay Assumptions.

[BibT_eX]

[DOI]

Amir Herzberg

SIAM J. Comput., 1996

Cycle-pancyclism in tournaments II.

[BibT_eX]

[DOI]

Graphs Comb., 1996

The Combinatorial Structure of Wait-free Solvable Tasks (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Distributed Algorithms, 10th International Workshop, 1996

On the Borowsky-Gafni Simulation Algorithm (Abstract).

[BibT_eX]

[DOI]

Nancy A. Lynch

Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing, 1996

On the Decidability of Distributed Decision Tasks (Brief Announcement).

[BibT_eX]

[DOI]

Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing, 1996

On the Borowsky-Gafni Simulation Algorithm.

[BibT_eX]

Nancy A. Lynch

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.

[BibT_eX]

[DOI]

Math. Syst. Theory, 1995

Cycle-pancyclism in tournaments I.

[BibT_eX]

[DOI]

Graphs Comb., 1995

Algebraic Spans (Preliminary Version).

[BibT_eX]

[DOI]

Proceedings of the Fourteenth Annual ACM Symposium on Principles of Distributed Computing, 1995

On Mixed Connectivity Certificates (Extended Abstract).

[BibT_eX]

[DOI]

Gene Itkis

Proceedings of the Algorithms, 1995

Algebraic Topology and Distributed Computing: A Primer.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Moshe Sidi

IEEE Trans. Parallel Distributed Syst., 1994

Tentative and Definite Distributed Computations: An Optimistic Approach to Network Synchronization.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1994

Upper and Lower Bounds for Stochastic Marked Graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1994

A theory of clock synchronization (extended abstract).

[BibT_eX]

[DOI]

Boaz Patt-Shamir

Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 1994

Set Consensus Using Arbitrary Objects (Preliminary Version).

[BibT_eX]

[DOI]

Proceedings of the Thirteenth Annual ACM Symposium on Principles of Distributed Computing, 1994

1993

Optimal Clock Synchronization under Different Delay Assumptions (Preliminary Version).

[BibT_eX]

[DOI]

Amir Herzberg

Proceedings of the Twelth Annual ACM Symposium on Principles of Distributed Computing, 1993

1991

Analysis of Distributed Algorithms based on Recurrence Relations (Preliminary Version).

[BibT_eX]

[DOI]

Yossi Malka

Proceedings of the Distributed Algorithms, 5th International Workshop, 1991

Stochastic Marked Graphs.

[BibT_eX]

[DOI]

Proceedings of the Fourth International Workshop on Petri Nets and Performance Models, 1991

1990

On the performance of distributed networks controlled by a simple synchronizer.

[BibT_eX]

[DOI]

PhD thesis, 1990

On the Average Performance of Synchronized Programs in Distributed Networks (Preliminary Version).

[BibT_eX]

[DOI]

Moshe Sidi

Proceedings of the Distributed Algorithms, 4th International Workshop, 1990

The Use of a Synchronizer Yields Maximum Computation Rate in Distributed Networks (Extended Abstract)

[BibT_eX]

[DOI]