Journal: Journal of the ACM

Volume 27, Issue 4

599 -- 603Alan R. Aronson, Barry E. Jacobs, Jack Minker. A Note on Fuzzy Deduction
604 -- 618D. T. Lee. Two-Dimensional Voronoi Diagrams in the L::p::-Metric
619 -- 632Shuji Tsukiyama, Isao Shirakawa, Hiroshi Ozaki, Hiromu Ariyoshi. An Algorithm to Enumerate All Cutsets of a Graph in Linear Time per Cutset
633 -- 655Yehoshua Sagiv, Mihalis Yannakakis. Equivalences Among Relational Expressions with the Union and Difference Operators
656 -- 663Andrzej Ehrenfeucht, Grzegorz Rozenberg. The Sequence Equivalence Problem is Decidable for 0S Systems
664 -- 674David Maier. Minimum Covers in Relational Database Model
675 -- 700Sheila A. Greibach, Emily P. Friedman. Superdeterministic PDAs: A Subcase with a Decidable Inclusion problem
701 -- 717Jacob T. Schwartz. Fast Probabilistic Algorithms for Verification of Polynomial Identities
718 -- 735Marshall L. Fisher, Dorit S. Hochbaum. Database Location in Computer Networks
736 -- 757K. G. Ramakrishnan. Solving Two-Commodity Transportation Problems with Coupling Constraints
758 -- 771Peter J. Downey, Ravi Sethi, Robert Endre Tarjan. Variations on the Common Subexpression Problem
772 -- 796Jean-Claude Raoult, Jean Vuillemin. Operational and Semantic Equivalence Between Recursive Programs
797 -- 821Gérard P. Huet. Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems: Abstract Properties and Applications to Term Rewriting Systems
822 -- 830Joseph JáJá. Computations of Bilinear Forms over Finite Fields
831 -- 838Richard E. Ladner, Michael J. Fischer. Parallel Prefix Computation
839 -- 849Rüdiger Reischuk. Improved Bounds on the Problem of Time-Space Trade-Off in the Pebble Game

Volume 27, Issue 3

403 -- 411Derek C. Oppen. Reasoning About Recursively Defined Data Structures
412 -- 427Doris Altenkamp, Kurt Mehlhorn. Codes: Unequal Probabilities, Unequal Letter Cost
428 -- 444Ronald L. Graham, Andrew Chi-Chih Yao, F. Frances Yao. Information Bounds Are Weak in the Shortest Distance Problem
445 -- 456Yossi Shiloach. A Polynomial Solution to the Undirected Two Paths Problem
457 -- 473Kishor S. Trivedi, Robert A. Wagner, Timothy M. Sigmon. Optimal Selection of CPU Speed, Device Capacities, and File Assignments
474 -- 483Haim Mendelson, Uri Yechiali. A New Approach to the Analysis of Linear Probing Schemes
484 -- 498Fred G. Abramson, Yuri Breitbart, Forbes D. Lewis. Complex Properties of Grammars
499 -- 518Joost Engelfriet, Grzegorz Rozenberg. Fixed Point Languages, Equality Languages, and Representation of Recursively Enumerable Languages
519 -- 532Guy Fayolle, Isi Mitrani, R. Iasnogorodski. Sharing a Processor Among Many Job Classes
533 -- 549Christos H. Papadimitriou, Paris C. Kanellakis. Flowshop scheduling with limited temporary storage
550 -- 563Sartaj Sahni, Yookun Cho. Scheduling Independent Tasks with Due Times on a Uniform Processor System
564 -- 579Carlo Ghezzi, Dino Mandrioli. Augmenting Parsers to Support Incrementality
580 -- 597Ravi Sethi, Adrian Tang. Constructing Call-by-Value Continuation Semantics

Volume 27, Issue 2

207 -- 227Andrew Chi-Chih Yao. New Algorithms for Bin Packing
228 -- 234Marshall C. Pease, Robert E. Shostak, Leslie Lamport. Reaching Agreement in the Presence of Faults
235 -- 249Raymond Reiter. Equality and Domain Closure in First-Order Databases
250 -- 262Yehoshua Sagiv. An Algorithm for Inferring Multivalued Dependencies with an Application to Propositional Logic
263 -- 269Grzegorz W. Wasilkowski. Can Any Stationary Iteration Using Linear Information Be Globally Convergent?
270 -- 280Tiko Kameda. Testing Deadlock-Freedom of Computer Systems
281 -- 286We-Min Chow. The Cycle Time Distribution of Exponential Cyclic Queues
287 -- 312Teofilo F. Gonzalez, Donald B. Johnson. A New Algorithm for Preemptive Scheduling of Trees
313 -- 322Martin Reiser, Stephen S. Lavenberg. Mean-Value Analysis of Closed Multichain Queuing Networks
323 -- 337Donald F. Towsley. Queuing Network Models with State-Dependent Routing
338 -- 355Ramachandran Krishnaswamy, Arthur B. Pyster. On the Correctness of Semantic-Syntax-Directed Translations
356 -- 364Greg Nelson, Derek C. Oppen. Fast Decision Procedures Based on Congruence Closure
365 -- 383Stephen A. Ward, Robert H. Halstead Jr.. A Syntactic Theory of Message Passing
384 -- 392Harold Abelson. Lower Bounds on Information Transfer in Distributed Computations
393 -- 401David Lichtenstein, Michael Sipser. GO Is Polynomial-Space Hard
402 -- 0Rainer Parchmann. Corrigendum: Control System Model for Critically Timed Success

Volume 27, Issue 1

1 -- 2Andrzej Proskurowski. On the Generation of Binary Trees
3 -- 5Marvin H. Solomon, Raphael A. Finkel. A Note on Enumerating Binary Trees
6 -- 29David Nassimi, Sartaj Sahni. An optimal routing algorithm for mesh-connected Parallel computers
30 -- 41Krzysztof Pawlikowski. Message Waiting Time in a Packet Switching System
42 -- 59G. Boyd Swartz. Polling in a Loop System
60 -- 71Peter B. Henderson, Yechezkel Zalcstein. Synchronization Problems Solvable by Generalized PV Systems
72 -- 80Abraham Silberschatz, Zvi M. Kedem. Consistency in Hierarchical Database Systems
81 -- 95Richard J. Lipton, Arnold L. Rosenberg, Andrew Chi-Chih Yao. External Hashing Schemes for Collections of Data Structures
96 -- 117Joost Engelfriet, Erik Meineche Schmidt, Jan van Leeuwen. Stack Machines and Classes of Nonnested Macro Languages
118 -- 122Ravindran Kannan. A Polynomial Algorithm for the Two-Variable Integer Programming Problem
123 -- 127Richard A. DeMillo, Stanley C. Eisenstat, Richard J. Lipton. Space-Time Trade-Offs in Structured Programming: An Improved Combinatorial Embedding Theorem
128 -- 145Marc A. Kaplan, Jeffrey D. Ullman. A Scheme for the Automatic Inference of Variable Types
146 -- 163Bhaskaram Prabhala, Ravi Sethi. Efficient Computation of Expressions with Common Subexpressions
164 -- 180Mitchell Wand. Continuation-Based Program Transformation Strategies
181 -- 190Edward A. Bender. The Number of Fanout-Free Functions with Various Gates
191 -- 205Norihisa Suzuki, David Jefferson. Verification Decidability of Presburger Array Programs