Journal of the ACM, Volume 58

Volume 58, Number 1, December 2010

• Victor Vianu:
  Invited articles section foreword. 1
  
• Alexandre V. Evfimievski, Ronald Fagin, David P. Woodruff:
  Epistemic privacy. 2
  
• Sudipto Guha, Kamesh Munagala, Peng Shi:
  Approximation algorithms for restless bandit problems. 3
  
• Pablo Barceló, Leonid Libkin, Antonella Poggi, Cristina Sirangelo:
  XML with incomplete information. 4
  

Volume 58, Number 2, April 2011

• Ketan Mulmuley:
  On P vs. NP and geometric complexity theory: Dedicated to Sri Ramakrishna. 5
  
• Kevin Buchin, Wolfgang Mulzer:
  Delaunay triangulations in O(sort(n)) time and more. 6
  
• Marcos Kawazoe Aguilera, Idit Keidar, Dahlia Malkhi, Alexander Shraer:
  Dynamic atomic storage without consensus. 7
  
• Haim Avron, Sivan Toledo:
  Randomized algorithms for estimating the trace of an implicit symmetric positive semi-definite matrix. 8
  

Volume 58, Number 3, May 2011

• Ferdinando Cicalese, Eduardo Sany Laber:
  On the competitive ratio of evaluating priced functions. 9
  
• Vijay V. Vazirani, Mihalis Yannakakis:
  Market equilibrium under separable, piecewise-linear, concave utilities. 10
  
• Emmanuel J. Candès, Xiaodong Li, Yi Ma, John Wright:
  Robust principal component analysis? 11
  
• Victor Vianu:
  Introduction to JACM invited article. 12
  
• Atish Das Sarma, Sreenivas Gollapudi, Rina Panigrahy:
  Estimating PageRank on graph streams. 13
  

Volume 58, Number 4, July 2011

• Bernard Chazelle, C. Seshadhri:
  Online geometric reconstruction. 14
  
• Ronald Fagin, Benny Kimelfeld, Phokion G. Kolaitis:
  Probabilistic data exchange. 15
  
• Victor Vianu:
  Invited articles foreword. 16
  
• Mikolaj Bojanczyk, Pawel Parys:
  XPath evaluation in linear time. 17
  
• Valerie King, Jared Saia:
  Breaking the O(n²) bit barrier: Scalable byzantine agreement with an adaptive adversary. 18
  

Volume 58, Number 5, October 2011

• David Arthur, Bodo Manthey, Heiko Röglin:
  Smoothed Analysis of the k-Means Method. 19
  
• Monaldo Mastrolilli, Ola Svensson:
  Hardness of Approximating Flow and Job Shop Scheduling Problems. 20
  
• MohammadHossein Bateni, Mohammad Taghi Hajiaghayi, Dániel Marx:
  Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth. 21
  
• Victor Vianu:
  Invited Articles Foreword. 22
  
• Leonid Barenboim, Michael Elkin:
  Deterministic Distributed Vertex Coloring in Polylogarithmic Time. 23
  

Volume 58, Number 6, December 2011

• S. Dov Gordon, Carmit Hazay, Jonathan Katz, Yehuda Lindell:
  Complete Fairness in Secure Two-Party Computation. 24
  
• Ron Lavi, Chaitanya Swamy:
  Truthful and Near-Optimal Mechanism Design via Linear Programming. 25
  
• Cristiano Calcagno, Dino Distefano, Peter W. O'Hearn, Hongseok Yang:
  Compositional Shape Analysis by Means of Bi-Abduction. 26
  
• Michael T. Goodrich:
  Randomized Shellsort: A Simple Data-Oblivious Sorting Algorithm. 27
  
• Bernhard Haeupler, Barna Saha, Aravind Srinivasan:
  New Constructive Aspects of the Lovász Local Lemma. 28
  
• Victor Vianu:
  Invited Article Foreword. 29
  
• Rahul Jain, Zhengfeng Ji, Sarvagya Upadhyay, John Watrous:
  QIP = PSPACE. 30
  

Last update Fri May 24 20:31:09 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page