Travelled to:2 × France
8 × USA
Collaborated with:J.Ferrante M.N.Wegman K.S.Gatlin M.M.Strout X.Gao A.Snavely C.D.Thomborson K.Högstedt V.Bala L.J.Stockmeyer V.Getov Y.Wei B.Simon R.W.Floyd J.Gill G.Markowsky
Talks about:time (4) explicit (2) approxim (2) compil (2) trace (2) data (2) methodolog (1) membership (1) represent (1) placement (1)
Person: Larry Carter
DBLP: Carter:Larry
Contributed to:
2006
2003
2003
1999
1999
19981997
1993
198519781977Wrote 11 papers:
- HPDC-2006-GaoSC #approximate
- Path Grammar Guided Trace Compression and Trace Approximation (XG, AS, LC), pp. 57–68.
- PLDI-2003-StroutCF #composition #runtime
- Compile-time composition of run-time data and iteration reorderings (MMS, LC, JF), pp. 91–102.
- POPL-2003-CarterFT #graph
- Folklore confirmed: reducible flow graphs are exponentially larger (LC, JF, CDT), pp. 106–114.
- HPCA-1999-GatlinC #memory management #performance
- Memory Hierarchy Considerations for Fast Transpose and Bit-Reversals (KSG, LC), pp. 33–42.
- PDP-1999-GetovWCG #kernel #optimisation #performance
- Performance optimisations of the NPB FT kernel by special-purpose unroller (VG, YW, LC, KSG), pp. 84–88.
- ASPLOS-1998-StroutCFS #independence
- Schedule-Independent Storage Mapping for Loops (MMS, LC, JF, BS), pp. 24–33.
- POPL-1997-CarterFH
- Determining the Idle Time of a Tiling (KH, LC, JF), pp. 160–173.
- PPoPP-1993-BalaFC #optimisation #representation
- Explicit Data Placement (XDP): A Methodology for Explicit Compile-Time Representation and Optimization (VB, JF, LC), pp. 139–148.
- STOC-1985-CarterSW #backtracking #complexity
- The Complexity of Backtrack Searches (LC, LJS, MNW), pp. 449–457.
- STOC-1978-CarterFGMW #approximate
- Exact and Approximate Membership Testers (LC, RWF, JG, GM, MNW), pp. 59–65.
- STOC-1977-CarterW
- Universal Classes of Hash Functions (LC, MNW), pp. 106–112.