Hagit Attiya

Distributed Comput., March, 2024

History-Independent Concurrent Objects.

[BibT_eX]

[DOI]

CoRR, 2024

Strong Linearizability using Primitives with Consensus Number 2.

[BibT_eX]

[DOI]

CoRR, 2024

2023

Locally solvable tasks and the limitations of valency arguments.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., June, 2023

Special issue on DISC 2019.

[BibT_eX]

[DOI]

Distributed Comput., March, 2023

Faithful Simulation of Randomized BFT Protocols on Block DAGs.

[BibT_eX]

[DOI]

Shafik Nassar

IACR Cryptol. ePrint Arch., 2023

Brief Announcement: Recoverable and Detectable Self-Implementations of Swap.

[BibT_eX]

[DOI]

Tomer Lev Lehman

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

Brief Announcement: Multi-Valued Connected Consensus: A New Perspective on Crusader Agreement and Adopt-Commit.

[BibT_eX]

[DOI]

Proceedings of the 37th International Symposium on Distributed Computing, 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

Topological Characterization of Task Solvability in General Models of Computation.

[BibT_eX]

[DOI]

Thomas Nowak

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

Recoverable and Detectable Self-Implementations of Swap.

[BibT_eX]

[DOI]

Tomer Lev Lehman

Proceedings of the 27th International Conference on Principles of Distributed Systems, 2023

Bounds on Worst-Case Responsiveness for Agreement Algorithms.

[BibT_eX]

[DOI]

Proceedings of the 27th International Conference on Principles of Distributed Systems, 2023

Multi-Valued Connected Consensus: A New Perspective on Crusader Agreement and Adopt-Commit.

[BibT_eX]

[DOI]

Proceedings of the 27th International Conference on Principles of Distributed Systems, 2023

The Synchronization Power of Auditable Registers.

[BibT_eX]

[DOI]

Proceedings of the 27th International Conference on Principles of Distributed Systems, 2023

Asynchronous Fully-Decentralized SGD in the Cluster-Based Model.

[BibT_eX]

[DOI]

Noa Schiller

Proceedings of the Algorithms and Complexity - 13th International Conference, 2023

2022

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

[BibT_eX]

[DOI]

Dagstuhl Reports, December, 2022

Separating lock-freedom from wait-freedom at every level of the consensus hierarchy.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 2022

Store-collect in the presence of continuous churn with application to snapshots and lattice agreement.

[BibT_eX]

[DOI]

Inf. Comput., 2022

Special issue on DISC 2020.

[BibT_eX]

[DOI]

Distributed Comput., 2022

Special issue on PODC 2020.

[BibT_eX]

[DOI]

Distributed Comput., 2022

NVM-ESR: Using Non-Volatile Memory in Exact State Reconstruction of Preconditioned Conjugate Gradient.

[BibT_eX]

[DOI]

CoRR, 2022

Detectable recovery of lock-free data structures.

[BibT_eX]

[DOI]

Proceedings of the PPoPP '22: 27th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, Seoul, Republic of Korea, April 2, 2022

Blunting an Adversary Against Randomized Concurrent Programs with Linearizable Implementations.

[BibT_eX]

[DOI]

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

The Step Complexity of Multidimensional Approximate Agreement.

[BibT_eX]

[DOI]

Proceedings of the 26th International Conference on Principles of Distributed Systems, 2022

Recovery of Distributed Iterative Solvers for Linear Systems Using Non-Volatile RAM.

[BibT_eX]

[DOI]

Proceedings of the 12th IEEE/ACM Workshop on Fault Tolerance for HPC at eXtreme Scale, 2022

2021

Specification and space complexity of collaborative text editing.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

Special issue on PODC 2019.

[BibT_eX]

[DOI]

Distributed Comput., 2021

Special issue on PODC 2018 and DISC 2018.

[BibT_eX]

[DOI]

Distributed Comput., 2021

Linearizable Implementations Suffice for Termination of Randomized Concurrent Programs.

[BibT_eX]

[DOI]

CoRR, 2021

Impossibility of Strongly-Linearizable Message-Passing Objects via Simulation by Single-Writer Registers.

[BibT_eX]

[DOI]

