Hagit Attiya

According to our database1, Hagit Attiya authored at least 180 papers between 1984 and 2021.

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

Awards

ACM Fellow

ACM Fellow 2009, "For contributions to distributed and parallel computing.".

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
Specification and space complexity of collaborative text editing.
Theor. Comput. Sci., 2021

2020
Editorial: Special issue of PODC 2017 and DISC 2017.
Distributed Comput., 2020

Indistinguishability.
Commun. ACM, 2020

Store-Collect in the Presence of Continuous Churn with Application to Snapshots and Lattice Agreement.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2020

Tracking in Order to Recover - Detectable Recovery of Lock-Free Data Structures.
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.
Proceedings of the PODC '20: ACM Symposium on Principles of Distributed Computing, 2020

Optimal Resilience in Systems That Mix Shared Memory and Message Passing.
Proceedings of the 24th International Conference on Principles of Distributed Systems, 2020

Locally Solvable Tasks and the Limitations of Valency Arguments.
Proceedings of the 24th International Conference on Principles of Distributed Systems, 2020

Staleness and Local Progress in Transactional Memory.
Proceedings of the Networked Systems - 8th International Conference, 2020

Efficient Concurrent Execution of Smart Contracts in Blockchains Using Object-Based Transactional Memory.
Proceedings of the Networked Systems - 8th International Conference, 2020

2019
Emulating a Shared Register in a System That Never Stops Changing.
IEEE Trans. Parallel Distributed Syst., 2019

Bounds on the Step and Namespace Complexity of Renaming.
SIAM J. Comput., 2019

Special issue on PODC 2015 and PODC 2016.
Distributed Comput., 2019

Privatization-Safe Transactional Memories (Extended Version).
CoRR, 2019

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

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

Privatization-Safe Transactional Memories.
Proceedings of the 33rd International Symposium on Distributed Computing, 2019

Putting Strong Linearizability in Context: Preserving Hyperproperties in Programsthat Use Concurrent Objects.
Proceedings of the 33rd International Symposium on Distributed Computing, 2019

Shared memory and the Bakery algorithm.
Proceedings of the Concurrency: the Works of Leslie Lamport, 2019

2018
Nontrivial and universal helping for wait-free queues and stacks.
J. Parallel Distributed Comput., 2018

Characterizing Transactional Memory Consistency Conditions Using Observational Refinement.
J. ACM, 2018

Erratum: Limited-Use Atomic Snapshots with Polylogarithmic Step Complexity.
J. ACM, 2018

Safe privatization in transactional memory.
Proceedings of the 23rd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2018

Separating Lock-Freedom from Wait-Freedom.
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, 2018

Nesting-Safe Recoverable Linearizability: Modular Constructions for Non-Volatile Memory.
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, 2018

2017
Limitations of Highly-Available Eventually-Consistent Data Stores.
IEEE Trans. Parallel Distributed Syst., 2017

Poly-logarithmic adaptive algorithms require revealing primitives.
J. Parallel Distributed Comput., 2017

Special issue on DISC 2013, 2014 and PODC 2014.
Distributed Comput., 2017

Simulating a Shared Register in a System that Never Stops Changing.
CoRR, 2017

Remote Memory References at Block Granularity.
Proceedings of the 21st International Conference on Principles of Distributed Systems, 2017

Lower Bounds on the Amortized Time Complexity of Shared Objects.
Proceedings of the 21st International Conference on Principles of Distributed Systems, 2017

2016
Lower Bounds for Restricted-Use Objects.
SIAM J. Comput., 2016

Counting-based impossibility proofs for set agreement and renaming.
J. Parallel Distributed Comput., 2016

Special issue in memory of Berthold Vöcking.
Distributed Comput., 2016

Lower Bound on the Step Complexity of Anonymous Binary Consensus.
Proceedings of the Distributed Computing - 30th International Symposium, 2016

Specification and Complexity of Collaborative Text Editing.
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, 2016

2015
Practically stabilizing SWMR atomic memory in message-passing systems.
J. Comput. Syst. Sci., 2015

Limited-Use Atomic Snapshots with Polylogarithmic Step Complexity.
J. ACM, 2015

Simulating a Shared Register in an Asynchronous System that Never Stops Changing - (Extended Abstract).
Proceedings of the Distributed Computing - 29th International Symposium, 2015

Trading Fences with RMRs and Separating Memory Models.
Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, 2015

Poly-Logarithmic Adaptive Algorithms Require Unconditional Primitives.
Proceedings of the 19th International Conference on Principles of Distributed Systems, 2015

Safety and Deferred Update in Transactional Memory.
Proceedings of the Transactional Memory. Foundations, Algorithms, Tools, and Applications, 2015

