@article{Proskurowski/80a,
AUTHOR = {Proskurowski, A.},
TITLE = {On the generation of binary trees},
JOURNAL = {J. ACM},
VOLUME = {27},
NUMBER = {1},
PAGES = {1-2},
YEAR = {1980},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Solomon-Finkel/80,
AUTHOR = {Solomon, M. and Finkel, R.A.},
TITLE = {A note on enumerating binary trees},
JOURNAL = {J. ACM},
VOLUME = {27},
NUMBER = {1},
PAGES = {3-5},
YEAR = {1980},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Nassimi-Sahni/80a,
AUTHOR = {Nassimi, D. and Sahni, S.},
TITLE = {An optimal routing algorithm for mesh-connected parallel computers},
JOURNAL = {J. ACM},
VOLUME = {27},
NUMBER = {1},
PAGES = {6-29},
YEAR = {1980},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Pawlikowski/80,
AUTHOR = {Pawlikowski, K.},
TITLE = {Message waiting time in a package switching system},
JOURNAL = {J. ACM},
VOLUME = {27},
NUMBER = {1},
PAGES = {30-41},
YEAR = {1980},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Swartz/80,
AUTHOR = {Swartz, G.B.},
TITLE = {Polling in a loop system},
JOURNAL = {J. ACM},
VOLUME = {27},
NUMBER = {1},
PAGES = {42-59},
YEAR = {1980},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Henderson-Zalcstein/80,
AUTHOR = {Henderson, P.B. and Zalcstein, Y.},
TITLE = {Synchronization problems solvable by generalized PV systems},
JOURNAL = {J. ACM},
VOLUME = {27},
NUMBER = {1},
PAGES = {60-71},
YEAR = {1980},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Silberschatz-Kedem/80,
AUTHOR = {Silberschatz, A. and Kedem, Z.},
TITLE = {Consistency in hierarchical database systems},
JOURNAL = {J. ACM},
VOLUME = {27},
NUMBER = {1},
PAGES = {72-80},
YEAR = {1980},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Lipton-Rosenberg-Yao/80,
AUTHOR = {Lipton, R.J. and Rosenberg, A.L. and Yao, A.C.},
TITLE = {External hashing schemes for collections of data structures},
JOURNAL = {J. ACM},
VOLUME = {27},
NUMBER = {1},
PAGES = {81-95},
YEAR = {1980},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Engelfriet-Schmidt-van_Leeuwen/80,
AUTHOR = {Engelfriet, J. and Schmidt, E.M. and van Leeuwen, J.},
TITLE = {Stack machines and classes of nontested macro languages},
JOURNAL = {J. ACM},
VOLUME = {27},
NUMBER = {1},
PAGES = {96-117},
YEAR = {1980},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Kannan/80,
AUTHOR = {Kannan, R.},
TITLE = {A polynomial algorithm for the two-variable integer programming problem},
JOURNAL = {J. ACM},
VOLUME = {27},
NUMBER = {1},
PAGES = {118-122},
YEAR = {1980},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{DeMillo-Eisenstat-Lipton/80,
AUTHOR = {DeMillo, R.A. and Eisenstat, S.C. and Lipton, R.J.},
TITLE = {Space-time tradeoffs in structured programming: An improved combinatorial embedding theorem},
JOURNAL = {J. ACM},
VOLUME = {27},
NUMBER = {1},
PAGES = {123-127},
YEAR = {1980},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Kaplan-Ullman/80,
AUTHOR = {Kaplan, M.A. and Ullman, J.D.},
TITLE = {A scheme for the automatic inference of variable types},
JOURNAL = {J. ACM},
VOLUME = {27},
NUMBER = {1},
PAGES = {128-145},
YEAR = {1980},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Prabhala-Sethi/80,
AUTHOR = {Prabhala, B. and Sethi, R.},
TITLE = {Efficient computation of expressions with common subexpressions},
JOURNAL = {J. ACM},
VOLUME = {27},
NUMBER = {1},
PAGES = {146-163},
YEAR = {1980},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Wand/80a,
AUTHOR = {Wand, M.},
TITLE = {Continuation-based program transformation strategies},
JOURNAL = {J. ACM},
VOLUME = {27},
NUMBER = {1},
PAGES = {164-180},
YEAR = {1980},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Bender/80,
AUTHOR = {Bender, E.A.},
TITLE = {The number of fanout-free functions with various gates},
JOURNAL = {J. ACM},
VOLUME = {27},
NUMBER = {1},
PAGES = {181-190},
YEAR = {1980},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Suzuki-Jefferson/80,
AUTHOR = {Suzuki, N. and Jefferson, D.},
TITLE = {Verification decidability of Presburger array programs},
JOURNAL = {J. ACM},
VOLUME = {27},
NUMBER = {1},
PAGES = {191-205},
YEAR = {1980},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Yao/80a,
AUTHOR = {Yao, A.C.-C.},
TITLE = {New algorithms for bin packing},
JOURNAL = {J. ACM},
VOLUME = {27},
NUMBER = {2},
PAGES = {207-227},
YEAR = {1980},
KEYWORDS = {Bin packing, first-fit, first-fit-decreasing, heuristic algorithms, NP-complete, online},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Pease-Shostak-Lamport/80,
AUTHOR = {Pease, M. and Shostak, R. and Lamport, L.},
TITLE = {Reaching agreements in the presence of faults},
JOURNAL = {J. ACM},
VOLUME = {27},
NUMBER = {2},
PAGES = {228-234},
YEAR = {1980},
KEYWORDS = {Agreement, authentication, consistency, distributed executive, fault avoidance, fault tolerance, synchronization, voting},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Reiter/80,
AUTHOR = {Reiter, R.},
TITLE = {Equality and domain closure for first-order databases},
JOURNAL = {J. ACM},
VOLUME = {27},
NUMBER = {2},
PAGES = {235-249},
YEAR = {1980},
KEYWORDS = {Equality, closed databases, deductive question-answering, first-order logic, theorem proving, relational databases, projection operator, division operator, definite answers, indefinite answers},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Sagiv/80,
AUTHOR = {Sagiv, Y.},
TITLE = {An algorithm for inferring multivalued dependencies with an application to propositional logic},
JOURNAL = {J. ACM},
VOLUME = {27},
NUMBER = {2},
PAGES = {250-262},
YEAR = {1980},
KEYWORDS = {Relational database, functional dependency, multivalued dependency, membership algorithm, database design, inference rule, propositional logic},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Kameda/80,
AUTHOR = {Kameda, T.},
TITLE = {Testing deadlock-freedom of computer systems},
JOURNAL = {J. ACM},
VOLUME = {27},
NUMBER = {2},
PAGES = {270-280},
YEAR = {1980},
KEYWORDS = {Deadlock, serially reusable resource, resource allocation, process, deadlock algorithm, operating system, efficient algorithm, network flow, bipartite matching, degree-constrained matching, algorithm complexity},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Chow/80,
AUTHOR = {Chow, W.-M.},
TITLE = {The cycle time distribution of exponential cyclic queues},
JOURNAL = {J. ACM},
VOLUME = {27},
NUMBER = {2},
PAGES = {281-286},
YEAR = {1980},
KEYWORDS = {Cyclic queue, cyclic time, exponential distribution, Erlangian distribution},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Gonzalez-Johnson/80,
AUTHOR = {Gonzalez, T.F. and Johnson, D.B.},
TITLE = {A new algorithm for preemptive scheduling of trees},
JOURNAL = {J. ACM},
VOLUME = {27},
NUMBER = {2},
PAGES = {287-312},
YEAR = {1980},
KEYWORDS = {Preemptive schedules, minimum finish time, trees, forests, identical processors, uniform processors, efficient algorithms, optimal schedules},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Reiser-Lavenberg/80,
AUTHOR = {Reiser, M. and Lavenberg, S.S.},
TITLE = {Mean value analysis of closed multichain queuing networks},
JOURNAL = {J. ACM},
VOLUME = {27},
NUMBER = {2},
PAGES = {313-322},
YEAR = {1980},
KEYWORDS = {Queuing networks, closed queuing systems, analytical models, performance evaluation, algorithms for the solution of queuing networks, approximation for general queuing networks},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
NOTE = {see Corrigendum in J. ACM 28, 629},
}
@article{Towsley/80,
AUTHOR = {Towsley, D.},
TITLE = {Queuing network models with state-dependent routing},
JOURNAL = {J. ACM},
VOLUME = {27},
NUMBER = {2},
PAGES = {323-337},
YEAR = {1980},
KEYWORDS = {Queuing theory, queuing networks, local balance, product-form state-dependent routing, load balancing},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Krishnaswamy-Pyster/80,
AUTHOR = {Krishnaswamy, R. and Pyster, A.B.},
TITLE = {On the correctness of semantic-syntax-directed translations},
JOURNAL = {J. ACM},
VOLUME = {27},
NUMBER = {2},
PAGES = {338-355},
YEAR = {1980},
KEYWORDS = {Translation, syntax-directed, semantic-syntax-directed, correctness, semantic-preserving},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Nelson-Oppen/80,
AUTHOR = {Nelson, G. and Oppen, D.C.},
TITLE = {Fast decision procedures based on congruence closure},
JOURNAL = {J. ACM},
VOLUME = {27},
NUMBER = {2},
PAGES = {356-364},
YEAR = {1980},
KEYWORDS = {Program verification, mechanical theorem proving, decision procedure, congruence closure, graph algorithms, theory of equality, theory of recursive data types},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Ward-Halstead/80,
AUTHOR = {Ward, S.A. and Halstead, R.H., Jr.},
TITLE = {A syntactic theory of message passing},
JOURNAL = {J. ACM},
VOLUME = {27},
NUMBER = {2},
PAGES = {365-383},
YEAR = {1980},
KEYWORDS = {Message passing, lambda calculus, programming language semantics, distributed computing, actor semantics},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Abelson/80,
AUTHOR = {Abelson, H.},
TITLE = {Lower bounds on information transfer in distributed computation},
JOURNAL = {J. ACM},
VOLUME = {27},
NUMBER = {2},
PAGES = {384-392},
YEAR = {1980},
KEYWORDS = {Distributed systems, parallel processing},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Lichtenstein-Sipser/80,
AUTHOR = {Lichtenstein, D. and Sipser, M.},
TITLE = {GO is polynomial-space hard},
JOURNAL = {J. ACM},
VOLUME = {27},
NUMBER = {2},
PAGES = {393-401},
YEAR = {1980},
KEYWORDS = {Computational complexity, games, GO, planarity, Pspace hardness},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Oppen/80,
AUTHOR = {Oppen, D.C.},
TITLE = {Reasoning about recursively defined data structures},
JOURNAL = {J. ACM},
VOLUME = {27},
NUMBER = {3},
PAGES = {403-411},
YEAR = {1980},
KEYWORDS = {Recursive data structures, program verification, theorem proving, decidability, logical complexity, simplification},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Altenkamp-Mehlhorn/80,
AUTHOR = {Altenkamp, D. and Mehlhorn, K.},
TITLE = {Codes: Unequal probabilities, unequal letter costs},
JOURNAL = {J. ACM},
VOLUME = {27},
NUMBER = {3},
PAGES = {412-427},
YEAR = {1980},
KEYWORDS = {Codes, unequal letter costs, unequal probabilities, noiseless coding, prefix codes, approximation algorithm, search trees},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Graham-Yao-Yao/80,
AUTHOR = {Graham, R.L. and Yao, A.C. and Yao, F.F.},
TITLE = {Information bounds are weak in the shortest distance problem},
JOURNAL = {J. ACM},
VOLUME = {27},
NUMBER = {3},
PAGES = {428-444},
YEAR = {1980},
KEYWORDS = {Decision tree model, Farkas lemma, information bound, lower bound, maximum flow, polyhedron, shortest distance, shortest path},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Shiloach/80a,
AUTHOR = {Shiloach, Y.},
TITLE = {A polynomial solution to the undirected two paths problem},
JOURNAL = {J. ACM},
VOLUME = {27},
NUMBER = {3},
PAGES = {445-456},
YEAR = {1980},
KEYWORDS = {Algorithm, connectivity, disjoint paths, planarity, two paths problem},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Trivedi-Wagner-Sigmon/80,
AUTHOR = {Trivedi, K.S. and Wagner, R.A. and Sigmon, T.M.},
TITLE = {Optimal selection of CPU speed, device capacities, and file assignments},
JOURNAL = {J. ACM},
VOLUME = {27},
NUMBER = {3},
PAGES = {457-473},
YEAR = {1980},
KEYWORDS = {Capacity planning, computer system design, configuration planning, file assignment problem, nonlinear programming, optimization, performance evaluation, performance-oriented design, queuing networks, systems modeling},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Mendelson-Yechiali/80,
AUTHOR = {Mendelson, H. and Yechiali, U.},
TITLE = {A new approach to the analysis of linear probing schemes},
JOURNAL = {J. ACM},
VOLUME = {27},
NUMBER = {3},
PAGES = {474-483},
YEAR = {1980},
KEYWORDS = {Hashing, collision resolution, linear probing scheme, cyclic probing scheme, ballot theorem},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Abramson-Breitbart-Lewis/80,
AUTHOR = {Abramson, F.G. and Breitbart, Y. and Lewis, F.D.},
TITLE = {Complex properties of grammars},
JOURNAL = {J. ACM},
VOLUME = {27},
NUMBER = {3},
PAGES = {484-498},
YEAR = {1980},
KEYWORDS = {Program-size complexity, combinational complexity, computational complexity, complex Boolean functions, natural complex problems, time/size trade-offs, context-free grammars, formal grammars, pushdown automata, reduction procedures, nonrecursive language, undecidable properties, recursively enumerable sets},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Engelfriet-Rozenberg/80,
AUTHOR = {Engelfriet, J. and Rozenberg, G.},
TITLE = {Fixed point languages, equality languages, and representation of recursively enumerable languages},
JOURNAL = {J. ACM},
VOLUME = {27},
NUMBER = {3},
PAGES = {499-518},
YEAR = {1980},
KEYWORDS = {Equality language, fixed point language, recursively enumerable language, deterministic sequential machine, Turing machine, Post correspondence problem, shuffle, AFL generator, representation of languages},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Fayolle-Mitrani-Iasnogorodski/80,
AUTHOR = {Fayolle, G. and Mitrani, I. and Iasnogorodski, R.},
TITLE = {Sharing a processor among many job classes},
JOURNAL = {J. ACM},
VOLUME = {27},
NUMBER = {3},
PAGES = {519-532},
YEAR = {1980},
KEYWORDS = {Processor sharing, strategy, egalitarian, discriminatory job classes, Laplace transform, Fourier-Stieltjes transform},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Papadimitriou-Kanellakis/80,
AUTHOR = {Papadimitriou, C.H. and Kanellakis, P.C.},
TITLE = {Flowshop scheduling with limited temporary storage},
JOURNAL = {J. ACM},
VOLUME = {27},
NUMBER = {3},
PAGES = {533-549},
YEAR = {1980},
KEYWORDS = {Flowshop scheduling, NP-complete problems, no-wait scheduling},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Sahni-Cho/80,
AUTHOR = {Sahni, S. and Cho, Y.},
TITLE = {Scheduling independent tasks with due times on a uniform processor system},
JOURNAL = {J. ACM},
VOLUME = {27},
NUMBER = {3},
PAGES = {550-563},
YEAR = {1980},
KEYWORDS = {Independent tasks, preemptive schedule, due time, uniform processors, complexity},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Ghezzi-Mandrioli/80,
AUTHOR = {Ghezzi, C. and Mandrioli, D.},
TITLE = {Augmenting parsers to support incrementality},
JOURNAL = {J. ACM},
VOLUME = {27},
NUMBER = {3},
PAGES = {564-579},
YEAR = {1980},
KEYWORDS = {Parsing, parse trees, incremental compilers, shift-reduce algorithms, LR parsers},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Sethi-Tang/80,
AUTHOR = {Sethi, R. and Tang, A.},
TITLE = {Constructing call-by-value continuation semantics},
JOURNAL = {J. ACM},
VOLUME = {27},
NUMBER = {3},
PAGES = {580-597},
YEAR = {1980},
KEYWORDS = {Denotational semantics, transformations between semantic descriptions, reflexive domains, inclusive predicates, directed complete relations, direct semantics, continuation semantics},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Aronson-Jacobs-Minker/80,
AUTHOR = {Aronson, A.R. and Jacobs, B.E. and Minker, J.},
TITLE = {A note on fuzzy deduction},
JOURNAL = {J. ACM},
VOLUME = {27},
NUMBER = {4},
PAGES = {599-603},
YEAR = {1980},
KEYWORDS = {Completeness theorems, deduction, first-order predicate logic, fuzzy logic, resolution},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Lee/80,
AUTHOR = {Lee, D.T.},
TITLE = {Two-dimensional Voronoi diagrams in the $L_p$-metric},
JOURNAL = {J. ACM},
VOLUME = {27},
NUMBER = {4},
PAGES = {604-618},
YEAR = {1980},
KEYWORDS = {Voronoi diagram, $L_p$-metric, computational geometry, computational complexity, analysis of algorithm, divide-and-conquer},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Tsukiyama-Ariyoshi-Shirakawa-Ozaki/80,
AUTHOR = {Tsukiyama, S. and Ariyoshi, H. and Shirakawa, I. and Ozaki, H.},
TITLE = {An algorithm to enumerate all cutsets of a graph in linear time per cutset},
JOURNAL = {J. ACM},
VOLUME = {27},
NUMBER = {4},
PAGES = {619-632},
YEAR = {1980},
KEYWORDS = {Algorithm, backtracking, computational complexity, cutset, enumeration, graph, partition of a set of vertices},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Sagiv-Yannakakis/80,
AUTHOR = {Sagiv, Y. and Yannakakis, M.},
TITLE = {Equivalences among relational expressions with the union and difference operators},
JOURNAL = {J. ACM},
VOLUME = {27},
NUMBER = {4},
PAGES = {633-655},
YEAR = {1980},
KEYWORDS = {Relational database, relational algebra, query optimization, equivalence of queries, conjunctive query, tableau, $NP$-complete, polynomial-time hierarchy, $\Pi^P_2$-complete},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Ehrenfeucht-Rozenberg/80d,
AUTHOR = {Ehrenfeucht, A. and Rozenberg, G.},
TITLE = {The sequence equivalence problem is decidable for OS systems},
JOURNAL = {J. ACM},
VOLUME = {27},
NUMBER = {4},
PAGES = {656-663},
YEAR = {1980},
KEYWORDS = {Formal languages, context-free grammars, OS systems, decision problems},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Maier/80,
AUTHOR = {Maier, D.},
TITLE = {Minimum covers in the relational database model},
JOURNAL = {J. ACM},
VOLUME = {27},
NUMBER = {4},
PAGES = {664-674},
YEAR = {1980},
KEYWORDS = {Relational database, functional dependency, minimum cover, nonredundant cover, efficient algorithms},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Greibach-Friedman/80,
AUTHOR = {Greibach, S.A. and Friedman, E.P.},
TITLE = {Superdeterministic PDAs: A subcase with a decidable inclusion problem},
JOURNAL = {J. ACM},
VOLUME = {27},
NUMBER = {4},
PAGES = {675-700},
YEAR = {1980},
KEYWORDS = {pushdown store acceptor, dpda, deterministic, inclusion problem, equivalence problem},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Schwartz/80,
AUTHOR = {Schwartz, J.T.},
TITLE = {Fast probabilistic algorithms for verification of polynomial identities},
JOURNAL = {J. ACM},
VOLUME = {27},
NUMBER = {4},
PAGES = {701-717},
YEAR = {1980, October},
KEYWORDS = {polynomials, polynomial algorithms, probabilistic algorithms},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Fisher-Hochbaum/80,
AUTHOR = {Fisher, M.L. and Hochbaum, D.S.},
TITLE = {Database location in computer networks},
JOURNAL = {J. ACM},
VOLUME = {27},
NUMBER = {4},
PAGES = {718-735},
YEAR = {1980},
KEYWORDS = {Database location, mathematical programming models},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Ramakrishnan/80,
AUTHOR = {Ramakrishnan, K.G.},
TITLE = {Solving two-commodity transportation problems with coupling constraints},
JOURNAL = {J. ACM},
VOLUME = {27},
NUMBER = {4},
PAGES = {736-757},
YEAR = {1980},
KEYWORDS = {Multicommodity transportation problem, network simplex method, spanning tree basis, coupling constraints, T-basis, bipartite graph},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Downey-Sethi-Tarjan/80,
AUTHOR = {Downey, P.J. and Sethi, R. and Tarjan, R.E.},
TITLE = {Variations on the common subexpression problem},
JOURNAL = {J. ACM},
VOLUME = {27},
NUMBER = {4},
PAGES = {758-771},
YEAR = {1980},
KEYWORDS = {Common subexpression, congruence closure, decision procedure, expression equivalence, graph algorithm, lossless join, relational database, theory of equality, unification, uniform word problem},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Raoult-Vuillemin/80,
AUTHOR = {Raoult, J.-C. and Vuillemin, J.},
TITLE = {Operational and semantic equivalence between recursive programs},
JOURNAL = {J. ACM},
VOLUME = {27},
NUMBER = {4},
PAGES = {772-796},
YEAR = {1980},
KEYWORDS = {Semantics of programming languages, algebraic semantics, subtree replacement systems},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Huet/80,
AUTHOR = {Huet, G.},
TITLE = {Confluent reductions: Abstract properties and applications to term rewriting systems},
JOURNAL = {J. ACM},
VOLUME = {27},
NUMBER = {4},
PAGES = {797-821},
YEAR = {1980},
KEYWORDS = {Church-Rosser property, confluence, combinatorial theories, equational theories, operational semantics, equality theorem proving},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Jaja/80,
AUTHOR = {J{\'a}j{\'a}, J.},
TITLE = {Computation of bilinear forms over finite fields},
JOURNAL = {J. ACM},
VOLUME = {27},
NUMBER = {4},
PAGES = {822-830},
YEAR = {1980},
KEYWORDS = {Algebraic complexity, arithmetic complexity, bilinear forms, complexity theory, tensor rank},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Ladner-Fischer/80,
AUTHOR = {Ladner, Richard E. and Fischer, Michael J.},
TITLE = {Parallel prefix computation},
JOURNAL = {J. ACM},
VOLUME = {27},
NUMBER = {4},
PAGES = {831-838},
YEAR = {1980, October},
KEYWORDS = {automaton, binary addition, circuit, combinational complexity, depth, fanout, parallelism, size, transducer},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Reischuk/80a,
AUTHOR = {Reischuk, R{\"u}diger},
TITLE = {Improved bounds on the problem of time-space trade-off in the pebble game},
JOURNAL = {J. ACM},
VOLUME = {27},
NUMBER = {4},
PAGES = {839-849},
YEAR = {1980, October},
KEYWORDS = {pebble game, straight-line program, register allocation, space bounds, time-space trade-off},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}