Models of computation - exploring the power of computing

From the Publisher: Your book fills the gap which all of us felt existed too long. Congratulations on this excellent contribution to our field." --Jan van Leeuwen, Utrecht University "This is an impressive book. The subject has been thoroughly researched and carefully presented. All the machine models central to the modern theory of computation are covered in depth; many for the first time in textbook form. Readers will learn a great deal from the wealth of interesting material presented." --Andrew C. Yao, Professor of Computer Science, Princeton University "Models of Computation" is an excellent new book that thoroughly covers the theory of computation including significant recent material and presents it all with insightful new approaches. This long-awaited book will serve as a milestone for the theory community." --Akira Maruoka, Professor of Information Sciences, Tohoku University "This is computer science." --Elliot Winard, Student, Brown University In Models of Computation: Exploring the Power of Computing, John Savage re-examines theoretical computer science, offering a fresh approach that gives priority to resource tradeoffs and complexity classifications over the structure of machines and their relationships to languages. This viewpoint reflects a pedagogy motivated by the growing importance of computational models that are more realistic than the abstract ones studied in the 1950s, '60s and early '70s. Assuming onlysome background in computer organization, Models of Computation uses circuits to simulate machines with memory, thereby making possible an early discussion of P-complete and NP-complete problems. Circuits are also used to demonstrate that tradeoffs between parameters of computation, such as space and time, regulate all computations by machines with memory. Full coverage of formal languages and automata is included along with a substantive treatment of computability. Topics such as space-time tradeoffs, memory hierarchies, parallel computation, and circuit complexity, are integrated throughout the text with an emphasis on finite problems and concrete computational models FEATURES: Includes introductory material for a first course on theoretical computer science. Builds on computer organization to provide an early introduction to P-complete and NP-complete problems. Includes a concise, modern presentation of regular, context-free and phrase-structure grammars, parsing, finite automata, pushdown automata, and computability. Includes an extensive, modern coverage of complexity classes. Provides an introduction to the advanced topics of space-time tradeoffs, memory hierarchies, parallel computation, the VLSI model, and circuit complexity, with parallelism integrated throughout. Contains over 200 figures and over 400 exercises along with an extensive bibliography. ** Instructor's materials are available from your sales rep. If you do not know your local sales representative, please call 1-800-552-2499 for assistance, or use the Addison Wesley Longman rep-locator at ...

[1]  S. Kleene.  General recursive functions of natural numbers , 1936 .

[2]  A. Turing.  On Computable Numbers, with an Application to the Entscheidungsproblem. , 1937 .

[3]  Claude E. Shannon,et al.  A symbolic analysis of relay and switching circuits , 1938, Transactions of the American Institute of Electrical Engineers.

[4]  Claude E. Shannon,et al.  The Number of Two‐Terminal Series‐Parallel Networks , 1942 .

[5]  Claude E. Shannon,et al.  The synthesis of two-terminal switching circuits , 1949, Bell Syst. Tech. J..

[6]  H. Rice.  Classes of recursively enumerable sets and their decision problems , 1953 .

[7]  E. Gilbert.  Lattice Theoretic Properties of Frontal Switching Functions , 1954 .

[8]  George H. Mealy,et al.  A method for synthesizing sequential circuits , 1955 .

[9]  David E. Muller,et al.  Complexity in Electronic Switching Circuits , 1956, IRE Trans. Electron. Comput..

[10]  Edward F. Moore,et al.  Gedanken-Experiments on Sequential Machines , 1956 .

[11]  George A. Miller,et al.  Finite State Languages , 1958, Inf. Control..

[12]  A. Nerode,et al.  Linear automaton transformations , 1958 .

[13]  Noam Chomsky,et al.  On Certain Formal Properties of Grammars , 1959, Inf. Control..

[14]  Dana S. Scott,et al.  Finite Automata and Their Decision Problems , 1959, IBM J. Res. Dev..

[15]  Robert McNaughton,et al.  Regular Expressions and State Graphs for Automata , 1960, IRE Trans. Electron. Comput..

[16]  Anthony G. Oettinger,et al.  Automatic syntactic analysis and the pushdown store , 1961 .

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

[18]  Kenneth E. Iverson,et al.  A programming language , 1899, AIEE-IRE '62 (Spring).

[19]  Peter S. Landweber,et al.  Three Theorems on Phrase Structure Grammars of Type 1 , 1963, Inf. Control..

[20]  John C. Shepherdson,et al.  Computability of Recursive Functions , 1963, JACM.

[21]  R. James Evey,et al.  Application of pushdown-store machines , 1899, AFIPS '63 (Fall).

[22]  Anatolij A. Karatsuba,et al.  Multiplication of Multidigit Numbers on Automata , 1963 .

[23]  S.-Y. Kuroda,et al.  Classes of Languages and Linear-Bounded Automata , 1964, Inf. Control..

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

[25]  R. E. Krichevskii,et al.  Complexity of Contact Circuits Realizing a Function of Logical Algebra , 1964 .

[26]  J. Tukey,et al.  An algorithm for the machine calculation of complex Fourier series , 1965 .

[27]  J. Hartmanis,et al.  On the Computational Complexity of Algorithms , 1965 .

[28]  Richard Edwin Stearns,et al.  Hierarchies of memory limited computations , 1965, SWCT.

[29]  Michael J. Flynn,et al.  Very high-speed computing systems , 1966 .

[30]  Alan Cobham,et al.  The Recognition Problem for the Set of Perfect Squares , 1966, SWAT.

[31]  Laszlo A. Belady,et al.  A Study of Replacement Algorithms for Virtual-Storage Computer , 1966, IBM Syst. J..

[32]  Manuel Blum,et al.  A Machine-Independent Theory of the Complexity of Recursive Functions , 1967, JACM.

[33]  G. Amdhal,et al.  Validity of the single processor approach to achieving large scale computing capabilities , 1967, AFIPS '67 (Spring).

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

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

[36]  E. Specker,et al.  Lengths of Formulas and Elimination of Quantifiers I , 1968 .

[37]  David A. Patterson,et al.  Computer Architecture: A Quantitative Approach , 1969 .

[38]  V. Strassen.  Gaussian elimination is not optimal , 1969 .

[39]  Richard Brent.  On the Addition of Binary Numbers , 1970, IEEE Transactions on Computers.

[40]  Walter J. Savitch,et al.  Relationships Between Nondeterministic and Deterministic Tape Complexities , 1970, J. Comput. Syst. Sci..

[41]  S. Winograd.  ON THE ALGEBRAIC COMPLEXITY OF FUNCTIONS , 1970 .

[42]  Carl Hewitt,et al.  Comparative Schematology , 1970 .

[43]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

[44]  John E. Savage,et al.  Combinational Complexity Measures as a Function of Fan-out , 1971 .

[45]  JOHN E. SAVAGE.  The complexity of decoders-II: Computational work and decoding time , 1971, IEEE Trans. Inf. Theory.

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

[47]  John E. Hopcroft,et al.  An n log n algorithm for minimizing states in a finite automaton , 1971 .

[48]  Manuel Blum,et al.  On Effective Procedures for Speeding Up Algorithms , 1971, JACM.

[49]  V. M. Khrapchenko.  Method of determining lower bounds for the complexity of P-schemes , 1971 .

[50]  Allan Borodin,et al.  Computational Complexity and the Existence of Complexity Gaps , 1972, JACM.

[51]  L. H. Harper,et al.  On the complexity of the marriage problem , 1972 .

[52]  Stephen A. Cook,et al.  Time-bounded random access machines , 1972, J. Comput. Syst. Sci..

[53]  John E. Savage,et al.  Computational Work and Time on Finite Machines , 1972, JACM.

[54]  David C. Van Voorhis.  An Improved Lower Bound for Sorting Networks , 1972, IEEE Transactions on Computers.

[55]  Ashok K. Chandra.  Efficient Compilation of Linear Recursive Programs , 1973, SWAT.

[56]  N. P. Red’kin.  Proof of Minimality of Circuits Consisting of Functional Elements , 1973 .

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

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

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

[60]  E. A. Lamagna,et al.  Combinational Complexity of Some Monotone Functions , 1974, SWAT.

[61]  Stephen A. Cook,et al.  Storage requirements for deterministic / polynomial time recognizable languages , 1974, STOC '74.

[62]  Vaughan R. Pratt,et al.  The power of negative thinking in multiplying Boolean matrices , 1974, STOC '74.

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

[64]  Vaughan R. Pratt,et al.  Every Prime has a Succinct Certificate , 1975, SIAM J. Comput..

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

[66]  Michael J. Fischer.  Hauptvortrag: The complexity of negation-limited networks - A brief survey , 1975, Automata Theory and Formal Languages.

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

[68]  Brian Randell,et al.  The origins of digital computers: Selected papers , 1975 .

[69]  Leslie G. Valiant,et al.  General Context-Free Recognition in Less than Cubic Time , 1975, J. Comput. Syst. Sci..

[70]  Mike Paterson,et al.  Complexity of Monotone Networks for Boolean Matrix Product , 1974, Theor. Comput. Sci..

[71]  William F. McColl.  The Depth of Boolean Functions , 1976, ICALP.

[72]  David E. Muller,et al.  Efficient Parallel Evaluation of Boolean Expressions , 1976, IEEE Transactions on Computers.

[73]  Robert E. Tarjan,et al.  Space bounds for a game on graphs , 1976, STOC '76.

[74]  Donald E. Knuth,et al.  Big Omicron and big Omega and big Theta , 1976, SIGA.

[75]  Leslie G. Valiant,et al.  Graph-Theoretic Properties in computational Complexity , 1976, J. Comput. Syst. Sci..

[76]  M. Paterson.  An Introduction to Boolean Function Complexity. , 1976 .

[77]  Leslie G. Valiant,et al.  Circuit Size is Nonlinear in Depth , 1976, Theor. Comput. Sci..

[78]  Robert E. Tarjan,et al.  Applications of a planar separator theorem , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[79]  R. Tarjan,et al.  A Separator Theorem for Planar Graphs , 1977 .

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

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

[82]  Wolfgang J. Paul.  A 2.5 n-Lower Bound on the Combinational Complexity of Boolean Functions , 1977, SIAM J. Comput..

[83]  Leslie G. Valiant,et al.  On Time Versus Space , 1977, JACM.

[84]  Mike Paterson.  New bounds on formula size , 1977, Theoretical Computer Science.

[85]  Martin Tompa,et al.  Time-space tradeoffs for computing functions, using connectivity properties of their circuits , 1978, J. Comput. Syst. Sci..

[86]  Andrzej Lingas.  A PSPACE Complete Problem Related to a Pebble Game , 1978, ICALP.

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

[88]  Thomas J. Schaefer,et al.  The complexity of satisfiability problems , 1978, STOC.

[89]  John W. Backus,et al.  Can programming be liberated from the von Neumann style?: a functional style and its algebra of programs , 1978, CACM.

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

[91]  Rüdiger Reischuk.  Improved bounds on the problem of time-space trade-off in the pebble game , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).

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

[93]  Nicholas Pippenger.  A Time-Space Trade-Off , 1978, JACM.

[94]  Harold Abelson,et al.  Lower bounds on information transfer in distributed computations , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).

[95]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[96]  H. T. Kung,et al.  Systolic Arrays for (VLSI). , 1978 .

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

[98]  Robert E. Tarjan,et al.  The pebbling problem is complete in polynomial space , 1979, SIAM J. Comput..

[99]  John E. Savage,et al.  Space-Time Tradeoffs for Oblivious Interger Multiplications , 1979, ICALP.

[100]  John E. Savage,et al.  Space-time tradeoffs for linear recursion , 1979, POPL '79.

[101]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

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

[103]  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).

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

[105]  Edmund A. Lamagna,et al.  The Complexity of Monotone Networks for Certain Bilinear Forms, Routing Problems, Sorting, and Merging , 1979, IEEE Transactions on Computers.

[106]  Andrew Chi-Chih Yao,et al.  Some complexity questions related to distributive computing(Preliminary Report) , 1979, STOC.

[107]  Friedhelm Meyer auf der Heide.  A Comparison Between Two Variations of a Pebble Game on Graphs , 1979, ICALP.

[108]  Allan Borodin,et al.  A time-space tradeoff for sorting and related non-oblivious computations , 1979, SIGA.

[109]  Harold Abelson,et al.  A Note on Time-Space Tradeoffs for Computing Continuous Functions , 1979, Inf. Process. Lett..

[110]  Leslie G. Valiant,et al.  Completeness classes in algebra , 1979, STOC.

[111]  Michael J. Fischer,et al.  Relations Among Complexity Measures , 1979, JACM.

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

[113]  Jan van Leeuwen,et al.  Move Rules and Trade-Offs in the Pebble Game , 1979, Theoretical Computer Science.

[114]  C. Thomborson,et al.  Area-time complexity for VLSI , 1979, STOC.

[115]  M. Rem,et al.  Cost and performance of VLSI computing structures , 1979, IEEE Transactions on Electron Devices.

[116]  Stephen A. Cook,et al.  Deterministic CFL's are accepted simultaneously in polynomial time and log squared space , 1979, STOC.

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

[118]  Claus-Peter Schnorr.  A 3n-Lower Bound on the Network Complexity of Boolean Functions , 1980, Theor. Comput. Sci..

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

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

[121]  Richard J. Lipton,et al.  Some connections between nonuniform and uniform complexity classes , 1980, STOC '80.

[122]  Harold Abelson,et al.  Information transfer and area-time tradeoffs for VLSI multiplication , 1980, CACM.

[123]  Martin Tompa,et al.  Two familiar transitive closure algorithms which admit no polynomial time, sublinear space implementations , 1980, STOC '80.

[124]  Nicholas Pippenger,et al.  On Another Boolean Matrix , 1980, Theor. Comput. Sci..

[125]  H. T. Kung,et al.  Systolic (VLSI) arrays for relational database operations , 1980, SIGMOD '80.

[126]  Allan Borodin,et al.  A time-space tradeoff for sorting on a general sequential model of computation , 1980, STOC '80.

[127]  Robert B. Johnson,et al.  The Complexity of a VLSI Adder , 1980, Inf. Process. Lett..

[128]  D. Grigor'ev.  Application of separability and independence notions for proving lower bounds of circuit complexity , 1980 .

[129]  Joseph JáJá,et al.  Time-space tradeoffs for some algebraic problems , 1980, STOC '80.

[130]  Robert E. Tarjan,et al.  The Space Complexity of Pebble Games on Trees , 1980, Inf. Process. Lett..

[131]  B. Chazelle,et al.  A model of computation for VLSI with related complexity results , 1981, STOC '81.

[132]  Andrew Chi-Chih Yao,et al.  The entropic limitations on VLSI computations(Extended Abstract) , 1981, STOC '81.

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

[134]  H. T. Kung,et al.  I/O complexity: The red-blue pebble game , 1981, STOC '81.

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

[136]  J. Savage.  Planar Circuit Complexity and The Performance of VLSI Algorithms , 1981 .

[137]  H. T. Kung,et al.  A Two-Level Pipelined Systolic Array for Convolutions , 1981 .

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

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

[140]  Richard J. Lipton,et al.  Lower bounds for VLSI , 1981, STOC '81.

[141]  Philip L. Lehman.  A Systolic (VLSI) Array for Processing Simple Relational Queries , 1981 .

[142]  H. T. Kung,et al.  A Systolic 2-D Convolution Chip. , 1981 .

[143]  Gérard M. Baudet.  On the Area Required by VLSI Circuits , 1981 .

[144]  Alessandro Zorat,et al.  On relations between input and communication/computation in VLSI , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[145]  Alessandro Zorat,et al.  Replication of Inputs May Save Computational Resources in VLSI , 1981 .

[146]  Arnold L. Rosenberg.  Three-Dimensional Integrated Circuitry , 1981 .

[147]  Leslie G. Valiant,et al.  A complexity theory based on Boolean algebra , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[148]  M. Pracchi,et al.  A critique of network speed in VLSI models of computation , 1982, IEEE Journal of Solid-State Circuits.

[149]  Ingo Wegener,et al.  Boolean Functions whose Monotone Complexity is of Size n2/log n , 1981, Theoretical Computer Science.

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

[151]  Robert E. Tarjan,et al.  Asymptotically tight bounds on time-space trade-offs in a pebble game , 1982, JACM.

[152]  Michael J. Fischer,et al.  Omega(n log n) Lower Bounds on Length of Boolean Formulas , 1982, SIAM J. Comput..

[153]  John E. Savage,et al.  Extreme Time-Space Tradeoffs for Graphs with Small Space Requirements , 1982, Inf. Process. Lett..

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

[155]  János Komlós,et al.  Sorting in c log n parallel sets , 1983, Comb..

[156]  David A. Carlson,et al.  Time-Space Tradeoffs on Back-to-Back FFT Algorithms , 1983, IEEE Transactions on Computers.

[157]  Maria M. Klawe,et al.  A tight bound for black and white pebbles on the pyramid , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[158]  Thompson.  The VLSI Complexity of Sorting , 1983, IEEE Transactions on Computers.

[159]  Jay Earley,et al.  An efficient context-free parsing algorithm , 1970, Commun. ACM.

[160]  Pavel Pudlák.  Bounds for Hodes-Specker theorem , 1983, Logic and Machines.

[161]  Arnold L. Rosenberg,et al.  Three-Dimensional VLSI: a case study , 1983, JACM.

[162]  Jean Vuillemin,et al.  A Combinatorial Limit to the Computing Power of VLSI Circuits , 1983, IEEE Transactions on Computers.

[163]  Ingo Wegener,et al.  Relating Monotone Formula Size and Monotone Depth of Boolean Functions , 1983, Inf. Process. Lett..

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

[165]  Jürgen Weiss,et al.  An n^3/2 Lower Bound on the Monotone Network Complexity of the Boolean Convolution , 1984, Inf. Control..

[166]  Franco P. Preparata,et al.  A Mesh-Connected Area-Time Optimal VLSI Multiplier of Large Integers , 1983, IEEE Transactions on Computers.

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

[168]  Alfred V. Aho,et al.  On notions of information transfer in VLSI circuits , 1983, STOC.

[169]  John E. Savage,et al.  Size-Space Tradeoffs for Oblivious Computations , 1983, J. Comput. Syst. Sci..

[170]  Thomas Lengauer,et al.  Four results on the complexity of VLSI computations , 1983 .

[171]  Yaacov Yesha,et al.  Time-Space Tradeoffs for Matrix Multiplication and the Discrete Fourier Transform on any General Sequential Random-Access Computer , 1984, J. Comput. Syst. Sci..

[172]  Leslie G. Valiant,et al.  Short Monotone Formulae for the Majority Function , 1984, J. Algorithms.

[173]  Ingo Wegener,et al.  On the Complexity of Slice Functions , 1984, Theor. Comput. Sci..

[174]  John E. Savage.  The Performance of Multilective VLSI Algorithms , 1984, J. Comput. Syst. Sci..

[175]  Don H. Johnson,et al.  Gauss and the history of the fast Fourier transform , 1984, IEEE ASSP Magazine.

[176]  Boris A. Trakhtenbrot,et al.  A Survey of Russian Approaches to Perebor (Brute-Force Searches) Algorithms , 1984, Annals of the History of Computing.

[177]  Jürgen Tiekenheinrich.  A 4n-Lower Bound on the Monotone Network Complexity of a One-Output Boolean Function , 1984, Inf. Process. Lett..

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

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

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

[181]  J. Friedman.  Constructing O(n log n) Size Monotone Formulae for the k-th Elementary Symmetric Polynomial of n Boolean Variables , 1984, FOCS.

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

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

[184]  John E. Savage.  Space-Time Trade-Offs for Banded Matrix Problems , 1984, JACM.

[185]  Viktor K. Prasanna,et al.  Information Transfer in Distributed Computing with Applications to VLSI , 1984, JACM.

[186]  Norbert Blum.  A Boolean Function Requiring 3n Network Size , 1984, Theor. Comput. Sci..

[187]  Paul E. Dunne.  Techniques for the analysis of monotone Boolean networks , 1984 .

[188]  Carla D. Savage.  A Systolic Design for Connectivity Problems , 1984, IEEE Transactions on Computers.

[189]  Kurt Mehlhorn,et al.  AT2-optimal VLSI integer division and integer square rooting , 1984, Integr..

[190]  Robert E. Wilber.  White pebbles help , 1985, STOC '85.

[191]  William F. McColl,et al.  Planar Circuits Have Short Specifications , 1985, STACS.

[192]  Robert E. Tarjan,et al.  Amortized efficiency of list update and paging rules , 1985, CACM.

[193]  A. Yao.  Separating the polynomial-time hierarchy by oracles , 1985 .

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

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

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

[197]  H. T. Kung.  Memory requirements for balanced computer architectures , 1986, ISCA '86.

[198]  Paul E. Dunne,et al.  The Complexity of Central Slice Functions , 1986, Theor. Comput. Sci..

[199]  Karl R. Abrahamson.  Time-space tradeoffs for branching programs contrasted with those for straight-line programs , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[200]  W. Daniel Hillis,et al.  Data parallel algorithms , 1986, CACM.

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

[202]  William F. McColl,et al.  The Planar Realization of Boolean Functions , 1987, Inf. Process. Lett..

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

[204]  A. Razborov.  Lower bounds on the size of bounded depth circuits over a complete basis with logical addition , 1987 .

[205]  Peter H. Hochschild.  Multiple Cuts, Input Repetition, and VLSI Complexity , 1987, Inf. Process. Lett..

[206]  Franco P. Preparata,et al.  Size-time complexity of Boolean networks for prefix computations , 1987, STOC.

[207]  David A. Carlson.  Time-Space Efficient Algorithms for Computing Convolutions and Related Problems , 1987, Inf. Comput..

[208]  Noga Alon,et al.  The monotone circuit complexity of boolean functions , 1987, Comb..

[209]  F. P. Preparata,et al.  Area-Time Optimal Division for T=f2( (log n)' +')* , 1987 .

[210]  Allan Borodin,et al.  A Time-Space Tradeoff for Element Distinctness , 1987, SIAM J. Comput..

[211]  Abhiram G. Ranade,et al.  How to emulate shared memory , 1991, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

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

[213]  Alok Aggarwal,et al.  Hierarchical memory with block transfer , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[214]  Bowen Alpern,et al.  A model for hierarchical memory , 1987, STOC.

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

[216]  Paul E. Dunne,et al.  The Complexity of Boolean Networks , 1988 .

[217]  Éva Tardos,et al.  The gap between monotone and non-monotone circuit complexity is exponential , 1988, Comb..

[218]  David A. Carlson.  Upper and Lower Bounds on Time-Space Tradeoffs for Computations with Embedded Fast Fourier Transforms , 1988, SIAM J. Discret. Math..

[219]  Richard M. Karp,et al.  A Survey of Parallel Algorithms for Shared-Memory Machines , 1988 .

[220]  Eli Upfal,et al.  Parallel hashing: an efficient implementation of shared memory , 1988, JACM.

[221]  Sung-Mo Kang,et al.  Interconnection delay in very high-speed VLSI , 1988, Proceedings 1988 IEEE International Conference on Computer Design: VLSI.

[222]  Neil Immerman.  Nondeterministic Space is Closed Under Complementation , 1988, SIAM J. Comput..

[223]  Alok Aggarwal,et al.  The input/output complexity of sorting and related problems , 1988, CACM.

[224]  Avi Wigderson,et al.  Monotone circuits for connectivity require super-logarithmic depth , 1990, STOC '88.

[225]  György Turán.  Lower Bounds for Synchronous Circuits and Planar Circuits , 1989, Inf. Process. Lett..

[226]  Paul Beame,et al.  A general sequential time-space tradeoff for finding unique elements , 1989, STOC '89.

[227]  Alexander A. Razborov,et al.  On the method of approximations , 1989, STOC '89.

[228]  György Turán.  On Restricted Boolean Circuits , 1989, FCT.

[229]  Stephen R. Tate,et al.  Optimal size integer division circuits , 1989, STOC '89.

[230]  Mauricio Karchmer,et al.  Communication complexity - a new approach to circuit depth , 1989 .

[231]  C. Greg Plaxton,et al.  Deterministic sorting in nearly logarithmic time on the hypercube and related computers , 1990, STOC '90.

[232]  W S McCulloch,et al.  A logical calculus of the ideas immanent in nervous activity , 1990, The Philosophy of Artificial Intelligence.

[233]  Jeffrey Scott Vitter,et al.  Optimal disk I/O with parallel block transfer , 1990, STOC '90.

[234]  Ran Raz,et al.  Monotone circuits for matching require linear depth , 1990, STOC '90.

[235]  Bowen Alpern,et al.  Uniform memory hierarchies , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[236]  Karl R. Abrahamson.  A time-space tradeoff for Boolean matrix multiplication , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[237]  Leslie G. Valiant,et al.  A bridging model for parallel computation , 1990, CACM.

[238]  Guy E. Blelloch,et al.  Vector Models for Data-Parallel Computing , 1990 .

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

[240]  Thomas Lengauer,et al.  Combinatorial algorithms for integrated circuit layout , 1990, Applicable theory in computer science.

[241]  Uri Zwick,et al.  Faster circuits and shorter formulae for multiple addition, multiplication and symmetric Boolean functions , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[242]  David S. Johnson,et al.  A Catalog of Complexity Classes , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[243]  Thomas Lengauer.  VLSI Theory , 1990, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[244]  P. Boas.  Machine models and simulations , 1991 .

[245]  Jeffrey Scott Vitter,et al.  Large-scale sorting in parallel memories (extended abstract) , 1991, SPAA '91.

[246]  Karl R. Abrahamson.  Time-Space Tradeoffs for Algebraic Problems on General Sequential Machines , 1991, J. Comput. Syst. Sci..

[247]  Juraj Hromkovic.  Nonlinear Lower Bounds on the Number of Processors of Circuits with Sublinear Separators , 1991, Inf. Comput..

[248]  Zvi Galil,et al.  On the Power of Multiple Reads in a Chip , 1991, ICALP.

[249]  F. Leighton,et al.  Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes , 1991 .

[250]  Markus G. Wloka.  Parallel VLSI Synthesis , 1991 .

[251]  Johan Håstad,et al.  A Simple Lower Bound for Monotone Clique Using a Communication Game , 1992, Inf. Process. Lett..

[252]  Randal E. Bryant,et al.  Symbolic Boolean manipulation with ordered binary-decision diagrams , 1992, CSUR.

[253]  M. Paterson,et al.  Optimal carry save networks , 1992 .

[254]  P. Dunne.  Relationships between monotone and non-monotone network complexity , 1992 .

[255]  Christoph Meinel,et al.  Branching Programs Provide Lower Bounds on the Areas of Multilective Deterministic and Nondeterministic VLSI-Circuits , 1992, Inf. Comput..

[256]  田中 圭介,et al.  On the complexity of negation-limited Boolean networks , 1993 .

[257]  Elias Koutsoupias,et al.  Improvements on Khrapchenko's theorem , 1993, Theor. Comput. Sci..

[258]  Sanjeev Saxena,et al.  On Parallel Prefix Computation , 1994, Parallel Process. Lett..

[259]  V. Pan,et al.  Polynomial and Matrix Computations , 1994, Progress in Theoretical Computer Science.

[260]  Carl H. Smith,et al.  A Recursive Introduction to the Theory of Computation , 1994, Graduate Texts in Computer Science.

[261]  Andrew Chi-Chih Yao.  Near-Optimal Time-Space Tradeoff for Element Distinctness , 1994, SIAM J. Comput..

[262]  S. Axler.  Linear Algebra Done Right , 1995, Undergraduate Texts in Mathematics.

[263]  Tetsuro Nishino,et al.  More on the complexity of negation-limited circuits , 1995, STOC '95.

[264]  John E. Savage.  Extending the Hong-Kung Model to Memory Hierarchies , 1995, COCOON.

[265]  Franco P. Preparata,et al.  Horizons of Parallel Computation , 1992, J. Parallel Distributed Comput..

[266]  Ben H. H. Juurlink,et al.  A quantitative comparison of parallel computation models , 1996, SPAA '96.

[267]  Paul G. Spirakis,et al.  BSP vs LogP , 1996, SPAA '96.

[268]  Ramesh Subramonian,et al.  LogP: a practical model of parallel computation , 1996, CACM.

[269]  John R. Wicks.  Linear Algebra: An Interactive Laboratory Approach With Mathematica , 1996 .

[270]  Jean Berstel,et al.  Context-Free Languages and Pushdown Automata , 1997, Handbook of Formal Languages.

[271]  Saburo Muroga,et al.  Binary Decision Diagrams , 2000, The VLSI Handbook.

[272]  Theodore M. Booth.  Demonstrating hazards in sequential relay circuits , 1963, SWCT.