Nir Shavit’s Publications:

2020

Mi, Lu, Wang, Hao, Meirovitch, Yaron, Schalek, Richard, Turaga, Srinivas C., Lichtman, Jeff W., Samuel, Aravinthan D. T.
and Shavit, Nir.
Learning Guided Electron Microscopy with Active Acquisition. 23rd International Conference on Medical Image Computing and Computer Assisted Intervention (MICCAI), October 2020. Presentation materials.

Rosenfeld, Jonathan S., Frankle, Jonathan, Carbin, Michael, and Shavit, Nir. On the Predictability of Pruning Across Scales. arXiv:2006.10621, June 2020.

Witvliet, Daniel, Mulcahy, Ben, Mitchell, James K., Meirovitch, Yaron, Berger, Daniel R., Wu, Yuelong, Liu, Yufang, Koh, Wan Xian, Parvathala, Rajeev, Holmyard, Douglas, Schalek, Richard L., Shavit, Nir, Chisholm, Andrew D., Lichtman, Jeff W., Samuel, Aravinthan D.T., and Zhen, Mei. Connectomes across development reveal principles of brain maturation in C. elegans. bioRxiv 2020.04.30.066209 https://doi.org/10.1101/2020.04.30.066209.

Jonathan S., Rosenfeld, Amir Rosenfeld, Yonatan Belinkov, and Nir Shavit. A Constructive Prediction of the Generalization Error Across Scales. Proceedings of the International Conference on Learning Representations (ICLR 2020), Addis Ababa, Ethiopia, April 2020. Also, arXiv:1909.12673, September 2019.

2019

Lu Mi, Hao Wang, Yonglong Tian, and Nir Shavit. Training-Free Uncertainty Estimation for Neural Networks. arXiv:1910.04858, September 2019.

Yaron Meirovitch, Lu Mi, Hayk Saribekyan, Alexander Matveev, David Rolnick, and Nir Shavit. Cross-Classification Clustering: An Efficient Multi-Object Tracking Technique for 3-D Instance Segmentation in Connectomics. The IEEE Conference on Computer Vision and Pattern Recognition (CVPR), pages 8425-8435, Long Beach, California, June 2019.

Daniel Witvliet, Ben Mulcahy, James K. Mitchell, Yaron Meirovitch, Daniel R. Berger, Douglas Holmyard, Richard L. Schalek, Steven J. Cook, Wan Xian Koh, Marianna Neubauer, Christine Rehaluk, Zitong Wang, David Kersen, Andrew D. Chisholm, Nir Shavit, Jeffrey W. Lichtman, Aravinthan Samuel, and Mei Zhen. Invariant, stochastic, and developmentally regulated synapses constitute the C. elegans connectome from isogenic individuals. Poster Presentation at Computational and Systems Neuroscience (Cosyne 2019), Lisbon, Portugal, March 2019.

2018

Dan Alistarh, Justin Kopinsky, Petr Kuznetsov, Srivatsan Ravi, and Nir Shavit. Inherent limitations of hybrid transactional memory. Distributed Computing, 31(3): 167-185, 2018.

Dan Alistarh, Will L. Leiserson., Alex Matveev, and Nir Shavit. ThreadScan: Automatic and Scalable Memory Reclamation. ACM Transactions on Parallel Computing (TOPC), 4(4):18:1-18:18, 2018.

Shibani Santurkar, David M. Budden, and Nir Shavit. Generative Compression. Picture Coding Symposium (PCS 2018), pages 258-262, San Francisco, CA, June 2018. Also, CoRR abs/1703.01467, 2017.

Moritz Helmstaedter, Jeff Lichtman, and Nir Shavit. High Throughput Connectomics (Dagstuhl Seminar 18481). Dagstuhl Reports 8(11): 112-138, 2018.

Yaron Meirovitch, Lu Mi, Hayk Saribekyan, Alex Matveev, David Rolnick, Casimir Wierzynski, and Nir Shavit. Cross-Classification Clustering: An Efficient Multi-Object Tracking Technique for 3-D Instance Segmentation in Connectomics. CoRR abs/1812.01157, 2018.

2017

Dan Alistarh, Will L. Leiserson., Alex Matveev, and Nir Shavit. Forkscan: Conservative Memory Reclamation for Modern Operating Systems. Proceedings of the Twelfth European Conference on Computer Systems (EuroSys 2017), Belgrade, Siberia, pages 483-498, April 2017.

David M. Budden, Alexander Matveev, Shibani Santurkar, Shraman Ray Chaudhuri, and Nir Shavit. Deep Tensor Convolution on Multicores. 34th International Conference on Machine Learning (ICML 2017), pages 615-624, Sydney, Australia, August 2017. Also, CoRR abs/1611.06565, 2016.

Alexander Matveev, Yaron Meirovitch, Hayk Saribekyan, Wiktor Jakubiuk, Tim Kaler, Gergely Odor, David M. Budden, Aleksandar Zlateski, and Nir Shavit. A Multicore Path to Connectomics-on-Demand. 22nd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPOPP 2017), pages 267-281, Austin, Texas, February 2017.

Shibani Santurkar, David M. Budden, Alex Matveev, Heather Berlin, Hayk Saribekyan, Yaron Meirovitch, and Nir Shavit. Toward Streaming Synapse Detection with Compositional ConvNets. CoRR abs/1702.07386, 2017.

Shibani Santurkar, David M. Budden, and Nir Shavit. Generative Compression. CoRR abs/1703.01467, 2017.

David Rolnick, Andreas Veit, Serge J. Belongie, and Nir Shavit. Deep Learning is Robust to Massive Label Noise. CoRR abs/1705.10694, 2017.

David Rolnick, Yaron Meirovitch, Toufiq Parag, Hanspeter Pfister, Viren Jain, Jeff W. Lichtman, Edward S. Boyden, and Nir Shavit. Morphological Error Detection in 3D Segmentations. CoRR abs/1705.10882, 2017.

2016

Nir Shavit and Gadi Taubenfeld. The computability of relaxed data structures: queues and stacks as examples. Distributed Computing, 29(5):395-407, 2016. Earlier version in Structural Information and Communication Complexity (SIROCCO), in the series Lecture Notes in Computer Science, volume 9439, pages 414-428, Springer DOI 10.1007/s00446-016-0272-0, 2015.

