Volume 27,
Number 1,
January 1980
- Andrzej Proskurowski:
On the Generation of Binary Trees.
1-2
Electronic Edition (ACM DL) BibTeX
- Marvin H. Solomon, Raphael A. Finkel:
A Note on Enumerating Binary Trees.
3-5
Electronic Edition (ACM DL) BibTeX
- David Nassimi, Sartaj Sahni:
An optimal routing algorithm for mesh-connected Parallel computers.
6-29
Electronic Edition (ACM DL) BibTeX
- Krzysztof Pawlikowski:
Message Waiting Time in a Packet Switching System.
30-41
Electronic Edition (ACM DL) BibTeX
- G. Boyd Swartz:
Polling in a Loop System.
42-59
Electronic Edition (ACM DL) BibTeX
- Peter B. Henderson, Yechezkel Zalcstein:
Synchronization Problems Solvable by Generalized PV Systems.
60-71
Electronic Edition (ACM DL) BibTeX
- Abraham Silberschatz, Zvi M. Kedem:
Consistency in Hierarchical Database Systems.
72-80
Electronic Edition BibTeX
- Richard J. Lipton, Arnold L. Rosenberg, Andrew Chi-Chih Yao:
External Hashing Schemes for Collections of Data Structures.
81-95
Electronic Edition (ACM DL) BibTeX
- Joost Engelfriet, Erik Meineche Schmidt, Jan van Leeuwen:
Stack Machines and Classes of Nonnested Macro Languages.
96-117
Electronic Edition (ACM DL) BibTeX
- Ravindran Kannan:
A Polynomial Algorithm for the Two-Variable Integer Programming Problem.
118-122
Electronic Edition (ACM DL) BibTeX
- Richard A. DeMillo, Stanley C. Eisenstat, Richard J. Lipton:
Space-Time Trade-Offs in Structured Programming: An Improved Combinatorial Embedding Theorem.
123-127
Electronic Edition (ACM DL) BibTeX
- Marc A. Kaplan, Jeffrey D. Ullman:
A Scheme for the Automatic Inference of Variable Types.
128-145
Electronic Edition (ACM DL) BibTeX
- Bhaskaram Prabhala, Ravi Sethi:
Efficient Computation of Expressions with Common Subexpressions.
146-163
Electronic Edition (ACM DL) BibTeX
- Mitchell Wand:
Continuation-Based Program Transformation Strategies.
164-180
Electronic Edition (ACM DL) BibTeX
- Edward A. Bender:
The Number of Fanout-Free Functions with Various Gates.
181-190
Electronic Edition (ACM DL) BibTeX
- Norihisa Suzuki, David Jefferson:
Verification Decidability of Presburger Array Programs.
191-205
Electronic Edition (ACM DL) BibTeX
Volume 27,
Number 2,
April 1980
Volume 27,
Number 3,
July 1980
- Derek C. Oppen:
Reasoning About Recursively Defined Data Structures.
403-411
Electronic Edition BibTeX
- Doris Altenkamp, Kurt Mehlhorn:
Codes: Unequal Probabilities, Unequal Letter Cost.
412-427
Electronic Edition (ACM DL) BibTeX
- Ronald L. Graham, Andrew Chi-Chih Yao, F. Frances Yao:
Information Bounds Are Weak in the Shortest Distance Problem.
428-444
Electronic Edition (ACM DL) BibTeX
- Yossi Shiloach:
A Polynomial Solution to the Undirected Two Paths Problem.
445-456
Electronic Edition (ACM DL) BibTeX
- Kishor S. Trivedi, Robert A. Wagner, Timothy M. Sigmon:
Optimal Selection of CPU Speed, Device Capacities, and File Assignments.
457-473
Electronic Edition (ACM DL) BibTeX
- Haim Mendelson, Uri Yechiali:
A New Approach to the Analysis of Linear Probing Schemes.
474-483
Electronic Edition (ACM DL) BibTeX
- Fred G. Abramson, Yuri Breitbart, Forbes D. Lewis:
Complex Properties of Grammars.
484-498
Electronic Edition (ACM DL) BibTeX
- Joost Engelfriet, Grzegorz Rozenberg:
Fixed Point Languages, Equality Languages, and Representation of Recursively Enumerable Languages.
499-518
Electronic Edition (ACM DL) BibTeX
- Guy Fayolle, Isi Mitrani, R. Iasnogorodski:
Sharing a Processor Among Many Job Classes.
519-532
Electronic Edition (ACM DL) BibTeX
- Christos H. Papadimitriou, Paris C. Kanellakis:
Flowshop scheduling with limited temporary storage.
533-549
Electronic Edition (ACM DL) BibTeX
- Sartaj Sahni, Yookun Cho:
Scheduling Independent Tasks with Due Times on a Uniform Processor System.
550-563
Electronic Edition (ACM DL) BibTeX
- Carlo Ghezzi, Dino Mandrioli:
Augmenting Parsers to Support Incrementality.
564-579
Electronic Edition (ACM DL) BibTeX
- Ravi Sethi, Adrian Tang:
Constructing Call-by-Value Continuation Semantics.
580-597
Electronic Edition (ACM DL) BibTeX
Volume 27,
Number 4,
October 1980
- Alan R. Aronson, Barry E. Jacobs, Jack Minker:
A Note on Fuzzy Deduction.
599-603
Electronic Edition (ACM DL) BibTeX
- D. T. Lee:
Two-Dimensional Voronoi Diagrams in the Lp-Metric.
604-618
Electronic Edition (ACM DL) BibTeX
- Shuji Tsukiyama, Isao Shirakawa, Hiroshi Ozaki, Hiromu Ariyoshi:
An Algorithm to Enumerate All Cutsets of a Graph in Linear Time per Cutset.
619-632
Electronic Edition (ACM DL) BibTeX
- Yehoshua Sagiv, Mihalis Yannakakis:
Equivalences Among Relational Expressions with the Union and Difference Operators.
633-655
Electronic Edition BibTeX
- Andrzej Ehrenfeucht, Grzegorz Rozenberg:
The Sequence Equivalence Problem is Decidable for 0S Systems.
656-663
Electronic Edition (ACM DL) BibTeX
- David Maier:
Minimum Covers in Relational Database Model.
664-674
Electronic Edition BibTeX
- Sheila A. Greibach, Emily P. Friedman:
Superdeterministic PDAs: A Subcase with a Decidable Inclusion problem.
675-700
Electronic Edition (ACM DL) BibTeX
- Jacob T. Schwartz:
Fast Probabilistic Algorithms for Verification of Polynomial Identities.
701-717
Electronic Edition BibTeX
- Marshall L. Fisher, Dorit S. Hochbaum:
Database Location in Computer Networks.
718-735
Electronic Edition BibTeX
- K. G. Ramakrishnan:
Solving Two-Commodity Transportation Problems with Coupling Constraints.
736-757
Electronic Edition (ACM DL) BibTeX
- Peter J. Downey, Ravi Sethi, Robert Endre Tarjan:
Variations on the Common Subexpression Problem.
758-771
Electronic Edition BibTeX
- Jean-Claude Raoult, Jean Vuillemin:
Operational and Semantic Equivalence Between Recursive Programs.
772-796
Electronic Edition (ACM DL) BibTeX
- Gérard P. Huet:
Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems: Abstract Properties and Applications to Term Rewriting Systems.
797-821
Electronic Edition BibTeX
- Joseph JáJá:
Computations of Bilinear Forms over Finite Fields.
822-830
Electronic Edition (ACM DL) BibTeX
- Richard E. Ladner, Michael J. Fischer:
Parallel Prefix Computation.
831-838
Electronic Edition BibTeX
- Rüdiger Reischuk:
Improved Bounds on the Problem of Time-Space Trade-Off in the Pebble Game.
839-849
Electronic Edition (ACM DL) BibTeX
Copyright © Wed May 21 20:01:23 2008
by Michael Ley (ley@uni-trier.de)
