Design and analysis of parallel algorithms

Kurskod: 5DV050 Inrättad: 2008-03-31 Inrättad av: teknisk-naturvetenskapliga fakultetsnämnden Reviderad: 2012-02-29 Reviderad av: teknisk-naturvetenskapliga fakultetsnämnden Kursplan giltig från: 2012, vecka 10 Ansvarig enhet: Inst för datavetenskap SCB-ämnesrubrik: Informatik/Dataoch systemvetenskap Huvudområden och successiv fördjupning: Beräkningsteknik: Avancerad nivå, har endast kurs/er på grundnivå som förkunskapskrav (A1N) , Datavetenskap: Avancerad nivå, har endast kurs/er på grundnivå som förkunskapskrav (A1N) Betygsskala: För denna kurs ges betygen 5 Med beröm godkänd, 4 Icke utan beröm godkänd, 3 Godkänd, VG Väl godkänd, G Godkänd, U Underkänd Utbildningsnivå: Avancerad nivå

[1]  Richard P. Brent,et al.  The Parallel Evaluation of General Arithmetic Expressions , 1974, JACM.

[2]  Benjamin W. Wah,et al.  How to Cope With Anomalies in Parallel Approximate Branch-and-Bound Algorithms , 1984, AAAI.

[3]  Lynn Elliot Cannon,et al.  A cellular computer to implement the kalman filter algorithm , 1969 .

[4]  David W. L. Yen,et al.  Systolic Processing and an Implementation for Signal and Image Processing , 1982, IEEE Transactions on Computers.

[5]  Kai Hwang,et al.  Partitioned Matrix Algorithms for VLSI Arithmetic Systems , 1982, IEEE Transactions on Computers.

[6]  Sartaj Sahni,et al.  Data broadcasting in SIMD computers , 1981, IEEE Transactions on Computers.

[7]  Edward F. Gehringer,et al.  The Cm* Multiprocessor Project: A Research Review , 1980 .

[8]  H. T. Kung,et al.  The Complexity of Parallel Evaluation of Linear Recurrences , 1977, JACM.

[9]  Paul Chow,et al.  A Pipelined Distributed Arithmetic PFFT Processor , 1983, IEEE Transactions on Computers.

[10]  J. Ian Munro,et al.  Optimal Algorithms for Parallel Polynomial Evaluation , 1971, J. Comput. Syst. Sci..

[11]  William L. Briggs,et al.  Multiprocessor FFT Methods , 1985, PPSC.

[12]  Richard C. T. Lee,et al.  Systolic algorithms to examine all pairs of elements , 1987, CACM.

[13]  W. Morven Gentleman,et al.  Some Complexity Results for Matrix Computations on Parallel Processors , 1978, JACM.

[14]  Allan Borodin,et al.  Fast parallel matrix and GCD computations , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[15]  Anita Liu Chow.  Parallel algorithms for geometric problems , 1980 .

[16]  I. V. Ramakrishnan,et al.  Modular Matrix Multiplication on a Linear Array , 1984, IEEE Trans. Computers.

[17]  David J. Kuck,et al.  A Parallel QR Algorithm for Symmetric Tridiagonal Matrices , 1977, IEEE Transactions on Computers.

[18]  I. V. Ramakrishnan,et al.  A Robust Matrix-Multiplication Array , 1984, IEEE Transactions on Computers.

[19]  Sartaj Sahni,et al.  Parallel Matrix and Graph Algorithms , 1981, SIAM J. Comput..

[20]  H. T. Kung,et al.  Numerically Stable Solution of Dense Systems of Linear Equations Using Mesh-Connected Processors , 1984 .

[21]  I-Ngo Chen,et al.  A New Parallel Algorithm for Network Flow Problems , 1974, Sagamore Computer Conference.

[22]  Gérard M. Baudet,et al.  Asynchronous Iterative Methods for Multiprocessors , 1978, JACM.

[23]  Gaston H. Gonnet,et al.  Handbook Of Algorithms And Data Structures , 1984 .

[24]  Edward W. Felten,et al.  The Traveling Salesman Problem on a Hypercubic, MIMD Computer , 1985, ICPP.

[25]  H. T. Kung,et al.  Synchronized and asynchronous parallel algorithms for multiprocessors , 1976 .

[26]  Samuel D. Conte,et al.  Elementary Numerical Analysis: An Algorithmic Approach , 1975 .

[27]  Peter M. Flanders.  A Unified Approach to a Class of Data Movements on an Array Processor , 1982, IEEE Transactions on Computers.

[28]  Don Heller,et al.  A Determinant Theorem with Applications to Parallel Algorithms , 1974 .

[29]  J. Hopcroft,et al.  Triangular Factorization and Inversion by Fast Matrix Multiplication , 1974 .

[30]  Stephen A. Cook,et al.  A Taxonomy of Problems with Fast Parallel Algorithms , 1985, Inf. Control..

[31]  Vipin Kumar,et al.  Parallel Branch-and-Bound Formulations for AND/OR Tree Search , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[32]  Franco P. Preparata,et al.  Area-Time Optimal VLSI Networks for Multiplying Matrices , 1980, Inf. Process. Lett..

[33]  D. Heller.  A Survey of Parallel Algorithms in Numerical Linear Algebra. , 1978 .

[34]  Glenn D. Bergland.  A Parallel Implementation of the Fast Fourier Transform Algorithm , 1972, IEEE Transactions on Computers.

[35]  Victor R. Lesser,et al.  Parallelism in Artificial Intelligence Problem Solving: A Case Study of Hearsay II , 1977, IEEE Transactions on Computers.

[36]  Joseph Mohan,et al.  Experience with Two Parallel Programs Solving the Traveling Salesman Problem , 1983, ICPP.

[37]  Harold S. Stone,et al.  Parallel Processing with the Perfect Shuffle , 1971, IEEE Transactions on Computers.

[38]  Douglas Stott Parker,et al.  Notes on Shuffle/Exchange-Type Switching Networks , 1980, IEEE Transactions on Computers.

[39]  W. L. Ruzzo,et al.  ADAPTIVE PARALLEL ALGORITHMS FOR FINDING MINIMUM SPANNING TREES. , 1984 .

[40]  Sartaj Sahni,et al.  Anomalies in Parallel Branch-and-Bound Algorithms , 1984 .

[41]  Victor Y. Pan,et al.  Fast and Efficient Parallel Linear Programming and Linear Least Squares Computations , 1986, Aegean Workshop on Computing.

[42]  Volker Strassen,et al.  The asymptotic spectrum of tensors and the exponent of matrix multiplication , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[43]  Richard J. Anderson,et al.  Parallelism and greedy algorithms , 1984 .

[44]  H. T. Kung,et al.  The Area-Time Complexity of Binary Multiplication , 1981, JACM.

[45]  Wayne Eberly,et al.  Very Fast Parallel Matrix and Polynomial Arithmetic , 1984, FOCS.

[46]  Harold S. Stone,et al.  A Parallel Algorithm for the Efficient Solution of a General Class of Recurrence Equations , 1973, IEEE Transactions on Computers.

[47]  Benjamin W. Wah,et al.  The status of manip - a multicomputer architecture for solving, combinatorial extremum-search problems , 1984, ISCA '84.

[48]  Jean-Loup Baer,et al.  Computer systems architecture , 1980 .

[49]  Mikhail J. Atallah,et al.  Efficient plane sweeping in parallel , 1986, SCG '86.

[50]  Joseph F. Traub.  Complexity of Sequential and Parallel Numerical Algorithms , 1973 .

[51]  Selim G. Akl.  A constant-time parallel algorithm for computing convex hulls , 1982, BIT Comput. Sci. Sect..

[52]  M. C. Er,et al.  A Parallel Computation Approach to Topological Sorting , 1983, Comput. J..

[53]  Donald Fraser,et al.  Array Permutation by Index-Digit Permutation , 1976, JACM.

[54]  Ronald H. Perrott,et al.  The influence of hardware and software considerations on the design of synchronous parallel algorithms , 1983, Softw. Pract. Exp..

[55]  Jon Louis Bentley,et al.  A Parallel Algorithm for Constructing Minimum Spanning Trees , 1980, J. Algorithms.

[56]  David J. Evans,et al.  The Parallel Solution of Triangular Systems of Equations , 1983, IEEE Transactions on Computers.

[57]  Jacques Lenfant,et al.  Parallel Permutations of Data: A Benes Network Control Algorithm for Frequently Used Permutations , 1978, IEEE Transactions on Computers.

[58]  Billy L. Buzbee.  A Fast Poisson Solver Amenable to Parallel Computation , 1973, IEEE Transactions on Computers.

[59]  Pierre A. Humblet,et al.  A Distributed Algorithm for Minimum-Weight Spanning Trees , 1979, TOPL.

[60]  P. Lewis,et al.  Historical notes on the fast Fourier transform , 1967, IEEE Transactions on Audio and Electroacoustics.

[61]  N.R. Malik,et al.  Graph theory with applications to engineering and computer science , 1975, Proceedings of the IEEE.

[62]  Larry Rudolph,et al.  The power of parallel prefix , 1985, IEEE Transactions on Computers.

[63]  G. Jack Lipovski,et al.  On Generating Multipliers for a Cellular Fast Fourier Transform Processor , 1972, IEEE Transactions on Computers.

[64]  Frank Thomson Leighton,et al.  Tight Bounds on the Complexity of Parallel Sorting , 1984, IEEE Transactions on Computers.

[65]  S. N. Maheshwari,et al.  Parallel algorithms for the convex hull problem in two dimensions , 1981, CONPAR.

[66]  Joachim von zur Gathen.  Parallel algorithms for algebraic problems , 1983, STOC '83.

[67]  Louis M. Monier,et al.  Optimality in VLSI , 1981 .

[68]  Alvin M. Despain,et al.  Very Fast Fourier Transform Algorithms Hardware for Implementation , 1979, IEEE Transactions on Computers.

[69]  Nicola Santoro,et al.  Computing on a Systolic Screen: Hulls, Contours and Applications , 1987, PARLE.

[70]  S. N. Maheshwari,et al.  Parallel Algorithms for the Connected Components and Minimal Spanning Tree Problems , 1982, Inf. Process. Lett..

[71]  Pramod Chandra P. Bhatt,et al.  Parallel algorithms for tree traversals , 1985, Parallel Comput..

[72]  Leonard Uhr,et al.  A pyramidal approach for the recognition of neurons using key features , 1986, Pattern Recognit..

[73]  Howard Jay Siegel,et al.  Study of multistage SIMD interconnection networks , 1978, ISCA '78.

[74]  Sartaj Sahni,et al.  Parallel permutation and sorting algorithms and a new generalized connection network , 1982, JACM.

[75]  KSHITIJ A. DOSHI,et al.  Optimal Graph Algorithms on a Fixed-Size Linear Array , 1987, IEEE Transactions on Computers.

[76]  Jack L. Rosenfeld,et al.  A case study in programming for parallel-processors , 1969, CACM.

[77]  Karl N. Levitt,et al.  Cellular Interconnection Arrays , 1968, IEEE Transactions on Computers.

[78]  Bernard Chazelle.  Computational Geometry on a Systolic Chip , 1984, IEEE Transactions on Computers.

[79]  Stephen A. Cook,et al.  Bounds on the time for parallel RAM's to compute simple functions , 1982, STOC '82.

[80]  Victor Y. Pan,et al.  A Logarithmic Boolean Time Algorithm for Parallel Polynomial Division , 1986, Inf. Process. Lett..

[81]  Gary D. Knott.  A numbering system for combinations , 1974, CACM.

[82]  Marshall C. Pease,et al.  The Indirect Binary n-Cube Microprocessor Array , 1977, IEEE Transactions on Computers.

[83]  Don Coppersmith,et al.  Matrix multiplication via arithmetic progressions , 1987, STOC.

[84]  S. Rao Kosaraju,et al.  Fast parallel processing array algorithms for some graph problems(Preliminary Version) , 1979, STOC.

[85]  Joel H. Saltz,et al.  Reduction of the effects of the communication delays in scientific algorithms on message passing MIMD architectures , 1985, PPSC.

[86]  Joseph JáJá,et al.  Parallel Algorithms in Graph Theory: Planarity Testing , 1982, SIAM J. Comput..

[87]  Frances Lucretia Van Scoy.  Parallel algorithms in cellular spaces. , 1976 .

[88]  P. Swarztrauber.  A direct Method for the Discrete Solution of Separable Elliptic Equations , 1974 .

[89]  Bernard John Lint.  Communication issues in parallel algorithms and computers. , 1979 .

[90]  H. T. Kung,et al.  The Design of Special-Purpose VLSI Chips , 1980, Computer.

[91]  K. Mani Chandy,et al.  Distributed computation on graphs: shortest path algorithms , 1982, CACM.

[92]  Joseph Mohan,et al.  A study in parallel computation : the traveling salesman problem , 1982 .

[93]  Alvin M. Despain,et al.  Fourier Transform Computers Using CORDIC Iterations , 1974, IEEE Transactions on Computers.

[94]  C. Thomborson,et al.  A Complexity Theory for VLSI , 1980 .

[95]  J. J. Lambiotte,et al.  Computing the Fast Fourier Transform on a vector computer , 1979 .

[96]  John Philip Fishburn.  Analysis of speedup in distributed algorithms , 1984 .

[97]  Louis A. Hageman,et al.  Iterative Solution of Large Linear Systems. , 1971 .

[98]  Kenneth E. Batcher,et al.  The flip network in staran , 1976 .

[99]  Christopher P. Arnold,et al.  An Efficient Parallel Algorithm for the Solution of Large Sparse Linear Matrix Equations , 1983, IEEE Transactions on Computers.

[100]  Ellis Horowitz,et al.  Divide-and-Conquer for Parallel Processing , 1983, IEEE Transactions on Computers.

[101]  Charles E. Leiserson,et al.  Area-Efficient VLSI Computation , 1983 .

[102]  W. Miranker.  A Survey of Parallelism in Numerical Analysis , 1971 .

[103]  Godfried T. Toussaint,et al.  PATTERN RECOGNITION AND GEOMETRICAL COMPLEXITY. , 1980 .

[104]  CHITOOR V. RAMAMOORTHY,et al.  System Segmentation for the Parallel Diagnosis of Computers , 1971, IEEE Transactions on Computers.

[105]  Marshall C. Pease,et al.  An Adaptation of the Fast Fourier Transform for Parallel Processing , 1968, JACM.

[106]  Paul N. Swarztrauber,et al.  Vectorizing the FFTs , 1982 .

[107]  H. T. Kung.  New Algorithms and Lower Bounds for the Parallel Evaluation of Certain Rational Expressions and Recurrences , 1976, JACM.

[108]  D. Helmbold,et al.  Two Processor Scheduling is in NC , 1987, SIAM J. Comput..

[109]  H. T. Kung.  Let's Design Algorithms for VLSI Systems , 1979 .

[110]  Franco P. Preparata,et al.  The cube-connected-cycles: A versatile network for parallel computation , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[111]  G. P. Bhattacharjee,et al.  Parallel Generation of Permutations , 1983, Comput. J..

[112]  Michael J. Quinn,et al.  Designing Efficient Algorithms for Parallel Computers , 1987 .

