• Documents
  • Authors
  • Tables
  • Other Seers ▼
    RefSeer AckSeer CollabSeer SeerSeer
  • Log in
  • Sign up
  • MetaCart

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

Prefix Sums and Their Applications

Cached

  • Download as a PDF

Download Links

  • [www.cs.cmu.edu]
  • [www-2.cs.cmu.edu]
  • [www.cs.cmu.edu]
  • [www.cs.cmu.edu]
  • [www.cs.cmu.edu]
  • [www-2.cs.cmu.edu]
  • [www.cs.cmu.edu]
  • [www.cs.cmu.edu]
  • [www.cs.cmu.edu]

  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Guy E. Blelloch
Citations:79 - 2 self
  • Summary
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@MISC{Blelloch_prefixsums,
    author = {Guy E. Blelloch},
    title = { Prefix Sums and Their Applications},
    year = {}
}

Years of Citing Articles

Bookmark

citeulike Connotea Bibsonomy Del.icio.us Digg Reddit

OpenURL

 

Abstract

Experienced algorithm designers rely heavily on a set of building blocks and on the tools needed to put the blocks together into an algorithm. The understanding of these basic blocks and tools is therefore critical to the understanding of algorithms. Many of the blocks and tools needed for parallel

Citations

259 Parallel prefix computation - Ladner, Fischer - 1980
234 Vector models for data-parallel computing - Blelloch - 1990
151 The organization of computations for uniform recurrence equations - Karp, Miller, et al. - 1967
143 Scans as primitive parallel operations - Blelloch - 1989
139 A parallel algorithm for the efficient solution of a general class of recurrence equations - Kogge, Stone - 1973
40 Faster optimal parallel prefix sums and list ranking - Cole, Vishkin - 1989
36 An efficient parallel algorithm for the solution of a tridiagonal linear system of equations - Stone - 1973
30 On the algorithmic complexity of discrete functions - Ofman - 1963
30 Parallel tridiagonal equation solvers - Stone - 1975
21 Parallel solutions to geometric problems on the scan model of computation - Blelloch, Little - 1988
19 New bounds for parallel prefix circuits - Fich - 1983
17 The chip complexity of binary arithmetic - Brent, Kung - 1980
14 The complexity of parallel evaluation of linear recurrence - Hyafil, Kung - 1975
13 Time and parallel processor bounds for linear recurrence systems - Chen, Kuck - 1975
4 Parallel Processsing with the Perfect Shuffle - Stone - 1971
4 efficient asynchronous parallel prefix algorithms - Lubachevsky, Greenberg, et al.
3 Optimal Parallel Prefix Circuits with (size + depth - Lakshmivarahan, Yang, et al. - 1987
3 A network of computers to execute reduction languages - Mago - 1979
2 Efficient Asynchronous Parallel Prefix Algorithms - Simple - 1987
The National Science Foundation
  • About CiteSeerX
  • Submit Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2010 The Pennsylvania State University