Directory Protocols for Distributed Transactional Memory.
Proceedings of the Transactional Memory. Foundations, Algorithms, Tools, and Applications, 2015

Disjoint-Access Parallelism in Software Transactional Memory.
Proceedings of the Transactional Memory. Foundations, Algorithms, Tools, and Applications, 2015

2014
Impossibility Results for Distributed Computing
Synthesis Lectures on Distributed Computing Theory, Morgan & Claypool Publishers, 2014

Lower Bounds and Impossibility Results for Transactional Memory Computing.
Bull. EATCS, 2014

Safety of Live Transactions in Transactional Memory: TMS is Necessary and Sufficient.
Proceedings of the Distributed Computing - 28th International Symposium, 2014

Concurrent updates with RCU: search tree as an example.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2014

2013
A non-topological proof for the impossibility of k-set agreement.
Theor. Comput. Sci., 2013

The Cost of Privatization in Software Transactional Memory.
IEEE Trans. Computers, 2013

Built-in Coloring for Highly-Concurrent Doubly-Linked Lists.
Theory Comput. Syst., 2013

An O(1)-barriers optimal RMRs mutual exclusion algorithm: extended abstract.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2013

A programming language perspective on transactional memory consistency.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2013

Upper bound on the complexity of solving hard renaming.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2013

Safety of Deferred Update in Transactional Memory.
Proceedings of the IEEE 33rd International Conference on Distributed Computing Systems, 2013

2012
A Single-Version STM that Is Multi-Versioned Permissive.
Theory Comput. Syst., 2012

Transactional scheduling for read-dominated workloads.
J. Parallel Distributed Comput., 2012

Polylogarithmic concurrent data structures from monotone circuits.
J. ACM, 2012

Announcement: best reviewer award 2011.
Distributed Comput., 2012

Counting-Based Impossibility Proofs for Renaming and Set Agreement.
Proceedings of the Distributed Computing - 26th International Symposium, 2012

Lower bounds for restricted-use objects: extended abstract.
Proceedings of the 24th ACM Symposium on Parallelism in Algorithms and Architectures, 2012

Early Deciding Synchronous Renaming in O( logf ) Rounds or Less.
Proceedings of the Structural Information and Communication Complexity, 2012

Faster than optimal snapshots (for a while): preliminary version.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2012

2011
Highly concurrent multi-word synchronization.
Theor. Comput. Sci., 2011

Sharing memories, robustly.
SIGACT News, 2011

Inherent Limitations on Disjoint-Access Parallel Implementations of Transactional Memory.
Theory Comput. Syst., 2011

The complexity of updating snapshot objects.
J. Parallel Distributed Comput., 2011

Structured Derivation of Semi-Synchronous Algorithms.
Proceedings of the Distributed Computing - 25th International Symposium, 2011

Pragmatic Self-stabilization of Atomic Memory in Message-Passing Systems.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2011

Laws of order: expensive synchronization in concurrent algorithms cannot be eliminated.
Proceedings of the 38th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2011

Single-Version STMs Can Be Multi-version Permissive (Extended Abstract).
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.
Proceedings of the Distributed Computing and Networking - 12th International Conference, 2011

2010
Time and Space Lower Bounds for Implementations Using k-CAS.
IEEE Trans. Parallel Distributed Syst., 2010

Efficient and Robust Local Mutual Exclusion in Mobile Ad Hoc Networks.
IEEE Trans. Mob. Comput., 2010

Packet-Mode Emulation of Output-Queued Switches.
IEEE Trans. Computers, 2010

Lower Bounds for Randomized Consensus under a Weak Adversary.
SIAM J. Comput., 2010

Combining shared-coin algorithms.
J. Parallel Distributed Comput., 2010

Robust Simulation of Shared Memory: 20 Years After.
Bull. EATCS, 2010

Practically Stabilizing Atomic Memory
CoRR, 2010

Transactional Contention Management as a Non-Clairvoyant Scheduling Problem.
Algorithmica, 2010

The Cost of Privatization.
Proceedings of the Distributed Computing, 24th International Symposium, 2010

Brief Announcement: Sharing Memory in a Self-stabilizing Manner.
Proceedings of the Distributed Computing, 24th International Symposium, 2010

Fast Randomized Test-and-Set and Renaming.
Proceedings of the Distributed Computing, 24th International Symposium, 2010

A Provably Starvation-Free Distributed Directory Protocol.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2010

Brief announcement: combine -- an improved directory-based consistency protocol.
Proceedings of the SPAA 2010: Proceedings of the 22nd Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2010

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

Brief announcement: single-version permissive STM.
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.
Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, 2010

2009
The complexity of obstruction-free implementations.
J. ACM, 2009

Editorial: It's all about change.
Distributed Comput., 2009

Brief Announcement: Transactional Scheduling for Read-Dominated Workloads.
Proceedings of the Distributed Computing, 23rd International Symposium, 2009

Max registers, counters, and monotone circuits.
Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, 2009

2008
Needed: foundations for transactional memory.
SIGACT News, 2008

Randomization Does Not Reduce the Average Delay in Parallel Packet Switches.
SIAM J. Comput., 2008

Tight bounds for asynchronous randomized consensus.
J. ACM, 2008

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

A world of (Im) possibilities.
Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, 2008

Tight RMR lower bounds for mutual exclusion and other problems.
Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, 2008

Randomized consensus in expected O(n log n) individual work.
Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, 2008

2007
Concurrency and the Principle of Data Locality.
IEEE Distributed Syst. Online, 2007

The power of DCAS: highly-concurrent software transactional memory.
Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, 2007

2006
The Inherent Queuing Delay of Parallel Packet Switches.
IEEE Trans. Parallel Distributed Syst., 2006

Sharing Memory with Semi-byzantine Clients and Faulty Storage Servers.
Parallel Process. Lett., 2006

Efficient adaptive collect using randomization.
Distributed Comput., 2006

Adapting to Point Contention with Long-Lived Safe Agreement .
Proceedings of the Structural Information and Communication Complexity, 2006

Synchronizing without locks is inherently expensive.
Proceedings of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing, 2006

The Complexity of Updating Multi-writer Snapshot Objects.
Proceedings of the Distributed Computing and Networking, 8th International Conference, 2006

2005
Time and Space Lower Bounds for Implementations Using <i>k</i>-CAS.
Proceedings of the Distributed Computing, 19th International Conference, 2005

Computing with Reads and Writes in the Absence of Step Contention.
Proceedings of the Distributed Computing, 19th International Conference, 2005

Optimal Clock Synchronization Under Energy Constraints in Wireless Ad-Hoc Networks.
Proceedings of the Principles of Distributed Systems, 9th International Conference, 2005

2004
Quantifying rollback propagation in distributed checkpointing.
J. Parallel Distributed Comput., 2004

The distribution of file transmission duration in the web.
Int. J. Commun. Syst., 2004

Tight bounds for FEC-based reliable multicast.
Inf. Comput., 2004

Efficient Adaptive Collect Using Randomization.
Proceedings of the Distributed Computing, 18th International Conference, 2004

Lower bounds for adaptive collect and related objects.
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.
Proceedings of the 12th International Workshop on Modeling, 2004

Distributed computing - fundamentals, simulations, and advanced topics (2. ed.).
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.
IEEE Trans. Parallel Distributed Syst., 2003

Algorithms adapting to point contention.
J. ACM, 2003

Introduction.
Distributed Comput., 2003

Understanding the Distribution of File Transmission Duration in the Web.
Proceedings of the Twelfth International World Wide Web Conference - Posters, 2003

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

Computing in Totally Anonymous Asynchronous Shared Memory Systems.
Inf. Comput., 2002

An adaptive collect algorithm with applications.
Distributed Comput., 2002

Adaptive and efficient mutual exclusion.
Distributed Comput., 2002

Wait-Free n-Set Consensus When Inputs Are Restricted.
Proceedings of the Distributed Computing, 16th International Conference, 2002

2001
Adaptive and Efficient Algorithms for Lattice Agreement and Renaming.
SIAM J. Comput., 2001

Time Bounds for Decision Problems in the Presence of Timing Uncertainty and Failures.
J. Parallel Distributed Comput., 2001

Improved implementations of binary universal operations.
J. ACM, 2001

2000
Efficient and Robust Sharing of Memory in Message-Passing Systems.
J. Algorithms, 2000

Polynominal and Adaptive Long-Lived (2<i>k</i>-1)-Renaming.
Proceedings of the Distributed Computing, 14th International Conference, 2000

Adaptive and efficient mutual exclusion (extended abstract).
Proceedings of the Nineteenth Annual ACM Symposium on Principles of Distributed Computing, 2000

1999
Local Labeling and Resource Allocation Using Preprocessing.
SIAM J. Comput., 1999

Long-Lived Renaming Made Adaptive.
Proceedings of the Eighteenth Annual ACM Symposium on Principles of Distributed Computing, 1999

1998
Atomic Snapshots in O(n log n) Operations.
SIAM J. Comput., 1998

A Correctness Condition for High-Performance Multiprocessors.
SIAM J. Comput., 1998

