Nir Shavit

From MaRDI portal
Person:236454

Available identifiers

zbMath Open shavit.nir-nWikidataQ2896304 ScholiaQ2896304MaRDI QIDQ236454

List of research outcomes

PublicationDate of PublicationType
Software transactional memory2020-12-02Paper
Linearizable counting networks2020-11-30Paper
A complexity-based classification for multiprocessor synchronization2020-04-23Paper
Are Lock-Free Concurrent Algorithms Practically Wait-Free?2018-08-02Paper
https://portal.mardi4nfdi.de/entity/Q46438742018-05-29Paper
On the space complexity of randomized synchronization2017-09-29Paper
Software transactional memory2017-09-29Paper
A wait-free sorting algorithm2017-09-29Paper
Towards a topological characterization of asynchronous complexity2017-09-29Paper
A Complexity-Based Hierarchy for Multiprocessor Synchronization2017-09-29Paper
The computability of relaxed data structures: queues and stacks as examples2017-04-04Paper
A simple constructive computability theorem for wait-free computation2016-09-01Paper
The Computability of Relaxed Data Structures: Queues and Stacks as Examples2016-01-08Paper
Counting networks are practically linearizable2015-09-11Paper
Operation-valency and the cost of coordination2015-09-04Paper
Split-ordered lists2015-09-04Paper
Balls-into-leaves2015-09-03Paper
On the inherent weakness of conditional synchronization primitives2015-08-03Paper
Are Lock-Free Concurrent Algorithms Practically Wait-Free?2015-06-26Paper
The asynchronous computability theorem for t-resilient tasks2015-05-07Paper
The SkipTrie2015-03-02Paper
Leaplist2015-03-02Paper
Johnson-Lindenstrauss Compression with Neuroscience-Based Constraints2014-11-19Paper
Non-blocking steal-half work queues2014-07-25Paper
Solo-valency and the cost of coordination2013-06-28Paper
An optimistic approach to lock-free FIFO queues2013-06-20Paper
On the inherent weakness of conditional primitives2013-06-13Paper
A dynamic-sized nonblocking work stealing deque2013-06-07Paper
Interrupting snapshots and the \(\text{Java}^{\text{TM}}\) size method2012-10-23Paper
On the Inherent Sequentiality of Concurrent Objects2012-09-12Paper
A scalable lock-free stack algorithm2012-03-07Paper
Transactional Mutex Locks2010-10-22Paper
Distributed Computing2010-02-23Paper
Nonblocking \(k\)-compare-single-swap2009-08-06Paper
Split-ordered lists2008-12-21Paper
Hopscotch Hashing2008-11-20Paper
A Simple Optimistic Skiplist Algorithm2007-11-15Paper
Toward a Topological Characterization of Asynchronous Complexity2007-05-03Paper
Distributed Computing2006-11-01Paper
Virtual leashing: creating a computational foundation for software protection2006-10-10Paper
An Optimistic Approach to Lock-Free FIFO Queues2005-08-17Paper
On the space complexity of randomized synchronization2005-01-25Paper
The topological structure of asynchronous computability2005-01-25Paper
A wait-free sorting algorithm2002-09-29Paper
Towards a practical snapshot algorithm2002-03-03Paper
https://portal.mardi4nfdi.de/entity/Q27668612002-01-28Paper
Combining funnels: A dynamic approach to software combining2001-09-13Paper
https://portal.mardi4nfdi.de/entity/Q27092362001-05-15Paper
Timing conditions for linearizability in uniform counting networks1999-06-21Paper
A steady state analysis of diffracting trees1999-01-11Paper
https://portal.mardi4nfdi.de/entity/Q42091701998-10-14Paper
Elimination trees and the construction of pools and stacks1998-08-03Paper
Bounded Concurrent Time-Stamping1997-05-26Paper
Slide—The Key to Polynomial End-to-End Communication1997-03-18Paper
Counting networks1995-02-20Paper
Are wait-free algorithms fast?1994-11-03Paper
Atomic snapshots of shared memory1994-03-20Paper
https://portal.mardi4nfdi.de/entity/Q31389721993-10-20Paper
https://portal.mardi4nfdi.de/entity/Q37255351986-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Nir Shavit