Journal: Journal of the ACM

Volume 49, Issue 6

715 -- 0Joseph Y. Halpern. Update: Time to publication statistics
716 -- 752Jörg Flum, Markus Frick, Martin Grohe. Query evaluation via tree-decompositions
753 -- 784Larry J. Stockmeyer, Albert R. Meyer. Cosmological lower bound on the circuit complexity of a small problem in logic
785 -- 827Gilbert Caplain. Correctness properties in a shared-memory parallel language
828 -- 858Sandeep Sen, Siddhartha Chatterjee, Neeraj Dumir. Towards a theory of cache-efficient algorithms

Volume 49, Issue 5

577 -- 602Daniel J. Lehmann, Liadan O Callaghan, Yoav Shoham. Truth revelation in approximately efficient combinatorial auctions
603 -- 615Daniel H. Huson, Knut Reinert, Eugene W. Myers. The greedy path-merging algorithm for contig scaffolding
616 -- 639Jon M. Kleinberg, Éva Tardos. Approximation algorithms for classification problems with pairwise relationships: metric labeling and Markov random fields
640 -- 671Steven S. Seiden. On the online bin packing problem
672 -- 713Rajeev Alur, Thomas A. Henzinger, Orna Kupferman. Alternating-time temporal logic

Volume 49, Issue 4

455 -- 495Didier Dubois, Hélène Fargier, Henri Prade, Patrice Perny. Qualitative decision theory: from savage s axioms to nonmonotonic reasoning
496 -- 511Andris Ambainis, Ashwin Nayak, Amnon Ta-Shma, Umesh V. Vazirani. Dense quantum coding and quantum finite automata
512 -- 537David A. McAllester. On the complexity analysis of static analyses
538 -- 576Karthikeyan Bhargavan, Davor Obradovic, Carl A. Gunter. Formal verification of standards for distance vector routing protocols

Volume 49, Issue 3

289 -- 317Uri Zwick. All pairs shortest paths using bridging sets and rectangular matrix multiplication
318 -- 367Miklós Ajtai, Randal C. Burns, Ronald Fagin, Darrell D. E. Long, Larry J. Stockmeyer. Compactly encoding unstructured inputs with differential compression
368 -- 406Wenfei Fan, Leonid Libkin. On XML integrity constraints in the presence of DTDs
407 -- 433Hisao Kameda, Odile Pourtallier. Paradoxes in distributed decisions on optimal load balancing for networks of homogeneous computers
434 -- 453Michael A. Frumkin, Rob F. Van der Wijngaart. Tight bounds on cache use for stencil operations on rectangular grids

Volume 49, Issue 2

127 -- 138Zhi-Zhong Chen, Michelangelo Grigni, Christos H. Papadimitriou. Map graphs
139 -- 156Rafail Ostrovsky, Yuval Rabani. Polynomial-time approximation schemes for geometric min-sum median clustering
157 -- 171Ming Li, Bin Ma, Lusheng Wang. On the closest string and substring problems
172 -- 206Eugene Asarin, Paul Caspi, Oded Maler. Timed regular expressions
207 -- 235Steven H. Low, Larry L. Peterson, Limin Wang. Understanding TCP Vegas: a duality model
236 -- 259Tim Roughgarden, Éva Tardos. How bad is selfish routing?
260 -- 288Mor Harchol-Balter. Task assignment with unknown duration

Volume 49, Issue 1

1 -- 15Lillian Lee. Fast context-free grammar parsing requires fast boolean matrix multiplication
16 -- 34Seth Pettie, Vijaya Ramachandran. An optimal minimum spanning tree algorithm
35 -- 55Joseph M. Hellerstein, Elias Koutsoupias, Daniel P. Miranker, Christos H. Papadimitriou, Vasilis Samoladas. On a model of indexability and its bounds for range queries
56 -- 100Frank Neven, Jan Van den Bussche. Expressiveness of structured document query languages based on attribute grammars
101 -- 126Sibsankar Haldar, Paul M. B. Vitányi. Bounded concurrent timestamp systems using vector clocks