default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSIAM Journal on Computing, Volume 7
Volume 7, Number 1, February 1978
- Edward G. Coffman Jr., M. R. Garey, David S. Johnson:
An Application of Bin-Packing to Multiprocessor Scheduling. 1-17 - Robert Michael Tanner:
Minimean Merging and Sorting: An Algorithm. 18-38 - Michael Machtey, Karl Winklmann, Paul Young:
Simple Gödel Numberings, Isomorphisms, and Programming Properties. 39-60 - Richard J. Lipton:
Polynomials with 0-1 Coefficients that Are Hard to Evaluate. 61-69 - Stephen A. Cook:
Soundness and Completeness of an Axiom System for Program Verification. 70-90 - Robert L. Probert:
An Extension of Computational Duality to Sequences of Bilinear Computations. 91-98 - Harry B. Hunt III, Daniel J. Rosenkrantz:
Computational Parallels Between the Regular and Context-Free Languages. 99-114 - Joachim Biskup:
The Time Measure of One-Tape Turing Machines Does Not Have the Parallel Computation Property. 115-117 - Robert Solovay, Volker Strassen:
Erratum: A Fast Monte-Carlo Test for Primality. 118
Volume 7, Number 2, May 1978
- Nancy A. Lynch, Richard J. Lipton:
On Structure Preserving Reductions. 119-126 - Claus-Peter Schnorr:
An Algorithm for Transitive Closure with Linear Expected Time. 127-133 - Michael L. Fredman:
Observations on the Complexity of Generating Quasi-Gray Codes. 134-146 - Donald B. Johnson, Tetsuo Mizoguchi:
Selecting the Kth element in X + Y and X_1 + X_2 + ... + X_m. 147-153 - Nimrod Megiddo, Arie Tamir:
An O(N log N) Algorithm for a Class of Matching Problems. 154-157 - Hermann A. Maurer, Arto Salomaa, Derick Wood:
On Good E0L Forms. 158-166 - Ronald V. Book, Maurice Nivat:
Linear Languages and the Intersection Closures of Classes of Languages. 167-177 - Greg N. Frederickson, Matthew S. Hecht, Chul E. Kim:
Approximation Algorithms for Some Routing Problems. 178-193 - Celia Wrathall:
Rudimentary Predicates and Relative Computation. 194-209 - Alan G. Konheim, Martin Reiser:
Finite Capacity Queuing Systems with Applications in Computer Modeling. 210-229 - Eshrat Reghbati, Derek G. Corneil:
Parallel Computations in Graph Theory. 230-237 - Roger W. Brockett, David P. Dobkin:
Errata: On the Number of Multiplications Required for Matrix Multiplication. 238
Volume 7, Number 3, August 1978
- Robert Sedgewick:
Data Movement in Odd-Even Merging. 239-272 - Kellogg S. Booth:
Isomorphism Testing for Graphs, Semigroups, and Finite Automata Are Polynomially Equivalent Problems. 273-279 - Harold N. Gabow, Eugene W. Myers:
Finding All Spanning Trees of Directed and Undirected Graphs. 280-287 - Ronald Fagin, Thomas G. Price:
Efficient Calculation of Expected Miss Ratios in the Independent Reference Model. 288-297 - Mark R. Brown:
Implementation and Analysis of Binomial Queue Algorithms. 298-319 - E. Mark Gold:
Deadlock Prediction: Easy and Difficult Cases. 320-336 - Christopher P. Wadsworth:
Approximate Reduction and Lambda Calculus Models. 337-356 - Robert A. Wagner, Joel I. Seiferas:
Correcting Counter-Automaton-Recognizable Languages. 357-375 - Brenda S. Baker:
Generalized Syntax Directed Translation, Tree Transducers, and Linear Space. 376-391
Volume 7, Number 4, November 1978
- John L. Bruno, Peter J. Downey:
Complexity of Task Sequencing with Deadlines, Set-Up Times and Changeover Costs. 393-404 - Daniel J. Rosenkrantz, Harry B. Hunt III:
Polynomial Algorithms for Deterministic Pushdown Automata. 405-412 - Alon Itai, Michael Rodeh:
Finding a Minimum Circuit in a Graph. 413-423 - Frank Ruskey:
Generating t-ary Trees Lexicographically. 424-439 - Alan L. Selman:
Polynomial Time Enumeration Reducibility. 440-457 - David A. Plaisted:
Some Polynomial and Integer Divisibility problems are NP-Hard. 458-464 - Arnold L. Rosenberg, Lawrence Snyder:
Minimal-Comparison 2, 3-Trees. 465-480 - Paul Walton Purdom Jr.:
Tree Size by Partial Backtracking. 481-491 - Anthony E. Trojanowski:
Ranking and Listing Algorithms for k-ary Trees. 492-509 - Nicholas Pippenger:
Generalized Connectors. 510-514 - Andrew Chi-Chih Yao:
On the Loop Switching Addressing Problem. 515-523 - Oscar H. Ibarra:
The Unsolvability of the Equivalence Problem for epsilon-Free NGSM's with Unary Input (Output) Alphabet and Applications. 524-532 - Theodore P. Baker:
A Technique for Extending Rapid Exact-Match String Matching to Arrays of More Than One Dimension. 533-541
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2026-07-17 01:04 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
