@article{Rathmann-Winslett-Manasse/94,
AUTHOR = {Rathmann, Peter K. and Winslett, Marianne and Manasse, Mark},
TITLE = {Circumscription with homomorphisms: Solving the equality and counterexample problems},
JOURNAL = {J. ACM},
VOLUME = {41},
NUMBER = {5},
PAGES = {819-873},
YEAR = {1994},
KEYWORDS = {circumscription, common sense reasoning},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Glass-Ni/94,
AUTHOR = {Glass, Christopher J. and Ni, Lionel M.},
TITLE = {The turn model for adaptive routing},
JOURNAL = {J. ACM},
VOLUME = {41},
NUMBER = {5},
PAGES = {874-902},
YEAR = {1994},
KEYWORDS = {adaptive routing, deadlock, hypercube, massively parallel computers, mesh topology, wormhole routing},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Dallery-Liu-Towsley/94,
AUTHOR = {Dallery, Yves and Liu, Zhen and Towsley, Don},
TITLE = {Equivalence, reversibility, symmetry and concavity properties in fork-join networks with blocking},
JOURNAL = {J. ACM},
VOLUME = {41},
NUMBER = {5},
PAGES = {903-942},
YEAR = {1994},
KEYWORDS = {blocking before service, concavity, duality, equivalence, fork-join queuing networks, marked graphs, queuing theory, symmetry, throughput},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Driscoll-Sleator-Tarjan/94,
AUTHOR = {Driscoll, James R. and Sleator, Daniel D.K. and Tarjan, Robert E.},
TITLE = {Fully persistent lists with catenation},
JOURNAL = {J. ACM},
VOLUME = {41},
NUMBER = {5},
PAGES = {943-959},
YEAR = {1994},
KEYWORDS = {amortization, catenation, concatenation, data structures, functional programming, LISP, list, queue, stack},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Lund-Yannakakis/94,
AUTHOR = {Lund, Carsten and Yannakakis, Mihalis},
TITLE = {On the hardness of approximating minimization problems},
JOURNAL = {J. ACM},
VOLUME = {41},
NUMBER = {5},
PAGES = {960-981},
YEAR = {1994},
KEYWORDS = {approximation algorithms, chromatic number, clique cover, dominating set, graph coloring, hitting set, independent set, NP-hard, probabilistically checkable proofs, set cover},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Storer-Reif/94,
AUTHOR = {Storer, James A. and Reif, John H.},
TITLE = {Shortest paths in the plane with polygonal obstacles},
JOURNAL = {J. ACM},
VOLUME = {41},
NUMBER = {5},
PAGES = {982-1012},
YEAR = {1994},
KEYWORDS = {Euclidean plane, minimal movement problem, motion planning, mover's problem, polygonal obstacles, robotics, shortest path},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Reif-Storer/94,
AUTHOR = {Reif, John H. and Storer, James A.},
TITLE = {A single-exponential upper bound for finding shortest paths in three dimensions},
JOURNAL = {J. ACM},
VOLUME = {41},
NUMBER = {5},
PAGES = {1013-1019},
YEAR = {1994},
KEYWORDS = {minimal movement problem, motion planning, mover's problem, robotics, shortest path, theory of real closed fields, 3-dimensional Euclidean space},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Aspnes-Herlihy-Shavit/94,
AUTHOR = {Aspnes, James and Herlihy, Maurice and Shavit, Nir},
TITLE = {Counting networks},
JOURNAL = {J. ACM},
VOLUME = {41},
NUMBER = {5},
PAGES = {1020-1048},
YEAR = {1994},
KEYWORDS = {counting networks, hot-spots, network routing, parallel processing},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}