BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Canada
1 × China
1 × France
1 × Turkey
10 × USA
Collaborated with:
M.Herlihy D.Dice D.Dolev A.Matveev D.Alistarh V.J.Marathe N.Francez K.Censor-Hillel J.Aspnes E.Gafni J.Kopinsky J.Li P.Felber P.Marlier I.Calciu Y.Lev V.Luchangco A.Adl-Tabatabai C.Kozyrakis C.v.Praun M.L.Scott
Talks about:
lock (4) transact (3) concurr (3) comput (3) free (3) construct (2) synchron (2) theorem (2) scalabl (2) memori (2)

Person: Nir Shavit

DBLP DBLP: Shavit:Nir

Contributed to:

ASPLOS 20152015
PPoPP 20152015
SOSP 20152015
STOC 20142014
PPoPP 20132013
PPoPP 20122012
CGO 20072007
PPoPP 20072007
STOC 19941994
STOC 19931993
STOC 19911991
STOC 19891989
STOC 19881988
ICALP 19861986

Wrote 14 papers:

ASPLOS-2015-MatveevS #hardware #hybrid #memory management #scalability #transaction
Reduced Hardware NOrec: A Safe and Scalable Hybrid Transactional Memory (AM, NS), pp. 59–71.
PPoPP-2015-AlistarhKLS #queue #scalability
The SprayList: a scalable relaxed priority queue (DA, JK, JL, NS), pp. 11–20.
SOSP-2015-MatveevSFM #concurrent #lightweight #named #programming
Read-log-update: a lightweight synchronization mechanism for concurrent programming (AM, NS, PF, PM), pp. 168–183.
STOC-2014-AlistarhCS #algorithm #concurrent #question
Are lock-free concurrent algorithms practically wait-free? (DA, KCH, NS), pp. 714–723.
PPoPP-2013-CalciuDLLMS
NUMA-aware reader-writer locks (IC, DD, YL, VL, VJM, NS), pp. 157–166.
PPoPP-2012-DiceMS #design
Lock cohorting: a general technique for designing NUMA locks (DD, VJM, NS), pp. 247–256.
CGO-2007-DiceS #comprehension #memory management #trade-off #transaction
Understanding Tradeoffs in Software Transactional Memory (DD, NS), pp. 21–33.
PPoPP-2007-Adl-TabatabaiDHSKPS #transaction
Potential show-stoppers for transactional synchronization (ARAT, DD, MH, NS, CK, CvP, MLS), p. 55.
STOC-1994-HerlihyS #theorem
A simple constructive computability theorem for wait-free computation (MH, NS), pp. 243–252.
STOC-1993-HerlihyS #theorem
The asynchronous computability theorem for t-resilient tasks (MH, NS), pp. 111–120.
STOC-1991-AspnesHS #coordination #multi #network
Counting Networks and Multi-Processor Coordination (JA, MH, NS), pp. 348–358.
STOC-1989-DolevS #bound #concurrent
Bounded Concurrent Time-Stamp Systems Are Constructible (DD, NS), pp. 454–466.
STOC-1988-DolevGS #testing #towards
Toward a Non-Atomic Era: 𝓁-Exclusion as a Test Case (DD, EG, NS), pp. 78–92.
ICALP-1986-ShavitF #approach #detection
A New Approach to Detection of Locally Indicative Stability (NS, NF), pp. 344–358.
Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.