@article{Chan/01a,
AUTHOR = {Chan, Timothy M.},
TITLE = {Dynamic planar convex hull operations in near-logarithmic amortized time},
JOURNAL = {J. ACM},
VOLUME = {48},
NUMBER = {1},
PAGES = {1-12},
YEAR = {2001},
EDITOR = {Halpern, Joseph Y.},
URL = {http://doi.acm.org/10.1145/363647.363652},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Borodin-Kleinberg-Raghavan-Sudan-Williamson/01,
AUTHOR = {Borodin, Allan and Kleinberg, Jon and Raghavan, Prabhakar and Sudan, Madhu and Williamson, David P.},
TITLE = {Adversarial queuing theory},
JOURNAL = {J. ACM},
VOLUME = {48},
NUMBER = {1},
PAGES = {13-38},
YEAR = {2001},
EDITOR = {Halpern, Joseph Y.},
URL = {http://doi.acm.org/10.1145/363647.363659},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Andrews-Awerbuch-Fernandez-Leighton-Liu-Kleinberg/01,
AUTHOR = {Andrews, Matthew and Awerbuch, Baruch and Fern{\'{a}}ndez, Antonio and Leighton, Tom and Liu, Zhiyong and Kleinberg, Jon},
TITLE = {Universal-stability results and performance bounds for greedy contention-resolution protocols},
JOURNAL = {J. ACM},
VOLUME = {48},
NUMBER = {1},
PAGES = {39-69},
YEAR = {2001},
EDITOR = {Halpern, Joseph Y.},
URL = {http://doi.acm.org/10.1145/363647.363677},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Basin-Ganzinger/01,
AUTHOR = {Basin, David and Ganzinger, Harald},
TITLE = {Automated complexity analysis based on ordered resolution},
JOURNAL = {J. ACM},
VOLUME = {48},
NUMBER = {1},
PAGES = {70-109},
YEAR = {2001},
EDITOR = {Halpern, Joseph Y.},
URL = {http://doi.acm.org/10.1145/363647.363681},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Case-Rajan-Shende/01,
AUTHOR = {Case, John and Rajan, Dayanand S. and Shende, Anil M.},
TITLE = {Lattice computers for approximating Euclidean space},
JOURNAL = {J. ACM},
VOLUME = {48},
NUMBER = {1},
PAGES = {110-144},
YEAR = {2001},
EDITOR = {Halpern, Joseph Y.},
URL = {http://doi.acm.org/10.1145/363647.363688},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Siekmann-Wrightson/01,
AUTHOR = {Siekmann, J{\"{o}}rg H. and Wrightson, Graham},
TITLE = {Erratum: A counterexample to W. Bibel's and E. Eder's strong completeness result for connection graph resolution},
JOURNAL = {J. ACM},
VOLUME = {48},
NUMBER = {1},
PAGES = {145-147},
YEAR = {2001},
EDITOR = {Halpern, Joseph Y.},
URL = {http://doi.acm.org/10.1145/363647.363697},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
NOTE = {see also: Journal of the ACM, Vol. 44, 1997, No. 2,  320-344},
}
@article{Ben-Sasson-Wigderson/01,
AUTHOR = {Ben-Sasson, Eli and Wigderson, Avi},
TITLE = {Short proofs are narrow --- Resolution made simple},
JOURNAL = {J. ACM},
VOLUME = {48},
NUMBER = {2},
PAGES = {149-169},
YEAR = {2001},
EDITOR = {Halpern, Joseph Y.},
URL = {http://doi.acm.org/10.1145/375827.375835},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Roura/01,
AUTHOR = {Roura, Salvador},
TITLE = {Improved master theorems for divide-and-conquer recurrences},
JOURNAL = {J. ACM},
VOLUME = {48},
NUMBER = {2},
PAGES = {170-205},
YEAR = {2001},
EDITOR = {Halpern, Joseph Y.},
URL = {http://doi.acm.org/10.1145/375827.375837},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Skutella/01,
AUTHOR = {Skutella, Martin},
TITLE = {Convex quadratic and semidefinite programming relaxations in scheduling},
JOURNAL = {J. ACM},
VOLUME = {48},
NUMBER = {2},
PAGES = {206-242},
YEAR = {2001},
EDITOR = {Halpern, Joseph Y.},
URL = {http://doi.acm.org/10.1145/375827.375840},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Jain-Vazirani/01,
AUTHOR = {Jain, Kamal and Vazirani, Vijay V.},
TITLE = {Approximation algorithms for metric facility location and $k$-median problems using the primal-dual schema and Lagrangian relaxation},
JOURNAL = {J. ACM},
VOLUME = {48},
NUMBER = {2},
PAGES = {274-296},
YEAR = {2001},
EDITOR = {Halpern, Joseph Y.},
URL = {http://doi.acm.org/10.1145/375827.375847},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Chong-Han-Lam/01,
AUTHOR = {Chong, Ka Wong and Han, Yijie and Lam, Tak Wah},
TITLE = {Concurrent threads and optimal parallel minimum spanning trees algorithm},
JOURNAL = {J. ACM},
VOLUME = {48},
NUMBER = {2},
PAGES = {297-323},
YEAR = {2001},
EDITOR = {Halpern, Joseph Y.},
URL = {http://doi.acm.org/10.1145/375827.375849},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Broder-Frieze-Upfal/01,
AUTHOR = {Broder, Andrei Z. and Frieze, Alan M. and Upfal, Eli},
TITLE = {A general approach to dynamic packet routing with bounded buffers},
JOURNAL = {J. ACM},
VOLUME = {48},
NUMBER = {2},
PAGES = {324-349},
YEAR = {2001},
EDITOR = {Halpern, Joseph Y.},
URL = {http://doi.acm.org/10.1145/382780.382781},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Mayers/01,
AUTHOR = {Mayers, Dominic},
TITLE = {Unconditional security in quantum cryptography},
JOURNAL = {J. ACM},
VOLUME = {48},
NUMBER = {3},
PAGES = {351-406},
YEAR = {2001},
EDITOR = {Halpern, Joseph Y.},
URL = {http://doi.acm.org/10.1145/382780.382782},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Manzini/01,
AUTHOR = {Manzini, Giovanni},
TITLE = {An analysis of the Burrows-Wheeler transform},
JOURNAL = {J. ACM},
VOLUME = {48},
NUMBER = {3},
PAGES = {407-430},
YEAR = {2001},
EDITOR = {Halpern, Joseph Y.},
URL = {http://doi.acm.org/10.1145/382780.382783},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Gottlob-Leone-Scarcello/01,
AUTHOR = {Gottlob, Georg and Leone, Nicola and Scarcello, Francesco},
TITLE = {The complexity of acyclic conjunctive queries},
JOURNAL = {J. ACM},
VOLUME = {48},
NUMBER = {3},
PAGES = {431-498},
YEAR = {2001},
EDITOR = {Halpern, Joseph Y.},
URL = {http://doi.acm.org/10.1145/382780.382784},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Bazzi-Neiger/01,
AUTHOR = {Bazzi, Rida A. and Neiger, Gil},
TITLE = {Simplifying fault-tolerance: Providing the abstraction of crash failures},
JOURNAL = {J. ACM},
VOLUME = {48},
NUMBER = {3},
PAGES = {499-554},
YEAR = {2001},
EDITOR = {Halpern, Joseph Y.},
URL = {http://doi.acm.org/10.1145/382780.382785},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Davies-Pfenning/01,
AUTHOR = {Davies, Rowan and Pfenning, Frank},
TITLE = {A modal analysis of staged computation},
JOURNAL = {J. ACM},
VOLUME = {48},
NUMBER = {3},
PAGES = {555-604},
YEAR = {2001},
EDITOR = {Halpern, Joseph Y.},
URL = {http://doi.acm.org/10.1145/502090.502091},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Darwiche/01,
AUTHOR = {Darwiche, Adnan},
TITLE = {Decomposable negation normal form},
JOURNAL = {J. ACM},
VOLUME = {48},
NUMBER = {4},
PAGES = {608-647},
YEAR = {2001},
EDITOR = {Halpern, Joseph Y.},
URL = {http://doi.acm.org/10.1145/502090.502092},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Friedman-Halpern/01,
AUTHOR = {Friedman, Nir and Halpern, Joseph Y.},
TITLE = {Plausibility measures and default reasoning},
JOURNAL = {J. ACM},
VOLUME = {48},
NUMBER = {4},
PAGES = {648-685},
YEAR = {2001},
EDITOR = {Halpern, Joseph Y.},
URL = {http://doi.acm.org/10.1145/502090.502093},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Hochbaum/01,
AUTHOR = {Hochbaum, Dorit S.},
TITLE = {An efficient algorithm for image segmentation, Markov random fields and related problems},
JOURNAL = {J. ACM},
VOLUME = {48},
NUMBER = {4},
PAGES = {686-701},
YEAR = {2001},
EDITOR = {Halpern, Joseph Y.},
URL = {http://doi.acm.org/10.1145/502090.502094},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Boneh-Franklin/01,
AUTHOR = {Boneh, Dan and Franklin, Matthew},
TITLE = {Efficient generation of shared RSA keys},
JOURNAL = {J. ACM},
VOLUME = {48},
NUMBER = {4},
PAGES = {702-722},
YEAR = {2001},
EDITOR = {Halpern, Joseph Y.},
URL = {http://doi.acm.org/10.1145/502090.502095},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Holm-de_Lichtenberg-Thorup/01,
AUTHOR = {Holm, Jacob and de Lichtenberg, Kristian and Thorup, Mikkel},
TITLE = {Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity},
JOURNAL = {J. ACM},
VOLUME = {48},
NUMBER = {4},
PAGES = {723-760},
YEAR = {2001},
EDITOR = {Halpern, Joseph Y.},
URL = {http://doi.acm.org/10.1145/502090.502096},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Iwata-Fleischer-Fujishige/01,
AUTHOR = {Iwata, Satoru and Fleischer, Lisa and Fujishige, Satoru},
TITLE = {A combinatorial strongly polynomial algorithm for minimizing submodular functions},
JOURNAL = {J. ACM},
VOLUME = {48},
NUMBER = {4},
PAGES = {761-777},
YEAR = {2001},
EDITOR = {Halpern, Joseph Y.},
URL = {http://doi.acm.org/10.1145/502090.502097},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Beals-Buhrman-Cleve-Mosca-de_Wolf/01,
AUTHOR = {Beals, Robert and Buhrman, Harry and Cleve, Richard and Mosca, Michele and de Wolf, Ronald},
TITLE = {Quantum lower bounds by polynomials},
JOURNAL = {J. ACM},
VOLUME = {48},
NUMBER = {4},
PAGES = {778-797},
YEAR = {2001},
EDITOR = {Halpern, Joseph Y.},
URL = {http://doi.acm.org/10.1145/502090.502098},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Hastad/01,
AUTHOR = {H{\aa}stad, Johan},
TITLE = {Some optimal inapproximability results},
JOURNAL = {J. ACM},
VOLUME = {48},
NUMBER = {4},
PAGES = {798-859},
YEAR = {2001},
EDITOR = {Halpern, Joseph Y.},
URL = {http://doi.acm.org/10.1145/502090.502099},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Trevisan/01,
AUTHOR = {Trevisan, Luca},
TITLE = {Extractors and pseudorandom generators},
JOURNAL = {J. ACM},
VOLUME = {48},
NUMBER = {4},
PAGES = {860-879},
YEAR = {2001},
EDITOR = {Halpern, Joseph Y.},
URL = {http://doi.acm.org/10.1145/502090.502100},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Hella-Libkin-Nurmonen-Wong/01,
AUTHOR = {Hella, Lauri and Libkin, Leonid and Nurmonen, Juha and Wong, Limsoon},
TITLE = {Logics with aggregate operators},
JOURNAL = {J. ACM},
VOLUME = {48},
NUMBER = {4},
PAGES = {880-907},
YEAR = {2001},
EDITOR = {Halpern, Joseph Y.},
URL = {http://doi.acm.org/10.1145/502102.502103},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Meghini-Sebastiani-Straccia/01,
AUTHOR = {Meghini, Carlo and Sebastiani, Fabrizio and Straccia, Umberto},
TITLE = {A model of multimedia information retrieval},
JOURNAL = {J. ACM},
VOLUME = {48},
NUMBER = {5},
PAGES = {909-970},
YEAR = {2001},
EDITOR = {Halpern, Joseph Y.},
URL = {http://doi.acm.org/10.1145/502102.502104},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Halevy-Mumick-Sagiv-Shmueli/01,
AUTHOR = {Halevy, Alon Y. and Mumick, Inderpal Singh and Sagiv, Yehoshua and Shmueli, Oded},
TITLE = {Static analysis in datalog extensions},
JOURNAL = {J. ACM},
VOLUME = {48},
NUMBER = {5},
PAGES = {971-1012},
YEAR = {2001},
EDITOR = {Halpern, Joseph Y.},
URL = {http://doi.acm.org/10.1145/502102.502105},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Attiya-Dagan/01,
AUTHOR = {Attiya, Hagit and Dagan, Eyal},
TITLE = {Improved implementations of binary universal operations},
JOURNAL = {J. ACM},
VOLUME = {48},
NUMBER = {5},
PAGES = {1013-1037},
YEAR = {2001},
EDITOR = {Halpern, Joseph Y.},
URL = {http://doi.acm.org/10.1145/502102.502106},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Hickey-Ju-van_Emden/01,
AUTHOR = {Hickey, T. and Ju, Q. and van Emden, M.H.},
TITLE = {Interval arithmetic: From principles to implementation},
JOURNAL = {J. ACM},
VOLUME = {48},
NUMBER = {5},
PAGES = {1038-1068},
YEAR = {2001},
EDITOR = {Halpern, Joseph Y.},
URL = {http://doi.acm.org/10.1145/502102.502107},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Bar-Noy-Bar-Yehuda-Freund-Naor-Schieber/01,
AUTHOR = {Bar-Noy, Amotz and Bar-Yehuda, Reuven and Freund, Ari and Naor, Joseph (Seffi) and Schieber, Baruch},
TITLE = {A unified approach to approximating resource allocation and scheduling},
JOURNAL = {J. ACM},
VOLUME = {48},
NUMBER = {5},
PAGES = {1069-1090},
YEAR = {2001},
EDITOR = {Halpern, Joseph Y.},
URL = {http://doi.acm.org/10.1145/504794.504795},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Liberatore/01,
AUTHOR = {Liberatore, Paolo},
TITLE = {Monotonic reductions, representative equivalence, and compilation of intractable problems},
JOURNAL = {J. ACM},
VOLUME = {48},
NUMBER = {6},
PAGES = {1091-1125},
YEAR = {2001},
EDITOR = {Halpern, Joseph Y.},
URL = {http://doi.acm.org/10.1145/504794.504796},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Lasserre-Zeron/01,
AUTHOR = {Lasserre, Jean B. and Zeron, Eduardo S.},
TITLE = {A Laplace transform algorithm for the volume of a convex polytope},
JOURNAL = {J. ACM},
VOLUME = {48},
NUMBER = {6},
PAGES = {1126-1140},
YEAR = {2001},
EDITOR = {Halpern, Joseph Y.},
URL = {http://doi.acm.org/10.1145/504794.504797},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Gal-Eckstein/01,
AUTHOR = {Gal, Avigdor and Eckstein, Jonathan},
TITLE = {Managing periodically updated data in relational databases: A stochastic modeling approach},
JOURNAL = {J. ACM},
VOLUME = {48},
NUMBER = {6},
PAGES = {1141-1183},
YEAR = {2001},
EDITOR = {Halpern, Joseph Y.},
URL = {http://doi.acm.org/10.1145/504794.504798},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}
@article{Frick-Grohe/01,
AUTHOR = {Frick, Markus and Grohe, Martin},
TITLE = {Deciding first-order properties of locally tree-decomposable structures},
JOURNAL = {J. ACM},
VOLUME = {48},
NUMBER = {6},
PAGES = {1184-1206},
YEAR = {2001},
EDITOR = {Halpern, Joseph Y.},
URL = {http://doi.acm.org/10.1145/504794.504799},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
}