Jacob Kornerup  Home/Search
Context Related
| utexas.edu/users/kornerup/dis.ps.Z Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: utexas.edu/user...korneruppapers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: vii Chapter 1 Introduction 1 1.1 Synchronous Parallel Programming . . . . . . . . . . . . . . . . . . . 4 1.2 Basic Definitions and Notations . . . . . . . . . . . . . . . . . . . . . 6 1.2.1 Types . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 1.2.2 Operator Priority . . . . . . . . . . . . . . . . . . . . . . . . . 8 1.2.3 Notation and Proof Style . . . . . . . . . . . . . . . . . . . . 9 1.3 Cost Calculus . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11 1.3.1 ... (Update)
Context of citations to this paper: More
...subject string. The number of processors employed is of the order of the product of the two string lengths. The theory of powerlists [2, 3] is central to the development of the algorithm and its algebraic manipulations. 1 Introduction We describe a parallel algorithm that nds...
...based, can handle only k = 2. Kornerup has extended the powerlist theory, and he has proven similar isomorphism results for arbitrary k, see [6]. 2 Interconnection Networks An interconnection network of size N , where N = 2 n , for some n, n 0, has n 1 stages numbered 0...
Cited by: More
Generating-Functions of Interconnection Networks - Jayadev Misra The (Correct)
Derivation of a Parallel String Matching Algorithm - Misra (2001) (Correct)
Active bibliography (related documents): More All
1.3: Parlists - a Generalization of Powerlists - Kornerup (1997) (Correct)
0.8: Mechanically Verifying Real-Valued Algorithms in ACL2 - Gamboa (1999) (Correct)
0.5: First Year Report - Goodman (1998) (Correct)
Similar documents based on text: More All
0.9: Verifying Adder Circuits Using Powerlists - Adams (1994) (Correct)
0.3: Powerlist: A Structure for Parallel Recursion - Misra (1994) (Correct)
0.3: Ameliorating the State Space Explosion Problem - Namjoshi (1998) (Correct)
Related documents from co-citation: More All
2: ACM Transactions on Programming Languages and Systems (context) - Misra, for et al. - 1994
BibTeX entry: (Update)
Jacob Kornerup. Data Structures for Parallel Recursion. PhD thesis, University of Texas at Austin, 1997. Available for download at http://www.cs.utexas.edu/users/kornerup/dis.ps.Z. http://citeseer.ist.psu.edu/kornerup97data.html More
@misc{ kornerup97data,
author = "J. Kornerup",
title = "Data Structures for Parallel Recursion",
text = "Jacob Kornerup. Data Structures for Parallel Recursion. PhD thesis, University
of Texas at Austin, 1997. Available for download at http://www.cs.utexas.edu/users/kornerup/dis.ps.Z.",
year = "1997",
url = "citeseer.ist.psu.edu/kornerup97data.html" }
Citations (may not include all citations):3972 Introduction to Algorithms (context) - Cormen, Leiserson et al. - 1990
981 Introduction to Parallel Algorithms and Architectures: Array.. (context) - Leighton - 1992
531 LogP: Towards a realistic model of parallel computation - Culler, Karp et al. - 1993
384 The Definition of Standard ML (context) - Milner, Tofte et al. - 1990
322 Sorting networks and their application (context) - Batcher - 1968
278 Algorithmic Skeletons: Structured Management of Parallel Com.. (context) - Cole - 1989
273 Can programming be liberated from the von Neumann style (context) - Backus - 1978
268 Parallel algorithms for shared memory machines (context) - Karp, Ramachandran - 1990
206 An algorithm for the machine calculation of complex Fourier .. (context) - Cooley, Tukey - 1965
206 Vector Models for Data-Parallel Computing (context) - Blelloch - 1990
201 Parallel prefix computation (context) - Ladner, Fischer - 1980
174 The parallel evaluation of general arithmetic expressions (context) - Brent - 1974
168 Gaussian elimination is not optimal (context) - Strassen - 1969
166 NESL: A nested data-parallel language - Blelloch - 1995
138 Lectures on constructive functional programming (context) - Bird - 1989
124 The cube-connected cycles: A versatile network for parallel .. (context) - Preparata, Vuillemin - 1981
115 Scans as primitive parallel operations - Blelloch - 1989
103 A Programming Language (context) - Iverson - 1962
93 Parallel processing with the perfect shuffle (context) - Stone - 1971
89 SISAL: Streams and Iterations in a Single Assignment Languag.. (context) - McGraw, Skezielewski et al. - 1985
85 Circuit design in Ruby (context) - Jones, Sheeran - 1990
81 Algorithmics -- towards programming as a mathematical activi.. (context) - Meertens - 1986
71 General purpose parallel computing - McColl - 1991
68 Functional Programming for Loosely-Coupled Multiprocessors (context) - Kelly - 1989
63 Algebraic Data Types and Program Transformation (context) - Malcolm - 1990
56 Parallel matrix and graph algorithms (context) - Dekel, Nassimi et al. - 1981
55 Foundations of Parallel Programming (context) - Skillicorn - 1994
45 An Introduction to Parallel Algorithms (context) - J'aJ'a - 1992
41 Predicate Calculus and Program Semantics (context) - Dijkstra, Sholten - 1990
37 Communications of the ACM (context) - Cann - 1992
25 ACM SIGPLAN Notices (context) - Turner, of - 1986
23 ACM Transactions on Programming Languages and Systems (context) - Misra, for et al. - 1994
22 Prentice Hall International Series in Computer Science (context) - Bird, Wadler et al. - 1988
21 Systematic efficient parallelization of scan and other list .. - Gorlatch - 1996
21 the computational equivalence of hypercube-derived networks (context) - Schwabe - 1990
20 the algorithmic complexity of discrete function (context) - Ofman - 1963
19 Pulse code communication (context) - Gray - 1953
17 Prefix sums and their applications - Blelloch - 1993
12 Mechanically verifying a family of multiplier circuits - Kapur, Subramaniam - 1996
12 A report on the functional language Haskell (context) - Hudak, Jones et al. - 1992
12 Automated reasoning about parallel algorithms using powerlis.. (context) - Kapur, Subramaniam - 1995
11 An algebraic model for divide-andconquer and its parallelism (context) - Mou, Hudak - 1988
10 Lawrence Livermore National Laboratory (context) - Bohm, Cahn et al. - 1991
10 Thinking Machines Corporation (context) - Lasser, lisp et al. - 1986
9 Constructors can be partial too - Kapur - 1994
9 Verifying adder circuits using powerlists - Adams - 1994
9 Defthms about zip and tie: Reasoning about powerlists in ACL - Gamboa - 1997
8 the conversion between binary code and binary-reflected gray.. - Johnsson, Ho - 1995
8 Mapping powerlists onto hypercubes (context) - Kornerup - 1994
7 Unpublished manuscript (context) - Misra - 1996
7 Mapping a functional notation for parallel programs onto hyp.. - Kornerup - 1995
6 Series in Computer Science and Information Processing (context) - Knuth, of et al. - 1973
5 Technical Monograph PRG (context) - Jones, Sheeran - 1991
5 Primer for program composition notation (context) - Chandy, Taylor - 1990
4 Automating induction over mutually recursive functions (context) - Kapur, Subramaniam - 1996
4 Parlists - a generalization of powerlists - Kornerup - 1997
4 A Formal Model for Divide-and-Conquer and Its Parallel Reali.. (context) - Mou - 1990
4 Electronic Data Sorting (context) - Demuth - 1956
4 Parlists -- a generalization of powerlists - Kornerup - 1997
4 Information Processing Letters (context) - Kornerup, in - 1997
3 Massive parallelization of divideand -conquer algorithms ove.. (context) - Achatz, Schulte - 1996
2 Department of Computer Science (context) - Mayr, Plaxton et al. - 1989
2 Multiplication circuits in powerlists (context) - Adams - 1995
2 An extended language for data parallel programming (context) - Rose, Jr - 1987
1 Information sorting in the application of electronic digital.. (context) - Seward - 1954
1 Routing and complexity of rearrangeable networks (context) - McIlroy, Savicki - 1997
1 The composition of parallel programs (context) - Chandy, Taylor - 1989
1 Describing structures of interconnection networks (context) - Misra, Kornerup - 1997
Documents on the same site (http://www.cs.utexas.edu/users/kornerup/kornerup-papers.html): More
Verifying Synchronous Programs (draft) - Jacob Kornerup (Correct)
On "An O(log N) Algorithm to Solve Linear Recurrences on.. - Kornerup (1994) (Correct)
Refinement in UNITY - Jacob Kornerup (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