| 2025 | ICLR | Wasserstein Distances, Neuronal Entanglement, and Sparsity. | Shashata Sawmya, Linghao Kong, Ilia Markov, Dan Alistarh, Nir Shavit |
| 2024 | PPoPP | Sparsity in Deep Neural Nets (Keynote). | Nir Shavit |
| 2023 | CVPR | Learning to Correct Sloppy Annotations in Electron Microscopy Volumes. | Minghao Chen, Mukesh Bangalore Renuka, Lu Mi, Jeff Lichtman, Nir Shavit, Yaron Meirovitch |
| 2022 | AAAI | Training-Free Uncertainty Estimation for Dense Regression: Sensitivity as a Surrogate. | Lu Mi, Hao Wang, Yonglong Tian, Hao He, Nir Shavit |
| 2022 | ICLR | Connectome-constrained Latent Variable Model of Whole-Brain Neural Activity. | Lu Mi, Richard Xu, Sridhama Prakhya, Albert Lin, Nir Shavit, Aravinthan D. T. Samuel, Srinivas C. Turaga |
| 2021 | CVPR | HDMapGen: A Hierarchical Graph Generative Model of High Definition Maps. | Lu Mi, Hang Zhao, Charlie Nash, Xiaohan Jin, Jiyang Gao, Chen Sun, Cordelia Schmid, Nir Shavit, Yuning Chai, Dragomir Anguelov |
| 2021 | ICML | On the Predictability of Pruning Across Scales. | Jonathan S. Rosenfeld, Jonathan Frankle, Michael Carbin, Nir Shavit |
| 2020 | ICLR | A Constructive Prediction of the Generalization Error Across Scales. | Jonathan S. Rosenfeld, Amir Rosenfeld, Yonatan Belinkov, Nir Shavit |
| 2020 | ICML | Inducing and Exploiting Activation Sparsity for Fast Inference on Deep Neural Networks. | Mark Kurtz, Justin Kopinsky, Rati Gelashvili, Alexander Matveev, John Carr, Michael Goin, William M. Leiserson, Sage Moore, Nir Shavit, Dan Alistarh |
| 2020 | MICCAI | Learning Guided Electron Microscopy with Active Acquisition. | Lu Mi, Hao Wang, Yaron Meirovitch, Richard Schalek, Srinivas C. Turaga, Jeff W. Lichtman, Aravinthan D. T. Samuel, Nir Shavit |
| 2019 | CVPR | Cross-Classification Clustering: An Efficient Multi-Object Tracking Technique for 3-D Instance Segmentation in Connectomics. | Yaron Meirovitch, Lu Mi, Hayk Saribekyan, Alexander Matveev, David Rolnick, Nir Shavit |
| 2018 | PCS | Generative Compression. | Shibani Santurkar, David M. Budden, Nir Shavit |
| 2017 | EuroSys | Forkscan: Conservative Memory Reclamation for Modern Operating Systems. | Dan Alistarh, William M. Leiserson, Alexander Matveev, Nir Shavit |
| 2017 | ICML | Deep Tensor Convolution on Multicores. | David M. Budden, Alexander Matveev, Shibani Santurkar, Shraman Ray Chaudhuri, Nir Shavit |
| 2017 | PPoPP | A Multicore Path to Connectomics-on-Demand. | Alexander Matveev, Yaron Meirovitch, Hayk Saribekyan, Wiktor Jakubiuk, Tim Kaler, Gergely dor, David M. Budden, Aleksandar Zlateski, Nir Shavit |
| 2016 | OPODIS | High Throughput Connectomics (Keynote Abstract). | Nir Shavit |
| 2016 | PODC | A Complexity-Based Hierarchy for Multiprocessor Synchronization: [Extended Abstract]. | Faith Ellen, Rati Gelashvili, Nir Shavit, Leqi Zhu |
| 2016 | SPAA | A Multicore Path to Connectomics-on-Demand. | Nir Shavit |
| 2015 | ASPLOS | Reduced Hardware NOrec: A Safe and Scalable Hybrid Transactional Memory. | Alexander Matveev, Nir Shavit |
| 2015 | PPoPP | The SprayList: a scalable relaxed priority queue. | Dan Alistarh, Justin Kopinsky, Jerry Li, Nir Shavit |
| 2015 | SPAA | ThreadScan: Automatic and Scalable Memory Reclamation. | Dan Alistarh, William M. Leiserson, Alexander Matveev, Nir Shavit |
| 2015 | SIROCCO | The Computability of Relaxed Data Structures: Queues and Stacks as Examples. | Nir Shavit, Gadi Taubenfeld |
| 2015 | SOSP | Read-log-update: a lightweight synchronization mechanism for concurrent programming. | Alexander Matveev, Nir Shavit, Pascal Felber, Patrick Marlier |
| 2014 | EuroSys | StackTrack: an automated transactional approach to concurrent memory reclamation. | Dan Alistarh, Patrick Eugster, Maurice Herlihy, Alexander Matveev, Nir Shavit |
| 2014 | ICDCS | The LevelArray: A Fast, Practical Long-Lived Renaming Algorithm. | Dan Alistarh, Justin Kopinsky, Alexander Matveev, Nir Shavit |
| 2014 | OPODIS | On the Importance of Registers for Computability. | Rati Gelashvili, Mohsen Ghaffari, Jerry Li, Nir Shavit |
| 2014 | PODC | Brief announcement: are lock-free concurrent algorithms practically wait-free? | Dan Alistarh, Keren Censor-Hillel, Nir Shavit |
| 2014 | PODC | Balls-into-leaves: sub-logarithmic renaming in synchronous message-passing systems. | Dan Alistarh, Oksana Denysyuk, Lus E. T. Rodrigues, Nir Shavit |
| 2014 | STOC | Are lock-free concurrent algorithms practically wait-free? | Dan Alistarh, Keren Censor-Hillel, Nir Shavit |
| 2014 | SPAA | Brief announcement: persistent unfairness arising from cache residency imbalance. | Dave Dice, Virendra J. Marathe, Nir Shavit |
| 2013 | PODC | Leaplist: lessons learned in designing tm-supported range queries. | Hillel Avni, Nir Shavit, Adi Suissa |
| 2013 | PODC | The SkipTrie: low-depth concurrent search without rebalancing. | Rotem Oshman, Nir Shavit |
| 2013 | PPoPP | NUMA-aware reader-writer locks. | Irina Calciu, David Dice, Yossi Lev, Victor Luchangco, Virendra J. Marathe, Nir Shavit |
| 2013 | SPAA | Reduced hardware transactions: a new approach to hybrid transactional memory. | Alexander Matveev, Nir Shavit |
| 2012 | PPoPP | Lock cohorting: a general technique for designing NUMA locks. | David Dice, Virendra J. Marathe, Nir Shavit |
| 2011 | OPODIS | Towards Consistency Oblivious Programming. | Yehuda Afek, Hillel Avni, Nir Shavit |
| 2011 | OPODIS | On the Nature of Progress. | Maurice Herlihy, Nir Shavit |
| 2011 | SPAA | Flat-combining NUMA locks. | David Dice, Virendra J. Marathe, Nir Shavit |
| 2010 | EuroPar | Scalable Producer-Consumer Pools Based on Elimination-Diffraction Trees. | Yehuda Afek, Guy Korland, Maria Natanzon, Nir Shavit |
| 2010 | EuroPar | Transactional Mutex Locks. | Luke Dalessandro, David Dice, Michael L. Scott, Nir Shavit, Michael F. Spear |
| 2010 | OPODIS | Efficient Lock Free Privatization. | Yehuda Afek, Hillel Avni, David Dice, Nir Shavit |
| 2010 | SPAA | TLRW: return of the read-write lock. | David Dice, Nir Shavit |
| 2010 | SPAA | Flat combining and the synchronization-parallelism tradeoff. | Danny Hendler, Itai Incze, Nir Shavit, Moran Tzafrir |
| 2008 | SIROCCO | Maintaining Consistent Transactional States without a Global Clock. | Hillel Avni, Nir Shavit |
| 2007 | CGO | Understanding Tradeoffs in Software Transactional Memory. | David Dice, Nir Shavit |
| 2007 | EuroPar | Topic 12 Theory and Algorithms for Parallel Computation. | Nir Shavit, Nicolas Schabanel, Pascal Felber, Christos Kaklamanis |
| 2007 | OPODIS | The Baskets Queue. | Moshe Hoffman, Ori Shalev, Nir Shavit |
| 2007 | PPoPP | Potential show-stoppers for transactional synchronization. | Ali-Reza Adl-Tabatabai, David Dice, Maurice Herlihy, Nir Shavit, Christos Kozyrakis, Christoph von Praun, Michael L. Scott |
| 2007 | SIROCCO | A Simple Optimistic Skiplist Algorithm. | Maurice Herlihy, Yossi Lev, Victor Luchangco, Nir Shavit |
| 2006 | EuroPar | A Hierarchical CLH Queue Lock. | Victor Luchangco, Daniel Nussbaum, Nir Shavit |
| 2006 | EuroSys | Predictive log-synchronization. | Ori Shalev, Nir Shavit |
| 2005 | FOCS | Linear Lower Bounds on Real-World Implementations of Concurrent Objects. | Faith Ellen Fich, Danny Hendler, Nir Shavit |
| 2005 | ICDCS | Virtual Leashing: Internet-Based Software Piracy Protection. | Ori Dvir, Maurice Herlihy, Nir Shavit |
| 2005 | OPODIS | A Lazy Concurrent List-Based Set Algorithm. | Steve Heller, Maurice Herlihy, Victor Luchangco, Mark Moir, William N. Scherer III, Nir Shavit |
| 2005 | SPAA | Using elimination to implement scalable and lock-free FIFO queues. | Mark Moir, Daniel Nussbaum, Ori Shalev, Nir Shavit |
| 2004 | PODC | On the inherent weakness of conditional synchronization primitives. | Faith E. Fich, Danny Hendler, Nir Shavit |
| 2004 | SPAA | DCAS is not a silver bullet for nonblocking algorithm design. | Simon Doherty, David Detlefs, Lindsay Groves, Christine H. Flood, Victor Luchangco, Paul Alan Martin, Mark Moir, Nir Shavit, Guy L. Steele Jr. |
| 2004 | SPAA | A scalable lock-free stack algorithm. | Danny Hendler, Nir Shavit, Lena Yerushalmi |
| 2003 | PODC | Operation-valency and the cost of coordination. | Danny Hendler, Nir Shavit |
| 2003 | PODC | Split-ordered lists: lock-free extensible hash tables. | Ori Shalev, Nir Shavit |
| 2003 | SPAA | Nonblocking k-compare-single-swap. | Victor Luchangco, Mark Moir, Nir Shavit |
| 2002 | PODC | Non-blocking steal-half work queues. | Danny Hendler, Nir Shavit |
| 2002 | SPAA | Work dealing. | Danny Hendler, Nir Shavit |
| 2000 | SPAA | DCAS-based concurrent deques. | Ole Agesen, David Detlefs, Christine H. Flood, Alex Garthwaite, Paul Alan Martin, Nir Shavit, Guy L. Steele Jr. |
| 1999 | PODC | Scalable Concurrent Priority Queue Algorithms. | Nir Shavit, Asaph Zemach |
| 1999 | STACS | Supporting Increment and Decrement Operations in Balancing Networks. | William Aiello, Costas Busch, Maurice Herlihy, Marios Mavronicolas, Nir Shavit, Dan Touitou |
| 1998 | PODC | Combining Funnels: A New Twist on an Old Tale... | Nir Shavit, Asaph Zemach |
| 1997 | PODC | Towards a Topological Characterization of Asynchronous Complexity (Preliminary Version). | Gunnar Hoest, Nir Shavit |
| 1997 | PODC | A Wait-Free Sorting Algorithm. | Nir Shavit, Eli Upfal, Asaph Zemach |
| 1997 | SPAA | Reactive Diffracting Trees. | Giovanni Della-Libera, Nir Shavit |
| 1996 | PODC | Counting Networks are Practically Linearizable. | Nancy A. Lynch, Nir Shavit, Alexander A. Shvartsman, Dan Touitou |
| 1996 | SPAA | A Steady State Analysis of Diffracting Trees (Extended Abstract). | Nir Shavit, Eli Upfal, Asaph Zemach |
| 1995 | PODC | Software Transactional Memory. | Nir Shavit, Dan Touitou |
| 1995 | SPAA | Elimination Trees and the Construction of Pools and Stacks (Preliminary Version). | Nir Shavit, Dan Touitou |
| 1994 | STOC | A simple constructive computability theorem for wait-free computation. | Maurice Herlihy, Nir Shavit |
| 1994 | SPAA | Diffracting Trees (Preliminary Version). | Nir Shavit, Asaph Zemach |
| 1993 | PODC | On the Space Complexity of Randomized Synchronization. | Faith E. Fich, Maurice Herlihy, Nir Shavit |
| 1993 | STOC | The asynchronous computability theorem for t-resilient tasks. | Maurice Herlihy, Nir Shavit |
| 1992 | RTSS | Timing-Based Mutual Exclusion. | Nancy A. Lynch, Nir Shavit |
| 1992 | SPAA | Low Contention Load Balancing on Large-Scale Multiprocessors. | Maurice Herlihy, Beng-Hong Lim, Nir Shavit |
| 1991 | FOCS | Low Contention Linearizable Counting | Maurice Herlihy, Nir Shavit, Orli Waarts |
| 1991 | SODA | Optimal Time Randomized Consensus - Making Resilient Algorithms Fast in Practice. | Michael E. Saks, Nir Shavit, Heather Woll |
| 1991 | STOC | Counting Networks and Multi-Processor Coordination | James Aspnes, Maurice Herlihy, Nir Shavit |
| 1990 | FOCS | Are Wait-Free Algorithms Fast? (Extended Abstract) | Hagit Attiya, Nancy A. Lynch, Nir Shavit |
| 1990 | PODC | Atomic Snapshots of Shared Memory. | Yehuda Afek, Danny Dolev, Hagit Attiya, Eli Gafni, Michael Merritt, Nir Shavit |
| 1989 | FOCS | Polynomial End-To-End Communication (Extended Abstract) | Baruch Awerbuch, Yishay Mansour, Nir Shavit |
| 1989 | PODC | Bounded Polynomial Randomized Consensus. | Hagit Attiya, Danny Dolev, Nir Shavit |
| 1989 | STOC | Bounded Concurrent Time-Stamp Systems Are Constructible | Danny Dolev, Nir Shavit |
| 1988 | STOC | Toward a Non-Atomic Era: \ell-Exclusion as a Test Case | Danny Dolev, Eli Gafni, Nir Shavit |
| 1986 | ICALP | A New Approach to Detection of Locally Indicative Stability. | Nir Shavit, Nissim Francez |