BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × China
4 × USA
Collaborated with:
K.Agrawal J.Sukha J.Shun G.E.Blelloch P.B.Gibbons M.A.Bender M.Farach-Colton S.P.Fekete S.Gilbert B.Sheridan R.Utterback
Talks about:
parallel (3) determinist (1) algorithm (1) transact (1) structur (1) prioriti (1) implicit (1) schedul (1) realloc (1) provabl (1)

Person: Jeremy T. Fineman

DBLP DBLP: Fineman:Jeremy_T=

Contributed to:

PODS 20142014
PPoPP 20142014
PPoPP 20132013
PPoPP 20122012
PPoPP 20082008

Wrote 5 papers:

Cost-oblivious storage reallocation (MAB, MFC, SPF, JTF, SG), pp. 278–288.
PPoPP-2014-AgrawalFSSU #data type #parallel #scheduling #source code
Provably good scheduling for parallel programs that use data structures through implicit batching (KA, JTF, BS, JS, RU), pp. 389–390.
Reducing contention through priority updates (JS, GEB, JTF, PBG), pp. 299–300.
PPoPP-2012-BlellochFGS #algorithm #parallel #performance
Internally deterministic parallel algorithms can be fast (GEB, JTF, PBG, JS), pp. 181–192.
PPoPP-2008-AgrawalFS #memory management #parallel #transaction
Nested parallelism in transactional memory (KA, JTF, JS), pp. 163–174.

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.