A New Approach to Detection of Locally Indicative Stability

`@inproceedings{``FS`

`, author = "N. Francez
and N. Shavit"`

`, title = "A New Approach to Detection
of Locally Indicative Stability."`

`, booktitle =
"Proc. of the 13th International Colloquium on Automata Languages and
Programming (ICALP)"`

`, site = "Rennes, France"`

`, publisher = "Springer-Verlag"`

`, year = 1986 `

`, pages = "344--358"`

`}`

Toward a Non-Atomic Era: L-Exclusion as a Test Case

`@inproceedings{``DGS`

`, author = "D. Dolev,
E. Gafni and N. Shavit"`

`, title = "Toward a Non-Atomic Era:
L-Exclusion as a Test Case."`

`, booktitle =
"Proc. of the 20th Annual ACM Symposium on Theory of Computing
(STOC)"`

`, site = "Chicago, USA"`

`, year = 1988 `

`, pages = "78--92"`

`}`

Bounded Polynomial Randomized Consensus

`@inproceedings{``ADS`

`, author = "H. Attiya,
D. Dolev, and N. Shavit"`

`, title = "Bounded Polynomial
Randomized Consensus"`

`, booktitle =
"Proc. of the 8th Annual ACM Symposium on Principles of Distributed
Computing (PODC)"`

`, site = "Edmonton, Canada"`

`, year = 1989 `

`, pages = "281--293"`

`}`

Polynomial End-to-End Communication

`@inproceedings{``AMS`

`, author = "B. Awerbuch,
Y. Mansour, and N. Shavit"`

`, title = "Polynomial End-to-End
Communication"`

`, booktitle =
"Proc. of the 30th Annual Symposium on Foundations of Computer Science
(FOCS)"`

`, site = "North Carolina, USA"`

`, year = 1989 `

`, pages = "358--363"`

`}`

Optimal Time Randomized Consensus - Making Resilient Algorithms Fast in Practice

`@inproceedings{``SSW`

`, author = "M. Saks, N. Shavit, and H. Woll"`

`, title = "Optimal Time Randomized
Consensus - Making Resilient Algorithms Fast in Practice"`

`, booktitle =
"Proc. of the 2nd ACM Symposium on Discrete Algorithms (SODA)"`

`, site = "San-Francisco"`

`, year = 1991 `

`, pages = "351--362"`

`}`

Concurrent Time-Stamping Made Simple

`@inproceedings{``GLS`

`, author = " R. Gawlick,
N. Lynch and N. Shavit"`

`, title = "Concurrent Time-Stamping
Made Simple"`

`, booktitle =
"Proc. of the Annual Israel Symposium on Theory and Computing Systems
(ISTCS)"`

`, site = "Haifa, Israel"`

`, year = 1992 `

`, pages = "171--183"`

`}`

`@inproceedings{``LS`

`, author = " N. Lynch and N. Shavit"`

`, title = "Timing Based Mutual
Exclusion"`

`, booktitle =
"Proc. of the Annual Real-Time Symposium (RTSS)"`

`, site = "Phoenix"`

`, year = 1992 `

`, pages = "2--11"`

`}`

Atomic Snapshots of Shared Memory

`@article{AADGMS_93`

`, author = "Y. Afek,
H. Attiya, D. Dolev, E. Gafni, M. Merritt and N.~Shavit"`

`, title = "Atomic Snapshots of Shared
Memory"`

`, journal = "Journal of the ACM"`

`, volume =40`

`, number =4`

`, year = 1993`

`, pages = "873--890"`

`}`

`@inproceedings{``AADGMS`

`, author = "Y. Afek,
H. Attiya, D. Dolev, E. Gafni, M. Merritt and N.~Shavit"`

`, title = "Atomic Snapshots of Shared
Memory"`

`, booktitle =
"Proc. of the 9th Annual ACM Symposium on Principles of Distributed
Computing (PODC)"`

`, site = "Quebec-City"`

`, year = 1990 `

`, pages = "1--14"`

`}`

The Asynchronous Computability Theorem for t-Resilient Tasks

`@inproceedings{``HS`

`, author = "M.P. Herlihy
and N. Shavit"`

`, title = "The Asynchronous
Computability Theorem for t-Resilient Tasks"`

`, booktitle =
"Proc. of the 25th Annual Symposium on Theory of Computing (STOC)"`

`, site = "San-Diego"`

`, year = 1993 `

`, pages = "111--120"`

`}`

A Bounded First-In-First-Enabled Solution to the l-Exclusion Problem

`@article{``ADGMS_94`

`, author = "Y. Afek,
D. Dolev, E. Gafni, M.
Merritt and N. Shavit"`

`, title = "A Bounded
First-In-First-Enabled Solution to the l-Exclusion Problem"`

`, journal = "ACM Transactions on
Programming Languages and Systems"`

`, volume =16`

`, number = 3 `

`, year = 1994`

`, pages = "939--953"`

`}`

`@inproceedings{``ADGMS`

`, author = "Y. Afek,
D. Dolev, E. Gafni, M.
Merritt and N. Shavit"`

`, title = "A Bounded
First-In-First-Enabled Solution to the l-Exclusion Problem"`

`, booktitle =
"Proc. of the 4th Workshop on Distributed Algorithms (WDAG)"`

`, site = "Bari, Italy"`

`, year = 1990 `

`, pages = "422--431"`

`}`

A Simple Constructive Computability Theorem for Wait-free Computation

`@inproceedings{``HS94`

`, author = "M.P. Herlihy
and N. Shavit"`

`, title = "A Simple Constructive
Computability Theorem for Wait-free Computation"`

`, booktitle =
"Proc. of the 26th Annual Symposium on Theory of Computing (STOC)"`

`, site = "Montreal, Canada"`

`, year = 1994 `

`, pages = "243--252"`

`}`

Are Wait-Free Algorithms Fast?

`@article{ALS94`

`, author = "H. Attiya,
N. Lynch and N. Shavit"`

`, title = "Are Wait-Free Algorithms
Fast?"`

`, journal = "Journal of the ACM"`

`, volume = 41`

`, number = 4 `

`, year = 1994`

`, pages = "725--763"`

`}`

`@inproceedings{``ALS`

`, author = "H. Attiya,
N. Lynch and N. Shavit"`

`, title = "Are Wait-Free Algorithms
Fast?"`

`, booktitle =
"Proc. of the 31st Annual Symposium on the Foundations of Computer Science
(FOCS)"`

`, site = "St. Louis"`

`, year = 1990 `

`, pages = "55--64"`

`}`

Linearizable Counting Networks

`@article{``HSW96`

`, author = "M.P. Herlihy,
N. Shavit and O. Waarts"`

`, title = "Linearizable
Counting Networks"`

`, journal = "Distributed Computing"`

`, volume = 9`

`, year = 1996`

`, pages = "193--203"`

`}`

`@inproceedings{``HSW`

`, author = "M.P. Herlihy,
N. Shavit and O. Waarts"`

`, title = "Low Contention Linearizable Counting"`

`, booktitle =
"Proc. of the 32nd Annual Symposium on the Foundations of Computer Science
(FOCS)"`

`, site = "San Juan"`

`, year = 1991 `

`, pages = "526--535"`

`}`

Bounded Concurrent Time-stamping

`@article{``DS97`

`, author = "D. Dolev
and N. Shavit"`

`, title = "Bounded Concurrent
Time-stamping"`

`, journal = "SIAM Journal on
Computing"`

`, volume = 26`

`, number = 2`

`, year = 1997`

`, pages = "418--455"`

`}`

`@inproceedings{``DS`

`, author = "D. Dolev
and N. Shavit"`

`, title = "Bounded Concurrent Time
Stamp Systems Are Constructible"`

`, booktitle =
"Proc. of the 21st Annual ACM Symposium on Theory of Computing
(STOC)"`

`, site = "Seattle"`

`, year = 1989 `

`, pages = "454--466"`

`}`

On the Space Complexity of Randomized Synchronization

`@article{``FHS98`

`, author = "F. Fich,
M.P. Herlihy and N. Shavit"`

`, title = "On the Space Complexity of
Randomized Synchronization"`

`, journal = "Journal of the ACM"`

`, volume = 45`

`, number = 5`

`, year = 1998`

`, pages = "843--862"`

`}`

`@inproceedings{``FHS`

`, author = "F. Fich,
M.P. Herlihy and N. Shavit"`

`, title = "On the Space Complexity of
Randomized Synchronization"`

`, booktitle =
"Proc. of the Annual ACM Symposium on Principles of Distributed Computing
(PODC)"`

`, site = "Ithaca"`

`, year = 1993 `

`, pages = "241--249"`

`}`

A Steady State Analysis of Diffracting Trees

`@article{``SUZ98`

`, author = "N. Shavit,
E. Upfal, and A. Zemach"`

`, title = "A Steady State Analysis of
Diffracting Trees"`

`, journal = "Theory of Computing
Systems, Special Issue"`

`, volume = 31`

`, year = 1998`

`, pages = "403--423"`

`}`

`@inproceedings{``SUZ96`

`, author = "N. Shavit,
E. Upfal, and A. Zemach"`

`, title = "A Steady State Analysis of
Diffracting Trees"`

`, booktitle =
"Proc. of the 8th Annual Symposium on Parallel Algorithms and
Architectures (SPAA)"`

`, site = "Padova,
Italy"`

`, year = 1996 `

`, pages = "33--41"`

`}`

Timing Conditions for Linearizability in Uniform Counting Networks

`@article{``SUZ98`

`, author = "N. Lynch, N. Shavit, A. Shvartsman, and D. Touitou."`

`, title = "Timing Conditions for Linearizability in Uniform Counting Networks"`

`, journal = "Theoretical Computer
Science, Special Issue"`

`, volume = 220`

`, number = 1`

`, year = 1998`

`, pages = "67--91"`

`}`

`@inproceedings{``Timing`

`, author = "N. Lynch, N. Shavit, A. Shvartsman, and D. Touitou"`

`, title = "Counting Networks are Practically
Linearizable"`

`, booktitle =
"Proc. of the 15th Annual ACM Symposium on Principles of Distributed
Computing (PODC)"`

`, site = "Philadelphia"`

`, year = 1996 `

`, pages = "280--289"`

`}`

The Topological Structure of Asynchronous Computability

`@article{``HS99`

`, author = "M.P. Herlihy
and N. Shavit"`

`, title = "The Topological Structure of
Asynchronous Computability"`

`, journal = "Journal of the ACM"`

`, volume = 46`

`, number = 6`

`, year = 1999`

`, pages = "858--923"`

`}`

`@inproceedings{``HS`

`, author = "M.P. Herlihy
and N. Shavit"`

`, title = "The Asynchronous
Computability Theorem for t-Resilient Tasks"`

`, booktitle =
"Proc. of the 25th Annual Symposium on Theory of Computing (STOC)"`

`, site = "San-Diego"`

`, year = 1993 `

`, pages = "111--120"`

`}`

`@inproceedings{``HS94`

`, author = "M.P. Herlihy
and N. Shavit"`

`, title = "A Simple Constructive
Computability Theorem for Wait-free Computation"`

`, booktitle =
"26th Annual Symposium on Theory of Computing (STOC)"`

`, site = "Montreal, Canada"`

`, year = 1994 `

`, pages = "243--252"`

`}`

`@article{Agesen02`

`, author = "O. Agesen,
D. L. Detlefs, C. H. Flood, A. T. Garthwaite,
Paul A. Martin, M. Moir, N. N. Shavit,
and G. L. Steele Jr."`

`, title = "DCAS-Based Concurrent Deques"`

`, journal = "Theory of Computing
Systems, Special Issue"`

`, volume = 35`

`, number = 3`

`, year = 2002`

`, pages = "349--386"`

`}`

`@inproceedings{Agesen`

`, author = "O. Agesen,
D. L. Detlefs, C. H. Flood, A. T. Garthwaite,
Paul A. Martin, N. N. Shavit, and G. L. Steele"`

`, title = "DCAS-Based Concurrent Deques"`

`, booktitle =
"Proc. of the Twelfth ACM Symposium on Parallel Algorithms and
Architectures"`

`, site = "Bar Harbor, Maine"`

`, year = 2000 `

`, pages = "137--146"`

`}`

Operation-Valency and the Cost of Coordination

`@inproceedings{``Valency`

`,
author = "D. Hendler and N. Shavit"`

`,
title = "Operation-Valency and the Cost of
Coordination"`

`,
booktitle = "Proc. of the 22nd Annual ACM
Symposium on Principles of Distributed Computing (PODC)"`

`,
site = "Boston, Massachusetts"`

`,
year = 2003 `

`,
pages = "84--91"`

`}`

Operation-Valency and the Cost of Coordination

`@inproceedings{``Valency`

`, author = "D. Hendler
and N. Shavit"`

`, title = "Operation-Valency and the Cost of Coordination"`

`, booktitle =
"Proc. of the 22nd Annual ACM Symposium on Principles of Distributed
Computing (PODC)"`

`, site = "Boston, Massachusetts"`

`, year = 2003 `

`, pages = "84--91"`

`}`

On the Uncontended Complexity of Consensus

`@inproceedings{``LMS`

`, author = "V. Luchangco,
M. Moir and N. Shavit"`

`, title = "On the Uncontended
Complexity of Consensus"`

`, booktitle =
"Proc. of the 17th International Conference on Distributed Computing"`

`, site = "Sorrento, Italy"`

`, year = 2003 `

`, pages = "45--59"`

`}`

DCAS is not a silver bullet for nonblocking algorithm design

`@inproceedings{DCAS`

`, author = "S. Doherty, D. Detlefs, L. Groves, C. H. Flood, V. Luchangco,
P. A. Martin, M. Moir, N. Shavit,
G. L. Steele Jr."`

`, title = "DCAS is not a silver bullet
for nonblocking algorithm design"`

`, booktitle =
"Proc. of the sixteenth ACM Symposium on Parallelism in Algorithms and
Architectures"`

`, site = "Barcelona, Spain"`

`, year = 2004 `

`, pages = "216--224"`

`}`

Obstruction-Free Algorithms Can Be Practically Wait-Free

`@inproceedings{``FLMS`

`, author = "F. Fich,
V. Luchangco, M. Moir, and
N. Shavit"`

`, title = "Obstruction-Free Algorithms
Can Be Practically Wait-Free"`

`, booktitle =
"Proc. of the 19th International Symposium on Distributed Computing (DISC
2005)"`

`, site = "Krakow, Poland"`

`, year = 2005 `

`, pages = "78--92"`

`}`

Obstruction-Free Step Complexity: Lock-Free DCAS as an Example (Brief announcement)

`@inproceedings{``Lock`

`, author = "F. Fich,
V. Luchangco, M. Moir, and
N. Shavit"`

`, title = "Obstruction-Free Step
Complexity: Lock-Free DCAS as an Example (Brief announcement)"`

`, booktitle =
"Proc. of the 19th International Symposium on Distributed Computing (DISC
2005)"`

`, site = "Krakow, Poland"`

`, year = 2005 `

`, pages = "493--494"`

`}`

Linear Lower Bounds on Real-World Implementations of Concurrent Objects

`@inproceedings{``FHS05`

`, author = "F. E. Fich,
D. Hendler, and N. Shavit"`

`, title = "Linear Lower Bounds on
Real-World Implementations of Concurrent Objects"`

`, booktitle =
"Proc. of the 46th Annual Symposium on Foundations of Computer Science
(FOCS 2005)"`

`, site = "Pittsburgh, PA"`

`, year = 2005 `

`, pages = "165--173"`

`}`

Towards a Topological Characterization of Asynchronous Complexity

`@article{``Hoest06`

`, author = "G. Hoest
and N. Shavit"`

`, title = "Towards a Topological
Characterization of Asynchronous Complexity"`

`, journal = "SIAM Journal on
Computing"`

`, volume = 36`

`, number = 2`

`, year = 2006`

`, pages = "457--497"`

`}`

`@inproceedings{``Hoest`

`, author = "G. Hoest
and N. Shavit"`

`, title = "Towards a Topological
Characterization of Asynchronous Complexity"`

`, booktitle =
"Proc. of the 16th Annual ACM Symposium on Principles of Distributed
Computing (PODC)"`

`, site = "Santa Barbara"`

`, year = 1997 `

`, pages = "199--208"`

`}`

`@article{``AHS94`

`, author = "J. Aspnes,
M.P. Herlihy, and N. Shavit"`

`, title = "Counting Networks"`

`, journal = "Journal of the ACM"`

`, volume = 41`

`, number = 5`

`, year = 1994`

`, pages = "1020--1048"`

`}`

`@inproceedings{``AHS`

`, author = "J. Aspnes,
M.P. Herlihy and N. Shavit"`

`, title = "Counting Networks and
Multi-Processor Coordination"`

`, booktitle =
"Proc. of the 23rd Annual Symposium on Theory of Computing (STOC)"`

`, site = "New Orleans"`

`, year = 1991 `

`, pages = "348--358"`

`}`

`@article{``HLS95`

`, author = "M.P. Herlihy,
B.H. Lim, and N. Shavit"`

`, title = "Scalable Concurrent
Counting"`

`, journal = "ACM Transactions on
Computer Systems"`

`, volume = 13`

`, number = 4`

`, year = 1995`

`, pages = "343--364"`

`}`

`@inproceedings{``HLS`

`, author = "M.P. Herlihy,
B.H. Lim, and N. Shavit"`

`, title = "Low contention load
balancing on large scale multiprocessors"`

`, booktitle =
"Proc. of the Annual Symposium on Parallel Algorithms and Architectures
(SPAA)"`

`, site = "San Diego"`

`, year = 1992 `

`, pages = "219--227"`

`}`

Slide: the Key to Polynomial End-to-end Communication

`@article{AAGMRS`

`, author = "Y. Afek,
B. Awerbuch, E. Gafni, Y. Mansour, A. Rosen, N. Shavit"`

`, title = "Slide: the Key to Polynomial
End-to-end Communication"`

`, journal = "Journal of
Algorithms"`

`, volume = 22`

`, year = 1997`

`, pages = "158--186"`

`}`

`@inproceedings{``AMS`

`, author = "B. Awerbuch,
Y. Mansour, and N. Shavit"`

`, title = "Polynomial End-to-End
Communication"`

`, booktitle =
"Proc. of the 30th Annual Symposium on Foundations of Computer Science
(FOCS),"`

`, site = "North Carolina"`

`, year = 1989 `

`, pages = "358--363"`

`}`

`@article{``SZ96`

`, author = "N. Shavit
and A. Zemach"`

`, title = "Diffracting Trees"`

`, journal = "ACM Transactions on
Computer Systems"`

`, volume = 14`

`, volume = 4`

`, year = 1996`

`, pages = "158--186"`

`}`

`@inproceedings{``SZ94`

`, author = "N. Shavit
and A. Zemach"`

`, title = "Diffracting Trees"`

`, booktitle =
"Proc. of the Annual Symposium on Parallel Algorithms and Architectures
(SPAA),"`

`, site = "New Jersey"`

`, year = 1994 `

`, pages = "167--176"`

`}`

Elimination Trees and the Construction of Pools and Stacks

`@article{``ST97`

`, author = "N. Shavit
and D. Touitou"`

`, title = "Elimination Trees and the
Construction of Pools and Stacks"`

`, journal = "Theory of Computing
Systems, Special Issue"`

`, volume = 30`

`, year = 1997`

`, pages = "645--670"`

`}`

`@inproceedings{``ST95a`

`, author = "N. Shavit
and D. Touitou"`

`, title = "Elimination Trees and the
Construction of Pools and Stacks"`

`, booktitle =
"Proc. of the Annual Symposium on Parallel Algorithms and Architectures
(SPAA),"`

`, site = "Santa Barbara"`

`, year = 1995 `

`, pages = "54--63"`

`}`

Towards a practical snapshot algorithm

`@article{``RST01`

`, author = "Y. Riany,
N. Shavit and D. Touitou"`

`, title = "Towards a practical snapshot
algorithm"`

`, journal = "Theoretical Computer
Science"`

`, volume = 269`

`, number = 1-2`

`, year = 2001`

`, pages = "163--201"`

`}`

`@inproceedings{``RST94`

`, author = "Y. Riany,
N. Shavit and D. Touitou"`

`, title = "Towards a practical snapshot
algorithm"`

`, booktitle =
"Proc. of the Third Israel Symposium on Theory and Computing Systems
(ISTCS),"`

`, site = "Tel Aviv"`

`, year = 1995 `

`, pages = "121--129"`

`}`

`@article{``GIO00`

`, author = "G. Della-Libera and N. Shavit"`

`, title = "Reactive Diffracting
Trees"`

`, journal = "Journal of Parallel and
Distributed Computing"`

`, volume = 60`

`, number = 7`

`, year = 2000`

`, pages = "853--890"`

`}`

`@inproceedings{``GIO97`

`, author = "G. Della-Libera and N. Shavit"`

`, title = "Reactive Diffracting
Trees"`

`, booktitle =
"Proc. of the 9th Annual Symposium on Parallel Algorithms and
Architectures (SPAA),"`

`, site = "Newport, RI"`

`, year = 1997 `

`, pages = "24--32"`

`}`

Combining Funnels: A Dynamic Approach to Software Combining

`@article{``Zemach00`

`, author = "N. Shavit
and A. Zemach"`

`, title = "Combining Funnels: A Dynamic
Approach to Software Combining"`

`, journal = "Journal of Parallel and
Distributed Computing"`

`, volume = 60`

`, number = 11`

`, year = 2000`

`, pages = "1355--1387"`

`}`

`@inproceedings{``Zemach98`

`, author = "N. Shavit
and A. Zemach"`

`, title = "Combining Funnels"`

`, booktitle =
"Proc. of the 17th Annual ACM Symposium on Principles of Distributed Computing
(PODC),"`

`, site = "Puerto Vallarta, Mexico"`

`, year = 1998 `

`, pages = "61--70"`

`}`

`@article{``Zemach01`

`, author = "N. Shavit,
E. Upfal, and A. Zemach"`

`, title = "A Wait-free Sorting
Algorithm"`

`, journal = "Theory of Computing
Systems."`

`, volume = 34`

`, number = 36`

`, year = 2001`

`, pages = "519--544"`

`}`

`@inproceedings{``Zemach97`

`, author = "N. Shavit,
E. Upfal, and A. Zemach"`

`, title = "A Wait-free Sorting
Algorithm"`

`, booktitle =
"Proc. of the 16th Annual ACM Symposium on Principles of Distributed
Computing (PODC),"`

`, site = "Santa Barbara"`

`, year = 1997 `

`, pages = "121--128"`

`}`

Scalable Concurrent Priority Queue Algorithms

`@inproceedings{``Zemach99`

`, author = "N. Shavit
and A. Zemach"`

`, title = "Scalable Concurrent Priority
Queue Algorithms"`

`, booktitle =
"Proc. of the 18th Annual ACM Symposium on Principles of Distributed
Computing (PODC)"`

`, site = "Atlanta, GA"`

`, year = 1999 `

`, pages = "113--122"`

`}`

Applications of Algebraic Topology to Concurrent Computation

`@incollection{``Astfalk`

`, author = "M.P. Herlihy
and N. Shavit"`

`, title = "Applications of Algebraic
Topology to Concurrent Computation"`

`, booktitle =
"Applications on Advanced Architecture Computers"`

`, editor = G. Astfalk`

`, chapter = 23`

`, publisher = "SIAM Press"`

`, year = 1996`

`, pages = "255--263"`

`}`

Supporting Increment and Decrement Operations in Balancing Networks

`@article{``ABHMST`

`, author = "W. Aiello, C. Busch, M. Herlihy, M. Mavronicolas, N. Shavit, and D. Touitou"`

`, title = "Supporting Increment and
Decrement Operations in Balancing Networks"`

`, journal = "Chicago Journal of
Theoretical Computer Science"`

`, volume = 4`

`, year = 2000`

`, note = "Electronic journal"`

`}`

`@inproceedings{ABHMST98`

`, author = "W. Aiello, C. Busch, M. Herlihy, M. Mavronicolas, N. Shavit, and D. Touitou"`

`, title = "Supporting Increment and
Decrement Operations in Balancing Networks"`

`, booktitle =
"Proc. of the 16th International Symposium on Theoretical Aspects of
Computer Science (STACS)"`

`, site = "Trier, Germany"`

`, year = 1999 `

`, series = "LNCS" `

`, volume = 1563`

`, pages = "393--403"`

`}`

Even Better DCAS-Based Concurrent Deques

`@inproceedings{Detlefs`

`, author = "David L. Detlefs, Christine H. Flood, Alexander T. Garthwaite, Paul A. Martin, Nir
N. Shavit, and Guy L. Steele Jr."`

`, title = "Even Better DCAS-Based
Concurrent Deques"`

`, booktitle =
"Proc. of the 14th International Symposium on Distributed Computing"`

`, site = "Toledo, Spain"`

`, year = 2000 `

`, pages = "59--73"`

`}`

Skiplist-Based Concurrent Priority Queues

`@inproceedings{``Lotan`

`, author = "I. Lotan
and N. Shavit."`

`, title = "Skiplist-Based
Concurrent Priority Queues"`

`, booktitle =
"Proc. of the 14th International Parallel and Distributed Processing
Symposium (IPDPS)"`

`, site = "Cancun, Mexico"`

`, year = 2000 `

`, pages = "263--268"`

`}`

Parallel Garbage Collection for Shared Memory Multiprocessors

`@inproceedings{``Detlefs01`

`, author = "C. Flood, D. Detlefs, N. Shavit and C.
Zhang"`

`, title = "Parallel Garbage Collection
for Shared Memory Multiprocessors"`

`, booktitle =
"Proc. of the Java TM Virtual Machine Research and Technology
Symposium"`

`, site = "Monterey, California"`

`, year = 2001 `

`}`

Non-Blocking Steal-half Work Queues

`@inproceedings{``Hendler02a`

`, author = "D. Hendler
and N. Shavit"`

`, title = "Non-Blocking Steal-half Work
Queues"`

`, booktitle =
"Proc. of the 21st Annual ACM Symposium on Principles of Distributed
Computing (PODC)"`

`, site = "Monterey, California"`

`, year = 2002 `

`, pages = "280--289"`

`}`

`@inproceedings{``Hendler02b`

`, author = "D. Hendler
and N. Shavit"`

`, title = "Work Dealing"`

`, booktitle =
"Proc. of the Fourteenth ACM Symposium on Parallel Algorithms and
Architectures"`

`, site = "Winnipeg, Manitoba,
Canada"`

`, year = 2002 `

`, pages = "164--172"`

`}`

A scalable lock-free stack algorithm

`@inproceedings{``HSL`

`, author = "D. Hendler,
N. Shavit and L. Yerushalmi"`

`, title = "A scalable lock-free stack
algorithm"`

`, booktitle =
"Proc. of the sixteenth ACM Symposium on Parallelism in Algorithms and
Architectures"`

`, site = "Barcelona, Spain"`

