default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSIAM Journal on Computing, Volume 3
Volume 3, Number 1, March 1974
- George E. Collins:
The Computing Time of the Euclidean Algorithm. 1-10 - Richard R. Muntz, Holger Opderbeck:
Stack Replacement Algorithms for Two-Level Directly Addressable Paged Memories. 11-22 - Robert E. Osteen, P. P. Lin:
Picture Skeletons Based on Eccentricities of Points of Minimum Spanning Trees. 23-40 - Jay P. Fillmore, S. G. Williamson:
On Backtracking: A Combinatorial Description of the Algorithm. 41-55 - Jean Francois Pacault:
Computing the Weak Components of a Directed Graph. 56-61 - Robert Endre Tarjan:
Finding Dominators in Directed Graphs. 62-89 - Curtis R. Cook:
First Order Graph Grammars. 90-99
Volume 3, Number 2, June 1974
- M. R. Garey:
Optimal Binary Search Trees with Restricted Maximal Depth. 101-110 - Sheila A. Greibach:
Jump PDA's and Hierarchies of Deterministic Context-Free Languages. 111-127 - Volker Strassen:
Polynomials with Rational Coefficients Which are Hard to Compute. 128-149 - John E. Savage:
An Algorithm for the Computation of Linear Forms. 150-158
Volume 3, Number 3, September 1974
- Yap Siong Chua, Arthur J. Bernstein:
Analysis of a Feedback Scheduler. 159-176 - David M. Perlman:
Isomorph Rejection on Power Sets. 177-183 - Oscar H. Ibarra:
A Hierarchy Theorem for Polynomial-Space Recognition. 184-187 - T. C. Hu:
Optimum Communication Spanning Trees. 188-195 - Richard J. Fateman:
Polynomial Multiplication, Powers and Asymptotic Analysis: Some Comments. 196-213 - Seymour E. Goodman, Stephen T. Hedetniemi:
On Hamiltonian Walks in Graphs. 214-221 - J. M. Adams, J. M. Phelan, Richard H. Stark:
A Note on the Hecht-Ullman Characterization of Nonreducible Flow Graphs. 222-223 - Susan L. Graham:
On Bounded Right Context Languages and Grammars. 224-254
Volume 3, Number 4, December 1974
- M. Douglas McIlroy:
The Number of 1's in Binary Integers: Bounds and Extremal Properties. 255-261 - Sartaj Sahni:
Computationally Related Problems. 262-279 - Daniel J. Kleitman:
A Note on Perfect Elimination Digraphs. 280-282 - Ronald V. Book, Maurice Nivat, Mike Paterson:
Reversal-Bounded Acceptors and Intersections of Linear Languages. 283-295 - Sukhamay Kundu:
Existence of Graphs with Three Spanning Trees and Given Degree Sequence. 296-298 - 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 - John H. Holland:
Erratum: Genetic Algorithms and the Optimal Allocation of Trials. 326
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 2024-11-04 20:45 CET 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 and maintained by:
the dblp computer science bibliography is funded and supported by:
