Journal: Journal of the ACM

Volume 56, Issue 6

0 -- 0Balder ten Cate, Carsten Lutz. The complexity of query containment in expressive fragments of XPath 2.0
0 -- 0Georg Gottlob, Zoltán Miklós, Thomas Schwentick. Generalized hypertree decompositions: NP-hardness and tractable variants
0 -- 0Leonid Libkin, Victor Vianu. Introduction to PODS 2007 special section
0 -- 0Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen. A property of quantum relative entropy with an application to privacy in quantum communication
0 -- 0Jon M. Kleinberg, Aleksandrs Slivkins, Tom Wexler. Triangulation and embedding using small sets of beacons

Volume 56, Issue 5

0 -- 0V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy 0002, Aravind Srinivasan. A unified approach to scheduling on unrelated parallel machines
0 -- 0Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch. A measure & conquer approach for the analysis of exact algorithms
0 -- 0Rohit Chadha, A. Prasad Sistla, Mahesh Viswanathan. On the expressiveness and complexity of randomization in finite state monitors
0 -- 0Gianfranco Bilardi, Kattamuri Ekanadham, Pratap Pattnaik. On approximating the ideal random access machine by physical machines

Volume 56, Issue 4

0 -- 0Kevin Leyton-Brown, Eugene Nudelman, Yoav Shoham. Empirical hardness models: Methodology and a case study on combinatorial auctions
0 -- 0Tim Roughgarden, Mukund Sundararajan. Quantifying inefficiency in cost-sharing mechanisms
0 -- 0Hagit Attiya, Rachid Guerraoui, Danny Hendler, Petr Kuznetsov. The complexity of obstruction-free implementations
0 -- 0Venkatesan Guruswami, Christopher Umans, Salil P. Vadhan. Unbalanced expanders and randomness extractors from Parvaresh--Vardy codes
0 -- 0Rohit Khandekar, Satish Rao, Umesh V. Vazirani. Graph partitioning using single commodity flows
0 -- 0Dimitris Achlioptas, Aaron Clauset, David Kempe, Cristopher Moore. On the bias of traceroute sampling: Or, power-law degree distributions in regular graphs

Volume 56, Issue 3

0 -- 0George S. Lueker. Improved bounds on the average length of longest common subsequences
0 -- 0Mikolaj Bojanczyk, Anca Muscholl, Thomas Schwentick, Luc Segoufin. Two-variable logic on data trees and XML reasoning
0 -- 0Daniel Stefankovic, Santosh Vempala, Eric Vigoda. Adaptive simulated annealing: A near-optimal connection between sampling and counting
0 -- 0Victor Vianu, Jan Van den Bussche. Introduction to PODS 2006 special section
0 -- 0Rajeev Alur, P. Madhusudan. Adding nesting structure to words
0 -- 0Jan Remy, Angelika Steger. A quasi-polynomial time approximation scheme for minimum weight triangulation
0 -- 0Xi Chen, Xiaotie Deng, Shang-Hua Teng. Settling the complexity of computing two-player Nash equilibria
0 -- 0Martin Grohe, André Hernich, Nicole Schweikardt. Lower bounds for processing data with few random accesses to external memory

Volume 56, Issue 2

0 -- 0Julia Chuzhoy, Sanjeev Khanna. Polynomial flow-cut gaps and hardness of directed cut problems
0 -- 0Lars Arvestad, Jens Lagergren, Bengt Sennblad. The gene evolution model and computing its associated probabilities
0 -- 0Glencora Borradaile, Philip N. Klein. An ::::O::::(::::n:::: log ::::n::::) algorithm for maximum ::::st::::-flow in a directed planar graph
0 -- 0Ran Raz. Multi-linear formulas for permanent and determinant are of super-polynomial size
0 -- 0Markus Püschel, Peter A. Milder, James C. Hoe. Permuting streaming data using RAMs
0 -- 0Sanjeev Arora, Satish Rao, Umesh V. Vazirani. Expander flows, geometric embeddings and graph partitioning

Volume 56, Issue 1

0 -- 0Kousha Etessami, Mihalis Yannakakis. Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations
0 -- 0Moni Naor, Guy N. Rothblum. The complexity of online memory checking
0 -- 0Moshe Babaioff, Ron Lavi, Elan Pavlov. Single-value combinatorial auctions and algorithmic implementation in undominated strategies
0 -- 0Leslie G. Valiant. Evolvability