Dan Alistarh, Keren Censor-Hillel, and Nir Shavit. Are Lock-Free Concurrent Algorithms Practically Wait-Free? Journal of the ACM, 63(4):31:1-31:20, 2016.

Nir Shavit. High Throughput Connectomics (Keynote Abstract). 20th International Conference on Principles of Distributed Systems (OPODIS 2016), pages 1:1-1:1, Madrid, Spain, December 2016.

Faith Ellen, Rati Gelashvili, Nir Shavit, and Leqi Zhu. A Complexity-Based Hierarchy for Multiprocessor Synchronization: [Extended Abstract]. Proceedings of the ACM Symposium on Principles of Distributed Computing (PODC 2016), pages 289-298, Chicago, Illinois, July 2016. Also, CoRR abs/1607.06139, 2016.

Nir Shavit. A Multicore Path to Connectomics-on-Demand (Keynote Abstract). Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2016), page 211, Pacific Grove, California, July 2016.

Nir Shavit and Alex Matveev Transactional Memory. Encyclopedia of Algorithms, pages 2246-2249, 2016. Springer.

Faith Ellen, Rati Gelashvili, Nir Shavit, and Leqi Zhu. A Complexity-Based Hierarchy for Multiprocessor Synchronization. CoRR abs/1607.06139, 2016.

David M. Budden, Alexander Matveev, Shibani Santurkar, Shraman Ray Chaudhuri, and Nir Shavit. Deep Tensor Convolution on Multicores. CoRR abs/1611.06565, 2016.

Yaron Meirovitch, Alexander Matveev, Hayk Saribekyan, David M. Budden, David Rolnick, Gergely Odor, Seymour Knowles-Barley, Thouis Raymond Jones, Hanspeter Pfister, Jeff William Lichtman, and Nir Shavit. Multi-Pass Approach to Large-Scale Connectomics. CoRR abs/1612.02120, 2016.

2015

Yehuda Afek, Alex Matveev, Oscar R. Moll, and Nir Shavit. Amalgamated Lock-Elision. Proceedings of the 29th International Symposium on Distributed Computing (DISC 2015), pages 309-324, Tokyo, Japan, May 2015.

Dan Alistarh, Will Leiserson, Alex Matveev, and Nir Shavit. ThreadScan: Automatic and Scalable Memory Reclamation. Proceedings of the 27th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2015), Portland, Oregon, pages 123-132, June 13-15, 2015.

Dan Alistarh, Justin Kopinsky, Jerry Li, and Nir Shavit. The SprayList: A Scalable Relaxed Priority Queue. Proceedings of the 20th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPOPP 2015), pages 11-20, San Francisco, CA, February 7-8, 2015.

Dan Alistarh, Justin Kopinsky, Petr Kuznetsov, Srivatsan Ravi, and Nir Shavit. Inherent Limitations of Hybrid Transactional Memory. Proceedings of the 29th International Symposium on Distributed Computing (DISC 2015), pages 185-199, Tokyo, Japan, May 2015.

David Dice, Virendra J. Marathe, and Nir Shavit. Lock Cohorting: A General Technique for Designing NUMA Locks. ACM Transactions on Parallel Computing,1:2, article 13, February 2015.

Alex Matveev, Nir Shavit, Pascal Felber, and Patrick Marlier. Read-Log-Update: A Lightweight Synchronization Mechanism for Concurrent Programming. Proceedings of the 25th ACM Symposium on Operating Systems Principles (SOSP 2015), pages 168-183, Monterey, California, October 4-7, 2015.

Alex Matveev and Nir Shavit. Reduced Hardware NOrec: A Safe and Scalable Hybrid Transactional Memory. Proceedings of the 20th International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS 2015), pages 59-71, Istanbul, Turkey, March 14-18, 2015.

Nir Shavit and Gadi Taubenfeld. The computability of relaxed data structures: queues and stacks as examples. Structural Information and Communication Complexity (SIROCCO), in the series Lecture Notes in Computer Science, volume 9439, pages 414-428, Springer DOI 10.1007/s00446-016-0272-0, 2015.

2014

Dan Alistarh, Patrick Eugster, Maurice Herlihy, Alex Matveev and Nir Shavit. StackTrack: An Automated Transactional Approach to Concurrent Memory Reclamation. Proceedings of the 9th European Conference on Computer Systems (EuroSys 2014), Article No. 25, Amsterdam, The Netherlands, April 2014.

Dan Alistarh, Justin Kopinsky, Alex Matveev and Nir Shavit. The LevelArray: A Fast, Practical Long-Lived Renaming Algorithm. Proceedings of the 34th Annual International Conference on Distributed Computing Systems (ICDCS 2014), Madrid, Spain, July 2014.

Dan Alistarh, Justin Kopinsky, Alex Matveev and Nir Shavit. The LevelArray: A Fast, Practical Long-Lived Renaming Algorithm. CoRR abs/1405.5461, 2014.

Dan Alistarh, Oksana Denysyuk, Luis E.T. Rodrigues, and Nir Shavit. Balls-into-Leaves: Sub-logarithmic Renaming in Synchronous Message-Passing Systems. Proceedings of the 33rd Annual ACM Symposium on Principles of Distributed Computing (PODC 2014), pages 232-241, Paris, France, July 2014.

Dan Alistarh, Keren Censor-Hillel, and Nir Shavit. Are Lock-Free Concurrent Algorithms Practically Wait-Free? Proceedings of the ACM 46th Annual Symposium on the Theory of Computing (STOC 2014), pages 714-723, New York, New York, June 2014.

Zeyuan Allen-Zhu, Rati Gelashvili, Silvio Micali, and Nir Shavit. Sparse sign-consistent Johnson-Lindenstrauss matrices: Compression with neuroscience-based constraints. Proceedings of the National Academy of Sciences, 111(47), pages 16872-16876, October 2014.

David Dice, Virendra J. Marathe, and Nir Shavit. Brief Announcement: Persistent Unfairness Arising From Cache Residency Imbalance. Proceedings of the 26th Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2014), pages 82-83, Prague, Czech Republic, June 2014.

Rati Gelashvili, Mohsen Ghaffari, Jerry Li, and Nir Shavit. On the Importance of Registers for Computability. Proceedings of the 18th International Conference on Principles of Distributed Systems (OPODIS 2014), Cortina d’Amprezzo, Italy, December 16-19, 2014.

Jeff Lichtman, Hanspeter Pfister, and Nir Shavit The big data challenges of connectomics. Nature Neuroscience, 17, pages 1448-1454, November 2014.

Dan Alistarh, Keren Censor-Hillel, and Nir Shavit. Brief announcement: are lock-free concurrent algorithms practically wait-free? Proceedings of the 33rd Annual ACM Symposium on Principles of Distributed Computing (PODC 2014), pages 50-52,

Zeyuan Allen Zhu, Rati Gelashvili, Silvio Micali, and Nir Shavit. Johnson-Lindenstrauss Compression with Neuroscience-Based Constraints. CoRR abs/1411.5383, 2014.

Rati Gelashvili, Mohsen Ghaffari, Jerry Li, and Nir Shavit. On the Importance of Registers for Computability. CoRR abs/1411.0168, 2014.

Dan Alistarh, Justin Kopinsky, Petr Kuznetsov, Srivatsan Ravi, and Nir Shavit. Inherent Limitations of Hybrid Transactional Memory. CoRR abs/1405.5689, 2014.

2013

Yehuda Afek, Alex Matveev and Nir Shavit. Amalgamated Transactions: Executing Long Transactions Mostly in Hardware. Compiler, Architecture and Tools Conference, Haifa, Israel, unpublished, November 2013.

Hillel Avni, Nir Shavit and Adi Suissa. Leaplist: Lessons Learned in Designing TM-Supported Range Queries. Proceedings of the 32nd Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC 2013), pages 299-308, Montreal, Canada, July 2013.

Irina Calciu, David Dice, Yossi Lev, Victor Luchangco, Virendra J. Marathe, and Nir Shavit. NUMA-aware reader-writer locks. Proceedings of the 18th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPOPP 2013), pages 157-166, Shenzhen, China, February 2013.

Dan Alistarh, Keren Censor-Hillel, and Nir Shavit. Are Lock-Free Concurrent Algorithms Practically Wait-Free? CoRR abs/1311.3200, 2013.

Alex Matveev and Nir Shavit. Reduced Hardware Transactions: A New Approach to Hybrid Transactional Memory. Proceedings of the 25th Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2013), pages 11-22, March 2013.

Rotem Oshman and Nir Shavit. The SkipTrie: Low-Depth Concurrent Search without Rebalancing. Proceedings of the 32nd Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC 2013), pages 23-32, Montreal, Canada, July 2013.

2012

Yehuda Afek, Alex Matveev and Nir Shavit. Pessimistic Software Lock-Elision. Proceedings of the 26th Annual International Symposium on Distributed Computing (DISC 2012), pages 297-311, Salvador, Brazil, October 2012.

David Dice, Virendra J. Marathe, and Nir Shavit. Lock Cohorting: A General Technique for Designing NUMA locks. Proceedings of the 17th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPOPP 2012), pages 247-256, New Orleans, Louisiana, February 2012.

Faith Ellen, Danny Hendler, and Nir Shavit. On the Inherent Sequentiality of Concurrent Objects. SIAM Journal on Computing, 41(3):519-536, 2012.

Maurice Herlihy and Nir Shavit. Transactional memory: beyond the first two decades. SIGACT News, volume 43, pages 101-103, December 2012.

Yehuda Afek, Nir Shavit, and Moran Tzafrir. Interrupting snapshots and the Java size method. Journal of Parallel and Distributed Computing, 72(7):880-888, 2012.

2011

Yehuda Afek, Hillel Avni, and Nir Shavit. Towards Consistency Oblivious Programming. Proceedings of the 15th International Conference on Principles of Distributed Systems (OPODIS 2011), pages 65-79, Toulouse, France, December 2011.

David Dice, Virendra J. Marathe, and Nir Shavit. Flat-combining NUMA locks. Procedings of the 24rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2011), pages 65-74, San Jose, California, June 2011.

Maurice Herlihy and Nir Shavit. On the Nature of Progress. Proceedings of the 15th International Conference on Principles of Distributed Systems (OPODIS 2011), pages 313-328, Toulouse, France, December 2011.

Nir Shavit. Data structures in the multicore age. Communications of the ACM, 54(3):76-84, 2011.

2010

Yehuda Afek, Guy Korland, Maria Natanzon, and Nir Shavit. Scalable Producer-Consumer Pools based on Elimination-Diffraction Trees. Proceedings of the European Conference on Parallel Computing (EuroPar), pages 151-162, Sachia, Naples, Italy, August 2010.

Adrian Cristal, Ulrich Drepper, Stephan Diestelhorst, Alexander Dragojevic, Christoph Fetzer, Pascal Felber, Vincent Gramoli, Rachid Guerraoui, Derin Harmanci, Michael Hohmuth, Ibrahim Hur, Michal Kapalka, Guy Korland, Walther Maldonado, Patrick Marlier, Martin Nowack, Martin Pohlack, Torvald Riegel, Etienne Riviere, Nir Shavit, Per Stenstrom, Sasa Tomic, and Osman Unsal. The VELOX Transactional Memory Stack. IEEE Micro, 30(5):76-87, September 2010.

Luke Dalessandro, David Dice, Michael L. Scott, Nir Shavit and Michael F. Spear. Transactional Mutex Locks. Proceedings of the European Conference on Parallel Computing (EuroPar), 10 Pages, Sachia, Naples, Italy, August 2010.

David Dice and Nir Shavit. TLRW Bytelock: Return of the Read-Write Lock. Proceedings of the Twenty Third ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2010), pages 284-293, Santorini, Greece, June 2010.

David Dice, Alex Matveev and Nir Shavit. Implicit Privatization Using Private Transactions. Proceedings of the Transact 2010 Workshop, 10 pages, Paris, France, April 2010.

Guy Korland, Nir Shavit, and Pascal Felber. Noninvasive Concurrency with Java STM. IEEE Transactions on High-Performance Embedded Architectures and Compilers, 19 pages, 2010.

Pascal Felber, Guy Korland, and Nir Shavit. Deuce: Noninvasive concurrency with a Java STM. Proceedings of the Workshop on Programmability Issues for Multi-Core Computers (MULTIPROG), 10 pages, Pisa, Italy, March 2010.

Danny Hendler, Itai Incze, Nir Shavit and Moran Tzafrir. Scalable Flat-Combining Based Synchronous Queues. Proceedings of the 23rd International Symposium on Distributed Computing (DISC 2010), pages 79-93, Boston, MA, September 2010.

Danny Hendler, Itai Incze, Nir Shavit and Moran Tzafrir. Flat-Combining and the Synchronization Parallelism Tradeoff. Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2010), pages 355-364, Santorini, Greece, June 2010.

Yehuda Afek, Hillel Avni, David Dice, and Nir Shavit. Efficient Lock Free Privatization. Proceedings of the 14th International Conference (OPODIS 2010), Tozeur, Tunisia, December 14-17, 2010, volume 6490 of Lecture Notes in Computer Science, pages 333-347, Springer 2010,

Danny Hendler, Nir Shavit, and Lena Yerushalmi. A scalable lock-free stack algorithm. J. Parallel Distrib. Comput., 70(1):1-12, 2010.

2009

Yehuda Afek, Nir Shavit and Moran Tzafrir. Interrupting Snapshots and the JavaTM Size() Method. Proceedings of the 23rd International Symposium on Distributed Computing (DISC 2009), pages 78-92, Elche, Spain, September 2009.

Victor Luchangco, Mark Moir, and Nir Shavit. Nonblocking K-Compare-Single-Swap. Theory of Computing Systems, 44(1):39-66, 2009.

Nir Shavit. Software transactional memory: Where do we come from? What are we? Where are we going? 23rd IEEE International Symposium on Parallel and Distributed Processing (IPDPS), Rome, Italy, May 2009.

2008

Maurice Herlihy and Nir Shavit. The Art of Multiprocessor Programming. Morgan Kaufmann 2008, ISBN 978-0-12-370591-4.

Edya Ladan-Mozes and Nir Shavit. An optimistic approach to lock-free FIFO queues. Distributed Computing, 20(5):323-341, 2008.

Hillel Avni and Nir Shavit. Maintaining Consistent Transactional States without a Global Clock. Proceedings of 15th International Colloquium on Structural Information and Communication Complexity (SIROCCO), pages 131-140, Villars-sur-Ollon, Switzerland, July 2008.

Danny Hendler and Nir Shavit. Solo-valency and the Cost of Coordination. Distributed Computing, 21(1):43-54, June 2008.

Maurice Herlihy, Nir Shavit and Moran Tzafrir. Hopscotch Hashing. Proceedings of the 22nd International Symposium on Distributed Computing (DISC 2008), pages 350-364, Arcachon, France, September 2008.

2007

Steve Heller, Maurice Herlihy, Victor Luchangco, Mark Moir, William N. Scherer III, and Nir Shavit. A Lazy Concurrent List-Based Set Algorithm. Parallel Processing Letters, 17(4:411-424, 2007.

David Dice and Nir Shavit. Understanding Tradeoffs in Software Transactional Memory. Proceedings of the 2007 International Symposium on Code Generation and Optimization (CGO), San Jose, California, March 2007.

Maurice Herlihy, Yossi Lev, Victor Luchangco, and Nir Shavit. A Simple Optimistic Skip-list Algorithm. Proceedings of the 14th Colloquium on Structural Information and Communication Complexity (SIROCCO), pages 124-138, Castiglioncello, Italy. June 2007. Also appears as a Brief Announcement in the Proceedings of the 10th International Conference on Principles of Distributed Systems (OPODIS 2006), Bordeaux, France, December 2006.

Moshe Hoffman, Ori Shalev, and Nir Shavit. The Baskets Queue. Proceedings of the 11th International Conference on Principles of Distributed Systems (OPODIS 2007), pages 401-414, Guadeloupe, West Indies, December 2007.

Nir Shavit, Nicolas Schabanel, Pascal Felber, and Christos Kaklamanis. Topic 12 Theory and Algorithms for Parallel Computation. Parallel Processing, 13th International Euro-Par Conference (Euro-Par 2007), page 73, Rennes, France, volume 4641 of Lecture Notes in Computer Science, August 2007. Springer.

Alex Matveev, Ori Shalev, and Nir Shavit. Dynamic Identification of Transactional Memory Locations. Technical Report, 2007.

Ali-Reza Adl-Tabatabai, David Dice, Maurice Herlihy, Nir Shavit, Christos Kozyrakis, Christoph von Praun, and Michael L. Scott. Potential show-stoppers for transactional synchronization. Proceedings of the 12th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPOPP 2007), page 55, San Jose, California, March 2007.

2006

Maurice Herlihy, Yossi Lev, Victor Luchangco, and Nir Shavit. Brief Announcement: A Simple Optimistic Skip-list Algorithm. Proceedings of the 10th International Conference on Principles of Distributed Systems (OPODIS 2006), Bordeaux, France, December 2006.

Gunnar Hoest and Nir Shavit. Towards a Topological Characterization of Asynchronous Complexity. SIAM Journal on Computing, 36(2):457-497, 2006. A preliminary version appeared in Proceedings of the 16th Annual ACM Symposium on Principles of Distributed Computing (PODC 1997), Santa Barbara, California, pages 199-208, 1997.

Yossi Lev, Maurice Herlihy, Victor Luchangco, and Nir Shavit. A Provably Correct Scalable Skiplist (Brief Announcement). Proceedings of the 10th International Conference On Principles of Distributed Systems (OPODIS 2006), Bordeaux, France, December 2006. Also in Parallel Computing (EuroPar 2006), pages 801-810, Dresden, Germany, September 2006.

Victor Luchangco, Daniel Nussbaum, and Nir Shavit. A Hierarchical CLH Queue Lock. Proceedings of the European Conference on Parallel Computing (EuroPar 2006), pages 801-810, Dresden, Germany, September 2006.

Ori Dvir, Maurice Herlihy and Nir Shavit. Virtual Leashing: Creating a Computational Foundation for Software Protection. Journal of Parallel and Distributed Computing (Special Issue), 66(9):1233-1240, September 2006. A preliminary version, titled: Virtual leashing: Internet-Based Software Protection, appeared in the Proceedings of the 18th International Conference on Distributed Computing Systems (ICDCS 2005), pages 283-292, Columbus, Ohio, 2005.

Ori Shalev and Nir Shavit. Split-Ordered Lists Lock-free Extensible Hash Tables. Journal of the ACM, 53(3):379-405, 2006. A preliminary version appeared in the Proceedings of the 22nd Annual ACM Symposium on Principles of Distributed Computing (PODC 2003), pages 102-111, Boston, Massachusetts, July 2003.

Virendra J. Marathe, Mark Moir and Nir Shavit. Composite Abortable Locks. Proceedings of the 20th IEEE International Parallel & Distributed Processing Symposium (IPDPS 2006), pages 1-10, Rhodes, Greece, April 2006.

Danny Hendler, Yossi Lev, Mark Moir and Nir Shavit. A Dynamic-Sized Nonblocking Work Stealing Deque. Distributed Computing (Special Issue), 18(3):189-207, 2006. A preliminary version, titled: Dynamic Memory ABP Work-Stealing, appeared in the Proceedings of the 18th International Conference on Distributed Computing, pages 188-200, Amsterdam, The Netherlands, October 2004.

David Dice, Ori Shalev, and Nir Shavit. Transactional Locking II. Proceedings of the 20th International Symposium on Distributed Computing (DISC 2006), pages 194-208, Stockholm, Sweden, September 2006.

Ori Shalev and Nir Shavit. Predictive Log Synchronization. Proceedings of EuroSys 2006, pages 305-315, Leuven, Belgium, April 2006.

David Dice and Nir Shavit. What Really Makes Transactions Faster? Proceedings of the 1st TRANSACT 2006 Workshop (Transact06), Ottawa, Canada, March 2006.

Faith Ellen, Danny Hendler and Nir Shavit. On the Inherent Weakness of Conditional Primitives. Distributed Computing, 18(4):267-277, 2006. A preliminary version, titled: On the Inherent Weakness of Conditional Synchronization Primitives, appeared in the Proceedings of the 23rd Annual ACM Symposium on Principles of Distributed Computing (PODC 2004), pages 80-87, Saint Johns, Newfoundland, Canada, July 2004.

2005

Faith Ellen, Danny Hendler and Nir Shavit. Linear Lower Bounds on Real-World Implementations of Concurrent Objects. Proceedings of the 46th Annual Symposium on Foundations of Computer Science (FOCS 2005), pages 165-173, Pittsburgh, Pennsylvania, October 2005.

Faith Ellen, Victor Luchangco, Mark Moir, and Nir Shavit. Obstruction-Free Step Complexity: Lock-Free DCAS as an Example (Brief announcement). Proceedings of the 19th International Symposium on Distributed Computing (DISC 2005), pages 493-494, Krakow, Poland, September 2005.

Faith Ellen, Victor Luchangco, Mark Moir, and Nir Shavit. Obstruction-Free Algorithms Can Be Practically Wait-Free. Proceedings of the 19th International Symposium on Distributed Computing (DISC 2005), pages 78-92, Krakow, Poland, September 2005.

Ori Dvir, Maurice Herlihy, and Nir Shavit. Virtual leashing: Internet-Based Software Protection. Proceedings of the 18th International Conference on Distributed Computing Systems (ICDCS 2005), pages 283-292, Columbus, Ohio, 2005.

Steve Heller, Maurice Herlihy, Victor Luchangco, Mark Moir, William N. Scherer, and Nir Shavit. A Lazy Concurrent List-Based Set Algorithm. Proceedings of the 9th International Conference On Principles of Distributed Systems (OPODIS 2005), pages 3-16, Pisa, Italy, December 2005.

Mark Moir, Daniel Nussbaum, Ori Shalev, and Nir Shavit. Using Elimination to Implement Scalable and Lock-Free FIFO Queues. Proceedings of the 17th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2005), pages 253-262, Las Vegas, Nevada, July 2005.

Ori Shalev and Nir Shavit. Transient Blocking Synchronization. Technical Report of Sun Microsystems, Inc. Mountain View, CA, 2005.

Mark Moir, Nir Shavit, and Jan Vitek. Concurrency and synchronization in Java programs. Science of Computer Programming, 58(3):291-292, 2005.

2004

Simon Doherty, David Detlefs, Lindsay Groves, Christine H. Flood, Victor Luchangco, Paul Alan Martin, Mark Moir, Nir Shavit, and Guy L. Steele Jr. DCAS Is Not a Silver Bullet for Nonblocking Algorithm Design. Proceedings of the 16th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2004), pages 216-224, Barcelona, Spain, June 2004.

Mark Moir and Nir Shavit. Concurrent Data Structures (Book Chapter). In Handbook of Data Structures and Applications, D. Metha and S.Sahni Editors, Chapman and Hall/CRC Press, Chapter 47, pages 47-1 to 47-30, 2004.

Danny Hendler, Yossi Lev, and Nir Shavit. Dynamic Memory ABP Work-Stealing. Proceedings of the 18th International Conference on Distributed Computing, pages 188-200, Amsterdam, The Netherlands, October 2004.

Edya Ladan-Mozes and Nir Shavit. An Optimistic Approach to Lock-Free FIFO Queues. Proceedings of the 18th International Conference on Distributed Computing, pages 117-131, Amsterdam, The Netherlands, October 2004.

Danny Hendler, Nir Shavit and Lena Yerushalmi. A Scalable Lock-Free Stack Algorithm. Proceedings of the 16th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2004), pages 206-215, Barcelona, Spain (June 2004). Also, Journal of Parallel and Distributed Computing, 70(1):1-12, 2010.

Faith Ellen Fich, Danny Hendler, and Nir Shavit. On the inherent weakness of conditional synchronization primitives. Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing (PODC 2004), pages 80-87, St. John’s, Newfoundland, Canada, July 2004.

2003

Victor Luchangco, Mark Moir, and Nir Shavit. On the Uncontended Complexity of Consensus. Proceedings of the 17th International Conference on Distributed Computing (DISC 2003), pages 45-59, Sorrento, Italy, October 2003.

Danny Hendler and Nir Shavit. Operation-Valency and the Cost of Coordination. Proceedings of the 22nd Annual ACM Symposium on Principles of Distributed Computing (PODC 2003), pages 84-91, Boston, Massachusetts, July 2003.

Ori Shalev and Nir Shavit. Split-ordered lists: lock-free extensible hash tables. Proceedings of the 22nd Annual ACM Symposium on Principles of Distributed Computing (PODC 2003), pages 102-111, Boston, Massachusetts, July 2003.

Mark Moir, Victor Luchangco, and Nir Shavit. Non-blocking K-Compare Single Swap. Proceedings of the 15th ACM Symposium on Parallel Algorithms and Architectures (SPAA 2003), pages 314-323, San-Diego, California, June 2003.

2002

Ole Agesen, David Detlefs, Christine H. Flood, Alexander T. Garthwaite, Paul Alan Martin, Mark Moir, Nir Shavit, and Guy L. Steele Jr. DCAS-Based Concurrent Deques. Theory of Computing Systems, Special Issue 35(3):349-386, 2002. A preliminary version appeared in Proceedings of the 12th ACM Symposium on Parallel Algorithms and Architectures (SPAA 2000), pages 137-146 Bar Harbor, Maine, August 2000.

Danny Hendler and Nir Shavit. Work Dealing. Proceedings of the 14th ACM Symposium on Parallel Algorithms and Architectures (SPAA 2002), pages 164 172, Winnipeg, Manitoba, Canada, August 2002.

Danny Hendler and Nir Shavit. Non-Blocking Steal-half Work Queues. Proceedings of the 21st Annual ACM Symposium on Principles of Distributed Computing (PODC 2002), pages 280-289, Monterey, California, July 2002.

2001

Christine H. Flood, David Detlefts, Nir Shavit and Xiolan Zhang. Parallel Garbage Collection for Shared Memory Multiprocessors. Proceedings of the Java TM Virtual Machine Research and Technology Symposium, Monterey, California, April 2001.

Nir Shavit, Eli Upfal, and Asaph Zemach. A Wait-free Sorting Algorithm. Theory of Computer Systems, 34(36):519-544, November/December 2001. A preliminary version appeared in the Proceedings of the 16th Annual ACM Symposium on Principles of Distributed Computing (PODC 1997), pages 121-128, Santa Barbara, California, 1997.

Yaron Riany, Nir Shavit and Dan Touitou. Towards a Practical Snapshot Algorithm. Theoretical Computer Science 269, pages 163-201, 2001. A preliminary version appeared in the Proceedings of the 3rd Israel Symposium on Theory and Computing Systems (ISTCS 1995), Tel Aviv, Israel, pages 121-129, 1995.

2000

Ole Agesen, David Detlefs, Christine H. Flood, Alex Garthwaite, Paul Alan Martin, Nir Shavit, Guy L. Steele Jr. DCAS-based concurrent deques. Proceedings of the 12th ACM Symposium on Parallel Algorithms and Architectures (SPAA 2000), pages 137-146 Bar Harbor, Maine, August 2000.

Giovanni Della-Libera and Nir Shavit. Reactive Diffracting Trees. Journal of Parallel and Distributed Computing 60:(7):853-890, 2000. A preliminary version appeared in the Proceedings of the 9th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA 1997), Newport, Rhode Island, pages 24-32, 1997.

Itay Lotan and Nir Shavit. Skiplist-Based Concurrent Priority Queues. Proceedings of the 14th International Parallel and Distributed Processing Symposium (IPDPS 2000), pages 263-268, Cancun, Mexico, 2000.

David Detlefs, Christine H. Flood, Alex Garthwaite, Paul Alan Martin, Nir Shavit and Guy L. Steele Jr. Even Better DCAS-Based Concurrent Deques. Proceedings of the 14th International Symposium on Distributed Computing (DISC 2000), Springer-Verlag, pages 59-73, Toledo, Spain, 2000.

William Aiello, Costas Busch, Maurice Herlihy, Marios Mavronicolas, Nir Shavit and Dan Touitou. Supporting Increment and Decrement Operations in Balancing Networks. Chicago Journal of Theoretical Computer Science, 4, MIT Press, December 2000. A preliminary version appeared in the Proceedings of the 16th International Symposium on Theoretical Aspects of Computer Science (STACS 1999), pages 393-403, Trier, Germany, March 1999.

Nir Shavit and Asaph Zemach. Combining Funnels: A Dynamic Approach to Software Combining. Journal of Parallel and Distributed Computing, 60(11):1355-1387, 2000. A preliminary version, titled: Combining Funnels, appeared in the Proceedings of the 17th Annual ACM Symposium on Principles of Distributed Computing (PODC 1998), Puerto Vallarta, Mexico, pp. 61-70 (1998).

1999

Maurice Herlihy and Nir Shavit. The Topological Structure of Asynchronous Computability. Journal of the ACM, pages 858-923, 1999. This work combines two preliminary papers, titled: The Asynchronous Computability Theorem for t-Resilient Tasks, which appeared in Proceedings of the 25th Annual Symposium on Theory of Computing (STOC 1993), San-Diego, California, pages 111-120, 1993, and A Simple Constructive Computability Theorem for Wait-free Computation, which appeared in Proceedings of the 26th Annual Symposium on Theory of Computing (STOC 1994), pages 243-252, 1994.

Nancy Lynch, Nir Shavit, Alexander Shvartzman, and Dan Touitou. Timing Conditions for Linearizability in Uniform Counting Networks. Theoretical Computer Science, Special Issue, 220(1):67-91, 1999. A preliminary version, titled: Counting Networks are Practically Linearizable, appeared in the Proceedings of the 15th Annual ACM Symposium on Principles of Distributed Computing (PODC 1996) pages 280-289, Philadelphia, Pennsylvania, 1996.

William Aiello, Costas Busch, Maurice Herlihy, Marios Mavronicolas, Nir Shavit and Dan Touitou. Supporting Increment and Decrement Operations in Balancing Networks. Proceedings of the 16th International Symposium on Theoretical Aspects of Computer Science (STACS 1999), pages 393-403, Trier, Germany, March 1999.

Nir Shavit and Asaph Zemach. Scalable Concurrent Priority Queue Algorithms. Proceedings of the 18th Annual ACM Symposium on Principals of Distributed Computing (PODC 1999), pages 113-122, Atlanta, Georgia, 1999.

1998

Nir Shavit, Eli Upfal, and Asaph Zemach. A Steady State Analysis of Diffracting Trees. Theory of Computing Systems, Special Issue, No. 31, pages 403-424, 1998. A preliminary version appeared in the Proceedings of the 8th Annual Symposium on Parallel Algorithms and Architectures (SPAA 1996), pages 33-41, Padova, Italy, 1996.

Faith Ellen, Maurice Herlihy and Nir Shavit. On the Space Complexity of Randomized Synchronization. Journal of the ACM, 45(5):843-862, 1998. A preliminary version appeared in the Proceedings of the Annual ACM Symposium on Principles of Distributed Computing (PODC 1993), pages 241-249, Ithaca, New York, 1993.

Nir Shavit and Asaph Zemach. Combining Funnels: A new twist on an old tale… Proceedings of the 17th Annual ACM Symposium on Principles of Distributed Computing (PODC 1998), Puerto Vallarta, Mexico, pages 61-70, 1998.

1997

Danny Dolev and Nir Shavit. Bounded Concurrent Time-stamping. SIAM Journal on Computing, 26(2):418-455, April 1997. A preliminary version, titled: Bounded Concurrent Time Stamp Systems Are Constructible, appeared in the Proceedings of the 21st Annual ACM Symposium on Theory of Computing (STOC 1989), pages 454-466, Seattle, Washington, 1989.

Gunnar Hoest and Nir Shavit. Towards a Topological Characterization of Asynchronous Complexity. Proceedings of the 16th Annual ACM Symposium on Principles of Distributed Computing (PODC 1997), Santa Barbara, California, pages 199-208, 1997.

Nir Shavit, Eli Upfal, and Asaph Zemach. A Wait-free Sorting Algorithm. Proceedings of the 16th Annual ACM Symposium on Principles of Distributed Computing (PODC 1997), pages 121-128, Santa Barbara, California, 1997.

Giovanni Della-Libera and Nir Shavit. Reactive Diffracting Trees. Proceedings of the 9th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA 1997), Newport, Rhode Island, pages 24-32, 1997.

Nir Shavit and Dan Touitou. Elimination Trees and the Construction of Pools and Stacks. Theory of Computing Systems, Special Issue, No. 30, pages 645-670, 1997. A preliminary version appeared in the Proceedings of the Annual Symposium on Parallel Algorithms and Architectures (SPAA 1995), pages 54-63, Santa Barbara, California, 1995.

Yehuda Afek, Baruch Awerbuch, Eli Gafni, Yishay Mansour, Adi Rosen, and Nir Shavit. Slide: the Key to Polynomial End-to-end Communication. Journal of Algorithms, 22, pages 158-186, 1997. Based on a paper, titled: Polynomial End-to-End Communication, which appeared in the Proceedings of the 30th Annual Symposium on Foundations of Computer Science (FOCS 1989), pages 358-363 (1989), and also on a PODC paper by Y. Afek, E. Gafni and A. Rosen.

Nir Shavit and Dan Touitou. Software Transactional Memory. Distributed Computing, Special Issue, 10, pages 99-116, 1997. A preliminary version appeared in the Proceedings of the 12th Annual ACM Symposium on Principles of Distributed Computing (PODC 1995), pages 204-213, Ottawa, Canada, 1995.

1996

Nancy Lynch, Nir Shavit, Alexander Shvartzman, and Dan Touitou. Counting Networks are Practically Linearizable. Proceedings of the 15th Annual ACM Symposium on Principles of Distributed Computing (PODC 1996),pages 280-289, Philadelphia, Pennsylvania, 1996.

Nir Shavit, Eli Upfal, and Asaph Zemach. A Steady State Analysis of Diffracting Trees. Proceedings of the 8th Annual Symposium on Parallel Algorithms and Architectures (SPAA 1996), pages 33-41, Padova, Italy, 1996.

Maurice Herlihy, Nir Shavit and Orli Waarts. Linearizable Counting Networks. Distributed Computing, 9, pages 193-203, 1996. A preliminary version, titled: Low Contention Linearizable Counting, appeared in the Proceedings of the 32nd Annual Symposium on the Foundations of Computer Science (FOCS 1991), pages 526-535, San Juan, Puerto Rico, 1991.

Maurice Herlihy and Nir Shavit. Applications of Algebraic Topology to Concurrent Computation. In Applications on Advanced Architecture Computers (IAAC), Chapter 23, pages 255-263. Greg Astfalk, editor. SIAM Press (1996). Also appeared, in slightly edited form, in Siam News, pages 27-10, December 1994.

Nir Shavit amd Asaph Zemach. Diffracting Trees. ACM Transactions on Computer Systems, 14(4):385-428, 1996. A preliminary version appeared in the Proceedings of the Annual Symposium on Parallel Algorithms and Architectures (SPAA 1994), pages 167-176, 1994.

1995

Yaron Riany, Nir Shavit and Dan Touitou. Towards a Practical Snapshot Algorithm. Proceedings of the 3rd Israel Symposium on Theory and Computing Systems (ISTCS 1995), Tel Aviv, Israel, pages 121-129, 1995.

Nir Shavit and Dan Touitou. Elimination Trees and the Construction of Pools and Stacks. Proceedings of the Annual Symposium on Parallel Algorithms and Architectures (SPAA 1995), pages 54-63, Santa Barbara, California, 1995.

Maurice Herlihy, Beng-Hong Lim, and Nir Shavit. Scalable Concurrent Counting. ACM Transactions on Computer Systems, 13:4, pages 343-364, 1995. A preliminary version, titled: Low contention load balancing on large scale multiprocessors, appeared in the Proceedings of the Annual Symposium on Parallel Algorithms and Architectures (SPAA 1992), pages 219-227, San Diego, California, 1992.

Nir Shavit and Dan Touitou. Software Transactional Memory. Proceedings of the Fourteenth Annual ACM Symposium on Principles of Distributed Computing (PODC 1995), pages 204-213, Ottawa, Ontario, Canada, August 1995.

1994

Hagit Attiya, Nancy Lynch and Nir Shavit. Are Wait-Free Algorithms Fast? Journal of the ACM,41(4):725-763, July 1994. A preliminary version appeared in Proceedings of the 31st Annual Symposium on the Foundations of Computer Science (FOCS 1990), pages 55-64, St. Louis, Missouri, 1990.

Yehuda Afek, Danny Dolev, Eli Gafni, Michael Merritt, and Nir Shavit. A Bounded first-in, first-enabled solution to the l-exclusion problem. ACM Transactions on Programming Languages and Systems, (16)3:939-953, May 1994. A preliminary version appeared in the Proceedings of the 4th Workshop on Distributed Algorithms (WDAG), pages 422-431, Bari, Italy, 1990.

Nir Shavit and Asaph Zemach. Diffracting Trees. Proceedings of the Annual Symposium on Parallel Algorithms and Architectures (SPAA 1994), pages 167-176, Cape May, New Jersey, June 1994.

James Aspnes, Maurice Herlihy and Nir Shavit. Counting Networks. Journal of the ACM, 41(5):1020-1048, September 1994. A preliminary version, titled: Counting Networks and Multi-Processor Coordination, appeared in the Proceedings of the 23rd Annual Symposium on Theory of Computing (STOC 1991), pages 348-358, New Orleans, Louisiana, 1991.

Maurice Herlihy and Nir Shavit. A simple constructive computability theorem for wait-free computation. Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing (STOC 1994), pages 243-252, Montreal, Quebec, Canada, May 1994.

1993

Faith Ellen, Maurice Herlihy and Nir Shavit. On the Space Complexity of Randomized Synchronization. Proceedings of the Annual ACM Symposium on Principles of Distributed Computing (PODC 1993), pages 241-249, Ithaca, New York, 1993.

Yehuda Afek, Hagit Attiya, Danny Dolev, Eli Gafni, Michael Merritt, and Nir Shavit. Atomic Snapshots of Shared Memory. Journal of the ACM, 40(4):873-890, September 1993. A preliminary version appeared in the Proceedings of the 9th Annual ACM Symposium on Principles of Distributed Computing (PODC 1990), pages 1-14, Quebec City, Quebec, Canada, 1990.

Maurice Herlihy and Nir Shavit. The asynchronous computability theorem for t-resilient tasks. Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing (STOC 1993), pages 111-120, San Diego, CA, May 1993.

1992

Nancy Lynch and Nir Shavit. Timing Based Mutual Exclusion. Proceedings of the Annual Real-Time Symposium (RTSS 1992), pages 2-11, Phoenix, Arizona, 1992.

Rainer Gawlick, Nancy Lynch and Nir Shavit. Concurrent Time-Stamping Made Simple. Proceedings of the Annual Israel Symposium on Theory and Computing Systems (ISTCS), pages 171-183, Haifa, Israel (1992).

Maurice Herlihy, Beng-Hong Lim, Nir Shavit. Low Contention Load Balancing on Large-Scale Multiprocessors. Proceedings of the 4th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA 1992), pages 219-227, San Diego, CA, June 1992.

1991

Michael Saks, Nir Shavit and Heather Woll. Optimal Time Randomized Consensus Making Resilient Algorithms Fast in Practice. Proceedings of the 2nd ACM Symposium on Discrete Algorithms (SODA 1991), pages 351-362, San Francisco, California, 1991.

James Aspnes, Maurice Herlihy and Nir Shavit. Counting Networks and Multi-Processor Coordination. Proceedings of the 23rd Annual Symposium on Theory of Computing (STOC 1991), pages 348-358, New Orleans, Louisiana, 1991.

Maurice Herlihy, Nir Shavit and Orli Waarts. Low Contention Linearizable Counting. Proceedings of the 32nd Annual Symposium on the Foundations of Computer Science (FOCS 1991), pages 526-535, San Juan, Puerto Rico, 1991.

1990

Hagit Attiya, Nancy Lynch and Nir Shavit. Are Wait-Free Algorithms Fast?. Proceedings of the 31st Annual Symposium on the Foundations of Computer Science (FOCS 1990), pages 55-64, St. Louis, Missouri, 1990.

Yehuda Afek, Danny Dolev, Eli Gafni, Michael Merritt, and Nir Shavit. A Bounded first-in, first-enabled solution to the l-exclusion problem. Proceedings of the 4th Workshop on Distributed Algorithms (WDAG), pages 422-431, Bari, Italy, 1990.

Yehuda Afek, Hagit Attiya, Danny Dolev, Eli Gafni, Michael Merritt, and Nir Shavit. Atomic Snapshots of Shared Memory. Proceedings of the 9th Annual ACM Symposium on Principles of Distributed Computing (PODC 1990), pages 1-14, Quebec City, Quebec, Canada, 1990.

1989

Hagit Attiya, Danny Dolev, and Nir Shavit. Bounded Polynomial Randomized Consensus. Proceedings of the 8th Annual ACM Symposium on Principles of Distributed Computing (PODC 1989), pages 281-293, Edmonton, Alberta, Canada, 1989.

Danny Dolev and Nir Shavit. Bounded Concurrent Time Stamp Systems Are Constructible. Proceedings of the 21st Annual ACM Symposium on Theory of Computing (STOC 1989), pages 454-466, Seattle, Washington, 1989.

Baruch Awerbuch, Yishay Mansour, and Nir Shavit. Polynomial End-To-End Communication (Extended Abstract). 30th Annual Symposium on Foundations of Computer Science, (FOCS 1989), pages 358-363, Research Triangle Park, North Carolina, October 1989.

1988

Danny Dolev, Eli Gafni, and Nir Shavit. Toward a Non-Atomic Era: L-Exclusion as a Test Case. Proceedings of the 20th Annual ACM Symposium on Theory of Computing (STOC 1988), Chicago, IL, 78-92, 1988.

1987

1986

Nissim Francez and Nir Shavit. A New Approach to Detection of Locally Indicative Stability. Proceedings of the 13th International Colloquium on Automata Languages and Programming (ICALP 1986), Rennes, France, 344-358, Springer-Verlag, 1986.


Accessibility