


default search action
Larry Carter
Person information
- affiliation: University of California, San Diego, USA
Refine list

refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
- [j22]Larry Carter, Stan Wagon:
The Mensa Correctional Institute. Am. Math. Mon. 125(4): 306-319 (2018) - 2016
- [j21]Michelle Mills Strout, Alan LaMielle
, Larry Carter, Jeanne Ferrante, Barbara Kreaseck, Catherine Olschanowsky:
An approach for code generation in the Sparse Polyhedral Framework. Parallel Comput. 53: 32-57 (2016)
2000 – 2009
- 2008
- [j20]Olivier Beaumont
, Larry Carter, Jeanne Ferrante, Arnaud Legrand, Loris Marchal
, Yves Robert
:
Centralized versus Distributed Schedulers for Bag-of-Tasks Applications. IEEE Trans. Parallel Distributed Syst. 19(5): 698-709 (2008) - 2006
- [j19]Larry Carter, Henri Casanova, Jeanne Ferrante, Frédéric Desprez, Yves Robert
:
Preface. Int. J. High Perform. Comput. Appl. 20(1): 3-4 (2006) - [j18]Barbara Kreaseck, Larry Carter, Henri Casanova, Jeanne Ferrante, Sagnik Nandy:
Interference-Aware Scheduling. Int. J. High Perform. Comput. Appl. 20(1): 45-59 (2006) - [j17]Larry Carter, Henri Casanova, Frédéric Desprez, Jeanne Ferrante, Yves Robert
:
Preface. Int. J. High Perform. Comput. Appl. 20(4): 441-442 (2006) - [c45]Xiaofeng Gao, Allan Snavely, Larry Carter:
Path Grammar Guided Trace Compression and Trace Approximation. HPDC 2006: 57-68 - [c44]Olivier Beaumont
, Larry Carter, Jeanne Ferrante, Arnaud Legrand, Loris Marchal, Yves Robert
:
Centralized versus distributed schedulers for multiple bag-of-task applications. IPDPS 2006 - 2005
- [c43]Sagnik Nandy, Larry Carter, Jeanne Ferrante:
GUARD: Gossip Used for Autonomous Resource Detection. IPDPS 2005 - 2004
- [j16]Michelle Mills Strout, Larry Carter, Jeanne Ferrante, Barbara Kreaseck:
Sparse Tiling for Stationary Iterative Methods. Int. J. High Perform. Comput. Appl. 18(1): 95-113 (2004) - [j15]Cyril Banino, Olivier Beaumont
, Larry Carter, Jeanne Ferrante, Arnaud Legrand, Yves Robert
:
Scheduling Strategies for Master-Slave Tasking on Heterogeneous Processor Platforms. IEEE Trans. Parallel Distributed Syst. 15(4): 319-330 (2004) - [c42]Sagnik Nandy, Larry Carter, Jeanne Ferrante:
A-FAST: Autonomous Flow Approach to Scheduling Tasks. HiPC 2004: 363-374 - [c41]Barbara Kreaseck, Larry Carter, Henri Casanova, Jeanne Ferrante:
On the Interference of Communication on Computation in Java. IPDPS 2004 - 2003
- [j14]Karin Högstedt, Larry Carter, Jeanne Ferrante:
On the Parallel Execution Time of Tiled Loops. IEEE Trans. Parallel Distributed Syst. 14(3): 307-321 (2003) - [c40]Barbara Kreaseck, Larry Carter, Henri Casanova, Jeanne Ferrante:
Autonomous Protocols for Bandwidth-Centric Scheduling of Independent-Task Applications. IPDPS 2003: 26 - [c39]Michelle Mills Strout, Larry Carter, Jeanne Ferrante:
Compile-time composition of run-time data and iteration reorderings. PLDI 2003: 91-102 - [c38]Larry Carter, Jeanne Ferrante, Clark D. Thomborson:
Folklore confirmed: reducible flow graphs are exponentially larger. POPL 2003: 106-114 - 2002
- [c37]Olivier Beaumont
, Arnaud Legrand, Yves Robert
, Larry Carter, Jeanne Ferrante:
Bandwidth-Centric Allocation of Independent Tasks on Heterogeneous Platforms. IPDPS 2002 - [c36]Michelle Mills Strout, Larry Carter, Jeanne Ferrante, Jonathan Freeman, Barbara Kreaseck:
Combining Performance Aspects of Irregular Gauss-Seidel Via Sparse Tiling. LCPC 2002: 90-110 - 2001
- [c35]Nick Mitchell, Larry Carter, Jeanne Ferrante:
A Modal Model of Memory. International Conference on Computational Science (1) 2001: 81-96 - [c34]Michelle Mills Strout, Larry Carter, Jeanne Ferrante:
Rescheduling for Locality in Sparse Matrix Computations. International Conference on Computational Science (1) 2001: 137-148 - 2000
- [j13]Lori Carter, Beth Simon, Brad Calder, Larry Carter, Jeanne Ferrante:
Path Analysis and Renaming for Predicated Instruction Scheduling. Int. J. Parallel Program. 28(6): 563-588 (2000) - [j12]Larry Carter, Jeanne Ferrante:
CROPS: coordinated restructuring of programs and storage. ACM SIGSOFT Softw. Eng. Notes 25(1): 38-39 (2000) - [c33]Kang Su Gatlin, Larry Carter:
Faster FFTs via Architecture-Cognizance. IEEE PACT 2000: 249-260 - [e2]Larry Carter, Jeanne Ferrante:
Languages and Compilers for Parallel Computing, 12th International Workshop, LCPC'99, La Jolla/San Diego, CA, USA, August 4-6, 1999, Proceedings. Lecture Notes in Computer Science 1863, Springer 2000, ISBN 3-540-67858-1 [contents]
1990 – 1999
- 1999
- [c32]Nicholas Mitchell, Larry Carter, Jeanne Ferrante:
Localizing Non-Affine Array References. IEEE PACT 1999: 192-202 - [c31]Lori Carter, Beth Simon, Brad Calder, Larry Carter, Jeanne Ferrante:
Predicated Static Single Assignment. IEEE PACT 1999: 245-255 - [c30]Kang Su Gatlin, Larry Carter:
Memory Hierarchy Considerations for Fast Transpose and Bit-Reversals. HPCA 1999: 33-42 - [c29]Vladimir Getov, Yuan Wei, Larry Carter, Kang Su Gatlin:
Performance optimisations of the NPB FT kernel by special-purpose unroller. PDP 1999: 84-88 - [c28]Larry Carter, John Feo, Allan Snavely:
Performance and Programming Experience on the Tera MTA. PP 1999 - [c27]Tung Nguyen, Michelle Mills Strout, Larry Carter, Jeanne Ferrante:
Asynchronous Dynamic Load Balancing of Tiles. PP 1999 - [c26]Kang Su Gatlin, Larry Carter:
Architecture-Cognizant Divide and Conquer Algorithms. SC 1999: 25 - [c25]Nicholas Mitchell, Larry Carter, Jeanne Ferrante, Dean M. Tullsen
:
ILP versus TLP on SMT. SC 1999: 37 - [c24]Karin Högstedt, Larry Carter, Jeanne Ferrante:
Selecting Tile Shape for Minimal Execution Time. SPAA 1999: 201-211 - [e1]Siddhartha Chatterjee, Jan F. Prins, Larry Carter, Jeanne Ferrante, Zhiyuan Li, David C. Sehr, Pen-Chung Yew:
Languages and Compilers for Parallel Computing, 11th International Workshop, LCPC'98, Chapel Hill, NC, USA, August 7-9, 1998, Proceedings. Lecture Notes in Computer Science 1656, Springer 1999, ISBN 3-540-66426-2 [contents] - 1998
- [j11]Nicholas Mitchell, Karin Högstedt, Larry Carter, Jeanne Ferrante:
Quantifying the Multi-Level Nature of Tiling Interactions. Int. J. Parallel Program. 26(6): 641-670 (1998) - [c23]Michelle Mills Strout, Larry Carter, Jeanne Ferrante, Beth Simon:
Schedule-Independent Storage Mapping for Loops. ASPLOS 1998: 24-33 - [c22]Larry Carter, Kang Su Gatlin:
Towards an Optimal Bit-Reversal Permutation Program. FOCS 1998: 544-555 - [c21]Allan Snavely, Larry Carter, Jay Boisseau, Amit Majumdar, Kang Su Gatlin, Nick Mitchell, John Feo, Brian D. Koblenz:
Multi-processor Performance on the Tera MTA. SC 1998: 4 - 1997
- [c20]Nicholas Mitchell, Larry Carter, Jeanne Ferrante, Karin Högstedt:
Quantifying the Multi-level Nature of Tiling Interactions. LCPC 1997: 1-15 - [c19]Karin Högstedt, Larry Carter, Jeanne Ferrante:
Determining the Idle Time of a Tiling. POPL 1997: 160-173 - 1995
- [j10]Ramesh C. Agarwal, Bowen Alpern, Larry Carter, Fred G. Gustavson, David J. Klepacki, Rick Lawrence, Mohammad Zubair:
High-Performance Parallel Implementations of the NAS Kernel Benchmarks on the IBM SP2. IBM Syst. J. 34(2): 263-272 (1995) - [c18]Larry Carter, Jeanne Ferrante, Susan Flynn Hummel:
Hierarchical tiling for improved superscalar performance. IPPS 1995: 239-245 - [c17]Larry Carter, Jeanne Ferrante, Susan Flynn Hummel:
Efficient Parallelism via Hierarchical Tiling. PP 1995: 680-685 - [c16]Bowen Alpern, Larry Carter:
Message Compression for High Performance. PP 1995: 814-819 - [c15]Bowen Alpern, Larry Carter:
Is Scalability Relevant? A Look at Sparse Matrix-Vector Product. PP 1995: 850-851 - [c14]Bowen Alpern, Larry Carter:
The Myth of Scalable High Performance. PP 1995: 857-859 - [c13]Bowen Alpern, Larry Carter, Kang Su Gatlin:
Microparallelism and High-Performance Protein Matching. SC 1995: 24 - 1994
- [j9]Bowen Alpern, Larry Carter, Ephraim Feig, Ted Selker:
The Uniform Memory Hierarchy Model of Computation. Algorithmica 12(2/3): 72-109 (1994) - [j8]Larry Carter, Jeanne Ferrante, Vasanth Bala:
XDP: A compiler intermediate language extension for the representation and optimization of data movement. Int. J. Parallel Program. 22(5): 485-518 (1994) - 1993
- [c12]Vasanth Bala, Jeanne Ferrante, Larry Carter:
Explicit Data Placement (XDP): A Methodology for Explicit Compile-Time Representation and Optimization. PPoPP 1993: 139-148 - [c11]Bowen Alpern, Larry Carter, Matt Grayson, Chris Pelkie:
Orientation Maps: Techniques for Visualizing Rotations. IEEE Visualization 1993: 183-188 - 1992
- [c10]Clark D. Thomborson, Bowen Alpern, Larry Carter:
Rectilinear Steiner Tree Minimization on a Workstation. Computational Support for Discrete Mathematics 1992: 119-136 - 1991
- [c9]Bowen Alpern, Larry Carter:
The Hyperbox. IEEE Visualization 1991: 133-139 - 1990
- [c8]Bowen Alpern, Larry Carter, Ephraim Feig:
Uniform Memory Hierarchies. FOCS 1990: 600-608 - [c7]Bowen Alpern, Larry Carter, Ted Selker:
Visualizing Computer Memory Architectures. IEEE Visualization 1990: 107-113
1980 – 1989
- 1988
- [j7]Larry Carter, Leendert M. Huisman, Tom W. Williams:
TRIM: testability range by ignoring the memory. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 7(1): 38-49 (1988) - 1987
- [j6]Andrew P. Black
, Norman C. Hutchinson, Eric Jul, Henry M. Levy, Larry Carter:
Distribution and Abstract Types in Emerald. IEEE Trans. Software Eng. 13(1): 65-76 (1987) - 1986
- [c6]Leendert M. Huisman, Larry Carter, Tom W. Williams:
TRIM : Testability Range by Ignoring the Memory. ITC 1986: 474-479 - 1985
- [c5]Larry Carter, Larry J. Stockmeyer, Mark N. Wegman:
The Complexity of Backtrack Searches (Preliminary Version). STOC 1985: 449-457 - 1981
- [j5]Mark N. Wegman, Larry Carter:
New Hash Functions and Their Use in Authentication and Set Equality. J. Comput. Syst. Sci. 22(3): 265-279 (1981)
1970 – 1979
- 1979
- [j4]Larry Carter, Mark N. Wegman:
Universal Classes of Hash Functions. J. Comput. Syst. Sci. 18(2): 143-154 (1979) - [c4]Mark N. Wegman, Larry Carter:
New Classes and Applications of Hash Functions. FOCS 1979: 175-182 - 1978
- [c3]George Markowsky, Larry Carter, Mark N. Wegman:
Analysis of a Universal Class of Hash Functions. MFCS 1978: 345-354 - [c2]Larry Carter, Robert W. Floyd, John Gill, George Markowsky, Mark N. Wegman:
Exact and Approximate Membership Testers. STOC 1978: 59-65 - 1977
- [j3]Larry Carter:
A Case Study of a New Code Generation Technique for Compilers. Commun. ACM 20(12): 914-920 (1977) - [j2]Larry Carter:
A four-gadget. SIGACT News 9(2): 36 (1977) - [c1]Larry Carter, Mark N. Wegman:
Universal Classes of Hash Functions (Extended Abstract). STOC 1977: 106-112 - 1974
- [j1]Larry Carter, John Gill:
Conjectures on uniquely decipherable codes (Corresp.). IEEE Trans. Inf. Theory 20(3): 394-396 (1974)
Coauthor Index

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 22:56 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint