Volume 29, Number 1, January 1982
- George W. Ernst, Michael M. Goldstein:
Mechanical Discovery of Classes of Problem-Solving Strategies.
1-23
- Eugene C. Freuder:
A Sufficient Condition for Backtrack-Free Search.
24-32
- Drew V. McDermott:
Nonmonotonic Logic II: Nonmonotonic Modal Theories.
33-57
- Ronald I. Becker, Stephen R. Schach, Yehoshua Perl:
A Shifting Algorithm for Min-Max Tree Partitioning.
58-67
- Christoph M. Hoffmann, Michael J. O'Donnell:
Pattern Matching in Trees.
68-95
- Zvi Galil:
An Almost Linear-Time Algorithm for Computing a Dependency Basis in a Relational Database.
96-102
- Yehoshua Sagiv, Scott F. Walecka:
Subset Dependencies and a Completeness Result for a Subclass of Embedded Multivalued Dependencies.
103-117
- Hermann A. Maurer, Arto Salomaa, Derick Wood:
Dense Hierarchies of Grammatical Families.
118-126
- D. Chow, Clement T. Yu:
On the Construction of Feedback Queries.
127-151
- Clement T. Yu, K. Lam, Gerard Salton:
Term Weighting in Information Retrieval Using the Term Precision Model.
152-170
- Ronald V. Book:
Confluent and Other Types of Thue Systems.
171-182
- James E. Burns, Paul Jackson, Nancy A. Lynch, Michael J. Fischer, Gary L. Peterson:
Data Requirements for Implementation of N-Process Mutual Exclusion Using a Single Shared Variable.
183-205
- Hans-Dieter Ehrich:
On the Theory of Specification, Implementation, and Parametrization of Abstract Data Types.
206-227
- Harry B. Hunt III:
On the Complexity of Flowchart and Loop Program Schemes and Programming Languages.
228-249
- Michael L. Fredman:
The Complexity of Maintaining an Array and Computing Its Partial Sums.
250-260
- Charles Rackoff:
Relativized Questions Involving Probabilistic Algorithms.
261-268
Volume 29, Number 2, April 1982
Volume 29, Number 3, July 1982
- Robert W. Floyd, Jeffrey D. Ullman:
The Compilation of Regular Expressions into Integrated Circuits.
603-622
- K. Takamizawa, Takao Nishizeki, Nobuji Saito:
Linear-time computability of combinatorial problems on series-parallel graphs.
623-641
- David Nassimi, Sartaj Sahni:
Parallel permutation and sorting algorithms and a new generalized connection network.
642-667
- Peter Honeyman:
Testing satisfaction of functional dependencies.
668-677
- Seymour Ginsburg, Sami Mohammed Zaiddan:
Properties of functional-dependency families.
678-698
- Anthony C. Klug:
Equivalence of Relational Algebra and Relational Calculus Query Languages Having Aggregate Functions.
699-717
- Mihalis Yannakakis:
A Theory of Safe Locking Policies in Database Systems.
718-740
- Dana Angluin:
Inference of Reversible Languages.
741-765
- Harold N. Gabow:
An Almost-Linear Algorithm for Two-Processor Scheduling.
766-780
- Errol L. Lloyd:
Critical Path Scheduling with Resource and Processor Constraints.
781-811
- Charles U. Martel:
Preemptive Scheduling with Release Times, Deadlines, and Due Times.
812-829
- Christopher L. Samelson, William G. Bulgren:
A Note on Product-Form Solution for Queuing Networks with Poisson Arrivals and General Service-Time Distributions with Finite Means.
830-840
- Krzysztof R. Apt, Maarten H. van Emden:
Contributions to the Theory of Logic Programming.
841-862
- Eitan M. Gurari, Oscar H. Ibarra:
Two-Way Counter Machines and Diophantine Equations.
863-873
- Mark Jerrum, Marc Snir:
Some Exact Complexity Results for Straight-Line Computations over Semirings.
874-897
- Andrew Chi-Chih Yao:
On Parallel Computation for the Knapsack Problem.
898-903
- Richard P. Brent, H. T. Kung:
Corrigendum: ``The Area-Time Complexity of Binary Multiplication''.
904
Volume 29, Number 4, October 1982
Last update Mon May 20 17:57:09 2013
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
