BibSLEIGH — Erez

Travelled to:

1 × Germany
1 × Greece
1 × Ireland
1 × Poland
1 × Portugal
1 × United Kingdom
17 × USA
8 × Canada

Collaborated with:

N.Cohen H.Paz A.Kogan B.Steensgaard J.Kilian E.K.Kolodner K.Barabash F.Pizlo Y.Levanoni C.Hawblitzel S.Timnat H.Azatchi T.Domani Y.Ossia G.Tardos A.Bendersky H.Kermany D.Rawitz M.Bellare M.Musuvathi L.Fireman A.Zaks S.M.Blackburn O.Goldreich R.Ostrovsky E.Lewis S.Qadeer S.Tasiran A.Braginsky D.Frampton Y.Ishai E.Kushilevitz Y.Lindell D.Abuaiadh U.Silbershtein R.Canetti A.Rosen A.Azagury Z.Yehudai D.F.Bacon V.T.Rajan N.Alon M.Dietzfelbinger P.B.Miltersen Benoit Daloze A.Tal S.Marr H.Mössenböck Yoav Zuriel Michal Friedman Gali Sheffi G.Goldshtein D.Sheinwald E.E.Salant I.Lahan I.Yanover

Talks about:

garbag (13) collector (10) concurr (7) free (7) parallel (5) knowledg (5) collect (5) data (5) fli (5) structur (4)

Person: Erez Petrank

DBLP: Petrank:Erez

Facilitated 2 volumes:

Contributed to:

2015

2014

2013

2012

2011

2010

2009

2008

2007

2006

2005

2004

2003

2002

2001

2000

1998

1997

1994

1992

2018

2019

Wrote 39 papers:

CAV-2015-HawblitzelPQT #automation #composition #concurrent #reasoning #refinement #source code: Automated and Modular Refinement Reasoning for Concurrent Programs (CH, EP, SQ, ST), pp. 449–465.
ISMM-2015-CohenP #data type #garbage collection: Data structure aware garbage collector (NC, EP), pp. 28–40.
OOPSLA-2015-CohenP #automation #data type #memory management: Automatic memory reclamation for lock-free data structures (NC, EP), pp. 260–279.
PPoPP-2014-TimnatP #data type #simulation: A practical wait-free simulation for lock-free data structures (ST, EP), pp. 357–368.
PLDI-2013-CohenP #bound #towards: Limitations of partial compaction: towards practical bounds (NC, EP), pp. 309–320.
PPoPP-2012-KoganP #data type #performance: A methodology for creating fast wait-free data structures (AK, EP), pp. 141–150.
PPoPP-2012-TimnatBKP: Wait-free linked-lists (ST, AB, AK, EP), pp. 309–310.
POPL-2011-BenderskyP #bound #memory management: Space overhead bounds for dynamic memory management with partial compaction (AB, EP), pp. 475–486.
PPoPP-2011-KoganP #multi: Wait-free queues with multiple enqueuers and dequeuers (AK, EP), pp. 223–234.
ISMM-2010-BarabashP #garbage collection #parallel #platform: Tracing garbage collection on highly parallel platforms (KB, EP), pp. 1–10.
PLDI-2009-PetrankMS #bound #parallel #source code: Progress guarantee for parallel programs via bounded lock-freedom (EP, MM, BS), pp. 144–154.
POPL-2009-HawblitzelP #automation #garbage collection #verification: Automated verification of practical garbage collectors (CH, EP), pp. 441–453.
ISMM-2008-PizloPS #execution: Path specialization: reducing phased execution overheads (FP, EP, BS), pp. 81–90.
PLDI-2008-PizloPS #case study #concurrent #garbage collection #realtime: A study of concurrent real-time garbage collectors (FP, EP, BS), pp. 33–44.
CC-2007-FiremanPZ #algorithm: New Algorithms for SIMD Alignment (LF, EP, AZ), pp. 1–15.
CC-2007-PazP #garbage collection #using: Using Prefetching to Improve Reference-Counting Garbage Collectors (HP, EP), pp. 48–63.
ISMM-2007-PizloFPS #garbage collection #multi #named #realtime: Stopless: a real-time garbage collector for multiprocessors (FP, DF, EP, BS), pp. 159–172.
PLDI-2006-KermanyP #concurrent #incremental #parallel: The Compressor: concurrent, incremental, and parallel compaction (HK, EP), pp. 354–363.
STOC-2006-IshaiKLP #black box: Black-box constructions for secure computation (YI, EK, YL, EP), pp. 99–108.
CC-2005-PazPB #concurrent #garbage collection: Age-Oriented Concurrent Garbage Collection (HP, EP, SMB), pp. 121–136.
CC-2005-PazPBKR #on the fly #performance: An Efficient On-the-Fly Cycle Collection (HP, EP, DFB, EKK, VTR), pp. 156–171.
OOPSLA-2004-AbuaiadhOPS #algorithm #parallel #performance: An efficient parallel heap compaction algorithm (DA, YO, EP, US), pp. 224–236.
CC-2003-AzatchiP #garbage collection: Integrating Generations with Advanced Reference Counting Garbage Collectors (HA, EP), pp. 185–199.
OOPSLA-2003-AzatchiLPP #garbage collection #on the fly: An on-the-fly mark and sweep garbage collector based on sliding views (HA, YL, HP, EP), pp. 269–281.
OOPSLA-2003-BarabashOP #concurrent #garbage collection #revisited: Mostly concurrent garbage collection revisited (KB, YO, EP), pp. 255–268.
ISMM-2002-DomaniGKLPS #java #thread: Thread-local heaps for Java (TD, GG, EKK, EL, EP, DS), pp. 183–194.
POPL-2002-PetrankR: The hardness of cache conscious data placement (EP, DR), pp. 101–112.
OOPSLA-2001-LevanoniP #garbage collection #java #on the fly: An On-the-Fly Reference Counting Garbage Collector for Java (YL, EP), pp. 367–380.
STOC-2001-CanettiKPR #black box #concurrent: Black-box concurrent zero-knowledge requires Ω(log n) rounds (RC, JK, EP, AR), pp. 570–579.
STOC-2001-KilianP #concurrent: Concurrent and resettable zero-knowledge in poly-loalgorithm rounds (JK, EP), pp. 560–569.
ISMM-2000-DomaniKLSBLLPY #garbage collection #implementation #java #on the fly: Implementing an On-the-Fly Garbage Collector for Java (TD, EKK, EL, EES, KB, IL, YL, EP, IY), pp. 155–166.
PLDI-2000-DomaniKP #garbage collection #java #on the fly: A generational on-the-fly garbage collector for Java (TD, EKK, EP), pp. 274–284.
ISMM-1998-AzaguryKPY #how #set: Combining Card Marking with Remembered Sets: How to Save Scanning Time (AA, EKK, EP, ZY), pp. 10–19.
STOC-1997-AlonDMPT #linear #question: Is Linear Hashing Good? (NA, MD, PBM, EP, GT), pp. 465–474.
STOC-1997-KilianPT #proving: Probabilistically Checkable Proofs with Zero Knowledge (JK, EP, GT), pp. 496–505.
STOC-1994-GoldreichOP #complexity: Computational complexity and knowledge complexity (OG, RO, EP), pp. 534–543.
STOC-1992-BellareP #performance #proving: Making Zero-Knowledge Provers Efficient (MB, EP), pp. 711–722.
OOPSLA-2018-DalozeTMMP #parallel: Parallelization of dynamic languages: synchronizing built-in collections (BD, AT, SM, HM, EP), p. 30.
OOPSLA-2019-ZurielFSCP #performance #set: Efficient lock-free durable sets (YZ, MF, GS, NC, EP), p. 26.