Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Shavit, Nir - School of Mathematical Sciences, Tel Aviv University
Slide The Key to Polynomial EndtoEnd Communication \Lambda Yehuda Afek y & Baruch Awerbuch z & Eli Gafni x &
Supporting Increment and Decrement Operations in Balancing Networks
Counting Networks James Aspnes y Maurice Herlihy z Nir Shavit x
On the Space Complexity of Randomized Synchronization
Towards a Topological Characterization of Asynchronous Complexity (Preliminary Version)
Combining Funnels: A Dynamic Approach To Software Combining \Lambda
Towards a Practical Snapshot Algorithm Yaron Riany y Nir Shavit yz Dan Touitou y
Elimination Trees and the Construction of Pools and Nir Shavit \Lambda
Reactive Diffracting Trees Giovanni DellaLibera
Timing Conditions for Linearizability in Uniform Counting Networks
Atomic Snapshots of Shared Memory YEHUDA AFEK
A Steady State Analysis of Diffracting Nir Shavit \Lambda Eli Upfal y Asaph Zemach z
Scalable Concurrent Priority Queue Nir Shavit Asaph Zemach
Software Transactional Memory Nir Shavit \Lambda
A WaitFree Sorting Algorithm Nir Shavit \Lambda Eli Upfal y Asaph Zemach z
The Topological Structure of Asynchronous Computability
Diffracting Trees Nir Shavit yz Asaph Zemach y
Scalable Concurrent Counting Maurice Herlihy \Lambda BengHong Lim y Nir Shavit z
Parallel Garbage Collection for Shared Memory Multiprocessors Christine H. Flood
Linearizable Counting Networks Maurice Herlihy
Are WaitFree Algorithms Fast? Hagit Attiya y Nancy Lynch z Nir Shavit x