Proceedings of the 35th International Symposium on Distributed Computing, 2021

Flat-Combining-Based Persistent Data Structures for Non-volatile Memory.

[BibT_eX]

[DOI]

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

2021 Principles of Distributed Computing Doctoral Dissertation Award.

[BibT_eX]

[DOI]

Proceedings of the PODC '21: ACM Symposium on Principles of Distributed Computing, 2021

Recoverable and Detectable Fetch&Add.

[BibT_eX]

[DOI]

Proceedings of the 25th International Conference on Principles of Distributed Systems, 2021

Assessing the Use Cases of Persistent Memory in High-Performance Scientific Computing.

[BibT_eX]

[DOI]

Proceedings of the 11th IEEE/ACM Workshop on Fault Tolerance for HPC at eXtreme Scale, 2021

2020

Editorial: Special issue of PODC 2017 and DISC 2017.

[BibT_eX]

[DOI]

Distributed Comput., 2020

Indistinguishability.

[BibT_eX]

[DOI]

Commun. ACM, 2020

Tracking in Order to Recover - Detectable Recovery of Lock-Free Data Structures.

[BibT_eX]

[DOI]

Proceedings of the SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020

Brief Announcement: Collect in the Presence of Continuous Churn with Application to Snapshots and Lattice Agreement.

[BibT_eX]

[DOI]

Proceedings of the PODC '20: ACM Symposium on Principles of Distributed Computing, 2020

Optimal Resilience in Systems That Mix Shared Memory and Message Passing.

[BibT_eX]

[DOI]

Sweta Kumari

Noa Schiller

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

Staleness and Local Progress in Transactional Memory.

[BibT_eX]

[DOI]

Proceedings of the Networked Systems - 8th International Conference, 2020

Efficient Concurrent Execution of Smart Contracts in Blockchains Using Object-Based Transactional Memory.

[BibT_eX]

[DOI]

Proceedings of the Networked Systems - 8th International Conference, 2020

2019

Emulating a Shared Register in a System That Never Stops Changing.

[BibT_eX]

[DOI]

IEEE Trans. Parallel Distributed Syst., 2019

Bounds on the Step and Namespace Complexity of Renaming.

[BibT_eX]

[DOI]

SIAM J. Comput., 2019

Special issue on PODC 2015 and PODC 2016.

[BibT_eX]

[DOI]

Distributed Comput., 2019

Privatization-Safe Transactional Memories (Extended Version).

[BibT_eX]

[DOI]

Artem Khyzha

Alexey Gotsman

CoRR, 2019

Tracking in Order to Recover: Recoverable Lock-Free Data Structures.

[BibT_eX]

[DOI]

CoRR, 2019

Putting Strong Linearizability in Context: Preserving Hyperproperties in Programs that Use Concurrent Objects.

[BibT_eX]

[DOI]

CoRR, 2019

Privatization-Safe Transactional Memories.

[BibT_eX]

[DOI]

Artem Khyzha

Alexey Gotsman

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

Putting Strong Linearizability in Context: Preserving Hyperproperties in Programsthat Use Concurrent Objects.

[BibT_eX]

[DOI]

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

Shared memory and the Bakery algorithm.

[BibT_eX]

[DOI]

Proceedings of the Concurrency: the Works of Leslie Lamport, 2019

2018

Nontrivial and universal helping for wait-free queues and stacks.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 2018

Characterizing Transactional Memory Consistency Conditions Using Observational Refinement.

[BibT_eX]

[DOI]

J. ACM, 2018

Erratum: Limited-Use Atomic Snapshots with Polylogarithmic Step Complexity.

[BibT_eX]

[DOI]

J. ACM, 2018

Safe privatization in transactional memory.

[BibT_eX]

[DOI]

Proceedings of the 23rd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2018

Separating Lock-Freedom from Wait-Freedom.

[BibT_eX]

[DOI]

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

Nesting-Safe Recoverable Linearizability: Modular Constructions for Non-Volatile Memory.

[BibT_eX]

[DOI]

Ohad Ben-Baruch

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

2017

Limitations of Highly-Available Eventually-Consistent Data Stores.

[BibT_eX]

[DOI]

Adam Morrison

IEEE Trans. Parallel Distributed Syst., 2017