`, year = 2004 `

`, pages = "206--215"`

`}`

An optimistic approach to lock-free FIFO queues

`@inproceedings{``LMOS`

`, author = "E. Ladan-Mozes
and N. Shavit"`

`, title = "An optimistic approach to
lock-Free FIFO queues"`

`, booktitle =
"Proc. of the 18th International Conference on Distributed Computing"`

`, site = "Amsterdam"`

`, year = 2004 `

`, pages = "117--131"`

`}`

Using Elimination to Implement Scalable and Lock-Free FIFO Queues

`@inproceedings{``MNSS`

`, author = "M. Moir,
D. Nussbaum, O. Shalev, and N. Shavit"`

`, title = "Using Elimination to
Implement Scalable and Lock-Free FIFO Queues"`

`, booktitle =
"Proc. of the seventeenth ACM Symposium on Parallelism in Algorithms and
Architectures"`

`, site = "Las Vegas, Nevada"`

`, year = 2005 `

`, pages = "253--262"`

`}`

A Lazy Concurrent List-Based Set Algorithm

`@inproceedings{``HHLMSS`

`, author = "S. Heller, M. Herlihy, V. Luchangco, M. Moir, W. Scherer and N. Shavit"`

`, title = "A Lazy Concurrent List-Based
Set Algorithm"`

`, booktitle =
"Proc. of the 9th International Conference On Principles Of Distributed
Systems (OPODIS 2005)"`

`, site = "Pisa, Italy"`

`, year = 2005 `

`, pages = "3--16"`

`}`

A dynamic-sized nonblocking work stealing deque

`@article{``deque`

`, author = "D. Hendler,
Y. Lev, M. Moir, and Nir Shavit"`

`, title = "A dynamic-sized nonblocking work stealing deque"`

`, journal = "Distributed Computing
(Special Issue)"`

`, volume = 18`

`, number = 3`

`, year = 2006`

`, pages = "189--207"`

`}`

`@inproceedings{``ABP`

`, author = "D. Hendler,
Y. Lev, and N. Shavit"`

`, title = "Dynamic memory ABP
work-stealing"`

`, booktitle =
"Proc. of the 18th International Conference on Distributed
Computing,"`

`, site = "Amsterdam"`

`, year = 2004 `

`, pages = "188--200"`

`}`

`@inproceedings{``MMS`

`, author = "V. Marathe,
M. Moir, and N. Shavit"`

`, title = "Composite Abortable Locks"`

`, booktitle =
"Proc. of the 20th IEEE International Parallel & Distributed
Processing Symposium (IPDPS)"`

`, site = "Rhodes Island, Greece"`

`, year = 2006 `

`, pages = "1--10"`

`}`

Split-Ordered Lists -- Lock-free Extensible Hash Tables

`@article{SS06`

`, author = "O. Shalev
and N. Shavit"`

`, title = "Split-Ordered Lists --
Lock-free Extensible Hash Tables"`

`, journal = "Journal of the ACM "`

`, volume = 53`

`, number = 3`

`, year = 2006`

`, pages = "379--405"`

`}`

`@inproceedings{``SS`

`, author = "O. Shalev
and N. Shavit"`

`, title = "Split-Ordered Lists --
Lock-free Resizable Hash Tables"`

`, booktitle =
"Proc. of the 22nd Annual ACM Symposium on Principles of Distributed
Computing (PODC)"`

`, site = "Boston, Massachusetts"`

`, year = 2003 `

`, pages = "102--111"`

`}`

Virtual leashing: Creating a computational foundation for software protection

`@article{``DHS06`

`, author = "O. Dvir,
M. Herlihy, and N. Shavit"`

`, title = "Virtual leashing: Creating a
computational foundation for software protection"`

`, journal = "Journal of Parallel and
Distributed Computing (Special Issue)"`

`, volume = 66`

`, number = 9`

`, year = 2006`

`, pages = "1233--1240"`

`}`

`@inproceedings{``DHS`

`, author = "O. Dvir,
M. Herlihy, and N. Shavit"`

`, title = "Virtual leashing:
Internet-based software protection"`

`, booktitle =
"Proc. of the 18th International Conference on Distributed Computing
Systems"`

`, site = "Columbus, Ohio"`

`, year = 2005 `

`, pages = "283--292"`

`}`

`@inproceedings{``CLH`

`, author = "V. Luchangco,
D. Nussbaum, and N. Shavit"`

`, title = "A Hierarchical CLH Queue
Lock "`

`, booktitle =
"Proc. of the European Conference on Parallel Computing (EuroPar 2006)"`

`, site = "Dresden, Germany"`

