Travelled to:6 × USA
Collaborated with:K.Pingali V.S.Adve D.Nguyen X.Sui S.T.King C.Lattner J.Criswell D.Dhurjati D.S.Fussell M.Kulkarni M.Burtscher M.A.Hassaan R.Kaleem T.Lee R.Manevich M.Méndez-Lojo D.Prountzos
Talks about:system (2) oper (2) parameterless (1) infrastructur (1) lightweight (1) determinist (1) architectur (1) algorithm (1) recoveri (1) proactiv (1)
Person: Andrew Lenharth
DBLP: Lenharth:Andrew
Contributed to:
2014
2013
20112009200720072016Wrote 7 papers:
- ASPLOS-2014-NguyenLP #on-demand
- Deterministic galois: on-demand, portable and parameterless (DN, AL, KP), pp. 499–512.
- SOSP-2013-NguyenLP #framework #graph #lightweight
- A lightweight infrastructure for graph analytics (DN, AL, KP), pp. 456–471.
- PLDI-2011-PingaliNKBHKLLMMPS #algorithm #parallel
- The tao of parallelism in algorithms (KP, DN, MK, MB, MAH, RK, THL, AL, RM, MML, DP, XS), pp. 12–25.
- ASPLOS-2009-LenharthAK #operating system
- Recovery domains: an organizing principle for recoverable operating systems (AL, VSA, STK), pp. 49–60.
- PLDI-2007-LattnerLA #analysis #points-to
- Making context-sensitive points-to analysis with heap cloning practical for the real world (CL, AL, VSA), pp. 278–289.
- SOSP-2007-CriswellLDA #architecture #execution #operating system
- Secure virtual architecture: a safe execution environment for commodity operating systems (JC, AL, DD, VSA), pp. 351–366.
- ASPLOS-2016-SuiLFP #approximate #source code
- Proactive Control of Approximate Programs (XS, AL, DSF, KP), pp. 607–621.