[113]  Charles Clos,et al.  A study of non-blocking switching networks , 1953 .

[114]  Duncan H. Lawrie,et al.  Access and Alignment of Data in an Array Processor , 1975, IEEE Transactions on Computers.

[115]  John E. Savage.  Area-Time Tradeoffs for Matrix Multiplication and Related Problems in VLSI Models , 1981, J. Comput. Syst. Sci..

[116]  Sartaj Sahni,et al.  A parallel matching algorithm for convex bipartite graphs and applications to scheduling , 1984, J. Parallel Distributed Comput..

[117]  J. Nievergelt.  Computational complexity of sequential and parallel algorithms , 1986 .

[118]  Ludek Kucera,et al.  Parallel Computation and Conflicts in Memory Access , 1982, Inf. Process. Lett..

[119]  Daniel Tabak.  Introduction to numerical methods for parallel computers , 1986 .

[120]  P. Sankar,et al.  A parallel procedure for the detection of dominant points on a digital curve , 1978 .

[121]  Howard Jay Siegel,et al.  Interconnection networks for large-scale parallel processing: theory and case studies (2nd ed.) , 1985 .

[122]  Marshall C. Pease.  Matrix Inversion Using Parallel Processing , 1967, JACM.

[123]  Selim G. Akl,et al.  Design, Analysis, and Implementation of a Parallel Tree Search Algorithm , 1982, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[124]  Jean-Marc Delosme,et al.  Highly concurrent computing structures for matrix arithmetic and signal processing , 1982, Computer.

[125]  Anthony P. Reeves,et al.  Efficient Function Implementation for Bit-Serial Parallel Processors , 1980, IEEE Transactions on Computers.

[126]  Chris R. Jesshope,et al.  The Implementation of Fast Radix 2 Transforms on Array Processors , 1980, IEEE Transactions on Computers.

[127]  S. P. Kumar,et al.  Solving Linear Algebraic Equations on an MIMD Computer , 1983, JACM.

[128]  David E. Muller,et al.  Bounds to Complexities of Networks for Sorting and for Switching , 1975, JACM.

[129]  A. Sameh.  On Jacobi and Jacobi-like algorithms for a parallel computer , 1971 .

[130]  Dharma P. Agrawal,et al.  Performance Analysis of FFT Algorithms on Multiprocessor Systems , 1983, IEEE Transactions on Software Engineering.

[131]  Andrew Vladislav Goldberg,et al.  Efficient graph algorithms for sequential and parallel computers , 1987 .

[132]  Carla D. Savage.  A Systolic Data Structure Chip for Connectivity Problems , 1981 .

[133]  Selim G. Akl,et al.  Systolic sorting in a sequential input/output environment , 1986, Parallel Comput..

[134]  David J. Kuck,et al.  On Stable Parallel Linear System Solvers , 1978, JACM.

[135]  Jeffrey D Ullma.  Computational Aspects of VLSI , 1984 .

[136]  Jeffrey S. Rohl,et al.  Generating Permutations by Choosing , 1978, Computer/law journal.

[137]  Mikhail J. Atallah,et al.  Efficient Parallel Solutions to Some Geometric Problems , 1986, J. Parallel Distributed Comput..

[138]  Alan R. Siegel,et al.  Minimum Storage Sorting Networks , 1985, IEEE Transactions on Computers.

[139]  F. Thomas Leighton,et al.  Complexity Issues in VLSI , 1983 .

[140]  G. Robert Redinbo,et al.  Finite Field Arithmetic on an Array Processor , 1979, IEEE Transactions on Computers.

[141]  Omar Wing,et al.  A Computation Model of Parallel Solution of Linear Equations , 1980, IEEE Transactions on Computers.

[142]  Deborah Evelyn.  An Introduction to Computational Combinatorics , 1979 .

[143]  Uzi Vishkin,et al.  An O(log n) Parallel Connectivity Algorithm , 1982, J. Algorithms.

[144]  Solomon W. Golomb,et al.  Permutations by Cutting and Shuffling , 1961 .

[145]  Tilak Agerwala,et al.  Communication Issues in the Design and Analysis of Parallel Algorithms , 1981, IEEE Transactions on Software Engineering.

[146]  Aviezri S. Fraenkel,et al.  Permutation Generation on Vector Processors , 1982, Comput. J..

[147]  Toshihide Ibaraki,et al.  Implementation of Parallel Prolog on Tree Machines , 1986, FJCC.

[148]  Kenneth C. Smith,et al.  A Parallel Radix-4 Fast Fourier Transform Computer , 1975, IEEE Transactions on Computers.

[149]  Geoffrey C. Fox,et al.  Matrix algorithms on a hypercube I: Matrix multiplication , 1987, Parallel Comput..

[150]  Frank Dehne.  Parallel computational geometry and clustering methods , 1986 .

[151]  Francis Y. L. Chin,et al.  Efficient parallel algorithms for some graph problems , 1982, CACM.

[152]  Sartaj Sahni,et al.  VLSI systems for band matrix multiplication , 1987, Parallel Comput..

[153]  L. Csanky,et al.  Fast parallel matrix inversion algorithms , 1975, 16th Annual Symposium on Foundations of Computer Science (sfcs 1975).

[154]  Charles R. Dyer,et al.  A Fast Parallel Algorithm for the Closest Pair Problem , 1980, Inf. Process. Lett..

[155]  Frances L. Van Scoy.  The Parallel Recognition of Classes of Graphs , 1980, IEEE Trans. Computers.

[156]  H. H. Wang,et al.  On vectorizing the fast fourier transform , 1980 .

[157]  Bently A. Crane.  Path Finding with Associative Memory , 1968, IEEE Transactions on Computers.

[158]  Selim G. Akl.  A Comparison of Combination Generation Methods , 1981, TOMS.

[159]  Kenneth E. Batcher,et al.  Bit-Serial Parallel Processing Systems , 1982, IEEE Transactions on Computers.

[160]  David L. Waltz,et al.  Toward memory-based reasoning , 1986, CACM.

[161]  Leonidas J. Guibas,et al.  Parallel computational geometry , 1988, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[162]  Dilip V. Sarwate,et al.  Computing connected components on parallel computers , 1979, CACM.

[163]  Robert Sedgewick,et al.  Permutation Generation Methods , 1977, CSUR.

[164]  K.H. Kim.  Introduction to computer architecture , 1977, Proceedings of the IEEE.

[165]  Derek G. Corneil,et al.  Parallel computations in graph theory , 1975, 16th Annual Symposium on Foundations of Computer Science (sfcs 1975).

[166]  Howard Jay Siegel,et al.  Parallel Processing Approaches to Image Correlation , 1982, IEEE Transactions on Computers.

[167]  Karl N. Levitt,et al.  Cellular arrays for the solution of graph problems , 1972, Commun. ACM.

[168]  David J. Sakrison,et al.  Berkeley Array Processor , 1970, IEEE Transactions on Computers.

[169]  S. N. Maheshwari,et al.  Efficient VLSI Networks for Parallel Processing Based on Orthogonal Trees , 1983, IEEE Transactions on Computers.

[170]  Tse-Yun Feng,et al.  The Universality of the Shuffle-Exchange Network , 1981, IEEE Transactions on Computers.

[171]  Gary L. Miller,et al.  Sublinear Parallel Algorithm for Computing the Greatest Common Divisor of Two Integers , 1984, SIAM J. Comput..

[172]  J. Vuillemin,et al.  Recursive implementation of optimal time VLSi integer multipliers , 1984 .

[173]  Harry W. J. M. Trienekens,et al.  Experiments with Parallel Algorithms for Combinatorial Problems , 1985 .

