Journal of the ACM, Volume 24, 1977

Volume 24, Number 1, January 1977

• Donald B. Johnson:
  Efficient Algorithms for Shortest Paths in Sparse Networks. 1-13
  
• Neil C. Wilhelm:
  A General Model for the Performance of Disk Systems. 14-31
  
• Edward C. Horvath, Shui Lam, Ravi Sethi:
  A Level Algorithm for Preemptive Scheduling. 32-43
  
• Rod M. Burstall, John Darlington:
  A Transformation System for Developing Recursive Programs. 44-67
  
• Joseph A. Goguen, James W. Thatcher, Eric G. Wagner, Jesse B. Wright:
  Initial Algebra Semantics and Continuous Algebras. 68-95
  
• Susan L. Graham:
  Special Editor's Note. 96-97
  
• Brenda S. Baker:
  An Algorithm for Structuring Flowgraphs. 98-120
  
• David B. Loveman:
  Program Improvement by Source-to-Source Transformation. 121-145
  
• Alfred V. Aho, Stephen C. Johnson, Jeffrey D. Ullman:
  Code Generation for Expressions with Common Subexpressions. 146-160
  
• Phillip D. Summers:
  A Methodology for LISP Program Construction from Examples. 161-175
  

Volume 24, Number 2, April 1977

• Dennis de Champeaux, Lenie Sint:
  An Improved Bidirectional Heuristic Search Algorithm. 177-191
  
• Francis T. Boesch, James F. Gimpel:
  Covering Points of a Digraph with Point-Disjoint Paths and Its Application to Code Optimization. 192-198
  
• Arnold L. Rosenberg, Larry J. Stockmeyer:
  Hashing Schemes for Extendible Arrays. 199-221
  
• Alexandre Brandwajn:
  A Queueing Model of Multiprogrammed Computer Systems Under Full Load Conditions. 222-240
  
• Micha Hofri:
  On Certain Output-Buffer Management Techniques--A Stochastic Model. 241-249
  
• K. Mani Chandy, John H. Howard Jr., Donald F. Towsley:
  Product Form and Local Balance in Queueing Networks. 250-263
  
• Toshihide Ibaraki:
  The Power of Dominance Relations in Branch-and-Bound Algorithms. 264-279
  
• Oscar H. Ibarra, Chul E. Kim:
  Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors. 280-289
  
• Eric C. R. Hehner:
  Information Content of Programs and Operation Encoding. 290-297
  
• Philip J. Davis:
  Proof, Completeness, Transcendentals, and Sampling. 298-310
  
• Charles M. Fiduccia, Yechezkel Zalcstein:
  Algebras Having Linear Multiplicative Complexities. 311-331
  
• John E. Hopcroft, Wolfgang J. Paul, Leslie G. Valiant:
  On Time Versus Space. 332-337
  
• Neil D. Jones, Steven S. Muchnick:
  Even Simple Programs Are Hard To Analyze. 338-350
  

Volume 24, Number 3, July 1977

• A. Michael Ballantyne, W. W. Bledsoe:
  Automatic Proofs of Theorems in Analysis Using Nonstandard Techniques. 353-374
  
• Guy Fayolle, Erol Gelenbe, Jacques Labetoulle:
  Stability and Optimal Control of the Packet Switching Broadcast Channel. 375-386
  
• Harry B. Hunt III, Daniel J. Rosenkrantz:
  On Equivalence and Containment Problems for Formal Languages. 387-396
  
• R. Attar, Aviezri S. Fraenkel:
  Local Feedback in Full-Text Retrieval Systems. 397-417
  
• Abraham Bookstein, Donald H. Kraft:
  Operations Research Applied to Document Indexing and Retrieval Decisions. 418-427
  
• Douglas Comer, Ravi Sethi:
  The Complexity of Trie Index Construction. 428-440
  
• K. Hwang, S. Bing Yao:
  Optimal Batched Searching of Tree Structured Files in Multiprocessor Computer Systems. 441-454
  
• Richard J. Lipton, Lawrence Snyder:
  A Linear Time Algorithm for Deciding Subject Security. 455-464
  
• Benjamin W. Y. Lin, Ronald L. Rardin:
  Development of a Parametric Generating Procedure for Integer Programming Test Problems. 465-472
  
• Lawrence T. Kou:
  On Live-Dead Analysis for Global Data Flow Problems. 473-483
  
• John C. Reynolds:
  Semantics of the Domain of Flow Diagrams. 484-503
  
• Ben Wegbreit:
  Complexity of Synthesizing Inductive Assertions. 504-512
  
• Laurent Hyafil, H. T. Kung:
  The Complexity of Parallel Evaluation of Linear Recurrences. 513-521
  
• Richard J. Lipton, Yechezkel Zalcstein:
  Word Problems Solvable in Logspace. 522-526
  
• K. L. Krause, V. Y. Shen, Herbert D. Schwetman:
  Errata: ``Analysis of Several Task-Scheduling Algorithms for a Model of Multiprogramming Computer Systems''. 527
  

Volume 24, Number 4, October 1977

• Robert E. Shostak:
  On the SUP-INF Method for Proving Presburger Formulas. 529-543
  
• Richard A. DeMillo, K. Vairavan, E. Sycara-Cyranski:
  A Study of Schedules as Models of Synchronous Parallel Computation. 544-565
  
• Mamoru Maekawa:
  Queueing Models for Computer Systems Connected by a Communication Line. 566-582
  
• Nancy A. Lynch:
  Log Space Recognition and Translation of Parenthesis Languages. 583-590
  
• Ian F. Blake, Alan G. Konheim:
  Big Buckets Are (Are Not) Better! 591-606
  
• Clement T. Yu, W. S. Luk:
  Analysis of Effectiveness of Retrieval in Clustered Files. 607-622
  
• T. D. Bui:
  Errata and Comments on a Paper by J. R. Cash. 623
  
• S. C. Sahasrabudhe, A. D. Kulkarni:
  On Solving Fredholm Integral Equations of the First Kind. 624-629
  
• Bharat Kinariwala, A. G. Rao:
  Flow Switching Approach to the Maximum Flow Problem: I. 630-645
  
• Kenneth J. Omahen:
  Capacity Bounds for Multiresource Queues. 646-663
  
• Daniel S. Hirschberg:
  Algorithms for the Longest Common Subsequence Problem. 664-675
  
• Shawpawn Kumar Das:
  A Machine Representation of Finite T₀ Topologies. 676-692
  
• Paul Young:
  Optimization Among Provably Equivalent Programs. 693-700
  

Last update Tue Feb 14 04:19:53 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page