JCSS, Volume 9

Volume 9, Number 1, August 1974

Arthur Gill, Lawrence T. Kou:
Multiple-Entry Finite Automata. 1-19
Gerald G. L. Meyer:
Algorithm Model for Penalty Functions-Type Iterative Procedures. 20-30
Akira Maruoka, Masayuki Kimura:
Completeness Problem of One-Dimensional Binary Scope-3 Tessellation Automata. 31-47
Eugene M. Norris:
Difunctionally Induced State Machines. 48-55
Kai Hwang:
Cyclic Decomposition of Finite Stochastic Systems. 56-68
Edward L. Robertson:
Complexity Classes of Partial Recursive Functions. 69-87
Seymour Ginsburg, Edwin H. Spanier:
On Incomparable Abstract Family of Languages (AFL). 88-108
Lee E. Heindel:
Congruence Arithmetic Algorithms for Polynomial Real Zero Determination. 109-128

Yves Rouchaleau, Bostwick F. Wyman:
Linear Dynamical Systems over Integral Domains. 129-142
Nancy A. Lynch:
Approximations to the Halting Problem. 143-150
Robert P. Daley:
The Extent and Density of Sequences within the Minimal-Program Complexity Hierarchies. 151-163
S. Rao Kosaraju:
1-Way Stack Automaton with Jumps. 164-176
Takumi Kasai:
Translatability of Flowcharts into While Programs. 177-195
Peter Elias:
Minimum Times and Memories Needed to Compute the Values of a Function. 196-212
Ronald V. Book:
Comparing Complexity Classes. 213-229

S. Rao Kosaraju:
Analysis of Structured Programs. 232-255
David S. Johnson:
Approximation Algorithms for Combinatorial Problems. 256-278
Philip M. Lewis II, Daniel J. Rosenkrantz, Richard Edwin Stearns:
Attributed Translations. 279-307
Stephen A. Cook:
An Observation on Time-Storage Trade Off. 308-316
Michael J. Fischer, Larry J. Stockmeyer:
Fast On-Line Integer Multiplication. 317-331
Jean Vuillemin:
Correct and Optimal Implementations of Recursion in a Simple Programming Language. 332-354
Robert Endre Tarjan:
Testing Flow Graph Reducibility. 355-365

Last update Tue Feb 14 04:20:22 2012 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page