Jay Sipelstein. Data representation optimizations for collection-oriented languages. PhD thesis, School of Computer Science, Carnegie Mellon University, to appear. Home/Search Document Not in Database Context Related Articles Check |
This paper is cited by the following papers:
Compiling Nested Data-Parallel Programs for.. - Siddhartha.. (1993) (3 citations) (Correct)
Provably Efficient Scheduling for Languages with Fine-Grained.. - Guy Blelloch (1995) (28 citations) (Correct)
Practical Parallel Divide-and-Conquer Algorithms - Hardwick (1997) (1 citation) (Correct)
Implementation of a Portable Nested Data-Parallel.. - Blelloch, Hardwick.. (1993) (97 citations) Self-citation (Sipelstein) (Correct)
Implementation of a Portable Nested Data-Parallel.. - Blelloch, Chatterjee.. (1994) (97 citations) Self-citation (Sipelstein) (Correct)
Implementation of a Portable Nested Data-Parallel Language - Blelloch (1994) (97 citations) Self-citation (Sipelstein) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC