Journal: Journal of the ACM

Volume 48, Issue 6

1126 -- 1140Jean B. Lasserre, Eduardo S. Zeron. A Laplace transform algorithm for the volume of a convex polytope
1141 -- 1183Avigdor Gal, Jonathan Eckstein. Managing periodically updated data in relational databases: a stochastic modeling approach
1184 -- 1206Markus Frick, Martin Grohe. Deciding first-order properties of locally tree-decomposable structures
1207 -- 1241Jan A. Bergstra, Alban Ponse. Register-machine based processes

Volume 48, Issue 5

909 -- 970Carlo Meghini, Fabrizio Sebastiani, Umberto Straccia. A model of multimedia information retrieval
971 -- 1012Alon Y. Halevy, Inderpal Singh Mumick, Yehoshua Sagiv, Oded Shmueli. Static analysis in datalog extensions
1013 -- 1037Hagit Attiya, Eyal Dagan. Improved implementations of binary universal operations
1038 -- 1068Timothy J. Hickey, Qun Ju, Maarten H. van Emden. Interval arithmetic: From principles to implementation
1069 -- 1090Amotz Bar-Noy, Reuven Bar-Yehuda, Ari Freund, Joseph Naor, Baruch Schieber. A unified approach to approximating resource allocation and scheduling

Volume 48, Issue 4

608 -- 647Adnan Darwiche. Decomposable negation normal form
648 -- 685Nir Friedman, Joseph Y. Halpern. Plausibility measures and default reasoning
686 -- 701Dorit S. Hochbaum. An efficient algorithm for image segmentation, Markov random fields and related problems
702 -- 722Dan Boneh, Matthew K. Franklin. Efficient generation of shared RSA keys
723 -- 760Jacob Holm, Kristian de Lichtenberg, Mikkel Thorup. Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity
761 -- 777Satoru Iwata, Lisa Fleischer, Satoru Fujishige. A combinatorial strongly polynomial algorithm for minimizing submodular functions
778 -- 797Robert Beals, Harry Buhrman, Richard Cleve, Michele Mosca, Ronald de Wolf. Quantum lower bounds by polynomials
798 -- 859Johan Håstad. Some optimal inapproximability results
860 -- 879Luca Trevisan. Extractors and pseudorandom generators
880 -- 907Lauri Hella, Leonid Libkin, Juha Nurmonen, Limsoon Wong. Logics with aggregate operators

Volume 48, Issue 3

351 -- 406Dominic Mayers. Unconditional security in quantum cryptography
407 -- 430Giovanni Manzini. An analysis of the Burrows-Wheeler transform
431 -- 498Georg Gottlob, Nicola Leone, Francesco Scarcello. The complexity of acyclic conjunctive queries
499 -- 554Rida A. Bazzi, Gil Neiger. Simplifying fault-tolerance: providing the abstraction of crash failures
555 -- 604Rowan Davies, Frank Pfenning. A modal analysis of staged computation

Volume 48, Issue 2

149 -- 169Eli Ben-Sasson, Avi Wigderson. Short proofs are narrow - resolution made simple
170 -- 205Salvador Roura. Improved master theorems for divide-and-conquer recurrences
206 -- 242Martin Skutella. Convex quadratic and semidefinite programming relaxations in scheduling
243 -- 273Daniel R. Dooly, Sally A. Goldman, Stephen D. Scott. On-line analysis of the TCP acknowledgment delay problem
274 -- 296Kamal Jain, Vijay V. Vazirani. Approximation algorithms for metric facility location and ::::k::::-Median problems using the primal-dual schema and Lagrangian relaxation
297 -- 323Ka Wong Chong, Yijie Han, Tak Wah Lam. Concurrent threads and optimal parallel minimum spanning trees algorithm
324 -- 349Andrei Z. Broder, Alan M. Frieze, Eli Upfal. A general approach to dynamic packet routing with bounded buffers

Volume 48, Issue 1

1 -- 12Timothy M. Chan. Dynamic planar convex hull operations in near-logarithmaic amortized time
13 -- 38Allan Borodin, Jon M. Kleinberg, Prabhakar Raghavan, Madhu Sudan, David P. Williamson. Adversarial queuing theory
39 -- 69Matthew Andrews, Baruch Awerbuch, Antonio Fernández, Frank Thomson Leighton, Zhiyong Liu, Jon M. Kleinberg. Universal-stability results and performance bounds for greedy contention-resolution protocols
70 -- 109David A. Basin, Harald Ganzinger. Automated complexity analysis based on ordered resolution
110 -- 144John Case, Dayanand S. Rajan, Anil M. Shende. Lattice computers for approximating Euclidean space
145 -- 147Jörg H. Siekmann, Graham Wrightson. Erratum: a counterexample to W. Bibel s and E. Eder s strong completeness result for connection graph resolution