default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNir Shavit
Person information
- affiliation: Massachusetts Institute of Technology, Cambridge, MA, USA
- affiliation (former): Tel Aviv University, Israel
- award (2012): Dijkstra Prize
- award (2004): Gödel Prize
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[i32]Shashata Sawmya, Thomas L. Athey, Gwyneth Liu, Nir Shavit:
NeuroADDA: Active Discriminative Domain Adaptation in Connectomic. CoRR abs/2503.06196 (2025)- 2024
- [c110]Nir Shavit
:
Sparsity in Deep Neural Nets (Keynote). PPoPP 2024: 1 - [i31]Shashata Sawmya, Linghao Kong, Ilia Markov, Dan Alistarh, Nir Shavit:
Sparse Expansion and Neuronal Disentanglement. CoRR abs/2405.15756 (2024) - [i30]Armand Nicolicioiu, Eugenia Iofinova, Eldar Kurtic, Mahdi Nikdan, Andrei Panferov, Ilia Markov, Nir Shavit, Dan Alistarh:
Panza: A Personalized Text Writing Assistant via Data Playback and Local Fine-Tuning. CoRR abs/2407.10994 (2024) - [i29]Micah Adler, Nir Shavit:
On the Complexity of Neural Computation in Superposition. CoRR abs/2409.15318 (2024) - [i28]Tony T. Wang, John Hughes, Henry Sleight, Rylan Schaeffer, Rajashree Agrawal, Fazl Barez, Mrinank Sharma, Jesse Mu, Nir Shavit, Ethan Perez:
Jailbreak Defense in a Narrow Domain: Limitations of Existing Methods and a New Transcript-Classifier Approach. CoRR abs/2412.02159 (2024) - 2023
- [c109]Minghao Chen, Mukesh Bangalore Renuka, Lu Mi, Jeff Lichtman, Nir Shavit, Yaron Meirovitch:
Learning to Correct Sloppy Annotations in Electron Microscopy Volumes. CVPR Workshops 2023: 4273-4284 - [c108]Yicong Li, Yaron Meirovitch, Aaron T. Kuan, Jasper S. Phelps, Alexandra Pacureanu, Wei-Chung Allen Lee, Nir Shavit, Lu Mi:
X-Ray2EM: Uncertainty-Aware Cross-Modality Image Reconstruction from X-Ray to Electron Microscopy in Connectomics. ISBI 2023: 1-5 - [i27]Tri Nguyen, Mukul Narwani, Mark Larson, Yicong Li, Shuhan Xie, Hanspeter Pfister, Donglai Wei, Nir Shavit, Lu Mi, Alexandra Pacureanu, Wei-Chung Lee, Aaron T. Kuan:
The XPRESS Challenge: Xray Projectomic Reconstruction - Extracting Segmentation with Skeletons. CoRR abs/2302.03819 (2023) - [i26]Tony T. Wang, Igor Zablotchi, Nir Shavit, Jonathan S. Rosenfeld:
Cliff-Learning. CoRR abs/2302.07348 (2023) - [i25]Yicong Li, Yaron Meirovitch, Aaron T. Kuan, Jasper S. Phelps, Alexandra Pacureanu, Wei-Chung Allen Lee, Nir Shavit, Lu Mi:
X-Ray2EM: Uncertainty-Aware Cross-Modality Image Reconstruction from X-Ray to Electron Microscopy in Connectomics. CoRR abs/2303.00882 (2023) - [i24]Tony T. Wang, Miles Wang, Kaivalya Hariharan, Nir Shavit:
Forbidden Facts: An Investigation of Competing Objectives in Llama-2. CoRR abs/2312.08793 (2023) - 2022
- [c107]Lu Mi, Hao Wang, Yonglong Tian, Hao He, Nir Shavit:
Training-Free Uncertainty Estimation for Dense Regression: Sensitivity as a Surrogate. AAAI 2022: 10042-10050 - [c106]Lu Mi, Richard Xu, Sridhama Prakhya, Albert Lin, Nir Shavit, Aravinthan D. T. Samuel, Srinivas C. Turaga:
Connectome-constrained Latent Variable Model of Whole-Brain Neural Activity. ICLR 2022 - 2021
- [c105]Lu Mi, Hang Zhao, Charlie Nash, Xiaohan Jin, Jiyang Gao, Chen Sun, Cordelia Schmid, Nir Shavit, Yuning Chai, Dragomir Anguelov:
HDMapGen: A Hierarchical Graph Generative Model of High Definition Maps. CVPR 2021: 4227-4236 - [c104]Jonathan S. Rosenfeld, Jonathan Frankle, Michael Carbin, Nir Shavit:
On the Predictability of Pruning Across Scales. ICML 2021: 9075-9083 - [i23]Lu Mi, Hao Wang, Yaron Meirovitch, Richard Schalek, Srinivas C. Turaga, Jeff W. Lichtman, Aravinthan D. T. Samuel, Nir Shavit:
Learning Guided Electron Microscopy with Active Acquisition. CoRR abs/2101.02746 (2021) - [i22]Lu Mi, Hang Zhao, Charlie Nash, Xiaohan Jin, Jiyang Gao, Chen Sun, Cordelia Schmid, Nir Shavit, Yuning Chai, Dragomir Anguelov:
HDMapGen: A Hierarchical Graph Generative Model of High Definition Maps. CoRR abs/2106.14880 (2021) - [i21]Lu Mi, Tianxing He, Core Francisco Park, Hao Wang, Yue Wang, Nir Shavit:
Revisiting Latent-Space Interpolation via a Quantitative Evaluation Framework. CoRR abs/2110.06421 (2021) - 2020
- [j43]Faith Ellen, Rati Gelashvili, Nir Shavit, Leqi Zhu:
A complexity-based classification for multiprocessor synchronization. Distributed Comput. 33(2): 125-144 (2020) - [c103]Jonathan S. Rosenfeld, Amir Rosenfeld, Yonatan Belinkov, Nir Shavit:
A Constructive Prediction of the Generalization Error Across Scales. ICLR 2020 - [c102]Mark Kurtz, Justin Kopinsky, Rati Gelashvili, Alexander Matveev, John Carr, Michael Goin, William M. Leiserson, Sage Moore, Nir Shavit, Dan Alistarh:
Inducing and Exploiting Activation Sparsity for Fast Inference on Deep Neural Networks. ICML 2020: 5533-5543 - [c101]Lu Mi, Hao Wang, Yaron Meirovitch, Richard Schalek, Srinivas C. Turaga, Jeff W. Lichtman, Aravinthan D. T. Samuel, Nir Shavit:
Learning Guided Electron Microscopy with Active Acquisition. MICCAI (5) 2020: 77-87 - [i20]Jonathan S. Rosenfeld, Jonathan Frankle, Michael Carbin, Nir Shavit:
On the Predictability of Pruning Across Scales. CoRR abs/2006.10621 (2020)
2010 – 2019
- 2019
- [c100]Yaron Meirovitch, Lu Mi, Hayk Saribekyan, Alexander Matveev, David Rolnick, Nir Shavit:
Cross-Classification Clustering: An Efficient Multi-Object Tracking Technique for 3-D Instance Segmentation in Connectomics. CVPR 2019: 8425-8435 - [i19]Jonathan S. Rosenfeld, Amir Rosenfeld, Yonatan Belinkov, Nir Shavit:
A Constructive Prediction of the Generalization Error Across Scales. CoRR abs/1909.12673 (2019) - [i18]Lu Mi, Hao Wang, Yonglong Tian, Nir Shavit:
Training-Free Uncertainty Estimation for Neural Networks. CoRR abs/1910.04858 (2019) - [i17]Rati Gelashvili, Nir Shavit, Aleksandar Zlateski:
L3 Fusion: Fast Transformed Convolutions on CPUs. CoRR abs/1912.02165 (2019) - 2018
- [j42]Dan Alistarh, Justin Kopinsky, Petr Kuznetsov, Srivatsan Ravi, Nir Shavit:
Inherent limitations of hybrid transactional memory. Distributed Comput. 31(3): 167-185 (2018) - [j41]Dan Alistarh, William M. Leiserson, Alexander Matveev, Nir Shavit:
ThreadScan: Automatic and Scalable Memory Reclamation. ACM Trans. Parallel Comput. 4(4): 18:1-18:18 (2018) - [c99]Shibani Santurkar, David M. Budden, Nir Shavit:
Generative Compression. PCS 2018: 258-262 - [i16]Yaron Meirovitch, Lu Mi, Hayk Saribekyan, Alexander Matveev, David Rolnick, Casimir Wierzynski, Nir Shavit:
Cross-Classification Clustering: An Efficient Multi-Object Tracking Technique for 3-D Instance Segmentation in Connectomics. CoRR abs/1812.01157 (2018) - [i15]Moritz Helmstaedter, Jeff Lichtman, Nir Shavit:
High Throughput Connectomics (Dagstuhl Seminar 18481). Dagstuhl Reports 8(11): 112-138 (2018) - 2017
- [c98]Dan Alistarh, William M. Leiserson, Alexander Matveev, Nir Shavit:
Forkscan: Conservative Memory Reclamation for Modern Operating Systems. EuroSys 2017: 483-498 - [c97]David M. Budden, Alexander Matveev, Shibani Santurkar, Shraman Ray Chaudhuri, Nir Shavit:
Deep Tensor Convolution on Multicores. ICML 2017: 615-624 - [c96]Alexander Matveev, Yaron Meirovitch, Hayk Saribekyan, Wiktor Jakubiuk, Tim Kaler, Gergely Ódor, David M. Budden, Aleksandar Zlateski, Nir Shavit:
A Multicore Path to Connectomics-on-Demand. PPoPP 2017: 267-281 - [i14]Shibani Santurkar, David M. Budden, Alexander Matveev, Heather Berlin, Hayk Saribekyan, Yaron Meirovitch, Nir Shavit:
Toward Streaming Synapse Detection with Compositional ConvNets. CoRR abs/1702.07386 (2017) - [i13]Shibani Santurkar, David M. Budden, Nir Shavit:
Generative Compression. CoRR abs/1703.01467 (2017) - [i12]David Rolnick, Andreas Veit, Serge J. Belongie, Nir Shavit:
Deep Learning is Robust to Massive Label Noise. CoRR abs/1705.10694 (2017) - [i11]David Rolnick, Yaron Meirovitch, Toufiq Parag, Hanspeter Pfister, Viren Jain, Jeff W. Lichtman, Edward S. Boyden, Nir Shavit:
Morphological Error Detection in 3D Segmentations. CoRR abs/1705.10882 (2017) - 2016
- [j40]Nir Shavit, Gadi Taubenfeld:
The computability of relaxed data structures: queues and stacks as examples. Distributed Comput. 29(5): 395-407 (2016) - [j39]Dan Alistarh, Keren Censor-Hillel, Nir Shavit:
Are Lock-Free Concurrent Algorithms Practically Wait-Free? J. ACM 63(4): 31:1-31:20 (2016) - [c95]Nir Shavit:
High Throughput Connectomics (Keynote Abstract). OPODIS 2016: 1:1-1:1 - [c94]Faith Ellen, Rati Gelashvili, Nir Shavit, Leqi Zhu:
A Complexity-Based Hierarchy for Multiprocessor Synchronization: [Extended Abstract]. PODC 2016: 289-298 - [c93]Nir Shavit:
A Multicore Path to Connectomics-on-Demand. SPAA 2016: 211 - [r2]Nir Shavit, Alexander Matveev:
Transactional Memory. Encyclopedia of Algorithms 2016: 2246-2249 - [i10]Faith Ellen, Rati Gelashvili, Nir Shavit, Leqi Zhu:
A Complexity-Based Hierarchy for Multiprocessor Synchronization. CoRR abs/1607.06139 (2016) - [i9]David M. Budden, Alexander Matveev, Shibani Santurkar, Shraman Ray Chaudhuri, Nir Shavit:
Deep Tensor Convolution on Multicores. CoRR abs/1611.06565 (2016) - [i8]Yaron Meirovitch, Alexander Matveev, Hayk Saribekyan, David M. Budden, David Rolnick, Gergely Ódor, Seymour Knowles-Barley, Thouis Raymond Jones, Hanspeter Pfister, Jeff William Lichtman, Nir Shavit:
A Multi-Pass Approach to Large-Scale Connectomics. CoRR abs/1612.02120 (2016) - 2015
- [j38]David Dice, Virendra J. Marathe, Nir Shavit:
Lock Cohorting: A General Technique for Designing NUMA Locks. ACM Trans. Parallel Comput. 1(2): 13:1-13:42 (2015) - [c92]Alexander Matveev, Nir Shavit:
Reduced Hardware NOrec: A Safe and Scalable Hybrid Transactional Memory. ASPLOS 2015: 59-71 - [c91]Dan Alistarh, Justin Kopinsky, Jerry Li, Nir Shavit:
The SprayList: a scalable relaxed priority queue. PPoPP 2015: 11-20 - [c90]Nir Shavit, Gadi Taubenfeld:
The Computability of Relaxed Data Structures: Queues and Stacks as Examples. SIROCCO 2015: 414-428 - [c89]Alexander Matveev, Nir Shavit, Pascal Felber, Patrick Marlier:
Read-log-update: a lightweight synchronization mechanism for concurrent programming. SOSP 2015: 168-183 - [c88]Dan Alistarh, William M. Leiserson, Alexander Matveev, Nir Shavit:
ThreadScan: Automatic and Scalable Memory Reclamation. SPAA 2015: 123-132 - [c87]Dan Alistarh, Justin Kopinsky, Petr Kuznetsov, Srivatsan Ravi, Nir Shavit:
Inherent Limitations of Hybrid Transactional Memory. DISC 2015: 185-199 - [c86]Yehuda Afek, Alexander Matveev, Oscar R. Moll, Nir Shavit:
Amalgamated Lock-Elision. DISC 2015: 309-324 - 2014
- [c85]Dan Alistarh, Patrick Eugster, Maurice Herlihy, Alexander Matveev, Nir Shavit:
StackTrack: an automated transactional approach to concurrent memory reclamation. EuroSys 2014: 25:1-25:14 - [c84]Dan Alistarh, Justin Kopinsky, Alexander Matveev, Nir Shavit:
The LevelArray: A Fast, Practical Long-Lived Renaming Algorithm. ICDCS 2014: 348-357 - [c83]Rati Gelashvili, Mohsen Ghaffari, Jerry Li, Nir Shavit:
On the Importance of Registers for Computability. OPODIS 2014: 171-185 - [c82]Dan Alistarh, Keren Censor-Hillel, Nir Shavit:
Brief announcement: are lock-free concurrent algorithms practically wait-free? PODC 2014: 50-52 - [c81]Dan Alistarh, Oksana Denysyuk, Luís E. T. Rodrigues, Nir Shavit:
Balls-into-leaves: sub-logarithmic renaming in synchronous message-passing systems. PODC 2014: 232-241 - [c80]Dave Dice, Virendra J. Marathe, Nir Shavit:
Brief announcement: persistent unfairness arising from cache residency imbalance. SPAA 2014: 82-83 - [c79]Dan Alistarh, Keren Censor-Hillel, Nir Shavit:
Are lock-free concurrent algorithms practically wait-free? STOC 2014: 714-723 - [i7]Dan Alistarh, Justin Kopinsky, Alexander Matveev, Nir Shavit:
The LevelArray: A Fast, Practical Long-Lived Renaming Algorithm. CoRR abs/1405.5461 (2014) - [i6]Dan Alistarh, Justin Kopinsky, Petr Kuznetsov, Srivatsan Ravi, Nir Shavit:
Inherent Limitations of Hybrid Transactional Memory. CoRR abs/1405.5689 (2014) - [i5]Rati Gelashvili, Mohsen Ghaffari, Jerry Li, Nir Shavit:
On the Importance of Registers for Computability. CoRR abs/1411.0168 (2014) - [i4]Zeyuan Allen Zhu, Rati Gelashvili, Silvio Micali, Nir Shavit:
Johnson-Lindenstrauss Compression with Neuroscience-Based Constraints. CoRR abs/1411.5383 (2014) - 2013
- [c78]Rotem Oshman, Nir Shavit:
The SkipTrie: low-depth concurrent search without rebalancing. PODC 2013: 23-32 - [c77]Hillel Avni, Nir Shavit, Adi Suissa:
Leaplist: lessons learned in designing tm-supported range queries. PODC 2013: 299-308 - [c76]Irina Calciu, David Dice, Yossi Lev, Victor Luchangco, Virendra J. Marathe, Nir Shavit:
NUMA-aware reader-writer locks. PPoPP 2013: 157-166 - [c75]Alexander Matveev, Nir Shavit:
Reduced hardware transactions: a new approach to hybrid transactional memory. SPAA 2013: 11-22 - [i3]Dan Alistarh, Keren Censor-Hillel, Nir Shavit:
Are Lock-Free Concurrent Algorithms Practically Wait-Free? CoRR abs/1311.3200 (2013) - 2012
- [j37]Yehuda Afek, Nir Shavit, Moran Tzafrir:
Interrupting snapshots and the Java size method. J. Parallel Distributed Comput. 72(7): 880-888 (2012) - [j36]Faith Ellen, Danny Hendler, Nir Shavit:
On the Inherent Sequentiality of Concurrent Objects. SIAM J. Comput. 41(3): 519-536 (2012) - [j35]Maurice Herlihy, Nir Shavit:
Transactional memory: beyond the first two decades. SIGACT News 43(4): 101-103 (2012) - [c74]David Dice, Virendra J. Marathe, Nir Shavit:
Lock cohorting: a general technique for designing NUMA locks. PPoPP 2012: 247-256 - [c73]Yehuda Afek, Alexander Matveev, Nir Shavit:
Pessimistic Software Lock-Elision. DISC 2012: 297-311 - 2011
- [j34]Nir Shavit:
Data structures in the multicore age. Commun. ACM 54(3): 76-84 (2011) - [c72]Yehuda Afek, Hillel Avni, Nir Shavit:
Towards Consistency Oblivious Programming. OPODIS 2011: 65-79 - [c71]Maurice Herlihy, Nir Shavit:
On the Nature of Progress. OPODIS 2011: 313-328 - [c70]David Dice, Virendra J. Marathe, Nir Shavit:
Flat-combining NUMA locks. SPAA 2011: 65-74 - 2010
- [j33]Danny Hendler, Nir Shavit, Lena Yerushalmi:
A scalable lock-free stack algorithm. J. Parallel Distributed Comput. 70(1): 1-12 (2010) - [j32]Yehuda Afek, Ulrich Drepper, Pascal Felber, Christof Fetzer, Vincent Gramoli, Michael Hohmuth, Etienne Rivière, Per Stenström, Osman S. Unsal, Walther Maldonado, Derin Harmanci, Patrick Marlier, Stephan Diestelhorst, Martin Pohlack, Adrián Cristal, Ibrahim Hur, Aleksandar Dragojevic, Rachid Guerraoui, Michal Kapalka, Sasa Tomic, Guy Korland, Nir Shavit, Martin Nowack, Torvald Riegel:
The Velox Transactional Memory Stack. IEEE Micro 30(5): 76-87 (2010) - [c69]Luke Dalessandro, David Dice, Michael L. Scott, Nir Shavit, Michael F. Spear:
Transactional Mutex Locks. Euro-Par (2) 2010: 2-13 - [c68]Yehuda Afek, Guy Korland, Maria Natanzon, Nir Shavit:
Scalable Producer-Consumer Pools Based on Elimination-Diffraction Trees. Euro-Par (2) 2010: 151-162 - [c67]Yehuda Afek, Hillel Avni, David Dice, Nir Shavit:
Efficient Lock Free Privatization. OPODIS 2010: 333-347 - [c66]David Dice, Nir Shavit:
TLRW: return of the read-write lock. SPAA 2010: 284-293 - [c65]Danny Hendler, Itai Incze, Nir Shavit, Moran Tzafrir:
Flat combining and the synchronization-parallelism tradeoff. SPAA 2010: 355-364 - [c64]Danny Hendler, Itai Incze, Nir Shavit, Moran Tzafrir:
Scalable Flat-Combining Based Synchronous Queues. DISC 2010: 79-93
2000 – 2009
- 2009
- [j31]Victor Luchangco, Mark Moir, Nir Shavit:
Nonblocking k -Compare-Single-Swap. Theory Comput. Syst. 44(1): 39-66 (2009) - [c63]Nir Shavit:
Software transactional memory: Where do we come from? What are we? Where are we going? IPDPS 2009: 1 - [c62]Yehuda Afek, Nir Shavit, Moran Tzafrir:
Interrupting Snapshots and the JavaTM^{\mbox{\tiny TM}} Size() Method. DISC 2009: 78-92 - 2008
- [b2]Maurice Herlihy, Nir Shavit:
The art of multiprocessor programming. Morgan Kaufmann 2008, ISBN 978-0-12-370591-4, pp. I-XX, 1-508 - [j30]Edya Ladan-Mozes, Nir Shavit:
An optimistic approach to lock-free FIFO queues. Distributed Comput. 20(5): 323-341 (2008) - [j29]Danny Hendler, Nir Shavit:
Solo-valency and the cost of coordination. Distributed Comput. 21(1): 43-54 (2008) - [c61]Hillel Avni, Nir Shavit:
Maintaining Consistent Transactional States without a Global Clock. SIROCCO 2008: 131-140 - [c60]Maurice Herlihy, Nir Shavit, Moran Tzafrir:
Hopscotch Hashing. DISC 2008: 350-364 - [e4]Christof Fetzer, Tim Harris, Maurice Herlihy, Nir Shavit:
Transactional Memory: From Implementation to Application, 08.06. - 13.06.2008. Dagstuhl Seminar Proceedings 08241, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany 2008 [contents] - [e3]Friedhelm Meyer auf der Heide, Nir Shavit:
SPAA 2008: Proceedings of the 20th Annual ACM Symposium on Parallelism in Algorithms and Architectures, Munich, Germany, June 14-16, 2008. ACM 2008, ISBN 978-1-59593-973-9 [contents] - [i2]Christof Fetzer, Tim Harris, Maurice Herlihy, Nir Shavit:
08241 Abstracts Collection - Transactional Memory : From Implementation to Application. Transactional Memory: From Implementation to Application 2008 - [i1]Christof Fetzer, Tim Harris, Maurice Herlihy, Nir Shavit:
08241 Summary - Transactional Memory : From Implementation to Application. Transactional Memory: From Implementation to Application 2008 - 2007
- [j28]Steve Heller, Maurice Herlihy, Victor Luchangco, Mark Moir, William N. Scherer III, Nir Shavit:
A Lazy Concurrent List-Based Set Algorithm. Parallel Process. Lett. 17(4): 411-424 (2007) - [c59]David Dice, Nir Shavit:
Understanding Tradeoffs in Software Transactional Memory. CGO 2007: 21-33 - [c58]Nir Shavit, Nicolas Schabanel, Pascal Felber, Christos Kaklamanis:
Topic 12 Theory and Algorithms for Parallel Computation. Euro-Par 2007: 793 - [c57]Moshe Hoffman, Ori Shalev, Nir Shavit:
The Baskets Queue. OPODIS 2007: 401-414 - [c56]Ali-Reza Adl-Tabatabai, David Dice, Maurice Herlihy, Nir Shavit, Christos Kozyrakis, Christoph von Praun, Michael L. Scott:
Potential show-stoppers for transactional synchronization. PPoPP 2007: 55 - [c55]Maurice Herlihy, Yossi Lev, Victor Luchangco, Nir Shavit:
A Simple Optimistic Skiplist Algorithm. SIROCCO 2007: 124-138 - 2006
- [j27]Danny Hendler, Yossi Lev, Mark Moir, Nir Shavit:
A dynamic-sized nonblocking work stealing deque. Distributed Comput. 18(3): 189-207 (2006) - [j26]Faith Ellen Fich, Danny Hendler, Nir Shavit:
On the inherent weakness of conditional primitives. Distributed Comput. 18(4): 267-277 (2006) - [j25]Ori Shalev, Nir Shavit:
Split-ordered lists: Lock-free extensible hash tables. J. ACM 53(3): 379-405 (2006) - [j24]Ori Dvir, Maurice Herlihy, Nir Shavit:
Virtual Leashing: Creating a computational foundation for software protection. J. Parallel Distributed Comput. 66(9): 1233-1240 (2006) - [j23]Gunnar Hoest, Nir Shavit:
Toward a Topological Characterization of Asynchronous Complexity. SIAM J. Comput. 36(2): 457-497 (2006) - [c54]Victor Luchangco, Daniel Nussbaum, Nir Shavit:
A Hierarchical CLH Queue Lock. Euro-Par 2006: 801-810 - [c53]Ori Shalev, Nir Shavit:
Predictive log-synchronization. EuroSys 2006: 305-315 - [c52]Virendra J. Marathe, Mark Moir, Nir Shavit:
Composite Abortable Locks. IPDPS 2006: 1-10 - [c51]David Dice, Ori Shalev, Nir Shavit:
Transactional Locking II. DISC 2006: 194-208 - 2005
- [j22]Mark Moir, Nir Shavit, Jan Vitek:
Concurrency and synchronization in Java programs. Sci. Comput. Program. 58(3): 291-292 (2005) - [c50]Faith Ellen Fich, Danny Hendler, Nir Shavit:
Linear Lower Bounds on Real-World Implementations of Concurrent Objects. FOCS 2005: 165-173 - [c49]Ori Dvir, Maurice Herlihy, Nir Shavit:
Virtual Leashing: Internet-Based Software Piracy Protection. ICDCS 2005: 283-292 - [c48]Steve Heller, Maurice Herlihy, Victor Luchangco, Mark Moir, William N. Scherer III, Nir Shavit:
A Lazy Concurrent List-Based Set Algorithm. OPODIS 2005: 3-16 - [c47]Mark Moir, Daniel Nussbaum, Ori Shalev, Nir Shavit:
Using elimination to implement scalable and lock-free FIFO queues. SPAA 2005: 253-262 - [c46]Faith Ellen Fich, Victor Luchangco, Mark Moir, Nir Shavit:
Obstruction-Free Algorithms Can Be Practically Wait-Free. DISC 2005: 78-92 - [c45]Faith Ellen Fich, Victor Luchangco, Mark Moir, Nir Shavit:
Obstruction-Free Step Complexity: Lock-Free DCAS as an Example. DISC 2005: 493-494 - 2004
- [c44]Faith E. Fich, Danny Hendler, Nir Shavit:
On the inherent weakness of conditional synchronization primitives. PODC 2004: 80-87 - [c43]Danny Hendler, Nir Shavit, Lena Yerushalmi:
A scalable lock-free stack algorithm. SPAA 2004: 206-215 - [c42]Simon Doherty, David Detlefs, Lindsay Groves, Christine H. Flood, Victor Luchangco, Paul Alan Martin, Mark Moir, Nir Shavit, Guy L. Steele Jr.:
DCAS is not a silver bullet for nonblocking algorithm design. SPAA 2004: 216-224 - [c41]Edya Ladan-Mozes, Nir Shavit:
An Optimistic Approach to Lock-Free FIFO Queues. DISC 2004: 117-131 - [c40]Danny Hendler, Yossi Lev, Nir Shavit:
Dynamic Memory ABP Work-Stealing. DISC 2004: 188-200 - [r1]Mark Moir, Nir Shavit:
Concurrent Data Structures. Handbook of Data Structures and Applications 2004 - 2003
- [c39]Danny Hendler, Nir Shavit:
Operation-valency and the cost of coordination. PODC 2003: 84-91 - [c38]Ori Shalev, Nir Shavit:
Split-ordered lists: lock-free extensible hash tables. PODC 2003: 102-111 - [c37]Victor Luchangco, Mark Moir, Nir Shavit:
Nonblocking k-compare-single-swap. SPAA 2003: 314-323 - [c36]Victor Luchangco, Mark Moir, Nir Shavit:
On the Uncontended Complexity of Consensus. DISC 2003: 45-59 - 2002
- [j21]Nir Shavit:
Introduction. Distributed Comput. 15(4): 191 (2002) - [j20]Ole Agesen, David Detlefs, Christine H. Flood, Alexander T. Garthwaite, Paul Alan Martin, Mark Moir, Nir Shavit, Guy L. Steele Jr.:
DCAS-Based Concurrent Deques. Theory Comput. Syst. 35(3): 349-386 (2002) - [c35]Danny Hendler, Nir Shavit:
Non-blocking steal-half work queues. PODC 2002: 280-289 - [c34]Danny Hendler, Nir Shavit:
Work dealing. SPAA 2002: 164-172 - 2001
- [j19]Yaron Riany, Nir Shavit, Dan Touitou:
Towards a practical snapshot algorithm. Theor. Comput. Sci. 269(1-2): 163-201 (2001) - [c33]Christine H. Flood, David Detlefs, Nir Shavit, Xiolan Zhang:
Parallel Garbage Collection for Shared Memory Multiprocessors. Java Virtual Machine Research and Technology Symposium 2001 - [e2]Ajay D. Kshemkalyani, Nir Shavit:
Proceedings of the Twentieth Annual ACM Symposium on Principles of Distributed Computing, PODC 2001, Newport, Rhode Island, USA, August 26-29, 2001. ACM 2001, ISBN 1-58113-383-9 [contents] - 2000
- [j18]William Aiello, Costas Busch, Maurice Herlihy, Marios Mavronicolas, Nir Shavit, Dan Touitou:
Supporting Increment and Decrement Operations in Balancing Networks. Chic. J. Theor. Comput. Sci. 2000 (2000) - [j17]Giovanni Della-Libera, Nir Shavit:
Reactive Diffracting Trees. J. Parallel Distributed Comput. 60(7): 853-890 (2000) - [j16]Nir Shavit, Asaph Zemach:
Combining Funnels: A Dynamic Approach to Software Combining. J. Parallel Distributed Comput. 60(11): 1355-1387 (2000) - [c32]Nir Shavit, Itay Lotan:
Skiplist-Based Concurrent Priority Queues. IPDPS 2000: 263-268 - [c31]Ole Agesen, David Detlefs, Christine H. Flood, Alex Garthwaite, Paul Alan Martin, Nir Shavit, Guy L. Steele Jr.:
DCAS-based concurrent deques. SPAA 2000: 137-146 - [c30]David Detlefs, Christine H. Flood, Alex Garthwaite, Paul Alan Martin, Nir Shavit, Guy L. Steele Jr.:
Even Better DCAS-Based Concurrent Deques. DISC 2000: 59-73
1990 – 1999
- 1999
- [j15]Maurice Herlihy, Nir Shavit:
The topological structure of asynchronous computability. J. ACM 46(6): 858-923 (1999) - [j14]Nancy A. Lynch, Nir Shavit, Alexander A. Shvartsman, Dan Touitou:
Timing Conditions for Linearizability in Uniform Counting Networks. Theor. Comput. Sci. 220(1): 67-91 (1999) - [c29]Nir Shavit, Asaph Zemach:
Scalable Concurrent Priority Queue Algorithms. PODC 1999: 113-122 - [c28]William Aiello, Costas Busch, Maurice Herlihy, Marios Mavronicolas, Nir Shavit, Dan Touitou:
Supporting Increment and Decrement Operations in Balancing Networks. STACS 1999: 393-403 - [c27]Nir Shavit, Asaph Zemach:
Concurrent Priority Queue Algorithms. WDAS 1999: 107-132 - [e1]Marios Mavronicolas, Michael Merritt, Nir Shavit:
Networks in Distributed Computing, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, October 27-29, 1997. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 45, DIMACS/AMS 1999, ISBN 978-0-8218-0992-1 [contents] - 1998
- [j13]Faith E. Fich, Maurice Herlihy, Nir Shavit:
On the Space Complexity of Randomized Synchronization. J. ACM 45(5): 843-862 (1998) - [j12]Nir Shavit, Eli Upfal, Asaph Zemach:
A Steady State Analysis of Diffracting Trees. Theory Comput. Syst. 31(4): 403-423 (1998) - [c26]Nir Shavit, Asaph Zemach:
Combining Funnels: A New Twist on an Old Tale... PODC 1998: 61-70 - 1997
- [j11]Nir Shavit, Dan Touitou:
Software Transactional Memory. Distributed Comput. 10(2): 99-116 (1997) - [j10]Yehuda Afek, Baruch Awerbuch, Eli Gafni, Yishay Mansour, Adi Rosén, Nir Shavit:
Slide-The Key to Polynomial End-to-End Communication. J. Algorithms 22(1): 158-186 (1997) - [j9]Nir Shavit, Dan Touitou:
Elimination Trees and the Construction of Pools and Stacks. Theory Comput. Syst. 30(6): 645-670 (1997) - [j8]Danny Dolev, Nir Shavit:
Bounded Concurrent Time-Stamping. SIAM J. Comput. 26(2): 418-455 (1997) - [c25]Nir Shavit, Eli Upfal, Asaph Zemach:
A Wait-Free Sorting Algorithm. PODC 1997: 121-128 - [c24]Gunnar Hoest, Nir Shavit:
Towards a Topological Characterization of Asynchronous Complexity (Preliminary Version). PODC 1997: 199-208 - [c23]Giovanni Della-Libera, Nir Shavit:
Reactive Diffracting Trees. SPAA 1997: 24-32 - 1996
- [j7]Maurice Herlihy, Nir Shavit, Orli Waarts:
Linearizable Counting Networks. Distributed Comput. 9(4): 193-203 (1996) - [j6]Nir Shavit, Asaph Zemach:
Diffracting Trees. ACM Trans. Comput. Syst. 14(4): 385-428 (1996) - [c22]Nancy A. Lynch, Nir Shavit, Alexander A. Shvartsman, Dan Touitou:
Counting Networks are Practically Linearizable. PODC 1996: 280-289 - [c21]Nir Shavit, Eli Upfal, Asaph Zemach:
A Steady State Analysis of Diffracting Trees (Extended Abstract). SPAA 1996: 33-41 - [p1]Maurice Herlihy, Nir Shavit:
Applications of Algebraic Topology to Concurrent Computation. Applications on Advanced Architecture Computers 1996: 255-263 - 1995
- [j5]Maurice Herlihy, Beng-Hong Lim, Nir Shavit:
Scalable Concurrent Counting. ACM Trans. Comput. Syst. 13(4): 343-364 (1995) - [c20]Yaron Riany, Nir Shavit, Dan Touitou:
Towards A Practical Snapshot Algorithm. ISTCS 1995: 121-129 - [c19]Nir Shavit, Dan Touitou:
Software Transactional Memory. PODC 1995: 204-213 - [c18]Nir Shavit, Dan Touitou:
Elimination Trees and the Construction of Pools and Stacks (Preliminary Version). SPAA 1995: 54-63 - 1994
- [j4]Hagit Attiya, Nancy A. Lynch, Nir Shavit:
Are Wait-Free Algorithms Fast? J. ACM 41(4): 725-763 (1994) - [j3]James Aspnes, Maurice Herlihy, Nir Shavit:
Counting Networks. J. ACM 41(5): 1020-1048 (1994) - [j2]Yehuda Afek, Danny Dolev, Eli Gafni, Michael Merritt, Nir Shavit:
A Bounded First-In, First-Enabled Solution to the l-Exclusion Problem. ACM Trans. Program. Lang. Syst. 16(3): 939-953 (1994) - [c17]Nir Shavit, Asaph Zemach:
Diffracting Trees (Preliminary Version). SPAA 1994: 167-176 - [c16]Maurice Herlihy, Nir Shavit:
A simple constructive computability theorem for wait-free computation. STOC 1994: 243-252 - 1993
- [j1]Yehuda Afek, Hagit Attiya, Danny Dolev, Eli Gafni, Michael Merritt, Nir Shavit:
Atomic Snapshots of Shared Memory. J. ACM 40(4): 873-890 (1993) - [c15]Faith E. Fich, Maurice Herlihy, Nir Shavit:
On the Space Complexity of Randomized Synchronization. PODC 1993: 241-249 - [c14]Maurice Herlihy, Nir Shavit:
The asynchronous computability theorem for t-resilient tasks. STOC 1993: 111-120 - 1992
- [c13]Rainer Gawlick, Nancy A. Lynch, Nir Shavit:
Concurrent Timestamping Made Simple. ISTCS 1992: 171-183 - [c12]Nancy A. Lynch, Nir Shavit:
Timing-Based Mutual Exclusion. RTSS 1992: 2-11 - [c11]Maurice Herlihy, Beng-Hong Lim, Nir Shavit:
Low Contention Load Balancing on Large-Scale Multiprocessors. SPAA 1992: 219-227 - 1991
- [c10]Maurice Herlihy, Nir Shavit, Orli Waarts:
Low Contention Linearizable Counting. FOCS 1991: 526-535 - [c9]Michael E. Saks, Nir Shavit, Heather Woll:
Optimal Time Randomized Consensus - Making Resilient Algorithms Fast in Practice. SODA 1991: 351-362 - [c8]James Aspnes, Maurice Herlihy, Nir Shavit:
Counting Networks and Multi-Processor Coordination. STOC 1991: 348-358 - 1990
- [c7]Hagit Attiya, Nancy A. Lynch, Nir Shavit:
Are Wait-Free Algorithms Fast? (Extended Abstract). FOCS 1990: 55-64 - [c6]Yehuda Afek, Danny Dolev, Hagit Attiya, Eli Gafni, Michael Merritt, Nir Shavit:
Atomic Snapshots of Shared Memory. PODC 1990: 1-13
1980 – 1989
- 1989
- [b1]Nir Shavit:
Concurrent time stamping (חתימות זמן מקביליות.). Hebrew University of Jerusalem, Israel, 1989 - [c5]Baruch Awerbuch, Yishay Mansour, Nir Shavit:
Polynomial End-To-End Communication (Extended Abstract). FOCS 1989: 358-363 - [c4]Hagit Attiya, Danny Dolev, Nir Shavit:
Bounded Polynomial Randomized Consensus. PODC 1989: 281-293 - [c3]Danny Dolev, Nir Shavit:
Bounded Concurrent Time-Stamp Systems Are Constructible. STOC 1989: 454-466 - 1988
- [c2]Danny Dolev, Eli Gafni, Nir Shavit:
Toward a Non-Atomic Era: \ell-Exclusion as a Test Case. STOC 1988: 78-92 - 1986
- [c1]Nir Shavit, Nissim Francez:
A New Approach to Detection of Locally Indicative Stability. ICALP 1986: 344-358
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-04-14 01:32 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
