Nir Shavit | Academic Influence

Nir Shavit's AcademicInfluence.com Rankings

Nir Shavit

Computer Science

#467

World Rank

#485

Historical Rank

Parallel Computing

#40

World Rank

#42

Historical Rank

Database

#2478

World Rank

#2596

Historical Rank

computer-science Degrees

Download Badge

Computer Science

Nir Shavit's Degrees

Bachelors Computer Science Technion – Israel Institute of Technology

Similar Degrees You Can Earn

Why Is Nir Shavit Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Nir Shavit is an Israeli computer scientist. He is a professor in the Computer Science Department at Tel Aviv University and a professor of electrical engineering and computer science at the Massachusetts Institute of Technology.

(See a Problem?)

Nir Shavit'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

Software transactional memory (1995) (1709)
Transactional Locking II (2006) (1025)
The art of multiprocessor programming (2020) (658)
The topological structure of asynchronous computability (1999) (483)
Deep Learning is Robust to Massive Label Noise (2017) (449)
Atomic snapshots of shared memory (1990) (425)
Flat combining and the synchronization-parallelism tradeoff (2010) (321)
A scalable lock-free stack algorithm (2004) (278)
The big data challenges of connectomics (2014) (229)
A Lazy Concurrent List-Based Set Algorithm (2005) (228)
The asynchronous computability theorem for t-resilient tasks (1993) (202)
The Art of Multiprocessor Programming, Revised Reprint (2012) (184)
Counting networks (1994) (170)
Data structures in the multicore age (2011) (168)
Hopscotch Hashing (2008) (166)
Generative Compression (2017) (155)
Connectomes across development reveal principles of brain maturation (2020) (153)
Atomic snapshots of shared memory (1993) (146)
Using elimination to implement scalable and lock-free FIFO queues (2005) (138)
Split-ordered lists: lock-free extensible hash tables (2003) (138)
Parallel Garbage Collection for Shared Memory Multiprocessors (2001) (127)
An optimistic approach to lock-free FIFO queues (2004) (115)
Non-blocking steal-half work queues (2002) (114)
Skiplist-based concurrent priority queues (2000) (110)
Elimination Trees and the Construction of Pools and Stacks (1997) (108)
Diffracting trees (1996) (106)
What Really Makes Transactions Faster (2006) (106)
The SprayList: a scalable relaxed priority queue (2015) (101)
Are wait-free algorithms fast? (1990) (100)
A Simple Optimistic Skiplist Algorithm (2007) (100)
A Constructive Prediction of the Generalization Error Across Scales (2019) (99)
TLRW: return of the read-write lock (2010) (96)
Lock cohorting: a general technique for designing NUMA locks (2012) (94)
Transactional Mutex Locks (2010) (93)
Optimal time randomized consensus—making resilient algorithms fast in practice (1991) (91)
NUMA-aware reader-writer locks (2013) (86)
Understanding Tradeoffs in Software Transactional Memory (2007) (84)
Counting networks and multi-processor coordination (1991) (81)
A simple constructive computability theorem for wait-free computation (1994) (78)
DCAS is not a silver bullet for nonblocking algorithm design (2004) (78)
Noninvasive concurrency with Java STM (2009) (78)
On the space complexity of randomized synchronization (1993) (75)
Bounded concurrrent time-stamp systems are constructible (1989) (74)
A Hierarchical CLH Queue Lock (2006) (71)
Nonblocking k-Compare-Single-Swap (2003) (67)
Timing-based mutual exclusion (1992) (65)
Flat-combining NUMA locks (2011) (65)
Lock Cohorting (2015) (65)
Bounded Concurrent Time-Stamping (1997) (63)
The Baskets Queue (2007) (61)
A dynamic-sized nonblocking work stealing deque (2006) (61)
Obstruction-Free Algorithms Can Be Practically Wait-Free (2005) (61)
Scalable concurrent counting (1995) (60)
Even Better DCAS-Based Concurrent Deques (2000) (59)
StackTrack: an automated transactional approach to concurrent memory reclamation (2014) (58)
A New Approach to Detection of Locally Indicative Stability (1986) (58)
Polynomial end-to-end communication (1989) (56)
Concurrent Timestamping Made Simple (1992) (56)
Bounded polynomial randomized consensus (1989) (53)
Combining Funnels: A Dynamic Approach to Software Combining (2000) (52)
Split-ordered lists: Lock-free extensible hash tables (2006) (51)
Read-log-update: a lightweight synchronization mechanism for concurrent programming (2015) (51)
DCAS-based concurrent deques (2000) (50)
Elimination trees and the construction of pools and stacks: preliminary version (1995) (50)
Reduced Hardware NOrec: A Safe and Scalable Hybrid Transactional Memory (2015) (50)
Reduced hardware transactions: a new approach to hybrid transactional memory (2013) (50)
Low contention load balancing on large-scale multiprocessors (1992) (48)
Inducing and Exploiting Activation Sparsity for Fast Inference on Deep Neural Networks (2020) (47)
A bounded first-in, first-enabled solution to the l-exclusion problem (1994) (47)
Toward a non-atomic era: l-exclusion as a test case (1988) (44)
Scalable concurrent priority queue algorithms (1999) (44)
On the Nature of Progress (2011) (42)
Towards a practical snapshot algorithm (1995) (42)
On the Inherent Sequentiality of Concurrent Objects (2012) (41)
Leaplist: lessons learned in designing tm-supported range queries (2013) (40)
Scalable Producer-Consumer Pools Based on Elimination-Diffraction Trees (2010) (40)
A Multi-Pass Approach to Large-Scale Connectomics (2016) (39)
Maintaining Consistent Transactional States without a Global Clock (2008) (38)
ThreadScan: Automatic and Scalable Memory Reclamation (2015) (38)
Sparse sign-consistent Johnson–Lindenstrauss matrices: Compression with neuroscience-based constraints (2014) (38)
Low contention linearizable counting (1991) (37)
Pessimistic Software Lock-Elision (2012) (37)
Reactive diffracting trees (1997) (36)
Deep Tensor Convolution on Multicores (2016) (35)
Concurrent Data Structures (2004) (34)
Scalable Flat-Combining Based Synchronous Queues (2010) (33)
Are lock-free concurrent algorithms practically wait-free? (2013) (33)
Towards Consistency Oblivious Programming (2011) (33)
Towards a topological characterization of asynchronous complexity (1997) (33)
Linear lower bounds on real-world implementations of concurrent objects (2005) (33)
Slide-The Key to Polynomial End-to-End Communication (1997) (33)
Towards a Fully Pessimistic STM Model (2012) (32)
On the Uncontended Complexity of Consensus (2003) (30)
On the space complexity of randomized synchronization (1998) (29)
A Steady State Analysis of Diffracting Trees (1998) (26)
Implicit Privatization Using Private Transactions (2010) (25)
The SkipTrie: low-depth concurrent search without rebalancing (2013) (25)
Linearizable counting networks (1996) (25)
Cross-Classification Clustering: An Efficient Multi-Object Tracking Technique for 3-D Instance Segmentation in Connectomics (2018) (25)
Toward a Topological Characterization of Asynchronous Complexity (2006) (25)
On the inherent weakness of conditional synchronization primitives (2004) (24)
Morphological Error Detection in 3D Segmentations (2017) (23)
Predictive log-synchronization (2006) (22)
Work dealing (2002) (21)
The computability of relaxed data structures: queues and stacks as examples (2015) (21)
Di racting Trees (1996) (21)
The Velox Transactional Memory Stack (2010) (21)
\bf DCAS-Based Concurrent Deques (2002) (21)
A Complexity-Based Hierarchy for Multiprocessor Synchronization: [Extended Abstract] (2016) (20)
Forkscan: Conservative Memory Reclamation for Modern Operating Systems (2017) (19)
HDMapGen: A Hierarchical Graph Generative Model of High Definition Maps (2021) (19)
On the Predictability of Pruning Across Scales (2020) (17)
Supporting Increment and Decrement Operations in Balancing Networks (1999) (17)
Combining funnels: a new twist on an old tale… (1998) (16)
A Multicore Path to Connectomics-on-Demand (2016) (16)
Amalgamated Lock-Elision (2015) (14)
Virtual Leashing: Internet-Based Software Piracy Protection (2005) (14)
Counting networks are practically linearizable (1996) (14)
Are Lock-Free Concurrent Algorithms Practically Wait-Free? (2016) (13)
Training-Free Uncertainty Estimation for Dense Regression: Sensitivity as a Surrogate (2019) (12)
Obstruction-Free Step Complexity: Lock-Free DCAS as an Example (2005) (12)
Combining Funnels (1998) (12)
Diffracting trees (preliminary version) (1994) (11)
Operation-valency and the cost of coordination (2003) (10)
Training-Free Uncertainty Estimation for Neural Networks (2019) (10)
A steady state analysis of diffracting trees (extended abstract) (1996) (10)
Toward Streaming Synapse Detection with Compositional ConvNets (2017) (10)
Composite Abortable Locks (2006) (10)
A Complexity-Based Hierarchy for Multiprocessor Synchronization (2016) (10)
Timing Conditions for Linearizability in Uniform Counting Networks (1999) (9)
Johnson-Lindenstrauss Compression with Neuroscience-Based Constraints (2014) (9)
Quantifying the Capacity Limitations of Hardware Transactional Memory (2015) (9)
Inherent limitations of hybrid transactional memory (2014) (8)
On the inherent weakness of conditional primitives (2006) (8)
Interrupting snapshots and the Java size method (2009) (8)
Persistent unfairness arising from cache residency imbalance (2014) (8)
Reactive Diiracting Trees (1997) (7)
A Multicore Path to Connectomics-on-Demand (2017) (7)
Reactive Diiracting Trees (1997) (7)
Inducing and Exploiting Activation Sparsity for Fast Neural Network Inference (2020) (6)
Technical perspectiveTransactions are tomorrow's loads and stores (2008) (6)
Concurrency and synchronization in Java programs (2005) (6)
A Wait-Free Sorting Algorithm (1997) (6)
Potential show-stoppers for transactional synchronization (2007) (5)
Balls-into-leaves: sub-logarithmic renaming in synchronous message-passing systems (2014) (5)
Reactive Di racting Trees (1997) (5)
Reactive Di racting Trees (1997) (5)
A Steady State Analysis of Di racting Trees (1997) (5)
Efficient Lock Free Privatization (2010) (5)
A complexity-based classification for multiprocessor synchronization (2019) (5)
Concurrent time stamping (חתימות זמן מקביליות.) (1989) (5)
Transactional memory: beyond the first two decades (2012) (4)
Solo-valency and the cost of coordination (2008) (4)
Concurrent Priority Queue Algorithms (1999) (4)
Hybrid Hardware/Software Transactional Memory (2005) (4)
Transient blocking synchronization (2005) (4)
Towards a Topological Characterization of Asynchronous Complexity (Preliminary Version). (1997) (3)
On the Importance of Registers for Computability (2014) (3)
A Simple Optimistic skip-list Algorithm (2007) (3)
A Lightweight Synchronization Mechanism for Concurrent Programming (2015) (3)
Virtual Leashing: Creating a computational foundation for software protection (2006) (3)
Software transactional memory: Where do we come from? What are we? Where are we going? (2009) (3)
Dynamic Memory ABP Work-Stealing (2004) (2)
Brief announcement: are lock-free concurrent algorithms practically wait-free? (2014) (2)
Networks in Distributed Computing (1998) (2)
Multiprocessor Synchronization and Concurrent Data Structures (2005) (2)
Proceedings of the Twentieth Annual ACM Symposium on Principles of Distributed Computing, PODC 2001, Newport, Rhode Island, USA, August 26-29, 2001 (2001) (2)
Dynamic Identification of Shared Transactional Locations (2008) (2)
Interrupting Snapshots and the JavaTM^{\mbox{\tiny TM}} Size() Method (2009) (2)
Polynomial End-To-End Communication (Extended Abstract) (1989) (2)
Connectome-constrained Latent Variable Model of Whole-Brain Neural Activity (2022) (2)
Topic 12 Theory and Algorithms for Parallel Computation (2003) (1)
Inherent limitations of hybrid transactional memory (2017) (1)
ThreadScan (2018) (1)
Acknowledgments: We Would like to Thank 7.1 Renaming (1996) (1)
High Throughput Connectomics (Dagstuhl Seminar 18481) (2018) (1)
L3 Fusion: Fast Transformed Convolutions on CPUs (2019) (1)
Revisiting Latent-Space Interpolation via a Quantitative Evaluation Framework (2021) (1)
Third Workshop on Programmability Issues for Multi-Core Computers (MULTIPROG-3) (2010) (1)
Learning Guided Electron Microscopy with Active Acquisition (2020) (1)
The SprayList : a scalable relaxed priority queue Citation (2014) (1)
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures (2008) (1)
Interrupting snapshots and the Java[superscript TM] size() method (2012) (0)
Universality of consensus (2021) (0)
Pspace-hard Functions Checkable Debate Systems and Approximation Algorithms for Pspace (2007) (0)
Networks in distributed computing : DIMACS Workshop, October 27-30, 1997 (1999) (0)
Priority queues (2021) (0)
The LevelArray: A Fast, Practical Long-Lived Renaming Algorithm (2014) (0)
08241 Abstracts Collection - Transactional Memory : From Implementation to Application (2008) (0)
Applications of Algebraic Topology to Concurrent Computation (1996) (0)
Mutual exclusion (2021) (0)
Concurrent hashing and natural parallelism (2021) (0)
Theory and algorithms for parallel computation (2007) (0)
Monitors and blocking synchronization (2021) (0)
Transactional programming (2021) (0)
A complexity-based classification for multiprocessor synchronization (2019) (0)
X-Ray2EM: Uncertainty-Aware Cross-Modality Image Reconstruction from X-Ray to Electron Microscopy in Connectomics (2023) (0)
The advent of multicore processors as the standard computing platform will force major changes in software design. (2011) (0)
ThreadScan : Automatic and Scalable Memory (2015) (0)
The computability of relaxed data structures: queues and stacks as examples (2016) (0)
The relative power of primitive synchronization operations (2021) (0)
Queues, memory management, and the ABA problem (2021) (0)
Counting, sorting, and distributed coordination (2021) (0)
Weakly Growing Context-sensitive Grammars Chicago Journal of Theoretical Computer Science (1996) (0)
Linked lists: The role of locking (2021) (0)
Skiplists and balanced search (2021) (0)
Scheduling and work distribution (2021) (0)
Data parallelism (2021) (0)
Spin locks and contention (2021) (0)
The XPRESS Challenge: Xray Projectomic Reconstruction - Extracting Segmentation with Skeletons (2023) (0)
Laboratory for Massachusetts It Institute Of (0)
Stacks and elimination (2021) (0)
SPAA 2008: Proceedings of the 20th Annual ACM Symposium on Parallelism in Algorithms and Architectures, Munich, Germany, June 14-16, 2008 (2008) (0)
Concurrent objects (2021) (0)
High Throughput Connectomics (Keynote Abstract) (2016) (0)
Foundations of shared memory (2021) (0)
The big data challenges of connectomics Citation (2015) (0)
Transactional Memory (2016) (0)
08241 Summary - Transactional Memory : From Implementation to Application (2008) (0)
MIT / ILCS / TM-442 m ARE WAIT-FREE N ALGORITHMS FAST ? (0)
Dynamic Identification of Shared Transactional Locations ( Extended Abstract ) (2011) (0)
Optimism and manual memory management (2021) (0)
Session details: Special track: multicores (2008) (0)

This paper list is powered by the following services:

Other Resources About Nir Shavit

en.wikipedia.org

What Schools Are Affiliated With Nir Shavit?

Nir Shavit is affiliated with the following schools:

Image Attributions

Image Source for Nir Shavit