Volume 28,
Number 1,
January 1981
- Shimon Even, Yossi Shiloach:
An On-Line Edge-Deletion Problem.
1-4
Electronic Edition (ACM DL) BibTeX
- Yehoshua Perl, Stephen R. Schach:
Max-Min Tree Partitioning.
5-15
Electronic Edition (ACM DL) BibTeX
- Michael Rodeh, Vaughan R. Pratt, Shimon Even:
Linear Algorithm for Data Compression via String Matching.
16-24
Electronic Edition (ACM DL) BibTeX
- Philip A. Bernstein, Dah-Ming W. Chiu:
Using Semi-Joins to Solve Relational Queries.
25-40
Electronic Edition BibTeX
- Witold Lipski Jr.:
On Databases with Incomplete Information.
41-70
Electronic Edition BibTeX
- Grzegorz W. Wasilkowski:
n-Evaluation Conjecture for Multipoint Iterations for the Solution of Scalar Nonlinear Equations.
71-80
Electronic Edition (ACM DL) BibTeX
- James O. Achugbue, Francis Y. L. Chin:
Bounds on Schedules for Independent Tasks with Similar Execution Times.
81-99
Electronic Edition (ACM DL) BibTeX
- John L. Bruno, Peter J. Downey, Greg N. Frederickson:
Sequencing Tasks with Exponential Service Times to Minimize the Expected Flow Time or Makespan.
100-113
Electronic Edition (ACM DL) BibTeX
- Ashok K. Chandra, Dexter Kozen, Larry J. Stockmeyer:
Alternation.
114-133
Electronic Edition BibTeX
- Zvi Galil:
String Matching in Real Time.
134-149
Electronic Edition BibTeX
- David G. Kirkpatrick:
A Unified Lower Bound for Selection and Set Partitioning Problems.
150-165
Electronic Edition (ACM DL) BibTeX
- Benton L. Leong, Joel I. Seiferas:
New Real-Time Simulations of Multihead Tape Units.
166-180
Electronic Edition (ACM DL) BibTeX
- John H. Rowland, Philip J. Davis:
On the Use of Transcendentals for Program Testing.
181-190
Electronic Edition (ACM DL) BibTeX
Volume 28,
Number 2,
April 1981
Volume 28,
Number 3,
July 1981
- Mark E. Stickel:
A Unification Algorithm for Associative-Commutative Functions.
423-434
Electronic Edition BibTeX
- Yehoshua Sagiv, Claude Delobel, Douglas Stott Parker Jr., Ronald Fagin:
An Equivalence Between Relational Database Dependencies and a Fragment of Propositional Logic.
435-453
Electronic Edition BibTeX
- David P. Dobkin, J. Ian Munro:
Optimal Time Minimal Space Selection Algorithms.
454-461
Electronic Edition (ACM DL) BibTeX
- Francis Y. L. Chin, Long-Lieh Tsai:
On J-maximal and J-minimal Flow-Shop Schedules.
462-476
Electronic Edition (ACM DL) BibTeX
- Leonard Kleinrock, Arne A. Nilsson:
On Optimal Scheduling Algorithms for Time-Shared Systems.
477-486
Electronic Edition (ACM DL) BibTeX
- Hanan Samet:
Connected Component Labeling Using Quadtrees.
487-501
Electronic Edition BibTeX
- Sarangan Krishna Kumar, Melvin A. Breuer:
Probabilistic Aspects of Boolean Switching Functions via a New Transform.
502-520
Electronic Edition (ACM DL) BibTeX
- Richard P. Brent, H. T. Kung:
The Area-Time Complexity of Binary Multiplication.
521-534
Electronic Edition (ACM DL) BibTeX
- Eitan M. Gurari, Oscar H. Ibarra:
The Complexity of the Equivalence Problem for Simple Programs.
535-560
Electronic Edition (ACM DL) BibTeX
- Ernst W. Mayr, Albert R. Meyer:
The Complexity of the Finite Containment Problem for Petri Nets.
561-576
Electronic Edition (ACM DL) BibTeX
- Robert Endre Tarjan:
A Unified Approach to Path Problems.
577-593
Electronic Edition BibTeX
- Robert Endre Tarjan:
Fast Algorithms for Solving Path Problems.
594-614
Electronic Edition BibTeX
- Andrew Chi-Chih Yao:
Should Tables Be Sorted?
615-628
Electronic Edition BibTeX
- Martin Reiser, Stephen S. Lavenberg:
Corrigendum: ``Mean-Value Analysis of Closed Multichain Queuing Networks''.
629
Electronic Edition (ACM DL) BibTeX
Volume 28,
Number 4,
October 1981
- Wolfgang Bibel:
On Matrices with Connections.
633-645
Electronic Edition BibTeX
- Donald W. Loveland, C. R. Reddy:
Deleting Repeated Goals in the Problem Reduction Format.
646-661
Electronic Edition (ACM DL) BibTeX
- Guy Latouche:
Algorithmic Analysis of a Multiprogramming-Multiprocessor Computer System.
662-679
Electronic Edition (ACM DL) BibTeX
- David Maier, Yehoshua Sagiv, Mihalis Yannakakis:
On the Complexity of Testing Implications of Functional and Join Dependencies.
680-695
Electronic Edition BibTeX
- Michael L. Fredman:
A Lower Bound on the Complexity of Orthogonal Range Queries.
696-705
Electronic Edition BibTeX
- Andrzej Ehrenfeucht, Grzegorz Rozenberg, Keijo Ruohonen:
A Morphic Representation of Complements of Recursively Enumerable Sets.
706-714
Electronic Edition (ACM DL) BibTeX
- Mehdi Jazayeri:
A Simpler Construction for Showing the Intrinsically Exponential Complexity of the Circularity Problem for Attribute Grammars.
715-720
Electronic Edition (ACM DL) BibTeX
- Ernest Davis, Jeffrey M. Jaffe:
Algorithms for Scheduling Tasks on Unrelated Processors.
721-736
Electronic Edition (ACM DL) BibTeX
- Stefania Gnesi, Ugo Montanari, Alberto Martelli:
Dynamic Programming as Graph Searching: An Algebraic Approach.
737-751
Electronic Edition (ACM DL) BibTeX
- Naoki Katoh, Toshihide Ibaraki, H. Mine:
An Algorithm for the K Best Solutions of the Resource Allocation Problem.
752-764
Electronic Edition (ACM DL) BibTeX
- Christos H. Papadimitriou:
On the complexity of integer programming.
765-768
Electronic Edition BibTeX
- Robert E. Shostak:
Deciding Linear Inequalities by Computing Loop Residues.
769-779
Electronic Edition (ACM DL) BibTeX
- Andrew Chi-Chih Yao:
A Lower Bound to Finding Convex Hulls.
780-787
Electronic Edition (ACM DL) BibTeX
Copyright © Sun May 17 00:05:34 2009
by Michael Ley (ley@uni-trier.de)
