SIAM Journal on Computing
, Volume 3
Volume 3, Number 1, March 1974
George E. Collins
: The Computing Time of the Euclidean Algorithm. 1-10
BibTeX
Richard R. Muntz
,
Holger Opderbeck
: Stack Replacement Algorithms for Two-Level Directly Addressable Paged Memories. 11-22
BibTeX
R. E. Osteen
,
P. P. Lin
: Picture Skeletons Based on Eccentricities of Points of Minimum Spanning Trees. 23-41
BibTeX
Jay P. Fillmore
,
S. G. Williamson
: On Backtracking: A Combinatorial Description of the Algorithm. 42-55
BibTeX
Jean Francois Pacault
: Computing the Weak Components of a Directed Graph. 56-61
BibTeX
Robert Endre Tarjan
: Finding Dominators in Directed Graphs. 62-89
BibTeX
Curtis R. Cook
: Order Graph Grammars. 90-99
BibTeX
Volume 3, Number 2, June 1974
M. R. Garey
: Optimal Binary Search Trees with Restricted Maximal Depth. 101-110
BibTeX
Sheila A. Greibach
: Jump PDA's and Hierarchies of Deterministic Context-Free Languages. 111-127
BibTeX
Volker Strassen
: Polynomials with Rational Coefficients Which Are Hard to Compute. 128-149
BibTeX
John E. Savage
: An Algorithm for the Computation of Linear Forms. 150-158
BibTeX
Volume 3, Number 3, September 1974
Y. S. Chua
,
Arthur J. Bernstein
: Analysis of a Feedback Scheduler. 159-176
BibTeX
David M. Perlman
: Isomorph Rejection on Power Sets. 177-183
BibTeX
Oscar H. Ibarra
: A Hierarchy Theorem for Polynomial-Space Recognition. 184-187
BibTeX
T. C. Hu
: Optimum Communication Spanning Trees. 188-195
BibTeX
Richard J. Fateman
: Polynomial Multiplication, Powers and Asymptotic Analysis: Some Comments. 196-213
BibTeX
S. E. Goodman
,
Stephen T. Hedetniemi
: On Hamiltonian Walks in Graphs. 214-221
BibTeX
J. M. Adams
,
J. M. Phelan
,
Richard H. Stark
: A Note on the Hecht-Ullman Characterization of Nonreducible Flow Graphs. 222-223
BibTeX
Susan L. Graham
: On Bounded Right Context Languages and Grammars. 224-254
BibTeX
Volume 3, Number 4, December 1974
M. Douglas McIlroy
: The Number of 1's in Binary Integers: Bounds and Extremal Properties. 255-261
BibTeX
Sartaj Sahni
: Computationally Related Problems. 262-279
BibTeX
Daniel J. Kleitman
: A Note on Perfect Elimination Digraphs. 280-282
BibTeX
Ronald V. Book
,
Maurice Nivat
,
Mike Paterson
: Reversal-Bounded Acceptors and Intersections of Linear Languages. 283-295
BibTeX
Sukhamay Kundu
: Existence of Graphs with Three Spanning Trees and Given Degree Sequence. 296-298
BibTeX
David S. Johnson
,
Alan J. Demers
,
Jeffrey D. Ullman
,
M. R. Garey
,
Ronald L. Graham
: Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms. 299-325
BibTeX
John H. Holland
: Erratum: Genetic Algorithms and the Optimal Allocation of Trials. 326
BibTeX
, ->
SIAM J. Comput. 2(2)
: 88-105(1973)
BibTeX
Copyright ©
Sun May 17 00:18:49 2009 by
Michael Ley
(
ley@uni-trier.de
)