Travelled to:
1 × Italy
1 × Korea
1 × United Kingdom
2 × USA
Collaborated with:
C.M.Kirsch D.Clifford B.Titzer Ulan Degenbaev J.Eisinger M.Stanton M.Starzinger T.A.Henzinger A.Sezgin A.Sokolova R.Brunauer A.Löcker H.A.Mayer G.Mitterlechner Manfred Ernst R.McIlroy K.Hara Marcel Hlopko M.Lippautz
Talks about:
collect (2) garbag (2) alloc (2) base (2) incorrect (1) structur (1) strategi (1) schedul (1) quantit (1) problem (1)
Person: Hannes Payer
DBLP: Payer:Hannes
Contributed to:
Wrote 7 papers:
- ISMM-2015-CliffordPST #optimisation
- Memento mori: dynamic allocation-site-based optimizations (DC, HP, MS, BT), pp. 105–117.
- ISMM-2014-CliffordPST
- Allocation folding based on dominance (DC, HP, MS, BT), pp. 15–24.
- POPL-2013-HenzingerKPSS #concurrent #data type
- Quantitative relaxation of concurrent data structures (TAH, CMK, HP, AS, AS), pp. 317–328.
- DAC-2012-KirschP #problem
- Incorrect systems: it’s not the problem, it’s the solution (CMK, HP), pp. 913–917.
- SAC-2007-BrunauerLMMP #evolution
- Evolution of iterated prisoner’s dilemma strategies with different history lengths in static and cultural environments (RB, AL, HAM, GM, HP), pp. 720–727.
- OOPSLA-2018-DegenbaevEHHLP #component #garbage collection
- Cross-component garbage collection (UD, JE, KH, MH, ML, HP), p. 24.
- PLDI-2016-DegenbaevEEMP #garbage collection #scheduling
- Idle time garbage collection scheduling (UD, JE, ME, RM, HP), pp. 570–583.