Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarJournal of the ACM, Volume 29, 1982
Volume 29, Number 1, January 1982
George W. Ernst, Michael M. Goldstein:
Mechanical Discovery of Classes of Problem-Solving Strategies. 1-23- Ronald I. Becker, Stephen R. Schach, Yehoshua Perl:
A Shifting Algorithm for Min-Max Tree Partitioning. 58-67 - 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 - Clement T. Yu, K. Lam, Gerard Salton:
Term Weighting in Information Retrieval Using the Term Precision Model. 152-170 - 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
Volume 29, Number 2, April 1982
- Steve Winker:
Generation and Verification of Finite Models and Counterexamples Using an Automated Theorem Prover Answering Two Open Questions. 273-284 - Christos H. Papadimitriou, Mihalis Yannakakis:
The complexity of restricted spanning tree problems. 285-309 - Fereidoon Sadri, Jeffrey D. Ullman:
Template Dependencies: A Large Class of Dependencies in Relational Databases and Its Complete Axiomatization. 363-372 - Jacques Cohen, Timothy J. Hickey, Joel Katcoff:
Upper Bounds for Speedup in Parallel Parsing. 408-428 - Theodore Brown:
Determination of the conditional response for quantum allocation algorithms. 448-460 - Simon S. Lam:
Dynamic Scaling and Growth Behavior of Queuing Network Normalization Constants. 492-513 - Percy Tzelnic, Izidor Gertner:
An Approach to Program Behavior Modeling and Optimal Memory Control. 527-554 - Albert R. Meyer, Joseph Y. Halpern:
Axiomatic Definitions of Programming Languages: A Theoretical Assessment. 555-576 - Michael A. Arbib, Ernest G. Manes:
The Pattern-of-Calls Expansion Is the Canonical Fixpoint for Recursive Definitions. 577-602
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 - Anthony C. Klug:
Equivalence of Relational Algebra and Relational Calculus Query Languages Having Aggregate Functions. 699-717 - 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 - Mark Jerrum, Marc Snir:
Some Exact Complexity Results for Straight-Line Computations over Semirings. 874-897
Volume 29, Number 4, October 1982
- Fouad A. Tobagi:
Distributions of packet delay and interdeparture time in slotted ALOHA and carrier sense multiple access. 907-927 - Thomas Lengauer, Robert Endre Tarjan:
Asymptotically tight bounds on time-space trade-offs in a pebble game. 1087-1130 - Esko Ukkonen:
The equivalence problem for some non-real-time deterministic pushdown automata. 1166-1181
maintained by 
, founded at 
, founded at 
last updated on 2019-04-18 22:13 CEST by the dblp team
data released under the ODC-BY 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
the dblp computer science bibliography is funded by:
