An algebra of scans

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3125, Issue , 2004, Pages 186-210

  Hinze, Ralf ^a  

^a UNIVERSITY OF BONN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; APPLICATION PROGRAMS;

BASIC BUILDING BLOCK; BINARY OPERATIONS; CIRCUIT DESIGNS; PARALLEL PREFIX COMPUTATIONS; PARALLEL SORTING; RECURSIVE STRUCTURE; STANDARD DESIGN; UNDERLYING GRAPHS;

INTEGRATED CIRCUIT MANUFACTURE;

EID: 24944578396     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27764-4_11     Document Type: Article

References (16)

1. Iverson, K.E.: APL: A Programming Language. John Wiley & Sons (1962)
2. Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms. First edn. The MIT Press, Cambridge, Massachusetts (1990)
3. Blelloch, G.: Prefix sums and their applications. Technical Report CMU-CS-90-190, School of Computer Science, Carnegie Mellon University, Pittsburgh, PA (1990)
4. Also appears in Synthesis of Parallel Algorithms, ed. John E. Reif, Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, 1993.
5. Lin, Y.C., Hsiao, J.W.: A new approach to constructing optimal prefix circuits with small depth. In: Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN'02). (2002)
6. Peyton Jones, S.: Haskell 98 Language and Libraries. Cambridge University Press (2003)
7. Braun, W., Rem, M.: A logarithmic implementation of flexible arrays. Memorandum MR83/4, Eindhoven University of Technology (1983)
8. Hinze, R.: Constructing red-black trees. In Okasaki, C., ed.: Proceedings of the Workshop on Algorithmic Aspects of Advanced Programming Languages, WAAAPL'99, Paris, France. (1999) 89-99 The proceedings appeared as a technical report of Columbia University, CUCS-023-99, also available from http://www.cs.columbia.edu/cdo/waaapl.html.
9. Brent, R., Kung, H.: The chip complexity of binary arithmetic. In: Twelfth Annual ACM Symposium on Theory of Computing (STOC '80), New York, ACM Press (1980) 190-200
10. Ladner, R.E., Fischer, M.J.: Parallel prefix computation. Journal of the ACM 27 (1980) 831-838
11. Fich, F.E.: New bounds for parallel prefix circuits. In ACM, ed.: Proceedings of the fifteenth annual ACM Symposium on Theory of Computing, Boston, Massachusetts, April 25-27, 1983, New York, NY, USA, ACM Press (1983) 100-109
12. Weinberger, A., Smith, J.: A one-microsecond adder using one-megacycle circuitry. IRE Transactions on Electronic Computers EC-5 (1956)
13. Misra, J.: Powerlist: A structure for parallel recursion. ACM Transactions on Programming Languages and Systems 16 (1994) 1737-1767
14. O'Donnell, J.T., Rünger, G.: Derivation of a logarithmic time carry lookahead addition circuit. Journal of Functional Programming, Special Issue on Functional Pearls (2004) to appear.
15. Gorlatch, S., Lengauer, G.: (De)Composition rules for parallel scan and reduction. In: Proc. 3rd Int. Working Conf. on Massively Parallel Programming Models (MPPM'97), IEEE Computer Society Press, pages 23-32 (1998)
16. Gorlatch, S.: Extracting and implementing list homomorphisms in parallel program development. Science of Computer Programming 33 (1999) 1-27