Nir Shavit
From MaRDI portal
List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| Software transactional memory Distributed Computing | 2020-12-02 | Paper |
| Linearizable counting networks Distributed Computing | 2020-11-30 | Paper |
| A complexity-based classification for multiprocessor synchronization Distributed Computing | 2020-04-23 | Paper |
| Are lock-free concurrent algorithms practically wait-free? Journal of the ACM | 2018-08-02 | Paper |
| scientific article; zbMATH DE number 6876104 (Why is no real title available?) | 2018-05-29 | Paper |
| Software transactional memory Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing - PODC '95 | 2017-09-29 | Paper |
| Towards a topological characterization of asynchronous complexity Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing - PODC '97 | 2017-09-29 | Paper |
| A complexity-based hierarchy for multiprocessor synchronization (extended abstract) Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing | 2017-09-29 | Paper |
| On the space complexity of randomized synchronization Proceedings of the twelfth annual ACM symposium on Principles of distributed computing - PODC '93 | 2017-09-29 | Paper |
| A wait-free sorting algorithm Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing - PODC '97 | 2017-09-29 | Paper |
| The computability of relaxed data structures: queues and stacks as examples Distributed Computing | 2017-04-04 | Paper |
| A simple constructive computability theorem for wait-free computation Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 | 2016-09-01 | Paper |
| The computability of relaxed data structures: queues and stacks as examples Structural Information and Communication Complexity | 2016-01-08 | Paper |
| Counting networks are practically linearizable Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing - PODC '96 | 2015-09-11 | Paper |
| Split-ordered lists Proceedings of the twenty-second annual symposium on Principles of distributed computing | 2015-09-04 | Paper |
| Operation-valency and the cost of coordination Proceedings of the twenty-second annual symposium on Principles of distributed computing | 2015-09-04 | Paper |
| Balls-into-leaves Proceedings of the 2014 ACM symposium on Principles of distributed computing | 2015-09-03 | Paper |
| On the inherent weakness of conditional synchronization primitives Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing | 2015-08-03 | Paper |
| Are lock-free concurrent algorithms practically wait-free? Proceedings of the forty-sixth annual ACM symposium on Theory of computing | 2015-06-26 | Paper |
| The asynchronous computability theorem for t-resilient tasks Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 | 2015-05-07 | Paper |
| The SkipTrie, low-depth concurrent search without rebalancing Proceedings of the 2013 ACM symposium on Principles of distributed computing | 2015-03-02 | Paper |
| Leaplist: lessons learned in designing TM-supported range queries Proceedings of the 2013 ACM symposium on Principles of distributed computing | 2015-03-02 | Paper |
| Johnson-Lindenstrauss Compression with Neuroscience-Based Constraints | 2014-11-19 | Paper |
| Non-blocking steal-half work queues Proceedings of the twenty-first annual symposium on Principles of distributed computing | 2014-07-25 | Paper |
| Solo-valency and the cost of coordination Distributed Computing | 2013-06-28 | Paper |
| An optimistic approach to lock-free FIFO queues Distributed Computing | 2013-06-20 | Paper |
| On the inherent weakness of conditional primitives Distributed Computing | 2013-06-13 | Paper |
| A dynamic-sized nonblocking work stealing deque Distributed Computing | 2013-06-07 | Paper |
| Interrupting snapshots and the \(\text{Java}^{\text{TM}}\) size method Journal of Parallel and Distributed Computing | 2012-10-23 | Paper |
| On the inherent sequentiality of concurrent objects SIAM Journal on Computing | 2012-09-12 | Paper |
| A scalable lock-free stack algorithm Journal of Parallel and Distributed Computing | 2012-03-07 | Paper |
| Transactional mutex locks Euro-Par 2010 - Parallel Processing | 2010-10-22 | Paper |
| On the uncontended complexity of consensus Lecture Notes in Computer Science | 2010-02-23 | Paper |
| Nonblocking \(k\)-compare-single-swap Theory of Computing Systems | 2009-08-06 | Paper |
| Split-ordered lists Journal of the ACM | 2008-12-21 | Paper |
| Hopscotch Hashing Lecture Notes in Computer Science | 2008-11-20 | Paper |
| A Simple Optimistic Skiplist Algorithm Structural Information and Communication Complexity | 2007-11-15 | Paper |
| Toward a Topological Characterization of Asynchronous Complexity SIAM Journal on Computing | 2007-05-03 | Paper |
| Distributed Computing Lecture Notes in Computer Science | 2006-11-01 | Paper |
| Virtual leashing: creating a computational foundation for software protection Journal of Parallel and Distributed Computing | 2006-10-10 | Paper |
| An Optimistic Approach to Lock-Free FIFO Queues Lecture Notes in Computer Science | 2005-08-17 | Paper |
| The topological structure of asynchronous computability Journal of the ACM | 2005-01-25 | Paper |
| On the space complexity of randomized synchronization Journal of the ACM | 2005-01-25 | Paper |
| A wait-free sorting algorithm Theory of Computing Systems | 2002-09-29 | Paper |
| Towards a practical snapshot algorithm Theoretical Computer Science | 2002-03-03 | Paper |
| scientific article; zbMATH DE number 1696666 (Why is no real title available?) | 2002-01-28 | Paper |
| Combining funnels: A dynamic approach to software combining Journal of Parallel and Distributed Computing | 2001-09-13 | Paper |
| Supporting increment and decrement operations in balancing networks Chicago Journal of Theoretical Computer Science | 2001-05-15 | Paper |
| Timing conditions for linearizability in uniform counting networks Theoretical Computer Science | 1999-06-21 | Paper |
| A steady state analysis of diffracting trees Theory of Computing Systems | 1999-01-11 | Paper |
| scientific article; zbMATH DE number 1206113 (Why is no real title available?) | 1998-10-14 | Paper |
| Elimination trees and the construction of pools and stacks Theory of Computing Systems | 1998-08-03 | Paper |
| Bounded Concurrent Time-Stamping SIAM Journal on Computing | 1997-05-26 | Paper |
| Slide—The Key to Polynomial End-to-End Communication Journal of Algorithms | 1997-03-18 | Paper |
| Counting networks Journal of the ACM | 1995-02-20 | Paper |
| Are wait-free algorithms fast? Journal of the ACM | 1994-11-03 | Paper |
| Atomic snapshots of shared memory Journal of the ACM | 1994-03-20 | Paper |
| scientific article; zbMATH DE number 432838 (Why is no real title available?) | 1993-10-20 | Paper |
| scientific article; zbMATH DE number 3956427 (Why is no real title available?) | 1986-01-01 | Paper |
Research outcomes over time
This page was built for person: Nir Shavit
