@article{Manna-Waldinger/86,
AUTHOR = {Manna, Z. and Waldinger, R.},
TITLE = {Special relations in automated deduction},
JOURNAL = {J. ACM},
VOLUME = {33},
NUMBER = {1},
PAGES = {1-59},
YEAR = {1986},
KEYWORDS = {Automated deduction, built-in theories, equality, monotonicity, orderings, special relations},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Mehlhorn-Preparata/86,
AUTHOR = {Mehlhorn, K. and Preparata, F.P.},
TITLE = {Routing through a rectangle},
JOURNAL = {J. ACM},
VOLUME = {33},
NUMBER = {1},
PAGES = {60-85},
YEAR = {1986},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Chor-Leiserson-Rivest-Shearer/86,
AUTHOR = {Chor, B. and Leiserson, C.E. and Rivest, R.L. and Shearer, J.B.},
TITLE = {An application of number theory to the organization of raster-graphics memory},
JOURNAL = {J. ACM},
VOLUME = {33},
NUMBER = {1},
PAGES = {86-104},
YEAR = {1986},
KEYWORDS = {BITBLT, Fibonacci lattices, golden ratio, interleaving, memory organization, raster graphics, rectangles},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Graham-Mendelzon-Vardi/86,
AUTHOR = {Graham, M.H. and Mendelzon, A.O. and Vardi, M.Y.},
TITLE = {Notions of dependency satisfaction},
JOURNAL = {J. ACM},
VOLUME = {33},
NUMBER = {1},
PAGES = {105-129},
YEAR = {1986},
KEYWORDS = {Completeness, consistency, data dependency, relational database, universal relation, weak universal relation},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Lubachevsky-Mitra/86,
AUTHOR = {Lubachevsky, B. and Mitra, D.},
TITLE = {A chaotic asynchronous algorithm for computing the fixed point of a nonnegative matrix of unit spectral radius},
JOURNAL = {J. ACM},
VOLUME = {33},
NUMBER = {1},
PAGES = {130-150},
YEAR = {1986},
KEYWORDS = {Asynchronous algorithm, chaotic algorithm, fixed point, Markov chains},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Emerson-Halpern/86,
AUTHOR = {Emerson, E.A. and Halpern, J.Y.},
TITLE = {``Sometimes'' and ``not never'' revisited: On branching versus linear time temporal logic},
JOURNAL = {J. ACM},
VOLUME = {33},
NUMBER = {1},
PAGES = {151-178},
YEAR = {1986},
KEYWORDS = {Concurrent programs, parallelism, temporal logic},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Eager-Sevcik/86,
AUTHOR = {Eager, D.L. and Sevcik, K.C.},
TITLE = {Bound hierarchies for multiple-class queuing networks},
JOURNAL = {J. ACM},
VOLUME = {33},
NUMBER = {1},
PAGES = {179-206},
YEAR = {1986},
KEYWORDS = {Asymptotic analysis, bounding algorithms, mean value analysis, product-form queuing networks},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{van_de_Liefvoort-Lipsky/86,
AUTHOR = {van de Liefvoort, A. and Lipsky, L.},
TITLE = {A matrix-algebraic solution to two $K_m$ servers in a loop},
JOURNAL = {J. ACM},
VOLUME = {33},
NUMBER = {1},
PAGES = {207-223},
YEAR = {1986},
KEYWORDS = {Finite population, matrix-geometric solution, queue length, steady state, throughput},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Harel/86,
AUTHOR = {Harel, D.},
TITLE = {Effective transformations on infinite trees, with applications to high undecidability, dominoes, and fairness},
JOURNAL = {J. ACM},
VOLUME = {33},
NUMBER = {1},
PAGES = {224-248},
YEAR = {1986},
KEYWORDS = {Domino problems, dynamic logic, fairness, high undecidability, recurrence lemma, recurring dominoes, recursive trees},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Digricoli-Harrison/86,
AUTHOR = {Digricoli, V.J. and Harrison, M.C.},
TITLE = {Equality-based binary resolution},
JOURNAL = {J. ACM},
VOLUME = {33},
NUMBER = {2},
PAGES = {253-289},
YEAR = {1986},
KEYWORDS = {Binary resolution, equality axioms, equality-based binary resolution, experiments with an RUE theorem prover, paramodulation, proof of completeness, refutation search heuristics, RUE (resolution by unification and equality)},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Asano-Asano-Imai/86,
AUTHOR = {Asano, Ta. and Asano, Te. and Imai, H.},
TITLE = {Partitioning a polygonal region into trapezoids},
JOURNAL = {J. ACM},
VOLUME = {33},
NUMBER = {2},
PAGES = {290-312},
YEAR = {1986},
KEYWORDS = {Approximation algorithm, circle graph, computational complexity, computational geometry, independent set, intersection graph, NP-complete, straight-lines-in-the-plane graph, VLSI design},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Lamport/86,
AUTHOR = {Lamport, L.},
TITLE = {The mutual exclusion problem: Part I - A theory of interprocess communication},
JOURNAL = {J. ACM},
VOLUME = {33},
NUMBER = {2},
PAGES = {313-326},
YEAR = {1986},
KEYWORDS = {Nonatomic operations, readers/writers, shared variables},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Lamport/86a,
AUTHOR = {Lamport, L.},
TITLE = {The mutual exclusion problem: Part II - Statement and solutions},
JOURNAL = {J. ACM},
VOLUME = {33},
NUMBER = {2},
PAGES = {327-348},
YEAR = {1986},
KEYWORDS = {Critical section, shared variables},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Reiter/86,
AUTHOR = {Reiter, R.},
TITLE = {A sound and sometimes complete query evaluation algorithm for relational databases with null values},
JOURNAL = {J. ACM},
VOLUME = {33},
NUMBER = {2},
PAGES = {349-370},
YEAR = {1986},
KEYWORDS = {Completeness proofs, first-order logic, integrity constraints, null values, query evaluation, relational algebra, relational databases, soundness proofs},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Flajolet-Puech/86,
AUTHOR = {Flajolet, P. and Puech, C.},
TITLE = {Partial match retrieval of multidimensional data},
JOURNAL = {J. ACM},
VOLUME = {33},
NUMBER = {2},
PAGES = {371-407},
YEAR = {1986},
KEYWORDS = {Analysis of algorithms, data structures, multidimensional search, partial match, trees},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Abiteboul-Ginsburg/86,
AUTHOR = {Abiteboul, S. and Ginsburg, S.},
TITLE = {Tuple sequences and lexicographic indexes},
JOURNAL = {J. ACM},
VOLUME = {33},
NUMBER = {3},
PAGES = {409-422},
YEAR = {1986},
KEYWORDS = {Dependencies inference rules, structure connected with relational implementation},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Beeri-Kifer/86,
AUTHOR = {Beeri, C. and Kifer, M.},
TITLE = {Elimination of intersection anomalies from database schemes},
JOURNAL = {J. ACM},
VOLUME = {33},
NUMBER = {3},
PAGES = {423-450},
YEAR = {1986},
KEYWORDS = {Acyclic schemes, conflict-free sets of multivalued dependencies, functional dependencies, multivalued dependencies, schema extension},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Chin/86,
AUTHOR = {Chin, F.},
TITLE = {Security problems on inference controls for SUM, MAX, and MIN queries},
JOURNAL = {J. ACM},
VOLUME = {33},
NUMBER = {3},
PAGES = {451-464},
YEAR = {1986},
KEYWORDS = {Compromisability, inference, knowlwedge representation, MAX/MIN queries, NP complete, protection, security, statistical databases, SUM query},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Ginsburg-Hull/86,
AUTHOR = {Ginsburg, S. and Hull, R.},
TITLE = {Sort sets in the relational model},
JOURNAL = {J. ACM},
VOLUME = {33},
NUMBER = {3},
PAGES = {465-488},
YEAR = {1986},
KEYWORDS = {Dependencies, logical implication, ordered domains},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Devroye/86,
AUTHOR = {Devroye, L.},
TITLE = {A note on the heigth of binary search trees},
JOURNAL = {J. ACM},
VOLUME = {33},
NUMBER = {3},
PAGES = {489-498},
YEAR = {1986},
KEYWORDS = {Analysis of algorithms, binary search tree, branching random walk, data structures, expected height of a tree},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Dolev-Lynch-Pinter-Stark-Weihl/86,
AUTHOR = {Dolev, D. and Lynch, N.A. and Pinter, S.S. and Stark, E.W. and Weihl, W.E.},
TITLE = {Reaching approximate agreement in the presence of faults},
JOURNAL = {J. ACM},
VOLUME = {33},
NUMBER = {3},
PAGES = {499-516},
YEAR = {1986},
KEYWORDS = {Agreement problem, approximate agreement problem, asynchronous system, Byzantine agreement problem, consensus problem, distributed computing, fault tolerance, reliability, successive approximation, synchronous system},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Coleman-Edenbrandt-Gilbert/86,
AUTHOR = {Coleman, T.F. and Edenbrandt, A. and Gilbert, J.R.},
TITLE = {Predicting fill for sparse orthogonal factorization},
JOURNAL = {J. ACM},
VOLUME = {33},
NUMBER = {3},
PAGES = {517-532},
YEAR = {1986},
KEYWORDS = {Bipartite graphs, block triangular form, fill, Givens rotations, least squares, matching, orthogonal factorization, sparse matrices},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Hochbaum-Shmoys/86,
AUTHOR = {Hochbaum, D.S. and Shmoys, D.B.},
TITLE = {A unified approach to approximation algorithms for bottleneck problems},
JOURNAL = {J. ACM},
VOLUME = {33},
NUMBER = {3},
PAGES = {533-550},
YEAR = {1986},
KEYWORDS = {Approximation algorithm, center problem, combinatorial optimization, communication network, heuristics, routing, worst-case analysis},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Singh/86,
AUTHOR = {Singh, S.},
TITLE = {Improved methods for storing and updating information in the out-of-kilter algorithm},
JOURNAL = {J. ACM},
VOLUME = {33},
NUMBER = {3},
PAGES = {551-567},
YEAR = {1986},
KEYWORDS = {Efficiency, experimental testing, mathematical software, minimum-cost network flow},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Mitra-McKenna/86,
AUTHOR = {Mitra, D. and McKenna, J.},
TITLE = {Asymptotic expansions for closed Markovian networks with state-dependent service rates},
JOURNAL = {J. ACM},
VOLUME = {33},
NUMBER = {3},
PAGES = {568-592},
YEAR = {1986},
KEYWORDS = {Asymptotics, integral representations, load dependence},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Tsitsiklis-Papadimitriou-Humblet/86,
AUTHOR = {Tsitsiklis, J.N. and Papadimitriou, C.H. and Humblet, P.},
TITLE = {The performance of a precedence-based queuing discipline},
JOURNAL = {J. ACM},
VOLUME = {33},
NUMBER = {3},
PAGES = {593-602},
YEAR = {1986},
KEYWORDS = {Database concurrency control, queuing theory, random dag, static locking, throughput},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Balcazar-Book-Schoning/86,
AUTHOR = {Balc{\'a}zar, J.L. and Book, R.V. and Sch{\"o}ning, U.},
TITLE = {The polynomial-time hierarchy and sparse oracles},
JOURNAL = {J. ACM},
VOLUME = {33},
NUMBER = {3},
PAGES = {603-617},
YEAR = {1986},
KEYWORDS = {Polynomial-time hierarchy, relativizations, sparse oracles},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Long-Selman/86,
AUTHOR = {Long, T.J. and Selman, A.L.},
TITLE = {Relativizing complexity classes with sparse oracles},
JOURNAL = {J. ACM},
VOLUME = {33},
NUMBER = {3},
PAGES = {618-627},
YEAR = {1986},
KEYWORDS = {Oracles, polynomial hierarchy, sparse sets, tally languages},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{de_Champeaux/86,
AUTHOR = {de Champeaux, D.},
TITLE = {Subproblem finder and instance checker, two cooperating modules for theorem provers},
JOURNAL = {J. ACM},
VOLUME = {33},
NUMBER = {4},
PAGES = {633-657},
YEAR = {1986},
KEYWORDS = {alphabetic variant recognition, meta properties, problem decomposition, special case recognition},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Grimson/86,
AUTHOR = {Grimson, W.E.L.},
TITLE = {The combinatorics of local constraints in model-based recognition and localization from sparse data},
JOURNAL = {J. ACM},
VOLUME = {33},
NUMBER = {4},
PAGES = {658-686},
YEAR = {1986},
KEYWORDS = {combinatorial complexity, constrained search, constraint propagation, object recognition, recognition, search},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Ramachandran/86,
AUTHOR = {Ramachandran, Vijaya},
TITLE = {On driving many long wires in a VLSI layout},
JOURNAL = {J. ACM},
VOLUME = {33},
NUMBER = {4},
PAGES = {687-701},
YEAR = {1986},
KEYWORDS = {capacitive delay, drivers and area bounds},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Chaudhuri-Rao/86,
AUTHOR = {Chaudhuri, R. and Rao, A.N.V.},
TITLE = {Approximating grammar probabilities: Solution of a conjecture},
JOURNAL = {J. ACM},
VOLUME = {33},
NUMBER = {4},
PAGES = {702-705},
YEAR = {1986},
KEYWORDS = {estimation, languages, probabilistic grammars, sample},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Collings-Hembree/86,
AUTHOR = {Collings, B.J. and Hembree, G.B.},
TITLE = {Initializing generalized feedback shift register pseudorandom number generators},
JOURNAL = {J. ACM},
VOLUME = {33},
NUMBER = {4},
PAGES = {706-711},
YEAR = {1986},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Cosnard-Robert/86,
AUTHOR = {Cosnard, M. and Robert, Y.},
TITLE = {Complexity of parallel $QR$ factorization},
JOURNAL = {J. ACM},
VOLUME = {33},
NUMBER = {4},
PAGES = {712-723},
YEAR = {1986},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Apt-Plotkin/86,
AUTHOR = {Apt, K.R. and Plotkin, G.D.},
TITLE = {Countable nondeterminism and random assignment},
JOURNAL = {J. ACM},
VOLUME = {33},
NUMBER = {4},
PAGES = {724-767},
YEAR = {1986},
KEYWORDS = {continuity, fairness, nondeterminism, powerdomains, predicate transformers},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Conway-Georganas/86,
AUTHOR = {Conway, A.E. and Georganas, N.D.},
TITLE = {RECAL - A new efficient algorithm for the exact analysis of multiple-chain queuing networks},
JOURNAL = {J. ACM},
VOLUME = {33},
NUMBER = {4},
PAGES = {768-791},
YEAR = {1986},
KEYWORDS = {closed queuing networks, dynamic scaling, exact analysis, multiple chains, normalization constants, product-form solution, recursion by chain},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Goldreich-Goldwasser-Micali/86,
AUTHOR = {Goldreich, O. and Goldwasser, S. and Micali, S.},
TITLE = {How to construct random functions},
JOURNAL = {J. ACM},
VOLUME = {33},
NUMBER = {4},
PAGES = {792-807},
YEAR = {1986},
KEYWORDS = {cryptography, one-way functions, prediction problems, randomness},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Kannan-Lipton/86,
AUTHOR = {Kannan, R. and Lipton, R.J.},
TITLE = {Polynomial-time algorithm for the orbit problem},
JOURNAL = {J. ACM},
VOLUME = {33},
NUMBER = {4},
PAGES = {808-821},
YEAR = {1986},
KEYWORDS = {linear sequential machines, linear transformations, matrix orbits},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Rowland-Cowles/86,
AUTHOR = {Rowland, J.H. and Cowles, J.R.},
TITLE = {Small sample algorithms for the identification of polynomials},
JOURNAL = {J. ACM},
VOLUME = {33},
NUMBER = {4},
PAGES = {822-829},
YEAR = {1986},
KEYWORDS = {test data selection},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}