Shared Memory Consistency Conditions for Nonsequential Execution: Definitions and Programming Strategies.
SIAM J. Comput., 1998

Adaptive Wait-Free Algorithms for Lattice Agreement and Renaming (Extended Abstract).
Proceedings of the Seventeenth Annual ACM Symposium on Principles of Distributed Computing, 1998

A Direct Lower Bound for <i>k</i>-Set Consensus.
Proceedings of the Seventeenth Annual ACM Symposium on Principles of Distributed Computing, 1998

1997
Time-Adaptive Algorithms for Synchronization.
SIAM J. Comput., 1997

The Level of Handshake Required for Managing a Connection.
Distributed Comput., 1997

IDABased Protocols for Reliable Multicast.
Proceedings of the On Principles Of Distributed Systems, 1997

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

Limitations of Fast Consistency Conditions for Distributed Shared Memories.
Inf. Process. Lett., 1996

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

Efficient and Robust Sharing of Memory in Message-Passing Systems (Extended Abstract).
Proceedings of the Distributed Algorithms, 10th International Workshop, 1996

Universal Operations: Unary versus Binary (Extended Abstract).
Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing, 1996

1995
Sharing Memory Robustly in Message-Passing Systems.
J. ACM, 1995

Connection Management Without Retaining Information.
Inf. Comput., 1995

Atomic Snapshots Using Lattice Agreement.
Distributed Comput., 1995

Counting Networks with Arbitrary Fan-Out.
Distributed Comput., 1995

Trade-offs between Message Delivery and Quiesce Times in Conection Management Protocols (Preliminary Report).
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
Inf. Comput., April, 1994

Sequential Consistency versus Linearizability.
ACM Trans. Comput. Syst., 1994

Efficiency of Semisynchronous Versus.
Math. Syst. Theory, 1994

Are Wait-Free Algorithms Fast?
J. ACM, 1994

Bounds on the Time to Reach Agreement in the Presence of Timing Uncertainty.
J. ACM, 1994

Reliable Communication Over Unreliable Channels.
J. ACM, 1994

The Level of Handshake Required for Establishing a Connection.
Proceedings of the Distributed Algorithms, 8th International Workshop, 1994

Programming DEC-Alpha Based Multiprocessors the Easy Way (Extended Abstract).
Proceedings of the 6th Annual ACM Symposium on Parallel Algorithms and Architectures, 1994

1993
Atomic Snapshots of Shared Memory.
J. ACM, 1993

Shared Memory Consistency Conditions for Non-Sequential Execution: Definitions and Programming Strategies.
Proceedings of the 5th Annual ACM Symposium on Parallel Algorithms and Architectures, 1993

Atomic Snapshots in O(n log n) Operations (Preliminary Version).
Proceedings of the Twelth Annual ACM Symposium on Principles of Distributed Computing, 1993

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

1992
Using Mappings to Prove Timing Properties.
Distributed Comput., 1992

Efficient Atomic Snapshots Using Lattice Agreement (Extended Abstract).
Proceedings of the Distributed Algorithms, 6th International Workshop, 1992

A Correctness Condition for High-Performance Multiprocessors (Extended Abstract)
Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 1992

1991
Better Computing on the Anonymous Ring.
J. Algorithms, 1991

Implementing FIFO Queus and Stacks (Extended Abstract).
Proceedings of the Distributed Algorithms, 5th International Workshop, 1991

Sequential Consistency Versus Linearizability (Extended Abstract).
Proceedings of the 3rd Annual ACM Symposium on Parallel Algorithms and Architectures, 1991

1990
Renaming in an Asynchronous Environment
J. ACM, July, 1990

Are Wait-Free Algorithms Fast? (Extended Abstract)
Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990

1989
Efficient Elections in Chordal Ring Networks.
Algorithmica, 1989

Bounded Polynomial Randomized Consensus.
Proceedings of the Eighth Annual ACM Symposium on Principles of Distributed Computing, 1989

1988
Computing on an anonymous ring.
J. ACM, 1988

1987
Language Complexity on the Synchronous Anonymous Ring.
Theor. Comput. Sci., 1987

Constructing Efficient Election Algorithms from Efficient Traversal Algorithms.
Proceedings of the Distributed Algorithms, 1987

Achievable Cases in an Asynchronous Environment (Extended Abstract)
Proceedings of the 28th Annual Symposium on Foundations of Computer Science, 1987

1984
Asynchronous Byzantine Consensus.
Proceedings of the Third Annual ACM Symposium on Principles of Distributed Computing, 1984

Towards a Data Model for Artificial Intelligence Applications.
Proceedings of the First International Conference on Data Engineering, 1984


  Loading...