Nir Shavit

According to our database1, Nir Shavit authored at least 158 papers between 1986 and 2018.

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

Awards

ACM Fellow

ACM Fellow 2013, "For contributions to the theory and practice of synchronization in concurrent programming.".

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2018
ThreadScan: Automatic and Scalable Memory Reclamation.
TOPC, 2018

Inherent limitations of hybrid transactional memory.
Distributed Computing, 2018

Generative Compression.
Proceedings of the 2018 Picture Coding Symposium, 2018

2017
Generative Compression.
CoRR, 2017

Toward Streaming Synapse Detection with Compositional ConvNets.
CoRR, 2017

Deep Learning is Robust to Massive Label Noise.
CoRR, 2017

Morphological Error Detection in 3D Segmentations.
CoRR, 2017

A Multicore Path to Connectomics-on-Demand.
Proceedings of the 22nd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2017

Deep Tensor Convolution on Multicores.
Proceedings of the 34th International Conference on Machine Learning, 2017

Forkscan: Conservative Memory Reclamation for Modern Operating Systems.
Proceedings of the Twelfth European Conference on Computer Systems, 2017

2016
Transactional Memory.
Encyclopedia of Algorithms, 2016

Are Lock-Free Concurrent Algorithms Practically Wait-Free?
J. ACM, 2016

The computability of relaxed data structures: queues and stacks as examples.
Distributed Computing, 2016

A Multi-Pass Approach to Large-Scale Connectomics.
CoRR, 2016

A Complexity-Based Hierarchy for Multiprocessor Synchronization.
CoRR, 2016

Deep Tensor Convolution on Multicores.
CoRR, 2016

A Multicore Path to Connectomics-on-Demand.
Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, 2016

A Complexity-Based Hierarchy for Multiprocessor Synchronization: [Extended Abstract].
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, 2016

High Throughput Connectomics (Keynote Abstract).
Proceedings of the 20th International Conference on Principles of Distributed Systems, 2016

2015
Lock Cohorting: A General Technique for Designing NUMA Locks.
TOPC, 2015

Inherent Limitations of Hybrid Transactional Memory.
Proceedings of the Distributed Computing - 29th International Symposium, 2015

Amalgamated Lock-Elision.
Proceedings of the Distributed Computing - 29th International Symposium, 2015

ThreadScan: Automatic and Scalable Memory Reclamation.
Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, 2015

Read-log-update: a lightweight synchronization mechanism for concurrent programming.
Proceedings of the 25th Symposium on Operating Systems Principles, 2015

The Computability of Relaxed Data Structures: Queues and Stacks as Examples.
Proceedings of the Structural Information and Communication Complexity, 2015

The SprayList: a scalable relaxed priority queue.
Proceedings of the 20th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2015

Reduced Hardware NOrec: A Safe and Scalable Hybrid Transactional Memory.
Proceedings of the Twentieth International Conference on Architectural Support for Programming Languages and Operating Systems, 2015

2014
Johnson-Lindenstrauss Compression with Neuroscience-Based Constraints.
CoRR, 2014

On the Importance of Registers for Computability.
CoRR, 2014

The LevelArray: A Fast, Practical Long-Lived Renaming Algorithm.
CoRR, 2014

Inherent Limitations of Hybrid Transactional Memory.
CoRR, 2014

Are lock-free concurrent algorithms practically wait-free?
Proceedings of the Symposium on Theory of Computing, 2014

Brief announcement: persistent unfairness arising from cache residency imbalance.
Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures, 2014

Balls-into-leaves: sub-logarithmic renaming in synchronous message-passing systems.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2014

Brief announcement: are lock-free concurrent algorithms practically wait-free?
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2014

On the Importance of Registers for Computability.
Proceedings of the Principles of Distributed Systems - 18th International Conference, 2014

The LevelArray: A Fast, Practical Long-Lived Renaming Algorithm.
Proceedings of the IEEE 34th International Conference on Distributed Computing Systems, 2014

StackTrack: an automated transactional approach to concurrent memory reclamation.
Proceedings of the Ninth Eurosys Conference 2014, 2014

2013
Are Lock-Free Concurrent Algorithms Practically Wait-Free?
CoRR, 2013

Reduced hardware transactions: a new approach to hybrid transactional memory.
Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures, 2013

NUMA-aware reader-writer locks.
Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2013

The SkipTrie: low-depth concurrent search without rebalancing.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2013

Leaplist: lessons learned in designing tm-supported range queries.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2013

2012
Transactional memory: beyond the first two decades.
SIGACT News, 2012

On the Inherent Sequentiality of Concurrent Objects.
SIAM J. Comput., 2012

Interrupting snapshots and the Java size method.
J. Parallel Distrib. Comput., 2012

Pessimistic Software Lock-Elision.
Proceedings of the Distributed Computing - 26th International Symposium, 2012

Lock cohorting: a general technique for designing NUMA locks.
Proceedings of the 17th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2012

2011
Data structures in the multicore age.
Commun. ACM, 2011

Flat-combining NUMA locks.
Proceedings of the SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2011

On the Nature of Progress.
Proceedings of the Principles of Distributed Systems - 15th International Conference, 2011

Towards Consistency Oblivious Programming.
Proceedings of the Principles of Distributed Systems - 15th International Conference, 2011

2010
The Velox Transactional Memory Stack.
IEEE Micro, 2010

A scalable lock-free stack algorithm.
J. Parallel Distrib. Comput., 2010

Scalable Flat-Combining Based Synchronous Queues.
Proceedings of the Distributed Computing, 24th International Symposium, 2010

Flat combining and the synchronization-parallelism tradeoff.
Proceedings of the SPAA 2010: Proceedings of the 22nd Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2010

TLRW: return of the read-write lock.
Proceedings of the SPAA 2010: Proceedings of the 22nd Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2010

Efficient Lock Free Privatization.
Proceedings of the Principles of Distributed Systems - 14th International Conference, 2010

Transactional Mutex Locks.
Proceedings of the Euro-Par 2010 - Parallel Processing, 16th International Euro-Par Conference, Ischia, Italy, August 31, 2010

Scalable Producer-Consumer Pools Based on Elimination-Diffraction Trees.
Proceedings of the Euro-Par 2010 - Parallel Processing, 16th International Euro-Par Conference, Ischia, Italy, August 31, 2010

2009
Nonblocking k -Compare-Single-Swap.
Theory Comput. Syst., 2009

Interrupting Snapshots and the JavaTM^{\mbox{\tiny TM}} Size() Method.
Proceedings of the Distributed Computing, 23rd International Symposium, 2009

Software transactional memory: Where do we come from? What are we? Where are we going?
Proceedings of the 23rd IEEE International Symposium on Parallel and Distributed Processing, 2009

2008
An optimistic approach to lock-free FIFO queues.
Distributed Computing, 2008

Solo-valency and the cost of coordination.
Distributed Computing, 2008

Hopscotch Hashing.
Proceedings of the Distributed Computing, 22nd International Symposium, 2008

Maintaining Consistent Transactional States without a Global Clock.
Proceedings of the Structural Information and Communication Complexity, 2008

08241 Summary - Transactional Memory : From Implementation to Application.
Proceedings of the Transactional Memory: From Implementation to Application, 08.06., 2008

08241 Abstracts Collection - Transactional Memory : From Implementation to Application.
Proceedings of the Transactional Memory: From Implementation to Application, 08.06., 2008

The art of multiprocessor programming.
Morgan Kaufmann, ISBN: 978-0-12-370591-4, 2008

2007
A Lazy Concurrent List-Based Set Algorithm.
Parallel Processing Letters, 2007

A Simple Optimistic Skiplist Algorithm.
Proceedings of the Structural Information and Communication Complexity, 2007

Potential show-stoppers for transactional synchronization.
Proceedings of the 12th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2007

The Baskets Queue.
Proceedings of the Principles of Distributed Systems, 11th International Conference, 2007

Topic 12 Theory and Algorithms for Parallel Computation.
Proceedings of the Euro-Par 2007, 2007

Understanding Tradeoffs in Software Transactional Memory.
Proceedings of the Fifth International Symposium on Code Generation and Optimization (CGO 2007), 2007

2006
Toward a Topological Characterization of Asynchronous Complexity.
SIAM J. Comput., 2006

Virtual Leashing: Creating a computational foundation for software protection.
J. Parallel Distrib. Comput., 2006

Split-ordered lists: Lock-free extensible hash tables.
J. ACM, 2006

A dynamic-sized nonblocking work stealing deque.
Distributed Computing, 2006

On the inherent weakness of conditional primitives.
Distributed Computing, 2006

Transactional Locking II.
Proceedings of the Distributed Computing, 20th International Symposium, 2006

Composite Abortable Locks.
Proceedings of the 20th International Parallel and Distributed Processing Symposium (IPDPS 2006), 2006

Predictive log-synchronization.
Proceedings of the 2006 EuroSys Conference, Leuven, Belgium, April 18-21, 2006, 2006

A Hierarchical CLH Queue Lock.
Proceedings of the Euro-Par 2006, Parallel Processing, 12th International Euro-Par Conference, Dresden, Germany, August 28, 2006

2005
Concurrency and synchronization in Java programs.
Sci. Comput. Program., 2005

Obstruction-Free Step Complexity: Lock-Free DCAS as an Example.
Proceedings of the Distributed Computing, 19th International Conference, 2005

Obstruction-Free Algorithms Can Be Practically Wait-Free.
Proceedings of the Distributed Computing, 19th International Conference, 2005

Using elimination to implement scalable and lock-free FIFO queues.
Proceedings of the SPAA 2005: Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2005

A Lazy Concurrent List-Based Set Algorithm.
Proceedings of the Principles of Distributed Systems, 9th International Conference, 2005

Virtual Leashing: Internet-Based Software Piracy Protection.
Proceedings of the 25th International Conference on Distributed Computing Systems (ICDCS 2005), 2005

Linear Lower Bounds on Real-World Implementations of Concurrent Objects.
Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 2005

2004
Concurrent Data Structures.
Proceedings of the Handbook of Data Structures and Applications., 2004

An Optimistic Approach to Lock-Free FIFO Queues.
Proceedings of the Distributed Computing, 18th International Conference, 2004

Dynamic Memory ABP Work-Stealing.
Proceedings of the Distributed Computing, 18th International Conference, 2004

A scalable lock-free stack algorithm.
Proceedings of the SPAA 2004: Proceedings of the Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2004

DCAS is not a silver bullet for nonblocking algorithm design.
Proceedings of the SPAA 2004: Proceedings of the Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2004

On the inherent weakness of conditional synchronization primitives.
Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, 2004

2003
On the Uncontended Complexity of Consensus.
Proceedings of the Distributed Computing, 17th International Conference, 2003

Nonblocking k-compare-single-swap.
Proceedings of the SPAA 2003: Proceedings of the Fifteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2003

Split-ordered lists: lock-free extensible hash tables.
Proceedings of the Twenty-Second ACM Symposium on Principles of Distributed Computing, 2003

Operation-valency and the cost of coordination.
Proceedings of the Twenty-Second ACM Symposium on Principles of Distributed Computing, 2003

2002
DCAS-Based Concurrent Deques.
Theory Comput. Syst., 2002

Introduction.
Distributed Computing, 2002

Work dealing.
SPAA, 2002

Non-blocking steal-half work queues.
Proceedings of the Twenty-First Annual ACM Symposium on Principles of Distributed Computing, 2002

2001
Towards a practical snapshot algorithm.
Theor. Comput. Sci., 2001

Parallel Garbage Collection for Shared Memory Multiprocessors.
Proceedings of the 1st Java Virtual Machine Research and Technology Symposium, 2001

2000
Combining Funnels: A Dynamic Approach to Software Combining.
J. Parallel Distrib. Comput., 2000

Reactive Diffracting Trees.
J. Parallel Distrib. Comput., 2000

Supporting Increment and Decrement Operations in Balancing Networks.
Chicago J. Theor. Comput. Sci., 2000

Even Better DCAS-Based Concurrent Deques.
Proceedings of the Distributed Computing, 14th International Conference, 2000


Skiplist-Based Concurrent Priority Queues.
Proceedings of the 14th International Parallel & Distributed Processing Symposium (IPDPS'00), 2000

1999
Timing Conditions for Linearizability in Uniform Counting Networks.
Theor. Comput. Sci., 1999

The topological structure of asynchronous computability.
J. ACM, 1999

Concurrent Priority Queue Algorithms.
Proceedings of the Distributed Data & Structures 2, 1999

Supporting Increment and Decrement Operations in Balancing Networks.
Proceedings of the STACS 99, 1999

Scalable Concurrent Priority Queue Algorithms.
Proceedings of the Eighteenth Annual ACM Symposium on Principles of Distributed Computing, 1999

1998
A Steady State Analysis of Diffracting Trees.
Theory Comput. Syst., 1998

On the Space Complexity of Randomized Synchronization.
J. ACM, 1998

Combining Funnels: A New Twist on an Old Tale...
Proceedings of the Seventeenth Annual ACM Symposium on Principles of Distributed Computing, 1998

1997
Bounded Concurrent Time-Stamping.
SIAM J. Comput., 1997

Elimination Trees and the Construction of Pools and Stacks.
Theory Comput. Syst., 1997

Slide-The Key to Polynomial End-to-End Communication.
J. Algorithms, 1997

Software Transactional Memory.
Distributed Computing, 1997

Reactive Diffracting Trees.
SPAA, 1997

A Wait-Free Sorting Algorithm.
Proceedings of the Sixteenth Annual ACM Symposium on Principles of Distributed Computing, 1997

Towards a Topological Characterization of Asynchronous Complexity (Preliminary Version).
Proceedings of the Sixteenth Annual ACM Symposium on Principles of Distributed Computing, 1997

1996
Diffracting Trees.
ACM Trans. Comput. Syst., 1996

Linearizable Counting Networks.
Distributed Computing, 1996

A Steady State Analysis of Diffracting Trees (Extended Abstract).
SPAA, 1996

Counting Networks are Practically Linearizable.
Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing, 1996

1995
Scalable Concurrent Counting.
ACM Trans. Comput. Syst., 1995

Elimination Trees and the Construction of Pools and Stacks (Preliminary Version).
SPAA, 1995

Software Transactional Memory.
Proceedings of the Fourteenth Annual ACM Symposium on Principles of Distributed Computing, 1995

Towards A Practical Snapshot Algorithm.
Proceedings of the Third Israel Symposium on Theory of Computing and Systems, 1995

1994
A Bounded First-In, First-Enabled Solution to the l-Exclusion Problem.
ACM Trans. Program. Lang. Syst., 1994

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

Counting Networks.
J. ACM, 1994

A simple constructive computability theorem for wait-free computation.
Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 1994

Diffracting Trees (Preliminary Version).
SPAA, 1994

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

The asynchronous computability theorem for t-resilient tasks.
Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 1993

On the Space Complexity of Randomized Synchronization.
Proceedings of the Twelth Annual ACM Symposium on Principles of Distributed Computing, 1993

1992
Low Contention Load Balancing on Large-Scale Multiprocessors.
SPAA, 1992

Timing-Based Mutual Exclusion.
Proceedings of the Real-Time Systems Symposium, 1992

Concurrent Timestamping Made Simple.
Proceedings of the Theory of Computing and Systems, 1992

1991
Counting Networks and Multi-Processor Coordination
Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, 1991

Optimal Time Randomized Consensus - Making Resilient Algorithms Fast in Practice.
Proceedings of the Second Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1991

Low Contention Linearizable Counting
Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991

1990
Atomic Snapshots of Shared Memory.
Proceedings of the Ninth Annual ACM Symposium on Principles of Distributed Computing, 1990

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

1989
Bounded Concurrent Time-Stamp Systems Are Constructible
Proceedings of the 21st Annual ACM Symposium on Theory of Computing, 1989

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

Polynomial End-To-End Communication (Extended Abstract)
Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October, 1989

1988
Toward a Non-Atomic Era: \ell-Exclusion as a Test Case
Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 1988

1986
A New Approach to Detection of Locally Indicative Stability.
Proceedings of the Automata, Languages and Programming, 13th International Colloquium, 1986


  Loading...