%A A. Bagchi %A A. Mahanti %T Three approaches to heuristic search in networks %J Journal of the ACM %K jacm %V 32 %N 1 %D January 1985 %P 1-27 %K artificial intelligence %A A. Mahanti %A A. Bagchi %T AND/OR graph heuristic search methods %J Journal of the ACM %K jacm %V 32 %N 1 %D January 1985 %P 28-51 %K artificial intelligence %A Leslie Lamport %A P.M. Melliar-Smith %T Synchronizing clocks in the presence of faults %J Journal of the ACM %K jacm %V 32 %N 1 %D January 1985 %P 52-78 %K computer systems %A Serge Abiteboul %T Disaggregations in databases %J Journal of the ACM %K jacm %V 32 %N 1 %D January 1985 %P 79-101 %K database theory %A Ken Fuchs %A Dennis Kafura %T Memory-constrained task scheduling on a network of dual processors %J Journal of the ACM %K jacm %V 32 %N 1 %D January 1985 %P 102-129 %K operating systems %A Dorit S. Hochbaum %A Wolfgang Maass %T Approximation schemes for covering and packing problems in image processing and VLSI %J Journal of the ACM %K jacm %V 32 %N 1 %D January 1985 %P 130-136 %K operations research %A Matthew Hennessy %A Robin Milner %T Algebraic laws for nondeterminism and concurrency %J Journal of the ACM %K jacm %V 32 %N 1 %D January 1985 %P 137-161 %K languages and systems %A Hendrik Vantilborgh %T Aggregation with an error of O(eps^2) %J Journal of the ACM %K jacm %V 32 %N 1 %D January 1985 %P 162-190 %K system modeling and analysis %A Danny Dolev %A Rudiger Reischuk %T Bounds on information exchange for Byzantine agreement %J Journal of the ACM %K jacm %V 32 %N 1 %D January 1985 %P 191-204 %K theory of computation %A Shimon Even %A Alan L. Selman %A Yacob Yacobi %T Hard-core theorems for complexity classes %J Journal of the ACM %K jacm %V 32 %N 1 %D January 1985 %P 205-217 %K theory of computation %A Maria M. Klawe %T A tight bound for black and white pebbles on the pyramid %J Journal of the ACM %K jacm %V 32 %N 1 %D January 1985 %P 218-228 %K theory of computation %A J.C. Lagarias %A A.M. Odlyzko %T Solving low-density subset sum problems %J Journal of the ACM %K jacm %V 32 %N 1 %D January 1985 %P 229-246 %K theory of computation %A M.A. Bauer %T Soundness and completeness of a synthesis algorithm based on example computations %J Journal of the ACM %K jacm %V 32 %N 2 %D April 1985 %P 249-279 %K artificial intelligence %A G. Gottlob %A A. Leitsch %T On the efficiency of subsumption algorithms %J Journal of the ACM %K jacm %V 32 %N 2 %D April 1985 %P 280-295 %K artificial intelligence %A Ching-Chy Wang %A Errol L. Lloyd %A Mary Lou Soffa %T Feedback vertex sets and cyclically reducible graphs %J Journal of the ACM %K jacm %V 32 %N 2 %D April 1985 %P 296-313 %K combinatorics and graph theory %A G.N. Buckley %A A. Silberschatz %T Beyond two-phase locking %J Journal of the ACM %K jacm %V 32 %N 2 %D April 1985 %P 314-326 %K database theory %A Brenda S. Baker %A Adward G. Coffman,\ Jr. %A Dan E. Willard %T Algorithms for resolving conflicts in dynamic storage allocation %J Journal of the ACM %K jacm %V 32 %N 2 %D April 1985 %P 327-343 %K data structures and algorithms %A M.E. Gonzalez\ Smith %A J.A. Storer %T Parallel algorithms for data compression %J Journal of the ACM %K jacm %V 32 %N 2 %D April 1985 %P 344-373 %K data structures and algorithms %A Michael J. Fischer %A Nancy A. Lynch %A Michael S. Paterson %T Impossibility of distributed consensus with one faulty process %J Journal of the ACM %K jacm %V 32 %N 2 %D April 1985 %P 374-382 %K distributed computing %A G. Cornuejols %A D. Naddef %A W. Pulleyblank %T The travelling salesman problem in graphs with 3-edge cutsets %J Journal of the ACM %K jacm %V 32 %N 2 %D April 1985 %P 383-410 %K operations research %A John Staples %A V.L. Nguyen %T A fixpoint semantics for nondeterministic data flow %J Journal of the ACM %K jacm %V 32 %N 2 %D April 1985 %P 411-444 %K programming language and methodology %A Asser N. Tantawi %A Don Towsley %T Optimal static load balancing in distributed computer systems %J Journal of the ACM %K jacm %V 32 %N 2 %D April 1985 %P 445-465 %K system modeling and analysis %A Eitan M. Gurari %T Decidable problems for powerful programs %J Journal of the ACM %K jacm %V 32 %N 2 %D April 1985 %P 466-483 %K theory of computation %A S. Skyum %A L.G. Valiant %T A complexity theory based on Boolean algebra %J Journal of the ACM %K jacm %V 32 %N 2 %D April 1985 %P 484-502 %K theory of computation %A Rina Dechter %A Judea Pearl %T Generalized best-first search strategies and the optimality of A* %J Journal of the ACM %K jacm %V 32 %N 3 %D July 1985 %P 505-536 %K artificial intelligence %A Edward A. Bender %A Jon T. Butler %T Enumeration of structured flowcharts %J Journal of the ACM %K jacm %V 32 %N 3 %D July 1985 %P 537-548 %K combinatorics and graph theory %A William H. Cunningham %T Optimal attack and reinforcement of a network %J Journal of the ACM %K jacm %V 32 %N 3 %D July 1985 %P 549-561 %K combinatorics and graph theory %A C.C. Lee %A D.T. Lee %T A simple on-line bin-packing algorithm %J Journal of the ACM %K jacm %V 32 %N 3 %D July 1985 %P 562-572 %K complexity of algorithms %A Bernard Chazelle %A Louis Monier %T A model of computation for VLSI with related complexity results %J Journal of the ACM %K jacm %V 32 %N 3 %D July 1985 %P 573-588 %K computer systems %A Albert G. Greenberg %A Shmuel Winograd %T A lower bound on the time needed in the worst case to resolve conflicts deterministically in multiple access channels %J Journal of the ACM %K jacm %V 32 %N 3 %D July 1985 %P 589-596 %K computer systems %A Dan E. Willard %A George S. Lueker %T Adding range restriction capability to dynamic data structures %J Journal of the ACM %K jacm %V 32 %N 3 %D July 1985 %P 597-617 %K database theory %A Y.C. Tay %A Rajan Suri %A Nathan Goodman %T A mean value performance model for locking in databases: the no-waiting case %J Journal of the ACM %K jacm %V 32 %N 3 %D July 1985 %P 618-651 %K database theory %A Daniel Dominic Sleator %A Robert Endre Tarjan %T Self-adjusting binary search trees %J Journal of the ACM %K jacm %V 32 %N 3 %D July 1985 %P 652-686 %K data structures and algorithms, splay trees %A Andrew C. Yao %T Uniform hashing is optimal %J Journal of the ACM %K jacm %V 32 %N 3 %D July 1985 %P 687-693 %K data structures and algorithms %A David Zerling %T Generating binary trees using rotations %J Journal of the ACM %K jacm %V 32 %N 3 %D July 1985 %P 694-701 %K data structures and algorithms %A Wei-Lu Cao %A William J. Stewart %T Iterative aggregation/disaggregation techniques for nearly uncoupled Markov chains %J Journal of the ACM %K jacm %V 32 %N 3 %D July 1985 %P 702-719 %K system modeling and analysis %A Udi Manber %A Martin Tompa %T The complexity of problems on probabilistic, nondeterministic, and alternating decision trees %J Journal of the ACM %K jacm %V 32 %N 3 %D July 1985 %P 720-732 %K theory of computation %A A.P. Sistla %A E.M. Clarke %T The complexity of propositional linear temporal logics %J Journal of the ACM %K jacm %V 32 %N 3 %D July 1985 %P 733-749 %K theory of computation %A Eugene C. Freuder %T A sufficient condition for backtrack-bounded search %J Journal of the ACM %K jacm %V 32 %N 4 %D October 1985 %P 755-761 %K artificial intelligence %A Richard M. Karp %A Avi Widgerson %T A fast parallel algorithm for the maximal independent set problem %J Journal of the ACM %K jacm %V 32 %N 4 %D October 1985 %P 762-773 %K combinatorics and graph theory %A Domenico Sacca %T Closures of database hypergraphs %J Journal of the ACM %K jacm %V 32 %N 4 %D October 1985 %P 774-803 %K database theory %A Baruch Awerbuch %T Complexity of network synchronization %J Journal of the ACM %K jacm %V 32 %N 4 %D October 1985 %P 804-823 %K distributed computing %A Gabriel Bracha %A Sam Toueg %T Asynchronous consensus and broadcast protocols %J Journal of the ACM %K jacm %V 32 %N 4 %D October 1985 %P 824-840 %K distributed computing %A Hector Gercia-Molina %A Daniel Barbara %T How to assign votes in a distributed system %J Journal of the ACM %K jacm %V 32 %N 4 %D October 1985 %P 841-860 %K distributed computing %A Ulrich Faigle %T On ordered languages and the optimization of linear functions by greedy algorithms %J Journal of the ACM %K jacm %V 32 %N 4 %D October 1985 %P 861-870 %K operations research %A Alian Adler %A Nimrod Megiddo %T A simplex algorithm whose average number of steps is bounded between two quadratic functions of the smaller dimension %J Journal of the ACM %K jacm %V 32 %N 4 %D October 1985 %P 871-895 %K operations research %A M. Hennessy %T Acceptance trees %J Journal of the ACM %K jacm %V 32 %N 4 %D October 1985 %P 896-928 %K programming languages and systems %A Friedhelm Meyer\ auf\ der\ Heide %T Lower bounds for solving linear Diophantine equations on random access machines %J Journal of the ACM %K jacm %V 32 %N 4 %D October 1985 %P 929-937 %K theory of computation %A Shlomo Moran %A Marc Snir %A Udi Manber %T Applications of Ramsey's theorem to decision tree complexity %J Journal of the ACM %K jacm %V 32 %N 4 %D October 1985 %P 938-949 %K theory of computation %A Mihalis Yannakakis %T A polynomial algorithm for the min-cut linear arrangement of trees %J Journal of the ACM %K jacm %V 32 %N 4 %D October 1985 %P 950-988 %K theory of computation %A Zohar Manna %A Richard Waldinger %T Special relations in automated deduction %J Journal of the ACM %K jacm %V 33 %N 1 %D January 1986 %P 1-59 %K artificial intelligence %A K. Mehlhorn %A F.P. Preparata %T Routing through a rectangle %J Journal of the ACM %K jacm %V 33 %N 1 %D January 1986 %P 60-85 %K circuit design %A Benny Chor %A Charles E. Leiserson %A Ronald L. Rivest %A James B. Shearer %T An application of number theory to the organization of raster-graphics memory %J Journal of the ACM %K jacm %V 33 %N 1 %D January 1986 %P 86-104 %K computer systems %A Marc H. Graham %A Alberto O. Mendelzon %A Moshe Y. Vardi %T Notions of dependency satisfaction %J Journal of the ACM %K jacm %V 33 %N 1 %D January 1986 %P 105-129 %K database theory %A Boris Lubachevsky %A Debasis Mitra %T A chaotic asynchronous algorithm for computing the fixed point of a nonnegative matrix of unit spectral radius %J Journal of the ACM %K jacm %V 33 %N 1 %D January 1986 %P 130-150 %K numerical computation %A E. Allen Emerson %A Joseph Y. Halpern %T "Sometimes" and "not never" revisited: on branching versus linear time temporal logic %J Journal of the ACM %K jacm %V 33 %N 1 %D January 1986 %P 151-178 %K programming languages and methodology %A Derek L. Eager %A Kenneth C. Sevcik %T Bound hierarchies for multiple-class queueing networks %J Journal of the ACM %K jacm %V 33 %N 1 %D January 1986 %P 179-206 %K system modeling and analysis %A Appie van\ de\ Liefvoort %A Lester Lipsky %T A matrix-algebraic solution to two Km servers in a loop %J Journal of the ACM %K jacm %V 33 %N 1 %D January 1986 %P 207-223 %K system modeling and analysis %A David Harel %T Effective transformations on infinite trees, with applications to high undecidability, dominoes, and fairness %J Journal of the ACM %K jacm %V 33 %N 1 %D January 1986 %P 224-248 %K theory of computation %A Vincent J. Digricoli %A Malcolm C. Harrison %T Equality-based binary resolution %J Journal of the ACM %K jacm %V 33 %N 2 %D April 1986 %P 253-289 %A Takao Asano %A Tetsuo Asano %A Hiroshi Imai %T Partitioning a polygonal region into trapezoids %J Journal of the ACM %K jacm %V 33 %N 2 %D April 1986 %P 290-312 %A Leslie Lamport %T The mutual exclusion problem: part I - a theory of interprocess communication %J Journal of the ACM %K jacm %V 33 %N 2 %D April 1986 %P 313-326 %A Leslie Lamport %T The mutual exclusion problem: part II - statement and solutions %J Journal of the ACM %K jacm %V 33 %N 2 %D April 1986 %P 327-348 %A Raymond Reiter %T A sound and sometimes complete query evaluation algorithm for relational databases with null values %J Journal of the ACM %K jacm %V 33 %N 2 %D April 1986 %P 349-370 %A Philippe Flajolet %A Claude Puech %T Partial match retrieval of multidimensional data %J Journal of the ACM %K jacm %V 33 %N 2 %D April 1986 %P 371-407 %A Serge Abiteboul %A Seymour Ginsburg %T Tuple sequences and lexicographic indexes %J Journal of the ACM %K jacm %V 33 %N 3 %D July 1986 %P 409-422 %K database theory %A Catriel Beeri %A Michael Kifer %T Elimination of intersection anomalies from database schemes %J Journal of the ACM %K jacm %V 33 %N 3 %D July 1986 %P 423-450 %K database theory %A Francis Chin %T Security problems on inference controls for SUM, MAX, and MIN queries %J Journal of the ACM %K jacm %V 33 %N 3 %D July 1986 %P 451-464 %K database theory %A Seymour Ginsburg %A Richard Hull %T Sort sets in the relational model %J Journal of the ACM %K jacm %V 33 %N 3 %D July 1986 %P 465-488 %K database theory %A Luc Devroye %T A note on the height of binary search trees %J Journal of the ACM %K jacm %V 33 %N 3 %D July 1986 %P 489-498 %K data structures and algorithms %A Danny Dolev %A Nancy A. Lynch %A Shlomit S. Pinter %A Eugene W. Stark %A William E. Weihl %T Reaching approximate agreement in the presence of faults %J Journal of the ACM %K jacm %V 33 %N 3 %D July 1986 %P 499-516 %K distributed computing %A Thomas F. Coleman %A Anders Edenbrandt %A John R. Gilbert %T Predicting fill for sparse orthogonal factorization %J Journal of the ACM %K jacm %V 33 %N 3 %D July 1986 %P 517-532 %K numerical computation %A Dorit S. Hochbaum %A David S. Shmoys %T A unified approach to approximation algorithms for bottleneck problems %J Journal of the ACM %K jacm %V 33 %N 3 %D July 1986 %P 533-550 %K operations research %A Samar Singh %T Improved methods for storing and updating information in the out-of-kilter algorithm %J Journal of the ACM %K jacm %V 33 %N 3 %D July 1986 %P 551-567 %K operations research %A Debasis Mitra %A J. McKenna %T Asymptotic expansions for closed Markovian networks with state-dependent service rates %J Journal of the ACM %K jacm %V 33 %N 3 %D July 1986 %P 568-592 %K system modeling and analysis %A John R. Tsitsiklis %A Christos H. Papadimitriou %A Pierre Humblet %T The performance of a precedence-based queueing discipline %J Journal of the ACM %K jacm %V 33 %N 3 %D July 1986 %P 593-602 %K system modeling and analysis %A Jose L. Balcazar %A Ronald V. Book %A Uwe Schoning %T The polynomial-time hierarchy and sparse oracles %J Journal of the ACM %K jacm %V 33 %N 3 %D July 1986 %P 603-617 %K theory of computation %A Timothy J. Long %A Alan L. Selman %T Relativizing complexity classes with sparse oracles %J Journal of the ACM %K jacm %V 33 %N 3 %D July 1986 %P 618-627 %K theory of computation %A Dennis de\ Champeaux %T Subproblem finder and instance checker, two cooperating modules for theorem provers %J Journal of the ACM %K jacm %V 33 %N 4 %D October 1986 %P 633-657 %K artificial intelligence %A W. Eric L. Grimson %T The ocmbinatorics of local constraints in model-based recognition and localization from sparse data %J Journal of the ACM %K jacm %V 33 %N 4 %D October 1986 %P 658-686 %K artificial intelligence %A Vijaya Ramachandran %T On driving many long wires in a VLSI layout %J Journal of the ACM %K jacm %V 33 %N 4 %D October 1986 %P 687-701 %K computer systems %A R. Chaudhuri %A A.N.V. Rao %T Approximating grammar probabiolities: solution of a conjecture %J Journal of the ACM %K jacm %V 33 %N 4 %D October 1986 %P 702-705 %K formal languages %A Bruce Jay Collings %A G. Barry Hembree %T Initializing generalized feedback shift register pseudorandom number generators %J Journal of the ACM %K jacm %V 33 %N 4 %D October 1986 %P 706-711 %K numerical computation %A M. Cosnard %A Y. Robert %T Complexity of parallel QR factorization %J Journal of the ACM %K jacm %V 33 %N 4 %D October 1986 %P 712-723 %K numerical computation %A K.R. Apt %A G.D. Plotkin %T Countable nondeterminism and random assignment %J Journal of the ACM %K jacm %V 33 %N 4 %D October 1986 %P 724-767 %K programming languages and systems %A A.E. onway %A N.D. Georganas %T RECAL - a new efficient algorithm for the exact analysis of multiple-chain queueing networks %J Journal of the ACM %K jacm %V 33 %N 4 %D October 1986 %P 768-791 %K system modeling and analysis %A Oded Goldreich %A Shafi Goldwasser %A Silvio Micali %T How to construct random functions %J Journal of the ACM %K jacm %V 33 %N 4 %D October 1986 %P 792-807 %K theory of computation %A R. Kanna %A R.J. Lipton %T Polynomial-time algorithm for the orbit problem %J Journal of the ACM %K jacm %V 33 %N 4 %D October 1986 %P 808-821 %K theory of computation %A John H. Rowland %A John R. Collins %T Small sample algorithms for the identification of plynomials %J Journal of the ACM %K jacm %V 33 %N 4 %D October 1986 %P 822-831 %K theory of computation %A B. Chazelle %A D.P. Dobkin %T Intersection of convex objects in two and three dimensions %J Journal of the ACM %K jacm %V 34 %N 1 %D January 1987 %P 1-27 %K computational geometry %A Victor Vianu %T Dynamic functional dependencies and database aging %J Journal of the ACM %K jacm %V 34 %N 1 %D January 1987 %P 28-59 %K database theory %A John H. Reif %A Leslie G. Valiant %T Logarithmic time sort for linear size networks %J Journal of the ACM %K jacm %V 34 %N 1 %D January 1987 %P 60-76 %K data structures and algorithms %A Danny DOlev %A Cynthia Dwork %A Larry Stockmeyer %T On the minimal synchronism needed for distributed consensus %J Journal of the ACM %K jacm %V 34 %N 1 %D January 1987 %P 77-97 %K distributed computing %A Greg N. Frederickson %A Nancy A. Lynch %T Electing a leader in a synchronous ring %J Journal of the ACM %K jacm %V 34 %N 1 %D January 1987 %P 98-115 %K distributed computing %A Eli Upfal %A Avi Wigderson %T How to share memory in a distributed system %J Journal of the ACM %K jacm %V 34 %N 1 %D January 1987 %P 116-127 %K distributed computing %A Yoshihito Toyama %T On the Church-Rosser property for the direct sum of term rewriting systems %J Journal of the ACM %K jacm %V 34 %N 1 %D January 1987 %P 128-143 %K formal languages %A Dorit S. Hochbaum %A David B. Shmoys %T Using dual approximation algorithms for scheduling problems: theoretical and practical results %J Journal of the ACM %K jacm %V 34 %N 1 %D January 1987 %P 144-162 %K operations research %A Rudiger Reischuk %T Simultaneous writes of parallel random access machines do not help to compute simple arithmetic functions %J Journal of the ACM %K jacm %V 34 %N 1 %D January 1987 %P 163-178 %K parallel processing %A Lorenzo Donatiello %A Balakrishna R. Iyer %T Analysis of a composite performance reliability mesure for fault-tolerant systems %J Journal of the ACM %K jacm %V 34 %N 1 %D January 1987 %P 179-199 %K system modeling and analysis %A Richard Cole %T Slowing down sorting networks to obtain faster sorting algorithms %J Journal of the ACM %K jacm %V 34 %N 1 %D January 1987 %P 200-208 %K theory of computation %A Alasdair Urquhart %T Hard examples for resolution %J Journal of the ACM %K jacm %V 34 %N 1 %D January 1987 %P 209-219 %K theory of computation %A Neil V. Murray %A Erik Rosenthal %T Inference with path resolution and semantic graphs %J Journal of the ACM %K jacm %V 34 %N 2 %D April 1987 %P 225-254 %K artificial intelligence %A Wen-Lianm Hsu %T Recognizing planar perfect graphs %J Journal of the ACM %K jacm %V 34 %N 2 %D April 1987 %P 255-288 %K combinatorics and graph theory %A Albert G. Greenberg %A Philippe Flajolet %A Richard E. Ladner %T Estimating the multiplicities of conflicts to speed their resolution in multiple access channels %J Journal of the ACM %K jacm %V 34 %N 2 %D April 1987 %P 289-325 %K computer systems %A Yann-Hang Lee %A Kang G. Shin %T Optimal reconfiguration strategy for a degradable multimodule computing system %J Journal of the ACM %K jacm %V 34 %N 2 %D April 1987 %P 326-348 %K computer systems %A Edward P.F. Chan %A Alberto O. Mendelzon %T Answering queries on embedded-complete database schemes %J Journal of the ACM %K jacm %V 34 %N 2 %D April 1987 %P 349-375 %A Christos A. Papachristou %T Associative table lookup processing for multioperand residue arithmetic %J Journal of the ACM %K jacm %V 34 %N 2 %D April 1987 %P 376-396 %K data structures and algorithms %A Georg Ch. Pflug %A Hans W. Kessler %T Linear probing with a nonuniform address distribution %J Journal of the ACM %K jacm %V 34 %N 2 %D April 1987 %P 397-410 %K data structures and algorithms %A Pierpaolo Degano %A Ugo Montanari %T A model for distributed systems based on graph rewriting %J Journal of the ACM %K jacm %V 34 %N 2 %D April 1987 %P 411-449 %K distributed computing %A David Peleg %T Concurrent dynamic logic %J Journal of the ACM %K jacm %V 34 %N 2 %D April 1987 %P 450-479 %K programming languages and systems %A Steven Homer %T Minimal degrees for polynomial reducibilities %J Journal of the ACM %K jacm %V 34 %N 2 %D April 1987 %P 480-491 %K theory of computation %A K.N. Venkataraman %T Decidability of the purely existential fragment of the theory of term algebras %J Journal of the ACM %K jacm %V 34 %N 2 %D April 1987 %P 492-510 %K theory of computation %A Zvi Galil %A Christoph M. Hoffmann %A Eugene M. Luks %A Claus P. Schnorr %A Andreas Weber %T An O(n^3 log n) deterministic and an O(n^3) Las Vegas isomorphism test for trivalent graphs %J Journal of the ACM %K jacm %V 34 %N 3 %D July 1987 %P 513-531 %K combinatorics and graph theory %A Robert W. Irving %A Paul Leather %A Dan Gusfield %T An efficient algorithm for the "optimal" stable marriage %J Journal of the ACM %K jacm %V 34 %N 3 %D July 1987 %P 532-543 %K combinatorics and graph theory %A Catriel Beeri %A Michael Kifer %T A theory of intersection anomalies in relational database schemes %J Journal of the ACM %K jacm %V 34 %N 3 %D July 1987 %P 544-577 %K database theory %A A. Blumer %A J. Blumer %A D. Haussler %A R. McConnell %A A. Ehrenfeucht %T Complete inverted files for efficient text retrieval and analysis %J Journal of the ACM %K jacm %V 34 %N 3 %D July 1987 %P 578-595 %K data structures and algorithms %A Michael L. Fredman %A Robert Endre Tarjan %T Fibonacci heaps and their uses in improved network optimization algorithms %J Journal of the ACM %K jacm %V 34 %N 3 %D July 1987 %P 596-615 %K data structures and algorithms %A D.S. Hirschberg %A L.L. Larmore %T New applications of failure functions %J Journal of the ACM %K jacm %V 34 %N 3 %D July 1987 %P 616-625 %K data structures and algorithms %A T.K. Srikanth %A Sam Toueg %T Optimal clock synchronization %J Journal of the ACM %K jacm %V 34 %N 3 %D July 1987 %P 626-645 %K distributed computing %A Stanley Cabay %A Bart Domzy %T Systems of linear equations with dense univariate polunomial coefficients %J Journal of the ACM %K jacm %V 34 %N 3 %D July 1987 %P 646-660 %K numerical analysis %A Randolph Nelson %T Stochastic catastrophe theory in computer performance modeling %J Journal of the ACM %K jacm %V 34 %N 3 %D July 1987 %P 661-685 %K system modeling and analysis %A Rajan Suri %T Infinitesimal perturbation analysis for general discrete event systems %J Journal of the ACM %K jacm %V 34 %N 3 %D July 1987 %P 686-717 %K system modeling and analysis %A Ronald V. Book %A Ding-Zhu Du %T The existence and density of generalized complexity cores %J Journal of the ACM %K jacm %V 34 %N 3 %D July 1987 %P 718-730 %K theory of computation %A Michio Oyamaguchi %T The equivalence problem for real-time DPDAs %J Journal of the ACM %K jacm %V 34 %N 3 %D July 1987 %P 731-760 %K theory of computation