Volume 24,
Number 1,
January 1977
Volume 24,
Number 2,
April 1977
- Dennis de Champeaux, Lenie Sint:
An Improved Bidirectional Heuristic Search Algorithm.
177-191
Electronic Edition (ACM DL) BibTeX
- Francis T. Boesch, James F. Gimpel:
Covering Points of a Digraph with Point-Disjoint Paths and Its Application to Code Optimization.
192-198
Electronic Edition (ACM DL) BibTeX
- Arnold L. Rosenberg, Larry J. Stockmeyer:
Hashing Schemes for Extendible Arrays.
199-221
Electronic Edition BibTeX
- Alexandre Brandwajn:
A Queueing Model of Multiprogrammed Computer Systems Under Full Load Conditions.
222-240
Electronic Edition (ACM DL) BibTeX
- Micha Hofri:
On Certain Output-Buffer Management Techniques--A Stochastic Model.
241-249
Electronic Edition (ACM DL) BibTeX
- K. Mani Chandy, John H. Howard Jr., Donald F. Towsley:
Product Form and Local Balance in Queueing Networks.
250-263
Electronic Edition BibTeX
- Toshihide Ibaraki:
The Power of Dominance Relations in Branch-and-Bound Algorithms.
264-279
Electronic Edition (ACM DL) BibTeX
- Oscar H. Ibarra, Chul E. Kim:
Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors.
280-289
Electronic Edition (ACM DL) BibTeX
- Eric C. R. Hehner:
Information Content of Programs and Operation Encoding.
290-297
Electronic Edition (ACM DL) BibTeX
- Philip J. Davis:
Proof, Completeness, Transcendentals, and Sampling.
298-310
Electronic Edition (ACM DL) BibTeX
- Charles M. Fiduccia, Yechezkel Zalcstein:
Algebras Having Linear Multiplicative Complexities.
311-331
Electronic Edition (ACM DL) BibTeX
- John E. Hopcroft, Wolfgang J. Paul, Leslie G. Valiant:
On Time Versus Space.
332-337
Electronic Edition (ACM DL) BibTeX
- Neil D. Jones, Steven S. Muchnick:
Even Simple Programs Are Hard To Analyze.
338-350
Electronic Edition (ACM DL) BibTeX
Volume 24,
Number 3,
July 1977
- A. Michael Ballantyne, W. W. Bledsoe:
Automatic Proofs of Theorems in Analysis Using Nonstandard Techniques.
353-374
Electronic Edition (ACM DL) BibTeX
- Guy Fayolle, Erol Gelenbe, Jacques Labetoulle:
Stability and Optimal Control of the Packet Switching Broadcast Channel.
375-386
Electronic Edition (ACM DL) BibTeX
- Harry B. Hunt III, Daniel J. Rosenkrantz:
On Equivalence and Containment Problems for Formal Languages.
387-396
Electronic Edition (ACM DL) BibTeX
- R. Attar, Aviezri S. Fraenkel:
Local Feedback in Full-Text Retrieval Systems.
397-417
Electronic Edition (ACM DL) BibTeX
- Abraham Bookstein, Donald H. Kraft:
Operations Research Applied to Document Indexing and Retrieval Decisions.
418-427
Electronic Edition (ACM DL) BibTeX
- Douglas Comer, Ravi Sethi:
The Complexity of Trie Index Construction.
428-440
Electronic Edition BibTeX
- K. Hwang, S. Bing Yao:
Optimal Batched Searching of Tree Structured Files in Multiprocessor Computer Systems.
441-454
Electronic Edition (ACM DL) BibTeX
- Richard J. Lipton, Lawrence Snyder:
A Linear Time Algorithm for Deciding Subject Security.
455-464
Electronic Edition BibTeX
- Benjamin W. Y. Lin, Ronald L. Rardin:
Development of a Parametric Generating Procedure for Integer Programming Test Problems.
465-472
Electronic Edition (ACM DL) BibTeX
- Lawrence T. Kou:
On Live-Dead Analysis for Global Data Flow Problems.
473-483
Electronic Edition (ACM DL) BibTeX
- John C. Reynolds:
Semantics of the Domain of Flow Diagrams.
484-503
Electronic Edition (ACM DL) BibTeX
- Ben Wegbreit:
Complexity of Synthesizing Inductive Assertions.
504-512
Electronic Edition (ACM DL) BibTeX
- Laurent Hyafil, H. T. Kung:
The Complexity of Parallel Evaluation of Linear Recurrences.
513-521
Electronic Edition (ACM DL) BibTeX
- Richard J. Lipton, Yechezkel Zalcstein:
Word Problems Solvable in Logspace.
522-526
Electronic Edition (ACM DL) BibTeX
- K. L. Krause, V. Y. Shen, Herbert D. Schwetman:
Errata: ``Analysis of Several Task-Scheduling Algorithms for a Model of Multiprogramming Computer Systems''.
527
Electronic Edition (ACM DL) BibTeX
Volume 24,
Number 4,
October 1977
Copyright © Sun May 17 00:05:27 2009
by Michael Ley (ley@uni-trier.de)
