SIAM Journal on Computing, Volume 4

Volume 4, Number 1, March 1975

• Juris Hartmanis, Theodore P. Baker:
  On Simple Gödel Numberings and Translations. 1-11
  
• Dennis P. Geller:
  Realization with Feedback Encoding. I: Analogues of the Classical Theory. 12-33
  
• Dennis P. Geller:
  Realization with Feedback Encoding. II: Applications to Distinguishing Sequences. 34-48
  
• Robert Mandl, Thomas Vari:
  Computational Complexity of Inner Products of Vectors (And That of Other Bilinear Forms) over a Noncommutative Ring (Auxiliary Functions Allowed). 49-55
  
• Kapali P. Eswaran:
  Faithful Representation of a Family of Sets by a Set of Intervals. 56-68
  
• Jeanne Ferrante, Charles Rackoff:
  A Decision Procedure for the First Order Theory of Real Addition with Order. 69-76
  
• Donald B. Johnson:
  Finding All the Elementary Circuits of a Directed Graph. 77-84
  
• Eugene S. Santos:
  State-Splitting for Stochastic Machines. 85-96
  

Volume 4, Number 2, June 1975

• Webb Miller:
  Computational Complexity and Numerical Stability. 97-107
  
• Stephen S. Lavenberg, Gerald S. Shedler:
  Derivation of Confidence Intervals for Work Rate Estimators in a Closed Queuing Network. 108-124
  
• Edward A. Ashcroft, Zohar Manna:
  Translating Program Schemas to While-Schemas. 125-146
  
• David J. Kuck, K. Maruyama:
  Time Bounds on the Parallel Evaluation of Arithmetic Expressions. 147-162
  
• Andrew D. Hall Jr.:
  Solving a Problem in Eigenvalue Approximation with a Symbolic Algebra System. 163-174
  
• Abraham Lempel:
  Matrix Factorization Over GF(2) and Trace-Orthogonal Bases of GF(2ⁿ). 175-186
  
• M. R. Garey, Ronald L. Graham:
  Bounds for Multiprocessor Scheduling with Resource Constraints. 187-200
  
• Ellis Horowitz, Sartaj Sahni:
  The Computation of Powers of Symbolic Polynomials. 201-208
  

Volume 4, Number 3, September 1975

• Dennis E. White, S. G. Williamson:
  Computational Algorithms for the Enumeration of Group Invariant Partitions. 209-213
  
• Vaughan R. Pratt:
  Every Prime has a Succinct Certificate. 214-220
  
• F. Hadlock:
  Finding a Maximum Cut of a Planar Graph in Polynomial Time. 221-225
  
• Ravi Sethi:
  Complete Register Allocation Problems. 226-248
  
• Ashok K. Chandra, C. K. Wong:
  Worst-Case Analysis of a Placement Algorithm Related to Storage Allocation. 249-263
  
• Robert L. (Scot) Drysdale III, Frank H. Young:
  Improved Divide/Sort/Merge Sorting Networks. 264-270
  
• Richard M. Karp, A. C. McKellar, C. K. Wong:
  Near-Optimal Solutions to a 2-Dimensional Placement Problem. 271-286
  
• Arnold L. Rosenberg:
  Managing Storage for Extendible Arrays. 287-306
  
• H. R. Strong Jr., Andrea Maggiolo-Schettini:
  Recursion Structure Simplification. 307-320
  
• R. Bumby, E. Cooper, D. Latch:
  Interactive Computation of Homology of Finite Partially Ordered Sets. 321-325
  
• Vaughan R. Pratt:
  The Power of Negative Thinking in Multiplying Boolean Matrices. 326-330
  
• S. Rao Kosaraju:
  Speed of Recognition of Context-Free Languages by Array Automata. 331-340
  
• W. H. Hosken:
  Optimum Partitions of Tree Addressing Structures. 341-347
  
• Leslie G. Valiant:
  Parallelism in Comparison Problems. 348-355
  
• Holger Opderbeck, Wesley W. Chu:
  The Renewal Model for Program Behavior. 356-374
  
• Philip M. Spira, A. Pan:
  On Finding and Updating Spanning Trees and Shortest Paths. 375-380
  
• L. Revah:
  On the Number of Multiplications/Divisions Evaluating a Polynomial with Auxiliary Functions. 381-392
  
• Shimon Even:
  An Algorithm for Determining Whether the Connectivity of a Graph is at Least k. 393-396
  

Volume 4, Number 4, December 1975

• M. R. Garey, David S. Johnson:
  Complexity Results for Multiprocessor Scheduling under Resource Constraints. 397-411
  
• Daniel Brand:
  Proving Theorems with the Modification Method. 412-430
  
• Theodore P. Baker, John Gill, Robert Solovay:
  Relativizatons of the P =? NP Question. 431-442
  
• Arnold L. Rosenberg:
  Preserving Proximity in Arrays. 443-460
  
• Erol Gelenbe, Jacques Lenfant, Dominique Potier:
  Response Time of a Fixed-Head Disk to Transfers of Variable Length. 461-473
  
• D. M. Jackson, G. H. John van Rees:
  The Enumeration of Generalized Double Stochastic Nonnegative Integer Square Matrices. 474-477
  
• John L. Bruno, Micha Hofri:
  On Scheduling Chains of Jobs on One Processor with Limited Preemption. 478-490
  
• Michael D. Alder:
  A Convergence Theorem for Hierarchies of Model Neurones. 491-506
  
• Shimon Even, Robert Endre Tarjan:
  Network Flow and Testing Graph Connectivity. 507-518
  
• Matthew S. Hecht, Jeffrey D. Ullman:
  A Simple Algorithm for Global Data Flow Analysis Problems. 519-532
  
• Alfred V. Aho, Kenneth Steiglitz, Jeffrey D. Ullman:
  Evaluating Polynomials at Fixed Sets of Points. 533-539
  
• Alan G. Konheim:
  An Elementary Solution of the Queuing System G/G/1. 540-545
  

Last update Sat May 26 07:00:23 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page