Volume 9,
Number 1,
February 1980
- Alan C. Tucker:
An Efficient Test for Circular-Arc Graphs.
1-24
- Stephen L. Bloom, Calvin C. Elgot, Jesse B. Wright:
Solutions of the Iteration Equation and Extensions of the Scalar Iteration Operation.
25-45
- Chandra M. R. Kintala, Patrick C. Fischer:
Refining Nondeterminism in Relativized Polynomial-Time Bounded Computations.
46-53
- Richard P. Brent, J. F. Traub:
On the Complexity of Composition and Generalized Composition of Power Series.
54-66
- Matthew Hennessy:
The Semantics of Call-By-Value and Call-By-Name in a Nondeterministic Environment.
67-84
- Paul K. Stockmeyer, F. Frances Yao:
On the Optimality of Linear Merge.
85-90
- Yookun Cho, Sartaj Sahni:
Bounds for List Schedules on Uniform Processors.
91-103
- Richard Statman:
Worst Case Exponential Lower Bounds for Input Resolution with Paramodulation.
104-110
- C. K. Wong, Malcolm C. Easton:
An Efficient Method for Weighted Sampling Without Replacement.
111-113
- Juris Hartmanis:
On the Succinctness of Different Representations of Languages.
114-120
- David P. Dobkin, Richard J. Lipton:
Addition Chain Methods for the Evaluation of Specific Polynomials.
121-125
- Daniel S. Hirschberg:
On the Complexity of Searching a Set of Vectors.
126-129
- J. T. Joichi, Dennis E. White, S. G. Williamson:
Combinatorial Gray codes.
130-141
- Philippe Flajolet, Lyle Ramshaw:
A Note on Gray Code and Odd-Even Merge.
142-158
- Barry K. Rosen:
Monoids for Rapid Data Flow Analysis.
159-196
- Zvi Galil:
Finding the Vertex Connectivity of Graphs.
197-199
- D. T. Lee, C. K. Wong:
Voronoi Diagrams in L_1 (L_infty) Metrics with 2-Dimensional Storage Applications.
200-211
- László Babai:
On the Complexity of Canonical Labeling of Strongly Regular Graphs.
212-216
- Eric C. R. Hehner, R. Nigel Horspool:
Corrigendum: A New Representation of the Rational Numbers for Fast Easy Arithmetic.
217 ,
->SIAM J. Comput. 8(2):
124-134 (1979)
Volume 9,
Number 2,
May 1980
Volume 9,
Number 3,
August 1980
- Hartmut Ehrig, Barry K. Rosen:
The Mathematics of Record Handling.
441-469
- Douglas Stott Parker Jr.:
Conditions for Optimality of the Huffman Algorithm.
470-489 ,
Erratum: SIAM J. Cumput. 27 (1): 317 (1998)
- Arnold Schönhage:
Storage Modification Machines.
490-508
- Wojciech Rytter:
A Correct Preprocessing Algorithm for Boyer-Moore String-Searching.
509-512
- John R. Gilbert, Thomas Lengauer, Robert Endre Tarjan:
The Pebbling Problem is Complete in Polynomial Space.
513-524
- Stephen L. Bloom, Calvin C. Elgot, Jesse B. Wright:
Vector Iteration in Pointed Iterative Theories.
525-540
- Jeffrey M. Jaffe:
Bounds on the Scheduling of Typed Task Systems.
541-551
- Bruce W. Weide:
Random Graphs and Graph Optimization Problems.
552-557
- Eugene L. Lawler, Jan Karel Lenstra, A. H. G. Rinnooy Kan:
Generating all Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms.
558-565
- Andrew Chi-Chih Yao:
Bounds on Selection Networks.
566-582
- Alan George, Joseph W. H. Liu:
An Optimal Algorithm for Symbolic Factorization of Symmetric Matrices.
583-593
- Mark R. Brown, Robert Endre Tarjan:
Design and Analysis of a Data Structure for Representing Sorted Lists.
594-614
- Richard J. Lipton, Robert Endre Tarjan:
Applications of a Planar Separator Theorem.
615-627
- László Babai, Paul Erdös, Stanley M. Selkow:
Random Graph Isomorphism.
628-635
- Stephen A. Cook, Charles Rackoff:
Space Lower Bounds for Maze Threadability on Restricted Machines.
636-652
- Kuo-Chung Tai:
Predictors of Context-Free Grammars.
653-664
Volume 9,
Number 4,
November 1980
- Krzysztof R. Apt, Lambert G. L. T. Meertens:
Completeness with Finite Systems of Intermediate Assertions for Recursive Program Schemes.
665-671
- Leonidas J. Guibas, Andrew M. Odlyzko:
A New Proof of the Linearity of the Boyer-Moore String Searching Algorithm.
672-682
- Stephen L. Bloom, Ralph Tindell:
Compatible Orderings on the Metric Theory of Trees.
683-691
- Dario Bini, Grazia Lotti, Francesco Romani:
Approximate Solutions for the Bilinear Form Computational Problem.
692-697
- David A. Plaisted:
The Application of Multivariate Polynomials to Inference Rules and Partial Tests for Unsatisfiability.
698-705
- Terry Beyer, Sandra Mitchell Hedetniemi:
Constant Time Generation of Rooted Trees.
706-712
- Joseph JáJá:
On the Complexity of Bilinear Forms with Commutativity.
713-728
- Ronald V. Book, Franz-Josef Brandenburg:
Equality Sets and Complexity Classes.
729-743
- David Nassimi, Sartaj Sahni:
Finding Connected Components and Connected Ones on a Mesh-Connected Parallel Computer.
744-757
- Gadiel Seroussi, Abraham Lempel:
Factorization of Symmetric Matrices and Trace-Orthogonal Bases in Finite Fields.
758-767
- Jerome A. Feldman, Anil Nigam:
A Model and Proof Technique for Message-Based Systems.
768-784
- Mila E. Majster-Cederbaum, Angelika Reiser:
Efficient On-Line Construction and Correction of Position Trees.
785-807
- Edward G. Coffman Jr., M. R. Garey, David S. Johnson, Robert Endre Tarjan:
Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms.
808-826
- Bengt Aspvall, Yossi Shiloach:
A Polynomial Time Algorithm for Solving Systems of Linear Inequalities with Two Variables per Inequality.
827-845
- Brenda S. Baker, Edward G. Coffman Jr., Ronald L. Rivest:
Orthogonal Packings in Two Dimensions.
846-855
Copyright © Fri Nov 27 19:56:49 2009
by Michael Ley (ley@uni-trier.de)
