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 × Denmark
1 × France
1 × Germany
1 × Spain
18 × USA
Collaborated with:
N.Shavit E.Koskinen H.Mendes E.Gafni Z.Liu S.Rajsbaum W.E.Weihl J.M.Wing C.Tasson M.J.Parkinson V.Luchangco M.Moir C.Busch R.Wattenhofer C.Dwork O.Waarts J.Aspnes B.Liskov L.Gilbert H.E.Ramadan I.Roy E.Witchel V.Vafeiadis C.A.R.Hoare M.Shapiro T.Harris S.Marlow S.L.P.Jones A.Adl-Tabatabai D.Dice C.Kozyrakis C.v.Praun M.L.Scott
Talks about:
transact (10) concurr (6) object (5) comput (5) memori (4) high (4) methodolog (3) implement (3) distribut (3) asynchron (3)

Person: Maurice Herlihy

DBLP DBLP: Herlihy:Maurice

Facilitated 1 volumes:

ASPLOS 2019Ed

Contributed to:

ESOP 20142014
ICALP (1) 20142014
PPoPP 20142014
SIGMOD 20142014
STOC 20142014
STOC 20132013
POPL 20102010
PPoPP 20092009
PPoPP 20082008
PPoPP 20072007
OOPSLA 20062006
PPoPP 20062006
PLDI 20052005
PPoPP 20052005
STOC 20002000
STOC 19971997
STOC 19941994
STOC 19931993
SOSP 19911992
STOC 19911991
PPoPP 19901990
PODS 19881988
POPL 19871987
POPL 19861986

Wrote 25 papers:

ESOP-2014-HerlihyK #composition #transaction
Composable Transactional Objects: A Position Paper (MH, EK), pp. 1–7.
ICALP-v1-2014-GafniH
Sporadic Solutions to Zero-One Exclusion Tasks (EG, MH), pp. 1–10.
PPoPP-2014-HerlihyL #locality
Well-structured futures and cache locality (MH, ZL), pp. 155–166.
SIGMOD-2014-Herlihy #hardware #memory management #transaction
Fun with hardware transactional memory (MH), p. 575.
STOC-2014-MendesTH #distributed
Distributed computability in Byzantine asynchronous systems (HM, CT, MH), pp. 704–713.
STOC-2013-MendesH #approximate #multi
Multidimensional approximate agreement in Byzantine asynchronous systems (HM, MH), pp. 391–400.
POPL-2010-KoskinenPH #transaction
Coarse-grained transactions (EK, MJP, MH), pp. 19–30.
PPoPP-2009-RamadanRHW #commit #transaction
Committing conflicting transactions in an STM (HER, IR, MH, EW), pp. 163–172.
PPoPP-2008-HerlihyK #transaction
Transactional boosting: a methodology for highly-concurrent transactional objects (MH, EK), pp. 207–216.
PPoPP-2007-Adl-TabatabaiDHSKPS #transaction
Potential show-stoppers for transactional synchronization (ARAT, DD, MH, NS, CK, CvP, MLS), p. 55.
OOPSLA-2006-HerlihyLM #flexibility #framework #implementation #memory management #transaction
A flexible framework for implementing software transactional memory (MH, VL, MM), pp. 253–262.
PPoPP-2006-VafeiadisHHS #correctness #proving
Proving correctness of highly-concurrent linearisable objects (VV, MH, CARH, MS), pp. 129–136.
PLDI-2005-Herlihy #re-engineering #transaction
The transactional manifesto: software engineering and non-blocking synchronization (MH), p. 280.
PPoPP-2005-HarrisMPH #composition #memory management #transaction
Composable memory transactions (TH, SM, SLPJ, MH), pp. 48–60.
STOC-2000-BuschHW
Hard-Potato routing (CB, MH, RW), pp. 278–285.
STOC-1997-HerlihyR #decidability #distributed
The Decidability of Distributed Decision Tasks (MH, SR), pp. 589–598.
STOC-1994-HerlihyS #theorem
A simple constructive computability theorem for wait-free computation (MH, NS), pp. 243–252.
STOC-1993-DworkHW #algorithm #memory management
Contention in shared memory algorithms (CD, MH, OW), pp. 174–183.
STOC-1993-HerlihyS #theorem
The asynchronous computability theorem for t-resilient tasks (MH, NS), pp. 111–120.
SOSP-WIP-1991-Herlihy92 #concurrent #implementation
A Methodology for Implementing Highly Concurrent Data Objects (MH), p. 12.
STOC-1991-AspnesHS #coordination #multi #network
Counting Networks and Multi-Processor Coordination (JA, MH, NS), pp. 348–358.
PPoPP-1990-Herlihy #concurrent #data type #implementation
A Methodology for Implementing Highly Concurrent Data Structures (MH), pp. 197–206.
PODS-1988-HerlihyW #concurrent #data type #hybrid
Hybrid Concurrency Control for Abstract Data Types (MH, WEW), pp. 201–210.
POPL-1987-HerlihyW #axiom #concurrent
Axioms for Concurrent Objects (MH, JMW), pp. 13–26.
POPL-1986-LiskovHG #communication #distributed #process
Limitations of Synchronous Communication with Static Process Structure in Languages for Distributed Computing (BL, MH, LG), pp. 150–159.

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.