Poly-logarithmic adaptive algorithms require revealing primitives.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 2017

Special issue on DISC 2013, 2014 and PODC 2014.

[BibT_eX]

[DOI]

Distributed Comput., 2017

Simulating a Shared Register in a System that Never Stops Changing.

[BibT_eX]

[DOI]

CoRR, 2017

Remote Memory References at Block Granularity.

[BibT_eX]

[DOI]

Gili Yavneh

Proceedings of the 21st International Conference on Principles of Distributed Systems, 2017

Lower Bounds on the Amortized Time Complexity of Shared Objects.

[BibT_eX]

[DOI]

Proceedings of the 21st International Conference on Principles of Distributed Systems, 2017

2016

Lower Bounds for Restricted-Use Objects.

[BibT_eX]

[DOI]

SIAM J. Comput., 2016

Counting-based impossibility proofs for set agreement and renaming.

[BibT_eX]

[DOI]

Ami Paz

J. Parallel Distributed Comput., 2016

Special issue in memory of Berthold Vöcking.

[BibT_eX]

[DOI]

Distributed Comput., 2016

Lower Bound on the Step Complexity of Anonymous Binary Consensus.

[BibT_eX]

[DOI]

Ohad Ben-Baruch

Proceedings of the Distributed Computing - 30th International Symposium, 2016

Specification and Complexity of Collaborative Text Editing.

[BibT_eX]

[DOI]

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

2015

Practically stabilizing SWMR atomic memory in message-passing systems.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2015

Limited-Use Atomic Snapshots with Polylogarithmic Step Complexity.

[BibT_eX]

[DOI]

J. ACM, 2015

Simulating a Shared Register in an Asynchronous System that Never Stops Changing - (Extended Abstract).

[BibT_eX]

[DOI]

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

Trading Fences with RMRs and Separating Memory Models.

[BibT_eX]

[DOI]

Philipp Woelfel

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

Poly-Logarithmic Adaptive Algorithms Require Unconditional Primitives.

[BibT_eX]

[DOI]

Proceedings of the 19th International Conference on Principles of Distributed Systems, 2015

Safety and Deferred Update in Transactional Memory.

[BibT_eX]

[DOI]

Proceedings of the Transactional Memory. Foundations, Algorithms, Tools, and Applications, 2015

Directory Protocols for Distributed Transactional Memory.

[BibT_eX]

[DOI]

Vincent Gramoli

Proceedings of the Transactional Memory. Foundations, Algorithms, Tools, and Applications, 2015

Disjoint-Access Parallelism in Software Transactional Memory.

[BibT_eX]

[DOI]

Panagiota Fatourou

Proceedings of the Transactional Memory. Foundations, Algorithms, Tools, and Applications, 2015

2014

Impossibility Results for Distributed Computing

[BibT_eX]

[DOI]

Synthesis Lectures on Distributed Computing Theory, Morgan & Claypool Publishers, ISBN: 978-3-031-02010-0, 2014

Lower Bounds and Impossibility Results for Transactional Memory Computing.

[BibT_eX]

[DOI]

Bull. EATCS, 2014

Safety of Live Transactions in Transactional Memory: TMS is Necessary and Sufficient.

[BibT_eX]

[DOI]

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

Concurrent updates with RCU: search tree as an example.

[BibT_eX]

[DOI]

Maya Arbel

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

2013

A non-topological proof for the impossibility of k-set agreement.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

The Cost of Privatization in Software Transactional Memory.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 2013

Built-in Coloring for Highly-Concurrent Doubly-Linked Lists.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2013

An O(1)-barriers optimal RMRs mutual exclusion algorithm: extended abstract.

[BibT_eX]

[DOI]

Smadar Levy

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

A programming language perspective on transactional memory consistency.

[BibT_eX]

[DOI]

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

Upper bound on the complexity of solving hard renaming.

[BibT_eX]

[DOI]

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

Safety of Deferred Update in Transactional Memory.

[BibT_eX]

[DOI]

Proceedings of the IEEE 33rd International Conference on Distributed Computing Systems, 2013

2012

A Single-Version STM that Is Multi-Versioned Permissive.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2012

Transactional scheduling for read-dominated workloads.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 2012

