- Lower Bounds for Randomized Consensus under a Weak Adversary
- Adaptive LongLived Renaming Using Bounded Memory
- The Cost of Obstruction-Freedom Hagit Attiya Technion
- A Direct Lower Bound for kSet Consensus Hagit Attiya
- Tight Bounds for Asynchronous Randomized Consensus (Preliminary Version)
- WaitFree nset Consensus when Inputs are Hagit Attiya and Zvi Avidor
- Built-in Coloring for Highly-Concurrent
- [22] C. Dwork, M. Herlihy, and O. Waarts. Bounded round numbers. In Proceedings of the 12th Annual ACM Symposium on Principles of Distributed Computing, pages 53--64, 1993.
- Polynomial and Adaptive Longlived (2k \Gamma 1)Renaming ?
- Max Registers, Counters, and Monotone Circuits (Preliminary Version)
- \Omega\Gamma1/1 n= log log n). We also thank Amotz BarNoy for helpful discussions. An anony mous referee provided many comments that improved the presentation.
- [18] K. Gharachorloo. electronic mail message, January 11 1994. [19] P. Gibbons and M. Merritt. Specifying NonBlocking Shared Memories. In Proc. 4th ACM
- 5. E. Borowsky and E. Gafni, ``Immediate atomic snapshots and fast renaming,'' in Proceedings of the 12th Annual ACM Symposium on Principles of Distributed Com
- This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research
- that any implementation of binary LL/SC from unary LL/SC will have to incur nonconstant over
- September 2007 (vol. 8, no. 9), art. no. 0709-mds2007090003 1541-4922 2007 IEEE
- Efficient Adaptive Collect using Randomization Hagit Attiya1
- 2004July Lower Bounds for Adaptive Collect and Related Objects / Attiya, Fich and Kaplan
- The Cost of Privatization Hagit Attiya1,2
- LongLived Renaming Made Adaptive (Extended Abstract)
- The N-Burst/G/1 model with heavy-tailed service-times distribution Ronit Nossenson and Hagit Attiya
- [6] R. Gawlick, R. Segala, J. SgaardAndersen, N. Lynch, ``Liveness in timed and untimed systems,'' Proc. 21st In
- Proof: Let S be the number of complete (m \Gamma 1)simplexes in K m (colored with f0; : : : ; m \Gamma 1g), where the (m \Gamma 1)simplexes in each msimplex are considered separately, and counted as
- Synchronizing without Locks is Inherently Expensive Hagit Attiya
- The Complexity of Updating Multi-writer Snapshot Objects
- Fast Randomized Test-and-Set and Renaming Dan Alistarh1
- Packet-Mode Emulation of Output-Queued Hagit Attiya, David Hay and Isaac Keslassy Member, IEEE
- Adaptive and Efficient Mutual Exclusion \Lambda [Extended Abstract]
- Lower Bounds for Adaptive Collect and Related Objects (Extended Abstract)
- Algorithm 5 Reflector for linear lattice agreement. Procedure reflector(view V, entrance i)
- Tight Bounds for Asynchronous
- Builtin Coloring for HighlyConcurrent DoublyLinked Lists # (Preliminary Version)
- Transactional Contention Management as a Non-Clairvoyant Scheduling Problem
- Transactional Scheduling for Read-Dominated Hagit Attiya and Alessia Milani
- Computing with Reads and Writes in the Absence of Step Contention
- Distributed Computing manuscript No. (will be inserted by the editor)
- Incremental Calculation for Fully Adaptive Hagit Attiya and Idan Zach
- DISC, September 2005 1 Time and Space Lower Bounds
- This lemma, in turn, can be used (within an induction) to prove that for every k, 0 k log N \Gamma 1, there exists an execution of 2 k+1 processes with k
- Distributed Computing manuscript No. (will be inserted by the editor)
- Time Bounds for Decision Problems in the Presence of Timing Uncertainty and Failures 1
- ADAPTIVE AND EFFICIENT ALGORITHMS FOR LATTICE AGREEMENT AND RENAMING \Lambda
- A Polynomial Adaptive Algorithm for LongLived (2k \Gamma 1)Renaming \Lambda
- Builtin Coloring for HighlyConcurrent DoublyLinked Lists
- Clearly, fi 0 :p j fi. It can easily be shown that p j distinguishes between fi and fi 0 , and therefore,
- Sharing Memory with SemiByzantine Clients and Faulty Storage Servers Hagit Attiya
- Adapting to Point Contention with Long-Lived Safe Agreement
- June 2003 Adaptive Algorithms / Hagit Attiya 1 Algorithms that Adapt toAlgorithms that Adapt to
- ROBUST SIMULATION OF SHARED MEMORY: 20 YEARS AFTER
- Computer-Assisted Construction of Efficient Concurrent Algorithms Martin Vechev, Eran Yahav, Maged Michael, Hagit Attiya, Greta Yorsh
- Single-Version STMs can be Multi-Version Permissive (Extended Abstract)
- A Provably Starvation-Free Distributed Directory Protocol
- Partial Snapshot Objects Hagit Attiya
- Packet-Mode Emulation of Output-Queued Switches Hagit Attiya
- Evaluating Self-Similar Processes for Modeling Web Servers Ronit Nossenson
- Fully Adaptive Snapshots Hagit Attiya and Idan Zach
- Highly-Concurrent Multi-Word Synchronization (Extended Abstract)
- Noname manuscript No. (will be inserted by the editor)
- Inherent Limitations on Disjoint-Access Parallel Implementations of Transactional Memory
- Lower Bounds for Randomized Consensus under a Weak Adversary
- Transactional Contention Management as a Non-Clairvoyant Scheduling Problem
- Transactional Contention Management as a Non-Clairvoyant Scheduling
- Time and Space Lower Bounds for Implementations Using k-CAS
- Efficient and Robust Local Mutual Exclusion in Mobile Ad Hoc Networks
- Randomization does not Reduce the Average Delay in Parallel Packet Switches
- Sharing Memory with semi-Byzantine Clients and
- THE INHERENT QUEUING DELAY OF PARALLEL PACKET SWITCHES
- The Distribution of File Transmission Duration in the Web Ronit Nossenson
- Needed: Foundations for Transactional Memory Hagit Attiya
- Built-in Coloring for Highly-Concurrent Doubly-Linked Lists (Preliminary Version)
- Adapting to Point Contention with Long-Lived Adaptive
- Improved Implementations of Binary Universal Hagit Attiya and Eyal Dagan
- Brief Announcement: Single-Version Permissive STM Hagit Attiya
- Combining Shared Coin Algorithms James Aspnes
- A non-topological proof for the impossibility of k-set agreement
- Structured Derivation of Semi-Synchronous Algorithms