Hagit Attiya
#58,293
Most Influential Person Now
Israeli computer scientist
Hagit Attiya's AcademicInfluence.com Rankings
Hagit Attiyacomputer-science Degrees
Computer Science
#2130
World Rank
#2213
Historical Rank
Distributed Computing
#6
World Rank
#6
Historical Rank
Database
#7209
World Rank
#7457
Historical Rank
Download Badge
Computer Science
Why Is Hagit Attiya Influential?
(Suggest an Edit or Addition)According to Wikipedia, Hagit Attiya is an Israeli computer scientist who holds the Harry W. Labov and Charlotte Ullman Labov Academic Chair of Computer Science at the Technion – Israel Institute of Technology in Haifa, Israel. Her research is in the area of distributed computing.
Hagit Attiya's Published Works
Number of citations in a given year to any of this author's works
Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author
Published Works
- Distributed Computing: Fundamentals, Simulations and Advanced Topics (1998) (971)
- Atomic snapshots of shared memory (1990) (425)
- Sharing memory robustly in message-passing systems (1990) (359)
- Renaming in an asynchronous environment (1990) (329)
- Sequential consistency versus linearizability (1994) (275)
- Sharing memory robustly in message-passing systems (1995) (268)
- Atomic snapshots of shared memory (1993) (146)
- Computing on an anonymous ring (1985) (142)
- Atomic snapshots in O(n log n) operations (1993) (134)
- Laws of order: expensive synchronization in concurrent algorithms cannot be eliminated (2011) (128)
- Computing on an anonymous ring (1988) (116)
- Using mappings to prove timing properties (1990) (111)
- Are wait-free algorithms fast? (1990) (100)
- Bounds on the time to reach agreement in the presence of timing uncertainty (1991) (95)
- Distributed computing - fundamentals, simulations, and advanced topics (2. ed.) (2004) (92)
- Inherent Limitations on Disjoint-Access Parallel Implementations of Transactional Memory (2009) (91)
- Achievable cases in an asynchronous environment (1987) (86)
- The Combinatorial Structure of Wait-Free Solvable Tasks (2002) (80)
- Concurrent updates with RCU: search tree as an example (2014) (78)
- Adaptive and Efficient Algorithms for Lattice Agreement and Renaming (2002) (78)
- Long-lived renaming made adaptive (1999) (75)
- Computing in Totally Anonymous Asynchronous Shared Memory Systems (1998) (73)
- Reliable communication over unreliable channels (1994) (72)
- Atomic snapshots using lattice agreement (1995) (69)
- Limitations of Highly-Available Eventually-Consistent Data Stores (2015) (68)
- Transactional Contention Management as a Non-Clairvoyant Scheduling Problem (2010) (67)
- Algorithms adapting to point contention (2003) (66)
- An adaptive collect algorithm with applications (2002) (66)
- A Correctness Condition for High-Performance Multiprocessors (1998) (65)
- Counting networks with arbitrary fan-out (1992) (62)
- Transactional scheduling for read-dominated workloads (2009) (60)
- Better Computing on the Anonymous Ring (1988) (59)
- Time bounds for real-time process control in the presence of timing uncertainty (1989) (58)
- Tight RMR lower bounds for mutual exclusion and other problems (2008) (57)
- Tight bounds for asynchronous randomized consensus (2007) (56)
- Specification and Complexity of Collaborative Text Editing (2016) (55)
- Bounded polynomial randomized consensus (1989) (53)
- The complexity of obstruction-free implementations (2009) (52)
- Optimal clock synchronization under different delay assumptions (1993) (52)
- Fast Randomized Test-and-Set and Renaming (2010) (52)
- Computing with Reads and Writes in the Absence of Step Contention (2005) (46)
- Information-Flow Models for Shared Memory with an Application to the PowerPC Architecture (2003) (45)
- Polylogarithmic concurrent data structures from monotone circuits (2012) (43)
- Impossibility Results for Distributed Computing (2014) (43)
- Asynchronous Byzantine consensus (1984) (43)
- Adaptive and efficient mutual exclusion (2002) (43)
- Limitations of Fast Consistency Conditions for Distributed Shared Memories (1996) (42)
- Lower bounds for randomized consensus under a weak adversary (2008) (42)
- Shared memory consistency conditions for non-sequential execution: definitions and programming strategies (1993) (42)
- A correctness condition for high-performance multiprocessors (extended abstract) (1992) (41)
- Efficient adaptive collect using randomization (2004) (41)
- Adaptive wait-free algorithms for lattice agreement and renaming (extended abstract) (1998) (41)
- Partial snapshot objects (2008) (40)
- Universal operations: unary versus binary (1996) (39)
- Nesting-Safe Recoverable Linearizability: Modular Constructions for Non-Volatile Memory (2018) (38)
- Polynominal and Adaptive Long-Lived (2k-1)-Renaming (2000) (35)
- Efficient and Robust Sharing of Memory in Message-Passing Systems (2000) (34)
- Time-adaptive algorithms for synchronization (1994) (33)
- A Provably Starvation-Free Distributed Directory Protocol (2010) (33)
- Single-Version STMs Can Be Multi-version Permissive (Extended Abstract) (2011) (32)
- Robust Simulation of Shared Memory: 20 Years After (2010) (32)
- Counting-Based Impossibility Proofs for Renaming and Set Agreement (2012) (30)
- Bounds on the time to reach agreement in the presence of timing uncertainty (1994) (29)
- Wiley Series on Parallel and Distributed Computing (2004) (27)
- Efficient and Robust Local Mutual Exclusion in Mobile Ad Hoc Networks (2008) (27)
- Max registers, counters, and monotone circuits (2009) (26)
- A programming language perspective on transactional memory consistency (2013) (25)
- Transactional contention management as a non-clairvoyant scheduling problem (2006) (24)
- Efficient Atomic Snapshots Using Lattice Agreement (Extended Abstract) (1992) (24)
- Built-in Coloring for Highly-Concurrent Doubly-Linked Lists (2006) (23)
- Practically stabilizing SWMR atomic memory in message-passing systems (2015) (22)
- Sharing memory with semi-Byzantine clients and faulty storage servers (2003) (22)
- Wait-Free n-Set Consensus When Inputs Are Restricted (2002) (22)
- Quantifying rollback propagation in distributed checkpointing (2001) (21)
- Safety of Deferred Update in Transactional Memory (2013) (21)
- Packet-Mode Emulation of Output-Queued Switches (2006) (21)
- Adaptive and efficient mutual exclusion (extended abstract) (2000) (21)
- Improved implementations of binary universal operations (2001) (21)
- Safety of Live Transactions in Transactional Memory: TMS is Necessary and Sufficient (2014) (21)
- A Single-Version STM that Is Multi-Versioned Permissive (2012) (21)
- Programming DEC-Alpha based multiprocessors the easy way (extended abstract) (1994) (21)
- Time and Space Lower Bounds for Implementations Using k-CAS (2005) (20)
- Shared Memory Consistency Conditions for Nonsequential Execution: Definitions and Programming Strategies (1998) (20)
- Indistinguishability (2020) (20)
- A non-topological proof for the impossibility of k-set agreement (2011) (19)
- Sequential verification of serializability (2010) (19)
- Tight RMR lower bounds for mutual exclusion and other problems (2008) (18)
- Tight bounds for asynchronous randomized consensus (2008) (18)
- Simulating a Shared Register in an Asynchronous System that Never Stops Changing - (Extended Abstract) (2015) (18)
- Needed: foundations for transactional memory (2008) (18)
- Time Bounds for Decision Problems in the Presence of Timing Uncertainty and Failures (1993) (17)
- Adaptive Long-Lived Renaming with Read and Write Operations (1999) (17)
- Connection management without retaining information (1995) (16)
- Lower bounds for adaptive collect and related objects (2004) (16)
- Adaptive long-lived renaming using bounded memory (1999) (16)
- Sequential consistency versus linearizability (extended abstract) (1991) (16)
- Putting Strong Linearizability in Context: Preserving Hyperproperties in Programs that Use Concurrent Objects (2019) (15)
- Nontrivial and Universal Helping for Wait-Free Queues and Stacks (2018) (15)
- Randomized consensus in expected O(n log n) individual work (2008) (14)
- Pragmatic Self-stabilization of Atomic Memory in Message-Passing Systems (2011) (14)
- The Level of Handshake Required for Establishing a Connection (1994) (14)
- Highly concurrent multi-word synchronization (2011) (13)
- Upper bound on the complexity of solving hard renaming (2013) (13)
- Synchronizing without locks is inherently expensive (2006) (13)
- Efficient elections in chordal ring networks (1989) (12)
- Limited-Use Atomic Snapshots with Polylogarithmic Step Complexity (2015) (12)
- Language Complexity on the Synchronous Anonymous Ring (1987) (11)
- The N-burst/G/1 model with heavy-tailed service-times distribution (2004) (11)
- The Combinatorial Structure of Wait-free Solvable Tasks (Extended Abstract) (1996) (11)
- The Cost of Privatization (2010) (10)
- Local Labeling and Resource Allocation Using Preprocessing (1994) (10)
- The distribution of file transmission duration in the web (2004) (10)
- Optimal Clock Synchronization Under Energy Constraints in Wireless Ad-Hoc Networks (2005) (10)
- The complexity of updating multi-writer snapshot objects (2006) (10)
- Tracking in Order to Recover: Recoverable Lock-Free Data Structures (2019) (9)
- Bounds on the Step and Namespace Complexity of Renaming (2019) (9)
- Combining shared-coin algorithms (2010) (9)
- Safe privatization in transactional memory (2018) (9)
- Emulating a Shared Register in a System That Never Stops Changing (2017) (9)
- Directory Protocols for Distributed Transactional Memory (2015) (9)
- The Cost of Privatization in Software Transactional Memory (2013) (8)
- Trade-offs between message delivery and quiesce times in connection management protocols (1995) (8)
- Tracking in Order to Recover - Detectable Recovery of Lock-Free Data Structures (2019) (8)
- Efficiency of semisynchronous versus asynchronous networks (1994) (8)
- R EL STM : A Proactive Transactional Memory Scheduler ∗ (2013) (8)
- Early Deciding Synchronous Renaming in O( logf ) Rounds or Less (2012) (8)
- COMBINE: An Improved Directory-Based Consistency Protocol (2010) (7)
- The inherent complexity of transactional memory and what to do about it (2010) (7)
- Locally Solvable Tasks and the Limitations of Valency Arguments (2020) (7)
- Store-Collect in the Presence of Continuous Churn with Application to Snapshots and Lattice Agreement (2020) (7)
- An O(1)-barriers optimal RMRs mutual exclusion algorithm: extended abstract (2013) (7)
- Adapting to Point Contention with Long-Lived Safe Agreement (2006) (7)
- Randomization does not reduce the average delay in parallel packet switches (2005) (6)
- The Inherent Queuing Delay of Parallel Packet Switches (2004) (6)
- Remote Memory References at Block Granularity (2017) (6)
- Highly-Concurrent Multi-word Synchronization (2008) (6)
- Faster than optimal snapshots (for a while): preliminary version (2012) (6)
- The distribution of file transmission duration in the web: Research Articles (2004) (6)
- The complexity of updating snapshot objects (2011) (6)
- A direct lower bound for k-set consensus (1998) (6)
- Lower bounds for restricted-use objects: extended abstract (2012) (6)
- Faster than Optimal Snapshots ( for a While ) (2012) (5)
- Detectable recovery of lock-free data structures (2022) (5)
- Lower Bounds and Impossibility Results for Transactional Memory Computing (2014) (5)
- Implementing FIFO Queus and Stacks (Extended Abstract) (1991) (5)
- Lower Bounds for Restricted-Use Objects (2016) (5)
- Optimal Clock Synchronization under Different Delay Assumptions (Preliminary Version). (1993) (5)
- Built-in Coloring for Highly-Concurrent Doubly-Linked Lists (2012) (4)
- Concurrency and the Principle of Data Locality (2007) (4)
- Efficient and Robust Sharing of Memory in Message-Passing Systems (Extended Abstract) (1996) (4)
- Counting-based impossibility proofs for set agreement and renaming (2016) (4)
- Brief Announcement: Sharing Memory in a Self-stabilizing Manner (2010) (4)
- Structured Derivation of Semi-Synchronous Algorithms (2011) (4)
- Assessing the Use Cases of Persistent Memory in High-Performance Scientific Computing (2021) (4)
- Disjoint-Access Parallelism in Software Transactional Memory (2015) (4)
- Optimal Resilience in Systems that Mix Shared Memory and Message Passing (2020) (3)
- Impossibility of Strongly-Linearizable Message-Passing Objects via Simulation by Single-Writer Registers (2021) (3)
- Achievable Cases in an Asynchronous Environment (Extended Abstract) (1987) (3)
- Characterizing Transactional Memory Consistency Conditions Using Observational Refinement (2017) (3)
- Specification and space complexity of collaborative text editing (2020) (3)
- Invited Paper: The Inherent Complexity of Transactional Memory and What to Do about It (2011) (3)
- Implementing FIFO queues and stacks (1991) (3)
- The power of DCAS: highly-concurrent software transactional memory (2007) (3)
- Transactions are Back—but How Di erent They Are? Relating STM and Databases Consistency Conditions (Preliminary Version) (2012) (3)
- Flat-Combining-Based Persistent Data Structures for Non-volatile Memory (2020) (2)
- Brief announcement: combine -- an improved directory-based consistency protocol (2010) (2)
- Linearizable Implementations Suffice for Termination of Randomized Concurrent Programs (2021) (2)
- Constructing Efficient Election Algorithms from Efficient Traversal Algorithms (1987) (2)
- The level of handshake required for managing a connection (1997) (2)
- Tight bounds for FEC-based reliable multicast (2004) (2)
- Brief Announcement: Transactional Scheduling for Read-Dominated Workloads (2009) (2)
- Trading Fences with RMRs and Separating Memory Models (2015) (2)
- Towards a data model for artificial intelligence applications (1984) (1)
- Proceedings of the Sixteenth Annual ACM Symposium on Principles of Distributed Computing, Santa Barbara, California, USA, August 21-24, 1997 (1997) (1)
- Announcement: best reviewer award 2011 (2012) (1)
- MIT / LCS / TM-412 . c USING MAPPINGS TO PROVE TIMING PROPERTIES (1)
- Poly-logarithmic adaptive algorithms require revealing primitives (2017) (1)
- Brief announcement: single-version permissive STM (2010) (1)
- Safety and Deferred Update in Transactional Memory (2015) (1)
- Folding of Hyperbolic Manifolds (2012) (1)
- Theory of Real-Time Systems — Project Survey (1991) (1)
- Distributed Shared Memory (2004) (1)
- Erratum: Limited-Use Atomic Snapshots with Polylogarithmic Step Complexity (2018) (1)
- Basic Algorithms in Message‐Passing Systems (2004) (1)
- Practically Stabilizing Atomic Memory (2010) (1)
- Leader Election in Rings (2004) (1)
- Causality and Time (2004) (1)
- Incremental Calculation for Fully Adaptive Algorithms (2003) (1)
- Technical perspectiveDistributing your data and having it, too (2008) (1)
- Separating Lock-Freedom from Wait-Freedom (2018) (1)
- Fault‐Tolerant Clock Synchronization (2004) (1)
- Problems Solvable in Asynchronous Systems (2004) (0)
- Computational Power of low-resource distributed systems: • Jukka Suomela: "Survey of Local Algorithms", Journal ACM Computing Surveys, 2013. (2013) (0)
- 2011 Edsger W. Dijkstra Prize in Distributed Computing Sharing Memory Robustly in Message-passing Systems (2011) (0)
- FROM RINGS TO COMPLETE GRAPHS · e ( nlogn ) TO e ( n ) DISTRIBUTED LEADER ELECTI . ON (2012) (0)
- Stabilizing Sharing Memory Robustly in Message Passing ( Extended Abstract ) (2010) (0)
- Lower Bound on the Step Complexity of Anonymous Binary Consensus (2016) (0)
- Faithful Simulation of Randomized BFT Protocols on Block DAGs (2023) (0)
- Editorial: Special issue of PODC 2017 and DISC 2017 (2020) (0)
- Max Registers, Counters, and Monotone Circuits (Preliminary Version) (2009) (0)
- Implementing FIFO Queues and (1991) (0)
- Staleness and Local Progress in Transactional Memory (2020) (0)
- Special issue on PODC 2020 (2022) (0)
- NVM-ESR: Using Non-Volatile Memory in Exact State Reconstruction of Preconditioned Conjugate Gradient (2022) (0)
- On folding of fuzzy dynamical chaotic manifold (2008) (0)
- Erratum (2018) (0)
- Shared memory and the Bakery algorithm (2019) (0)
- GRAPH OF SIMPLICIAL COMPLEXS (2012) (0)
- Evaluating Web Server Performance with an Extension of the N-burst Model (2011) (0)
- Privatization-Safe Transactional Memories (Extended Version) (2019) (0)
- Introduction (2003) (0)
- Special issue in memory of Berthold Vöcking (2016) (0)
- A world of (Im) possibilities (2008) (0)
- Wait‐Free Simulations of Arbitrary Objects (2004) (0)
- Solving Consensus in Eventually Stable Systems (2004) (0)
- RETRACTION AND NEIGHBORHOOD RETRACTION OF FUZZY DYNAMICAL TOPOLOGICAL SPACES AND THEIR FOLDINGS (2013) (0)
- Brief Announcement: Collect in the Presence of Continuous Churn with Application to Snapshots and Lattice Agreement (2020) (0)
- ON GRAPHS AND TOPOLOGICAL SPACES (2014) (0)
- Distributed computing: (2019) (0)
- Editorial: Special issue of PODC 2017 and DISC 2017 (2020) (0)
- Special issue on DISC 2013, 2014 and PODC 2014 (2017) (0)
- Special issue on DISC 2019 (2023) (0)
- Editorial: It’s all about change (2009) (0)
- Poly-Logarithmic Adaptive Algorithms Require Unconditional Primitives (2015) (0)
- D C ] 1 0 A ug 2 01 7 Simulating a Shared Register in a System that Never Stops Changing ∗ (2018) (0)
- Universal Operations: Unary versus Binary (Extended Abstract). (1996) (0)
- Trade-offs between Message Delivery and Quiesce Times in Conection Management Protocols (Preliminary Report). (1995) (0)
- Tight Bounds for Asynchronous Randomized Consensus ∗ ( Preliminary Version ) (2007) (0)
- Secure Multi-party Computation Dedication a Warning (1998) (0)
- Asynchronous Fully-Decentralized SGD in the Cluster-Based Model (2022) (0)
- Special issue on DISC 2020 (2022) (0)
- Implementing FIFO Queues and ( EXTENDED (0)
- 2021 Principles of Distributed Computing Doctoral Dissertation Award (2021) (0)
- Fault‐Tolerant Simulations of Read/Write Objects (2004) (0)
- Fast Wait-free Algorithms for Lattice Agreement and Renaming (1999) (0)
- The Step Complexity of Multidimensional Approximate Agreement (2022) (0)
- סינכרוניות כנגד אסינכרוניות במערכות מבוזרות (Synchronism vs. asynchronism in distributed systems.) (1987) (0)
- Special issue on PODC 2018 and DISC 2018 (2021) (0)
- A Single-Version STM that Is Multi-Versioned Permissive (2012) (0)
- Using Mappings to Prove Timing Properties* (EXTENDED ABSTRACT) (1990) (0)
- Acknowledgments: We Thank (2007) (0)
- Topological Characterization of Task Solvability in General Models of Computation (2023) (0)
- Recoverable and Detectable Fetch&Add (2021) (0)
- Special issue on PODC 2019 (2021) (0)
- Computer-Assisted Construction of Efficient Concurrent Algorithms (2008) (0)
- Session details: Session 4 (2013) (0)
- Sharing memories, robustly (2011) (0)
- Special issue on DISC 2013, 2014 and PODC 2014 (2017) (0)
- Special issue in memory of Berthold Vöcking (2016) (0)
- Lower Bounds on the Amortized Time Complexity of Shared Objects (2017) (0)
- Efficient and Robust Local Mutual Exclusion in Mobile Ad Hoc Networks ( Extended (2008) (0)
- Fault‐Tolerant Consensus (2004) (0)
- Mutual Exclusion in Shared Memory (2004) (0)
- J ul 2 01 0 Practically Stabilizing Atomic Memory ( Extended Abstract ) (2010) (0)
- Privatization-Safe Transactional Memories (2019) (0)
- IDABased Protocols for Reliable Multicast (1997) (0)
- Randomization does not Reduce the Queuing Delay of Parallel Packet Switches (2008) (0)
- Blunting an Adversary Against Randomized Concurrent Programs with Linearizable Implementations (2021) (0)
- A Formal Model for Simulations (2004) (0)
- Recovery of Distributed Iterative Solvers for Linear Systems Using Non-Volatile RAM (2022) (0)
- Improving the Fault Tolerance of Algorithms (2004) (0)
- Announcement: best reviewer award 2011 (2012) (0)
- Special issue on PODC 2015 and PODC 2016 (2019) (0)
- Broadcast and Multicast (2004) (0)
- Separating lock-freedom from wait-freedom at every level of the consensus hierarchy (2022) (0)
- The Cost of Obstruction-Freedom ∗ (2007) (0)
This paper list is powered by the following services:
Other Resources About Hagit Attiya
What Schools Are Affiliated With Hagit Attiya?
Hagit Attiya is affiliated with the following schools:
