Parallel Algorithms for Shared-Memory Machines

[1]  Joel I. Seiferas.  Machine-Independent Complexity Theory , 1990, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[2]  Ravi B. Boppana,et al.  The Complexity of Finite Functions , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[3]  Larry Rudolph,et al.  A Complexity Theory of Efficient Parallel Algorithms , 1990, Theor. Comput. Sci..

[4]  Michael T. Goodrich,et al.  Triangulating a Polygon in Parallel , 1989, J. Algorithms.

[5]  Ernst W. Mayr,et al.  The complexity of circuit value and network stability , 1989, [1989] Proceedings. Structure in Complexity Theory Fourth Annual Conference.

[6]  Jerry L. Trahan,et al.  The power of parallel random access machines with augmented instruction sets , 1989, [1989] Proceedings. Structure in Complexity Theory Fourth Annual Conference.

[7]  David G. Kirkpatrick,et al.  A Simple Parallel Tree Contraction Algorithm , 1989, J. Algorithms.

[8]  Howard J. Karloff,et al.  The Iterated Mod Problem , 1989, Inf. Comput..

[9]  Noam Nisan,et al.  Parallel Algorithms for Zero-One Supply-Demand Problems , 1989, SIAM J. Discret. Math..

[10]  Ming-Yang Kao,et al.  Local reorientation, global order, and planar topology , 1989, STOC '89.

[11]  A. Aggarwal,et al.  Parallel depth-first search in general directed graphs , 1989, STOC '89.

[12]  Noam Nisan,et al.  CREW PRAMS and decision trees , 1989, STOC '89.

[13]  Uzi Vishkin,et al.  Highly parallelizable problems , 1989, STOC '89.

[14]  John H. Reif,et al.  Polling: a new randomized sampling technique for computational geometry , 1989, STOC '89.

[15]  Ravi B. Boppana,et al.  Optimal separations between concurrent-write parallel machines , 1989, STOC '89.

[16]  David Eppstein,et al.  Parallel Algorithmic Techniques for Combinatorial Computation , 1988, ICALP.

[17]  Natarajan Shankar,et al.  Efficient Parallel Circuits and Algorithms for Division , 1988, Inf. Process. Lett..

[18]  Andrew V. Goldberg,et al.  Sublinear-time parallel algorithms for matching and related problems , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[19]  M. Luby.  Removing randomness in parallel computation without a processor penalty , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[20]  Philip N. Klein,et al.  Efficient parallel algorithms for chordal graphs , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[21]  J. Gathen.  Algebraic complexity theory , 1988 .

[22]  Jerry Lee Trahan.  Instruction Sets for Parallel Random Access Machines , 1988 .

[23]  Gary L. Miller,et al.  Efficient Parallel Evaluation of Straight-Line Code and Arithmetic Circuits , 1988, SIAM J. Comput..

[24]  Uzi Vishkin,et al.  Efficient Parallel Triconnectivity in Logarithmic Time , 1988, AWOC.

[25]  Arthur L. Delcher,et al.  Optimal Parallel Evaluation of Tree-Structured Computations by Raking , 1988, AWOC.

[26]  Bruce E. Litow,et al.  O(log(n)) Parallel Time Finite Field Inversion , 1988, AWOC.

[27]  Ming-Yang Kao,et al.  All Graphs have Cycle Separators and Planar Directed Depth-First Search is in DNC , 1988, AWOC.

[28]  Marek Chrobak,et al.  Fast Parallel and Sequential Algorithms for Edge-Coloring Planar Graphs , 1988, AWOC.

[29]  Uzi Vishkin,et al.  On Finding Lowest Common Ancestors: Simplification and Parallelization , 1988, AWOC.

[30]  Gary L. Miller,et al.  An Improved Parallel Algorithm that Computes the BFS Numbering of a Directed Graph , 1988, Information Processing Letters.

[31]  Xin He,et al.  A Nearly Optimal Parallel Algorithm for Constructing Depth First Spanning Trees in Planar Graphs , 1988, SIAM J. Comput..

[32]  Philip N. Klein,et al.  Parallel Time O(log n) Acceptance of Deterministic CFLs on an Exclusive-Write P-RAM , 1988, SIAM J. Comput..

[33]  Danny Soroker,et al.  Fast Parallel Strong Orientation of Mixed Graphs and Related Augmentation Problems , 1988, J. Algorithms.

[34]  Danny Soroker.  Fast Parallel Algorithms for Finding Hamiltonian Paths and Cycles in a Tournament , 1988, J. Algorithms.

[35]  The parallel complexity of exponentiating polynomials over finite fields , 1988, JACM.

[36]  Eli Upfal,et al.  The Complexity of Parallel Search , 1988, J. Comput. Syst. Sci..

[37]  Joseph JaJa,et al.  Parallel algorithms for planar graph isomorphism and related problems , 1988 .

[38]  Richard J. Anderson,et al.  A random 1-011-011-01algorithm for depth first search , 1988 .

[39]  Xin He,et al.  Binary Tree Algebraic Computation and Parallel Algorithms for Simple Graphs , 1988, J. Algorithms.

[40]  Richard Cole,et al.  Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time , 1988, SIAM J. Comput..

[41]  Richard Cole,et al.  Optimal parallel algorithms for polygon and point-set problems , 1988, SCG '88.

[42]  Alok Aggarwal,et al.  A random NC algorithm for depth first search , 1987, Comb..

[43]  Ernst W. Mayr,et al.  The Dynamic Tree Expression Problem , 1988 .

[44]  Michael Ben-Or,et al.  A deterministic algorithm for sparse multivariate polynomial interpolation , 1988, STOC '88.

[45]  Robert E. Tarjan,et al.  Almost-optimum speed-ups of algorithms for bipartite matching and related problems , 1988, STOC '88.

[46]  S. Teng,et al.  Optimal Tree Contraction in the EREW Model , 1988 .

[47]  Richard Cole,et al.  Cascading divide-and-conquer: A technique for designing parallel algorithms , 1989, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[48]  Abhiram G. Ranade,et al.  How to emulate shared memory (Preliminary Version) , 1987, FOCS.

[49]  Prabhakar Ragde,et al.  Incomparability in parallel computation , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[50]  Prabhakar Raghavan,et al.  Parallel graph algorithms that are efficient on average , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[51]  Gary L. Miller,et al.  A parallel algorithm for finding a separator in planar graphs , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[52]  Marek Karpinski,et al.  The matching problem for bipartite graphs with polynomially bounded permanents is in NC , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[53]  Mark K. Goldberg,et al.  A new parallel algorithm for the maximal independent set problem , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[54]  Arkady Kanevsky,et al.  Improved algorithms for graph four-connectivity , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[55]  Joachim von zur Gathen.  Computing Powers in Parallel , 1987, SIAM J. Comput..

[56]  Torben Hagerup,et al.  Towards Optimal Parallel Bucket Sorting , 1987, Inf. Comput..

[57]  Baruch Awerbuch,et al.  New Connectivity and MSF Algorithms for Shuffle-Exchange Network and PRAM , 1987, IEEE Transactions on Computers.

[58]  B. D. Saunders,et al.  Fast parallel computation of hermite and smith forms of polynomial matrices , 1987 .

[59]  Ming Li,et al.  Separation and Lower Bounds for ROM and Nondeterministic Models of Parallel Computation , 1987, Inf. Comput..

[60]  David B. Shmoys,et al.  Efficient Parallel Algorithms for Edge Coloring Problems , 1987, J. Algorithms.

[61]  Richard M. Karp,et al.  Efficient Randomized Pattern-Matching Algorithms , 1987, IBM J. Res. Dev..

[62]  Nicholas Pippenger.  The Complexity of Computations by Networks , 1987, IBM J. Res. Dev..

[63]  Gary L. Miller,et al.  Dynamic parallel complexity of computational circuits , 1987, STOC '87.

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

[65]  Roman Smolensky,et al.  Algebraic methods in the theory of lower bounds for Boolean circuit complexity , 1987, STOC.

[66]  Johan Håstad,et al.  Optimal bounds for decision problems on the CRCW PRAM , 1987, STOC.

[67]  László Babai,et al.  Permutation groups in NC , 1987, STOC '87.

[68]  Andrew V. Goldberg,et al.  Parallel symmetry-breaking in sparse graphs , 1987, STOC.

[69]  Samuel R. Buss,et al.  The Boolean formula value problem is in ALOGTIME , 1987, STOC.

[70]  Vijay V. Vazirani,et al.  Matching is as easy as matrix inversion , 1987, STOC.

[71]  Gary L. Miller,et al.  A new graphy triconnectivity algorithm and its parallelization , 1987, STOC.

[72]  Eli Upfal,et al.  How to share memory in a distributed system , 1984, JACM.

[73]  A logarithmic time sort for linear size networks , 1987, JACM.

[74]  Richard Cole,et al.  Deterministic Coin Tossing with Applications to Optimal Parallel List Ranking , 2018, Inf. Control..

[75]  Richard Cole,et al.  Parallel merge sort , 1988, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[76]  M. Karpinski,et al.  Subtree Isomorphism and Bipartite Perfect Matching are Mutually $NC$-Reducible , 1986 .

[77]  Marek Karpinski,et al.  The Matching Problem for Strongly Chordal Graphs is in $NC$ , 1986 .

[78]  Howard J. Karloff.  A las vegas rnc algorithm for maximum matching , 1986, Comb..

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

[80]  Uzi Vishkin,et al.  Parallel Ear Decomposition Search (EDS) and st-Numbering in Graphs , 1986, Theor. Comput. Sci..

[81]  János Komlós,et al.  Deterministic selection in O(loglog N) parallel time , 1986, STOC '86.

[82]  Gad M. Landau,et al.  Introducing efficient parallelism into approximate string matching and a new serial algorithm , 1986, STOC '86.

[83]  Ephraim Feig,et al.  A fast parallel algorithm for determining all roots of a polynomial with real roots , 1986, STOC '86.

[84]  Anna R. Karlin,et al.  Parallel hashing—an efficient implementation of shared memory , 1986, STOC '86.

[85]  Ketan Mulmuley,et al.  A fast parallel algorithm to compute the rank of a matrix over an arbitrary field , 1986, STOC '86.

[86]  Ming Li,et al.  New lower bounds for parallel computation , 1986, STOC '86.

[87]  David A. Mix Barrington,et al.  Bounded-width polynomial-size branching programs recognize exactly those languages in NC1 , 1986, STOC '86.

[88]  Nimrod Megiddo,et al.  Linear programming with two variables per inequality in poly-log time , 1986, STOC '86.

[89]  Paul Beame,et al.  Limits on the power of concurrent-write parallel machines , 1986, STOC '86.

[90]  Erich Kaltofen,et al.  Uniform closure properties of P-computable functions , 1986, STOC '86.

[91]  Johan Håstad,et al.  Almost optimal lower bounds for small depth circuits , 1986, STOC '86.

[92]  László Babai,et al.  A Las Vegas - NC algorithm for isomorphism of graphs with bounded multiplicity of eigenvalues , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[93]  Martin Tompa,et al.  A new pebble game that characterizes parallel complexity classes , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[94]  Eugene M. Luks,et al.  Parallel algorithms for permutation groups and graph isomorphism , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[95]  Jeffrey D. Ullman,et al.  Parallel complexity of logical query programs , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[96]  Richard Cole,et al.  Approximate and exact parallel scheduling with applications to list, tree and graph problems , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[97]  Philip N. Klein,et al.  An efficient parallel algorithm for planarity , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[98]  Hillel Gazit,et al.  An optimal randomized parallel algorithm for finding connected components in a graph , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[99]  Cynthia Dwork,et al.  Parallel Algorithms for Term Matching , 1988, SIAM J. Comput..

[100]  Justin R. Smith.  Parallel Algorithms for Depth-First Searches I. Planar Graphs , 1986, SIAM J. Comput..

[101]  Walter L. Ruzzo,et al.  Parallel RAMs with Owned Global Memory and Deterministic Context-Free Language Recognition (Extended Abstract) , 1986, ICALP.

[102]  Joachim von zur Gathen,et al.  Parallel Arithmetic Computations: A Survey , 1986, MFCS.

[103]  Kurt Mehlhorn,et al.  Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones , 1986, SIAM J. Comput..

[104]  Jeffrey Scott Vitter,et al.  New Classes for Parallel Complexity: A Study of Unification and Other Complete Problems for P , 1986, IEEE Transactions on Computers.

[105]  Wojciech Rytter,et al.  An Optimal Parallel Algorithm for Dynamic Expression Evaluation and Its Applications , 1986, FSTTCS.

[106]  Stephen A. Cook,et al.  Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes , 1986, SIAM J. Comput..

[107]  Noga Alon,et al.  A Fast and Simple Randomized Parallel Algorithm for the Maximal Independent Set Problem , 1985, J. Algorithms.

[108]  Uzi Vishkin,et al.  Optimal parallel generation of a computation tree form , 1985, TOPL.

[109]  Uzi Vishkin,et al.  Optimal Parallel Pattern Matching in Strings , 2017, Inf. Control..

[110]  Marc Snir,et al.  On Parallel Searching , 2011, SIAM J. Comput..

[111]  Robert E. Tarjan,et al.  An Efficient Parallel Biconnectivity Algorithm , 2011, SIAM J. Comput..

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

[113]  Vijay V. Vazirani,et al.  NC Algorithms for Comparability Graphs, Interval Gaphs, and Testing for Unique Perfect Matching , 1985, FSTTCS.

[114]  Victor Y. Pan,et al.  Fast and Efficient Parallel Algorithms for the Exact Inversion of Integer Matrices , 1985, FSTTCS.

[115]  Victor Y. Pan,et al.  Efficient parallel solution of linear systems , 1985, STOC '85.

[116]  Eli Upfal,et al.  Constructing a perfect matching is in random NC , 1985, STOC '85.

[117]  Michael Luby,et al.  A simple parallel algorithm for the maximal independent set problem , 1985, STOC '85.

[118]  Andrew Chi-Chih Yao,et al.  Separating the Polynomial-Time Hierarchy by Oracles (Preliminary Version) , 1985, FOCS.

[119]  John H. Reif,et al.  An optimal parallel algorithm for integer sorting , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[120]  Gary L. Miller,et al.  Parallel tree contraction and its application , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[121]  Pierre McKenzie,et al.  Fast parallel computation with permutation groups , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[122]  Victor Y. Pan,et al.  Improved processor bounds for algebraic and combinatorial problems in RNC , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[123]  Chee-Keng Yap,et al.  Algebraic cell decomposition in NC , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[124]  László Lovász,et al.  Computing ears and branchings in parallel , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[125]  Friedhelm Meyer auf der Heide,et al.  The complexity of parallel sorting , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[126]  A. Wigderson,et al.  A fast parallel algorithm for the maximal independent set problem , 1985, JACM.

[127]  Alexander L. Chistov,et al.  Fast parallel calculation of the rank of matrices over a field of arbitrary characteristic , 1985, FCT.

[128]  John H. Reif,et al.  Depth-First Search is Inherently Sequential , 1985, Inf. Process. Lett..

[129]  Uzi Vishkin,et al.  On Efficient Parallel Strong Orientation , 1985, Inf. Process. Lett..

[130]  Rüdiger Reischuk.  Probabilistic Parallel Algorithms for Sorting and Selection , 1985, SIAM J. Comput..

[131]  Richard Cole,et al.  A Parallel Median Algorithm , 1985, Inf. Process. Lett..

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

[133]  Allan Borodin,et al.  Routing, Merging, and Sorting on Parallel Models of Computation , 1985, J. Comput. Syst. Sci..

[134]  Richard J. Lipton,et al.  Unbounded fan-in circuits and associative functions , 1983, J. Comput. Syst. Sci..

[135]  Uzi Vishkin,et al.  Randomized speed-ups in parallel computation , 2015, STOC '84.

[136]  Mikhail J. Atallah,et al.  Finding Euler Tours in Parallel , 2011, J. Comput. Syst. Sci..

[137]  Zvi Galil,et al.  Optimal parallel algorithms for string matching , 1984, STOC '84.

[138]  Eli Upfal,et al.  A probabilistic relation between desirable and feasible, models of parallel computation , 1984, STOC '84.

[139]  Baruch Awerbuch,et al.  Finding euler circuits in logarithmic parallel time , 1984, STOC '84.

[140]  Helmut Alt,et al.  Comparison of arithmetic functions with respect to boolean circuit depth , 1984, STOC '84.

[141]  John H. Reif,et al.  The complexity of elementary algebra and geometry , 1984, STOC '84.

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

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

[144]  Stephen A. Cook,et al.  Log Depth Circuits for Division and Related Problems , 1984, SIAM J. Comput..

[145]  John C. Mitchell,et al.  On the Sequential Nature of Unification , 1984, J. Log. Program..

[146]  Faith Ellen,et al.  Relations between concurrent-write models of parallel computation , 1984, PODC '84.

[147]  Yung H. Tsin,et al.  Efficient Parallel Algorithms for a Class of Graph Theoretic Problems , 1984, SIAM J. Comput..

[148]  Jürgen Avenhaus,et al.  The Nielsen Reduction and P-Complete Problems in Free Groups , 1984, Theor. Comput. Sci..

[149]  Uzi Vishkin,et al.  Simulation of Parallel Random Access Machines by Circuits , 1984, SIAM J. Comput..

[150]  Uzi Vishkin,et al.  Constant Depth Reducibility , 1984, SIAM J. Comput..

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

[152]  John H. Reif,et al.  Symmetric Complementation , 1984, JACM.

[153]  Stuart J. Berkowitz,et al.  On Computing the Determinant in Small Parallel Time Using a Small Number of Processors , 1984, Inf. Process. Lett..

[154]  Mikhail J. Atallah,et al.  Parallel Strong Orientation of an Undirected Graph , 1984, Inf. Process. Lett..

[155]  Joachim von zur Gathen,et al.  Parallel algorithms for algebraic problems , 1983, SIAM J. Comput..

[156]  H. James Hoover,et al.  Bounding Fan-out in Logical Networks , 1984, JACM.

[157]  A. Wigderson,et al.  Trade-offs between depth and width in parallel computation , 1985, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[158]  Allan Borodin,et al.  Parallel Computation for Well-Endowed Rings and Space-Bounded Probabilistic Machines , 1984, Inf. Control..

[159]  F. Fich.  New bounds for parallel prefix circuits , 1983, STOC 1983.

[160]  Avi Wigderson,et al.  Superconcentrators, generalizers and generalized connectors with limited depth , 1983, STOC.

[161]  Stephen A. Cook,et al.  The parallel complexity of the abelian permutation group membership problem , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[162]  John H. Reif,et al.  Logarithmic depth circuits for algebraic functions , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[163]  Leslie G. Valiant,et al.  Fast Parallel Computation of Polynomials Using Few Processors , 1983, SIAM J. Comput..

[164]  Miklós Ajtai,et al.  ∑11-Formulae on finite structures , 1983, Ann. Pure Appl. Log..

[165]  Uzi Vishkin,et al.  Implementation of Simultaneous Memory Address Access in Models That Forbid It , 1983, J. Algorithms.

[166]  E. Szemerédi,et al.  Sorting inc logn parallel steps , 1983 .

[167]  Donald B. Johnson,et al.  Parallel algorithms for minimum cuts and maximum flows in planar networks , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[168]  John Staples,et al.  The Maximum Flow Problem is Log Space Complete for P , 1982, Theor. Comput. Sci..

[169]  Leslie M. Goldschlager,et al.  A universal interconnection pattern for parallel computers , 1982, JACM.

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

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

[172]  Ludek Kucera,et al.  Parallel Computation and Conflicts in Memory Access , 1982, Information Processing Letters.

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

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

[175]  Joseph JáJá,et al.  Fast, Efficient Parallel Algorithms for Some Graph Problems , 1981, SIAM J. Comput..

[176]  Michael Sipser,et al.  Parity, circuits, and the polynomial-time hierarchy , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[177]  Uzi Vishkin,et al.  Finding the maximum, merging and sorting in a parallel computation model , 1981, CONPAR.

[178]  Leslie G. Valiant,et al.  A fast parallel algorithm for routing in permutation networks , 1981, IEEE Transactions on Computers.

[179]  Oscar H. Ibarra,et al.  A Note on the Parallel Complexity of Computing the Rank of Order n Matrices , 1980, Inf. Process. Lett..

[180]  Stephen A. Cook,et al.  Hardware complexity and parallel computation , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[181]  Walter L. Ruzzo,et al.  Tree-size bounded alternation(Extended Abstract) , 1979, J. Comput. Syst. Sci..

[182]  M. Fischer,et al.  Parallel Prefix Computation , 1980, J. ACM.

[183]  Jacob T. Schwartz,et al.  Fast Probabilistic Algorithms for Verification of Polynomial Identities , 1980, J. ACM.

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

[185]  Walter L. Ruzzo,et al.  On uniform circuit complexity , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[186]  Nicholas Pippenger,et al.  On simultaneous resource bounds , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

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

[188]  Richard J. Lipton,et al.  Linear Programming is Log-Space Hard for P , 1979, Inf. Process. Lett..

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

[190]  Walter J. Savitch,et al.  Time Bounded Random Access Machines with Parallel Processing , 1979, JACM.

[191]  Leslie M. Goldschlager,et al.  A unified approach to models of synchronous parallel machines , 1978, STOC.

[192]  Steven Fortune,et al.  Parallelism in random access machines , 1978, STOC.

[193]  Franco P. Preparata,et al.  An Improved Parallel Processor Bound in Fast Matrix Inversion , 1978, Inf. Process. Lett..

[194]  Allan Borodin,et al.  On Relating Time and Space to Size and Depth , 1977, SIAM J. Comput..

[195]  L. Goldschlager.  The monotone and planar circuit value problems are log space complete for P , 1977, SIGA.

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

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

[198]  Leslie G. Valiant,et al.  Parallelism in Comparison Problems , 1975, SIAM J. Comput..

[199]  R. Ladner.  The circuit value problem is log space complete for P , 1975, SIGA.

[200]  Neil D. Jones,et al.  Complete problems for deterministic polynomial time , 1974, STOC '74.

[201]  Larry J. Stockmeyer,et al.  A characterization of the power of vector machines , 1974, STOC '74.

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

[203]  Stephen A. Cook,et al.  An observation on time-storage trade off , 1973, J. Comput. Syst. Sci..

[204]  Stephen A. Cook,et al.  Time Bounded Random Access Machines , 1973, J. Comput. Syst. Sci..

[205]  Kenneth E. Batcher,et al.  Sorting networks and their applications , 1968, AFIPS Spring Joint Computing Conference.

[206]  Daniel H. Younger,et al.  Recognition and Parsing of Context-Free Languages in Time n^3 , 1967, Inf. Control..

[207]  Christopher S. Wallace,et al.  A Suggestion for a Fast Multiplier , 1964, IEEE Trans. Electron. Comput..

[208]  W. T. Tutte.  How to Draw a Graph , 1963 .

[209]  Yuri Petrovich Ofman,et al.  On the Algorithmic Complexity of Discrete Functions , 1962 .

[210]  Nicholas Pippenger.  Communication Networks , 1932, Nature.

[211]  H. Whitney.  Non-Separable and Planar Graphs. , 1931, Proceedings of the National Academy of Sciences of the United States of America.