@article{Dyer-Frieze-Kannan/91,
AUTHOR = {Dyer, M. and Frieze, A. and Kannan, R.},
TITLE = {A random polynomial time algorithm for approximating the volume of convex bodies},
JOURNAL = {J. ACM},
VOLUME = {38},
NUMBER = {1},
PAGES = {1-17},
YEAR = {1991, January},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Mitchell-Papadimitriou/91,
AUTHOR = {Mitchell, J.S.B. and Papadimitriou, C.H.},
TITLE = {The weighted region problem: Finding shortest paths through a weighted planar subdivision},
JOURNAL = {J. ACM},
VOLUME = {38},
NUMBER = {1},
PAGES = {18-73},
YEAR = {1991, January},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Mulmuley/91,
AUTHOR = {Mulmuley, K.},
TITLE = {A fast planar partition algorithm, II},
JOURNAL = {J. ACM},
VOLUME = {38},
NUMBER = {1},
PAGES = {74-103},
YEAR = {1991, January},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Willard/91,
AUTHOR = {Willard, D.E.},
TITLE = {Optimal sample cost residues for differential database batch query problems},
JOURNAL = {J. ACM},
VOLUME = {38},
NUMBER = {1},
PAGES = {104-119},
YEAR = {1991, January},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Sagiv/91,
AUTHOR = {Sagiv, Y.},
TITLE = {Evaluation of queries in independent database schemes},
JOURNAL = {J. ACM},
VOLUME = {38},
NUMBER = {1},
PAGES = {120-161},
YEAR = {1991, January},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Frederickson/91,
AUTHOR = {Frederickson, G.N.},
TITLE = {Planar graph decomposition and all pairs shortest paths},
JOURNAL = {J. ACM},
VOLUME = {38},
NUMBER = {1},
PAGES = {162-204},
YEAR = {1991, January},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Chandru-Hooker/91,
AUTHOR = {Chandru, V. and Hooker, J.N.},
TITLE = {Extended Horn sets in propositional logic},
JOURNAL = {J. ACM},
VOLUME = {38},
NUMBER = {1},
PAGES = {205-221},
YEAR = {1991, January},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Kissin/91,
AUTHOR = {Kissin, G.},
TITLE = {Upper and lower bounds on switching energy in VLSI},
JOURNAL = {J. ACM},
VOLUME = {38},
NUMBER = {1},
PAGES = {222-254},
YEAR = {1991, January},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Arkin-Papadimitriou-Yannakakis/91,
AUTHOR = {Arkin, E.M. and Papadimitriou, C.H. and Yannakakis, M.},
TITLE = {Modularity of cycles and paths in graphs},
JOURNAL = {J. ACM},
VOLUME = {38},
NUMBER = {2},
PAGES = {255-274},
YEAR = {1991, April},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Dobkin-Suri/91,
AUTHOR = {Dobkin, D. and Suri, S.},
TITLE = {Maintenance of geometric extrema},
JOURNAL = {J. ACM},
VOLUME = {38},
NUMBER = {2},
PAGES = {275-298},
YEAR = {1991, April},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Bryant/91a,
AUTHOR = {Bryant, R.E.},
TITLE = {A methodology for hardware verification based on logic simulation},
JOURNAL = {J. ACM},
VOLUME = {38},
NUMBER = {2},
PAGES = {299-328},
YEAR = {1991, April},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Ioannidis-Wong/91,
AUTHOR = {Ioannidis, Y. and Wong, E.},
TITLE = {Towards an algebraic theory of recursion},
JOURNAL = {J. ACM},
VOLUME = {38},
NUMBER = {2},
PAGES = {329-381},
YEAR = {1991, April},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Fagin-Halpern-Vardi/91,
AUTHOR = {Fagin, R. and Halpern, J.Y. and Vardi, M.Y.},
TITLE = {A model-theoretic analysis of knowledge},
JOURNAL = {J. ACM},
VOLUME = {38},
NUMBER = {2},
PAGES = {382-428},
YEAR = {1991, April},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Bambos-Walrand/91,
AUTHOR = {Bambos, N. and Walrand, J.},
TITLE = {On stability and performance of parallel processing systems},
JOURNAL = {J. ACM},
VOLUME = {38},
NUMBER = {2},
PAGES = {429-452},
YEAR = {1991, April},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Mansour-Schieber-Tiwari/91,
AUTHOR = {Mansour, Y. and Schieber, B. and Tiwari, P.},
TITLE = {A lower bound for integer greatest common divisor computations},
JOURNAL = {J. ACM},
VOLUME = {38},
NUMBER = {2},
PAGES = {453-471},
YEAR = {1991, April},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Condon/91,
AUTHOR = {Condon, A.},
TITLE = {Space-bounded probabilistic game automata},
JOURNAL = {J. ACM},
VOLUME = {38},
NUMBER = {2},
PAGES = {472-494},
YEAR = {1991, April},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Alon-Dewdney-Ott/91,
AUTHOR = {Alon, N. and Dewdney, A.K. and Ott, T.J.},
TITLE = {Efficient simulation of finite automata by neural nets},
JOURNAL = {J. ACM},
VOLUME = {38},
NUMBER = {2},
PAGES = {495-514},
YEAR = {1991, April},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Atallah-Chen-Wagener/91,
AUTHOR = {Atallah, M.J. and Chen, D.Z. and Wagener, H.},
TITLE = {An optimal parallel algorithm for the visibility of a simple polygon from a point},
JOURNAL = {J. ACM},
VOLUME = {38},
NUMBER = {3},
PAGES = {516-533},
YEAR = {1991, July},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Imielinski/91,
AUTHOR = {Imielinski, T.},
TITLE = {Abstraction in query processing},
JOURNAL = {J. ACM},
VOLUME = {38},
NUMBER = {3},
PAGES = {534-558},
YEAR = {1991, July},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Hsiang-Rusinowitch/91,
AUTHOR = {Hsiang, J. and Rusinowitch, M.},
TITLE = {Proving refutational completeness of theorem-proving strategies: The transfinite semantic tree method},
JOURNAL = {J. ACM},
VOLUME = {38},
NUMBER = {3},
PAGES = {559-587},
YEAR = {1991, July},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Marek-Truszczynski/91,
AUTHOR = {Marek, W. and Truszczynski, M.},
TITLE = {Autoepistemic logic},
JOURNAL = {J. ACM},
VOLUME = {38},
NUMBER = {3},
PAGES = {588-619},
YEAR = {1991, July},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{van_Gelder-Ross-Schlipf/91,
AUTHOR = {van Gelder, A. and Ross, K.A. and Schlipf, J.S.},
TITLE = {The well-founded semantics for general logic programs},
JOURNAL = {J. ACM},
VOLUME = {38},
NUMBER = {3},
PAGES = {620-650},
YEAR = {1991, July},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Crochemore-Perrin/91,
AUTHOR = {Crochemore, M. and Perrin, D.},
TITLE = {Two-way string-matching},
JOURNAL = {J. ACM},
VOLUME = {38},
NUMBER = {3},
PAGES = {651-675},
YEAR = {1991, July},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Ross-Yao/91,
AUTHOR = {Ross, K.W. and Yao, D.D.},
TITLE = {Optimal load balancing and scheduling in a distributed computer system},
JOURNAL = {J. ACM},
VOLUME = {38},
NUMBER = {3},
PAGES = {676-690},
YEAR = {1991, July},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Goldreich-Micali-Wigderson/91,
AUTHOR = {Goldreich, O. and Micali, S. and Wigderson, A.},
TITLE = {Proofs that yield nothing but their validity or all languages in $NP$ have zero-knowledge proof systems},
JOURNAL = {J. ACM},
VOLUME = {38},
NUMBER = {3},
PAGES = {691-729},
YEAR = {1991, July},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{ozveren-Willsky-Antsaklis/91,
AUTHOR = {{\"o}zveren, C.M. and Willsky, A.S. and Antsaklis, P.J.},
TITLE = {Stability and stabilizability of discrete event dynamic systems},
JOURNAL = {J. ACM},
VOLUME = {38},
NUMBER = {3},
PAGES = {730-752},
YEAR = {1991, July},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Toran/91,
AUTHOR = {Tor{\'a}n, J.},
TITLE = {Complexity classes defined by counting quantifiers},
JOURNAL = {J. ACM},
VOLUME = {38},
NUMBER = {3},
PAGES = {753-774},
YEAR = {1991, July},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Stewart-White/91,
AUTHOR = {Stewart, Bradley S. and White III, Chelsea C.},
TITLE = {Multiobjective $A^*$},
JOURNAL = {J. ACM},
VOLUME = {38},
NUMBER = {4},
PAGES = {775-814},
YEAR = {1991, October},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Gabow-Tarjan/91,
AUTHOR = {Gabow, Harold N. and Tarjan, Robert E.},
TITLE = {Faster scaling algorithms for general graph-matching problems},
JOURNAL = {J. ACM},
VOLUME = {38},
NUMBER = {4},
PAGES = {815-853},
YEAR = {1991, October},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Chan-Hernandez/91,
AUTHOR = {Chan, Edward P.F. and Hern{\'a}ndez, H{\'e}ctor J.},
TITLE = {Independence-reducible database schemes},
JOURNAL = {J. ACM},
VOLUME = {38},
NUMBER = {4},
PAGES = {854-886},
YEAR = {1991, October},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Bloom-esik/91,
AUTHOR = {Bloom, Stephen L. and {\'e}sik, Zolt{\'a}n},
TITLE = {Floyd-Hoare logic in iteration theories},
JOURNAL = {J. ACM},
VOLUME = {38},
NUMBER = {4},
PAGES = {887-934},
YEAR = {1991, October},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Halpern-Shoham/91,
AUTHOR = {Halpern, Joseph Y. and Shoham, Yoav},
TITLE = {A propositional modal logic of time intervals},
JOURNAL = {J. ACM},
VOLUME = {38},
NUMBER = {4},
PAGES = {935-962},
YEAR = {1991, October},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Tiomkin-Kaminski/91,
AUTHOR = {Tiomkin, Michael and Kaminski, Michael},
TITLE = {Nonmonotonic default modal logics},
JOURNAL = {J. ACM},
VOLUME = {38},
NUMBER = {4},
PAGES = {963-984},
YEAR = {1991, October},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Balas-Miller-Pekny-Toth/91,
AUTHOR = {Balas, Egon and Miller, Donald and Pekny, Joseph and Toth, Paolo},
TITLE = {A parallel shortest augmenting path algorithm for the assignment problem},
JOURNAL = {J. ACM},
VOLUME = {38},
NUMBER = {4},
PAGES = {985-1004},
YEAR = {1991, October},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Glasserman/91,
AUTHOR = {Glasserman, Paul},
TITLE = {Structural conditions for perturbation analysis of queuing systems},
JOURNAL = {J. ACM},
VOLUME = {38},
NUMBER = {4},
PAGES = {1005-1025},
YEAR = {1991, October},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Berger-Rompel/91,
AUTHOR = {Berger, Bonnie and Rompel, John},
TITLE = {Simulating $(\log^c n)$-wise independence in $NC$},
JOURNAL = {J. ACM},
VOLUME = {38},
NUMBER = {4},
PAGES = {1026-1046},
YEAR = {1991, October},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}