`, year = 2006 `

`, pages = "801--810"`

A Provably Correct Scalable Skiplist (Brief Announcement)

`@inproceedings{``LHLS`

`, author = "Y. Lev, M. Herlihy, V. Luchangco, and N. Shavit"`

`, title = "A Provably Correct Scalable Skiplist (Brief Announcement)"`

`, booktitle =
"Proc. of the 10th International Conference On Principles Of Distributed
Systems (OPODIS 2006)"`

`, site = "Bordeaux, France"`

`, year = 2006 `

`} `

`@article{``STM`

`, author = "N. Shavit, and D. Touitou"`

`, title = "Software Transactional Memory"`

`, journal = "Distributed Computing, Special Issue "`

`, volume = 10`

`, year = 1997`

`, pages = "99--116"`

`}`

`@inproceedings{``ST95b`

`, author = "N. Shavit, and D. Touitou"`

`, title = "Software Transactional Memory"`

`, booktitle = "Proc. of the 12th Annual ACM
Symposium on Principles of Distributed Computing (PODC)"`

`, site = "Ottawa, Canada"`

`, year = 1995 `

`, pages = "204--213"`

`}`

Non-blocking K-Compare Single Swap

`@inproceedings{``SWAP`

`, author = "M. Moir, V. Luchangco,
and N. Shavit"`

`, title = "Non-blocking K-Compare Single Swap"`

`, booktitle = "Proc. of the fifteenth ACM
Symposium on Parallel Algorithms and Architectures"`

`, site = "San-Diego, California"`

`, year = 2003 `

`, pages = "314--323"`

`}`

On the inherent weakness of conditional primitives

`@article{FHS06`

`, author = "F. E. Fich, D. Hendler, and N. Shavit"`

`, title = "On the inherent weakness of conditional primitives"`

`, journal = "Distributed Computing "`

`, volume = 18`

`, number = 4`

`, year = 2006`

`, pages = "267--277"`

`}`

`@inproceedings{``FHS`

`, author = "F. E. Fich, D. Hendler, and N. Shavit"`

`, title = "On the inherent weakness of conditional synchronization
primitives"`

`, booktitle = "Proc. of the 23rd Annual ACM
Symposium on Principles of Distributed Computing (PODC)"`

`, site = "Saint Johns, Newfoundland,
Canada"`

`, year = 2004 `

`, pages = "80--87"`

`}`

What Really Makes Transactions Faster?

`@inproceedings{``DS06`

`, author = "D. Dice and N. Shavit"`

`, title = "What Really Makes Transactions Faster?"`

`, booktitle = "Proc. of the 1st TRANSACT
2006 workshop"`

`, site = "Ottawa, Canada"`

`, year = 2006 `

`, note = "Electronic, no. page numbers"`

`}`

Predictive Log Synchronization

`@inproceedings{``PLS`

`, author = "O. Shalev and N. Shavit"`

`, title = "Predictive Log Synchronization"`

`, booktitle = "Proc. of the EuroSys 2006 Conference "`

`, site = "Leuven, Belgium"`

`, year = 2006 `

`, pages = "305--315"`

`}`

`@inproceedings{``DSS`

`, author = "D. Dice, O. Shalev, and N. Shavit"`

`, title = "Transactional Locking II"`

`, booktitle = "Proc. of the 20th
International Symposium on Distributed Computing (DISC 2006)"`

`, site = "Stockholm, Sweden"`

`, year = 2006 `

`, pages = "194--208"`

`}`

Understanding Tradeoffs in Software Transactional Memory

`@inproceedings{``DS07`

`, author = "D. Dice and N. Shavit"`

`, title = "Understanding Tradeoffs in Software Transactional
Memory"`

`, booktitle = "Proc. of the 2007
International Symposium on Code Generation and Optimization (CGO)"`

`, site = "San Jose, CA"`

`, year = 2007 `

`, note = "To appear"`

`}`

Dynamic
Identification of Transactional Memory Locations

`@misc{``MSS`

`, author = "A. Matveev and O. Shalev and N. Shavit"`

`, title = "Dynamic Identification of Transactional Memory
Locations", year = 2007 `

`, note = "Unpublished Manuscript, Tel-Aviv University"`

`}`

`@inproceedings{``MS04`

`, author = "M. Moir and N. Shavit"`

`, title = "`Concurrent Data Structures`"`

`, booktitle = "` Handbook of Data
Structures and Applications, D. Metha and S. Sahni Editors`"`

`, site = "San Jose, CA"`

`, year = 2007 `

`, pages = "47-14 — 47-30"`

`, note = "`Chapman and Hall/CRC Pre`ss"`

`}`