[174]  Samuel E. Orcutt.  Implementation of Permutation Functions in Illiac IV-Type Computers , 1976, IEEE Transactions on Computers.

[175]  David J. Kuck,et al.  Parallel Computation of Eigenvalues of Real Matrices , 1971, IFIP Congress.

[176]  T. Anthony Marsland,et al.  Parallel Search of Strongly Ordered Game Trees , 1982, CSUR.

[177]  Richard M. Karp,et al.  The Organization of Computations for Uniform Recurrence Equations , 1967, JACM.

[178]  M. A. Wolfe.  A first course in numerical analysis , 1972 .

[179]  Fred Popowich,et al.  Parallel Game-Tree Search , 1985, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[180]  Yijie Han,et al.  : Parallel Algorithms for Bucket Sorting and the Data Dependent Prefix Problem , 1986, ICPP.

[181]  Daniel S. Hirschberg.  Parallel algorithms for the transitive closure and the connected component problems , 1976, STOC '76.

[182]  David G. Kirkpatrick,et al.  Parallel processing for efficient subdivision search , 1987, SCG '87.

[183]  Sartaj Sahni,et al.  A Self-Routing Benes Network and Parallel Permutation Algorithms , 1981, IEEE Transactions on Computers.

[184]  James Christopher Wyllie,et al.  The Complexity of Parallel Computations , 1979 .

[185]  Maw-Sheng Chern,et al.  Parallel generation of permutations and combinations , 1986, BIT Comput. Sci. Sect..

[186]  Mateo Valero,et al.  Solving Matrix Problems with No Size Restriction on a Systolic Array Processor , 1986, International Conference on Parallel Processing.

[187]  Willard L. Miranker,et al.  Optimal Sequential and Parallel Seach for Finding a Root , 1977, J. Comb. Theory, Ser. A.

[188]  Michael J. Quinn,et al.  Parallel graph algorithms , 1984, CSUR.

[189]  Gary D. Knott,et al.  A Numbering System for Permutations of Combinations , 1976, Commun. ACM.

[190]  Bruce M. Maggs,et al.  Communication-Efficient Parallel Graph Algorithms , 1986, ICPP.

[191]  Selim G. Akl,et al.  Efficient Selection on a Binary Tree , 1986, Inf. Process. Lett..

[192]  Ernst W. Mayr,et al.  Techniques for solving graph problems in parallel environments , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[193]  George C. Stockman,et al.  A Minimax Algorithm Better than Alpha-Beta? , 1979, Artif. Intell..

[194]  H. T. Kung,et al.  Direct VLSI Implementation of Combinatorial Algorithms , 1979 .

[195]  Shmuel Winograd,et al.  On the Parallel Evaluation of Certain Arithmetic Expressions , 1975, JACM.

[196]  Sartaj Sahni,et al.  Binary Trees and Parallel Scheduling Algorithms , 1981, IEEE Transactions on Computers.

[197]  Alok Aggarwal.  A Comparative Study of X-Tree, Pyramid and Related Machines , 1984, FOCS.

[198]  Mikhail J. Atallah,et al.  Graph Problems on a Mesh-Connected Processor Array , 1984, JACM.

[199]  Alvin M. Despain,et al.  Pipeline and Parallel-Pipeline FFT Processors for VLSI Implementations , 1984, IEEE Transactions on Computers.

[200]  Selim G. Akl.  A new algorithm for generating derangements , 1980, BIT Comput. Sci. Sect..

[201]  Thompson.  Fourier Transforms in VLSI , 1983, IEEE Transactions on Computers.

[202]  Gerard Maurice Baudet,et al.  The design and analysis of algorithms for asynchronous multiprocessors. , 1978 .

[203]  P. A. Gilmore,et al.  Structuring of Parallel Algorithms , 1968, JACM.

[204]  Allan Borodin,et al.  The computational complexity of algebraic and numeric problems , 1975, Elsevier computer science library.