Polylogarithmic concurrent data structures from monotone circuits.

[BibT_eX]

[DOI]

Keren Censor-Hillel

J. ACM, 2012

Announcement: best reviewer award 2011.

[BibT_eX]

[DOI]

Distributed Comput., 2012

Counting-Based Impossibility Proofs for Renaming and Set Agreement.

[BibT_eX]

[DOI]

Ami Paz

Proceedings of the Distributed Computing - 26th International Symposium, 2012

Lower bounds for restricted-use objects: extended abstract.

[BibT_eX]

[DOI]

Proceedings of the 24th ACM Symposium on Parallelism in Algorithms and Architectures, 2012

Early Deciding Synchronous Renaming in O( logf ) Rounds or Less.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2012

Faster than optimal snapshots (for a while): preliminary version.

[BibT_eX]

[DOI]

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

2011

Highly concurrent multi-word synchronization.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

Sharing memories, robustly.

[BibT_eX]

[DOI]

SIGACT News, 2011

Inherent Limitations on Disjoint-Access Parallel Implementations of Transactional Memory.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2011

The complexity of updating snapshot objects.

[BibT_eX]

[DOI]

Panagiota Fatourou

J. Parallel Distributed Comput., 2011

Structured Derivation of Semi-Synchronous Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing - 25th International Symposium, 2011

Pragmatic Self-stabilization of Atomic Memory in Message-Passing Systems.

[BibT_eX]

[DOI]

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

Laws of order: expensive synchronization in concurrent algorithms cannot be eliminated.

[BibT_eX]

[DOI]

Proceedings of the 38th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2011

Single-Version STMs Can Be Multi-version Permissive (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing and Networking - 12th International Conference, 2011

Invited Paper: The Inherent Complexity of Transactional Memory and What to Do about It.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing and Networking - 12th International Conference, 2011

2010

Time and Space Lower Bounds for Implementations Using k-CAS.

[BibT_eX]

[DOI]

IEEE Trans. Parallel Distributed Syst., 2010

Efficient and Robust Local Mutual Exclusion in Mobile Ad Hoc Networks.

[BibT_eX]

[DOI]

Alex Kogan

IEEE Trans. Mob. Comput., 2010

Packet-Mode Emulation of Output-Queued Switches.

[BibT_eX]

[DOI]

Isaac Keslassy

IEEE Trans. Computers, 2010

Lower Bounds for Randomized Consensus under a Weak Adversary.

[BibT_eX]

[DOI]

Keren Censor-Hillel

SIAM J. Comput., 2010

Combining shared-coin algorithms.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 2010

Robust Simulation of Shared Memory: 20 Years After.

[BibT_eX]

Bull. EATCS, 2010

Practically Stabilizing Atomic Memory

[BibT_eX]

[DOI]

CoRR, 2010

Transactional Contention Management as a Non-Clairvoyant Scheduling Problem.

[BibT_eX]

[DOI]

Algorithmica, 2010

The Cost of Privatization.

[BibT_eX]

[DOI]

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

Brief Announcement: Sharing Memory in a Self-stabilizing Manner.

[BibT_eX]

[DOI]

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

Fast Randomized Test-and-Set and Renaming.

[BibT_eX]

[DOI]

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

A Provably Starvation-Free Distributed Directory Protocol.

[BibT_eX]

[DOI]

Vincent Gramoli

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

Brief announcement: combine -- an improved directory-based consistency protocol.

[BibT_eX]

[DOI]

Vincent Gramoli

Proceedings of the SPAA 2010: Proceedings of the 22nd Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2010

Sequential verification of serializability.

[BibT_eX]

[DOI]

G. Ramalingam

Noam Rinetzky

Proceedings of the 37th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2010

Brief announcement: single-version permissive STM.

[BibT_eX]

[DOI]

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

The inherent complexity of transactional memory and what to do about it.

[BibT_eX]

[DOI]

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

2009

The complexity of obstruction-free implementations.

[BibT_eX]

[DOI]

J. ACM, 2009

Editorial: It's all about change.

[BibT_eX]

[DOI]

Distributed Comput., 2009

Brief Announcement: Transactional Scheduling for Read-Dominated Workloads.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing, 23rd International Symposium, 2009

Max registers, counters, and monotone circuits.

[BibT_eX]

[DOI]

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

2008

Needed: foundations for transactional memory.

[BibT_eX]

[DOI]

SIGACT News, 2008

Randomization Does Not Reduce the Average Delay in Parallel Packet Switches.

[BibT_eX]

[DOI]

SIAM J. Comput., 2008

Tight bounds for asynchronous randomized consensus.

[BibT_eX]

[DOI]

J. ACM, 2008

Partial snapshot objects.

[BibT_eX]

[DOI]

Rachid Guerraoui

Eric Ruppert

Proceedings of the SPAA 2008: Proceedings of the 20th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2008

A world of (Im) possibilities.

[BibT_eX]

[DOI]

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

Tight RMR lower bounds for mutual exclusion and other problems.

[BibT_eX]

[DOI]

Philipp Woelfel

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

Randomized consensus in expected O(n log n) individual work.

[BibT_eX]

[DOI]

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

2007

Concurrency and the Principle of Data Locality.

[BibT_eX]

[DOI]

IEEE Distributed Syst. Online, 2007

The power of DCAS: highly-concurrent software transactional memory.

[BibT_eX]

[DOI]

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

2006

The Inherent Queuing Delay of Parallel Packet Switches.

[BibT_eX]

[DOI]

IEEE Trans. Parallel Distributed Syst., 2006

Sharing Memory with Semi-byzantine Clients and Faulty Storage Servers.

[BibT_eX]

[DOI]

Amir Bar-Or

Parallel Process. Lett., 2006

Efficient adaptive collect using randomization.

[BibT_eX]

[DOI]

Distributed Comput., 2006

Adapting to Point Contention with Long-Lived Safe Agreement .

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2006

Synchronizing without locks is inherently expensive.

[BibT_eX]

[DOI]

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

The Complexity of Updating Multi-writer Snapshot Objects.

[BibT_eX]

[DOI]

Panagiota Fatourou

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

2005

Time and Space Lower Bounds for Implementations Using k-CAS.

[BibT_eX]

[DOI]

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

Computing with Reads and Writes in the Absence of Step Contention.

[BibT_eX]

[DOI]

Rachid Guerraoui

Petr Kouznetsov

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

Optimal Clock Synchronization Under Energy Constraints in Wireless Ad-Hoc Networks.

[BibT_eX]

[DOI]

Proceedings of the Principles of Distributed Systems, 9th International Conference, 2005

2004

Quantifying rollback propagation in distributed checkpointing.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 2004

The distribution of file transmission duration in the web.

[BibT_eX]

[DOI]

Ronit Nossenson

Int. J. Commun. Syst., 2004

Tight bounds for FEC-based reliable multicast.

[BibT_eX]

[DOI]

Hadas Shachnai

Inf. Comput., 2004

Efficient Adaptive Collect Using Randomization.

[BibT_eX]

[DOI]

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

Lower bounds for adaptive collect and related objects.

[BibT_eX]

[DOI]

Faith Ellen Fich

Yaniv Kaplan

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

The N-Burst/G/1 Model with Heavy-Tailed Service-Times Distribution.

[BibT_eX]

[DOI]

Ronit Nossenson

Proceedings of the 12th International Workshop on Modeling, 2004

Distributed computing - fundamentals, simulations, and advanced topics (2. ed.).

[BibT_eX]

Wiley series on parallel and distributed computing, Wiley, ISBN: 978-0-471-45324-6, 2004

2003

Information-Flow Models for Shared Memory with an Application to the PowerPC Architecture.

[BibT_eX]

[DOI]

Allon Adir

Gil Shurek

IEEE Trans. Parallel Distributed Syst., 2003

Algorithms adapting to point contention.

[BibT_eX]

[DOI]

J. ACM, 2003

Introduction.

[BibT_eX]

[DOI]

Distributed Comput., 2003

Understanding the Distribution of File Transmission Duration in the Web.

[BibT_eX]

[DOI]

Ronit Nossenson

Proceedings of the Twelfth International World Wide Web Conference - Posters, 2003

2002

The Combinatorial Structure of Wait-Free Solvable Tasks.

[BibT_eX]

[DOI]

SIAM J. Comput., 2002

Computing in Totally Anonymous Asynchronous Shared Memory Systems.

[BibT_eX]

[DOI]

Alla Gorbach

Shlomo Moran

Inf. Comput., 2002

An adaptive collect algorithm with applications.

[BibT_eX]

[DOI]

Eli Gafni

Distributed Comput., 2002

Adaptive and efficient mutual exclusion.

[BibT_eX]

[DOI]

Vita Bortnikov

Distributed Comput., 2002

Wait-Free n-Set Consensus When Inputs Are Restricted.

[BibT_eX]

[DOI]

Zvi Avidor

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

2001

Adaptive and Efficient Algorithms for Lattice Agreement and Renaming.

[BibT_eX]

[DOI]

SIAM J. Comput., 2001

Time Bounds for Decision Problems in the Presence of Timing Uncertainty and Failures.

[BibT_eX]

[DOI]

Taly Djerassi-Shintel

J. Parallel Distributed Comput., 2001

Improved implementations of binary universal operations.

[BibT_eX]

[DOI]

Eyal Dagan

J. ACM, 2001

2000

Efficient and Robust Sharing of Memory in Message-Passing Systems.

[BibT_eX]

[DOI]

J. Algorithms, 2000

Polynominal and Adaptive Long-Lived (2k-1)-Renaming.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing, 14th International Conference, 2000

Adaptive and efficient mutual exclusion (extended abstract).

[BibT_eX]

[DOI]

Vita Bortnikov

Proceedings of the Nineteenth Annual ACM Symposium on Principles of Distributed Computing, 2000

1999

Local Labeling and Resource Allocation Using Preprocessing.

[BibT_eX]

[DOI]

Hadas Shachnai

Tami Tamir

SIAM J. Comput., 1999

Long-Lived Renaming Made Adaptive.

[BibT_eX]

[DOI]

Proceedings of the Eighteenth Annual ACM Symposium on Principles of Distributed Computing, 1999

1998

Atomic Snapshots in O(n log n) Operations.

[BibT_eX]

[DOI]

SIAM J. Comput., 1998

A Correctness Condition for High-Performance Multiprocessors.

[BibT_eX]

[DOI]

SIAM J. Comput., 1998

Shared Memory Consistency Conditions for Nonsequential Execution: Definitions and Programming Strategies.

[BibT_eX]

[DOI]

SIAM J. Comput., 1998

Adaptive Wait-Free Algorithms for Lattice Agreement and Renaming (Extended Abstract).

[BibT_eX]

[DOI]

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

A Direct Lower Bound for k-Set Consensus.

[BibT_eX]

[DOI]

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

1997

Time-Adaptive Algorithms for Synchronization.

[BibT_eX]

[DOI]

Rajeev Alur

Gadi Taubenfeld

SIAM J. Comput., 1997

The Level of Handshake Required for Managing a Connection.

[BibT_eX]

[DOI]

Rinat Rappoport

Distributed Comput., 1997

IDABased Protocols for Reliable Multicast.

[BibT_eX]

Hadas Shachnai

Proceedings of the On Principles Of Distributed Systems, 1997

1996

Optimal Clock Synchronization under Different Delay Assumptions.

[BibT_eX]

[DOI]

Amir Herzberg

SIAM J. Comput., 1996

Limitations of Fast Consistency Conditions for Distributed Shared Memories.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1996

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

[BibT_eX]

[DOI]

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

Efficient and Robust Sharing of Memory in Message-Passing Systems (Extended Abstract).

[BibT_eX]

[DOI]

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

Universal Operations: Unary versus Binary (Extended Abstract).

[BibT_eX]

[DOI]

Eyal Dagan

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

1995

Sharing Memory Robustly in Message-Passing Systems.

[BibT_eX]

[DOI]

Amotz Bar-Noy

Danny Dolev

J. ACM, 1995

Connection Management Without Retaining Information.

[BibT_eX]

[DOI]

Shlomi Dolev

Inf. Comput., 1995

Atomic Snapshots Using Lattice Agreement.

[BibT_eX]

[DOI]

Maurice Herlihy

Distributed Comput., 1995

Counting Networks with Arbitrary Fan-Out.

[BibT_eX]

[DOI]

Eran Aharonson

Distributed Comput., 1995

Trade-offs between Message Delivery and Quiesce Times in Conection Management Protocols (Preliminary Report).

[BibT_eX]

[DOI]

Jon M. Kleinberg

Proceedings of the Third Israel Symposium on Theory of Computing and Systems, 1995

1994

Time Bounds for Real-Time Process Control in the Presence of Timing Uncertainty

[BibT_eX]

[DOI]

Inf. Comput., April, 1994

Sequential Consistency versus Linearizability.

[BibT_eX]

[DOI]

ACM Trans. Comput. Syst., 1994

Efficiency of Semisynchronous Versus.

[BibT_eX]

[DOI]

Marios Mavronicolas

Math. Syst. Theory, 1994

Are Wait-Free Algorithms Fast?

[BibT_eX]

[DOI]

Nir Shavit

J. ACM, 1994

Bounds on the Time to Reach Agreement in the Presence of Timing Uncertainty.

[BibT_eX]

[DOI]

J. ACM, 1994

Reliable Communication Over Unreliable Channels.

[BibT_eX]

[DOI]

J. ACM, 1994

The Level of Handshake Required for Establishing a Connection.

[BibT_eX]

[DOI]

Rinat Rappoport

Proceedings of the Distributed Algorithms, 8th International Workshop, 1994

Programming DEC-Alpha Based Multiprocessors the Easy Way (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the 6th Annual ACM Symposium on Parallel Algorithms and Architectures, 1994

1993

Atomic Snapshots of Shared Memory.

[BibT_eX]

[DOI]

J. ACM, 1993

Shared Memory Consistency Conditions for Non-Sequential Execution: Definitions and Programming Strategies.

[BibT_eX]

[DOI]

Proceedings of the 5th Annual ACM Symposium on Parallel Algorithms and Architectures, 1993

Atomic Snapshots in O(n log n) Operations (Preliminary Version).

[BibT_eX]

[DOI]

Proceedings of the Twelth Annual ACM Symposium on Principles of Distributed Computing, 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

1992

Using Mappings to Prove Timing Properties.

[BibT_eX]

[DOI]

Distributed Comput., 1992

Efficient Atomic Snapshots Using Lattice Agreement (Extended Abstract).

[BibT_eX]

[DOI]

Maurice Herlihy

Proceedings of the Distributed Algorithms, 6th International Workshop, 1992

A Correctness Condition for High-Performance Multiprocessors (Extended Abstract)

[BibT_eX]

[DOI]

Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 1992

1991

Better Computing on the Anonymous Ring.

[BibT_eX]

[DOI]

Marc Snir

J. Algorithms, 1991

Implementing FIFO Queus and Stacks (Extended Abstract).

[BibT_eX]

[DOI]

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

Sequential Consistency Versus Linearizability (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the 3rd Annual ACM Symposium on Parallel Algorithms and Architectures, 1991

1990

Renaming in an Asynchronous Environment

[BibT_eX]

[DOI]

J. ACM, July, 1990

Are Wait-Free Algorithms Fast? (Extended Abstract)

[BibT_eX]

[DOI]

Nir Shavit

Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990

1989

Efficient Elections in Chordal Ring Networks.

[BibT_eX]

[DOI]

Algorithmica, 1989

Bounded Polynomial Randomized Consensus.

[BibT_eX]

[DOI]

Danny Dolev

Nir Shavit

Proceedings of the Eighth Annual ACM Symposium on Principles of Distributed Computing, 1989

1988

Computing on an anonymous ring.

[BibT_eX]

[DOI]

Marc Snir

Manfred K. Warmuth

J. ACM, 1988

1987

סינכרוניות כנגד אסינכרוניות במערכות מבוזרות (Synchronism vs. asynchronism in distributed systems.).

[BibT_eX]

[DOI]

PhD thesis, 1987

Language Complexity on the Synchronous Anonymous Ring.

[BibT_eX]

[DOI]

Yishay Mansour

Theor. Comput. Sci., 1987

Constructing Efficient Election Algorithms from Efficient Traversal Algorithms.

[BibT_eX]

[DOI]