default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of the ACM, Volume 58
Volume 58, Number 1, December 2010
- Victor Vianu:
Invited articles section foreword. 1:1 - Alexandre V. Evfimievski, Ronald Fagin, David P. Woodruff:
Epistemic privacy. 2:1-2:45 - Sudipto Guha, Kamesh Munagala, Peng Shi
:
Approximation algorithms for restless bandit problems. 3:1-3:50 - Pablo Barceló, Leonid Libkin, Antonella Poggi, Cristina Sirangelo:
XML with incomplete information. 4:1-4:62
Volume 58, Number 2, April 2011
- Ketan Mulmuley:
On P vs. NP and geometric complexity theory: Dedicated to Sri Ramakrishna. 5:1-5:26 - Kevin Buchin, Wolfgang Mulzer:
Delaunay triangulations in O(sort(n)) time and more. 6:1-6:27 - Marcos Kawazoe Aguilera, Idit Keidar, Dahlia Malkhi, Alexander Shraer:
Dynamic atomic storage without consensus. 7:1-7:32 - Haim Avron, Sivan Toledo:
Randomized algorithms for estimating the trace of an implicit symmetric positive semi-definite matrix. 8:1-8:34
Volume 58, Number 3, May 2011
- Ferdinando Cicalese, Eduardo Sany Laber:
On the competitive ratio of evaluating priced functions. 9:1-9:40 - Vijay V. Vazirani, Mihalis Yannakakis:
Market equilibrium under separable, piecewise-linear, concave utilities. 10:1-10:25 - Emmanuel J. Candès, Xiaodong Li, Yi Ma, John Wright:
Robust principal component analysis? 11:1-11:37 - Victor Vianu:
Introduction to JACM invited article. 12:1 - Atish Das Sarma, Sreenivas Gollapudi, Rina Panigrahy:
Estimating PageRank on graph streams. 13:1-13:19
Volume 58, Number 4, July 2011
- Bernard Chazelle, C. Seshadhri:
Online geometric reconstruction. 14:1-14:32 - Ronald Fagin, Benny Kimelfeld, Phokion G. Kolaitis:
Probabilistic data exchange. 15:1-15:55 - Victor Vianu:
Invited articles foreword. 16:1 - Mikolaj Bojanczyk, Pawel Parys:
XPath evaluation in linear time. 17:1-17:33 - Valerie King, Jared Saia:
Breaking the O(n2) bit barrier: Scalable byzantine agreement with an adaptive adversary. 18:1-18:24
Volume 58, Number 5, October 2011
- David Arthur, Bodo Manthey, Heiko Röglin:
Smoothed Analysis of the k-Means Method. 19:1-19:31 - Monaldo Mastrolilli, Ola Svensson:
Hardness of Approximating Flow and Job Shop Scheduling Problems. 20:1-20:32 - MohammadHossein Bateni, Mohammad Taghi Hajiaghayi, Dániel Marx:
Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth. 21:1-21:37 - Victor Vianu:
Invited Articles Foreword. 22:1 - Leonid Barenboim, Michael Elkin:
Deterministic Distributed Vertex Coloring in Polylogarithmic Time. 23:1-23:25
Volume 58, Number 6, December 2011
- S. Dov Gordon, Carmit Hazay, Jonathan Katz, Yehuda Lindell:
Complete Fairness in Secure Two-Party Computation. 24:1-24:37 - Ron Lavi, Chaitanya Swamy:
Truthful and Near-Optimal Mechanism Design via Linear Programming. 25:1-25:24 - Cristiano Calcagno, Dino Distefano, Peter W. O'Hearn, Hongseok Yang:
Compositional Shape Analysis by Means of Bi-Abduction. 26:1-26:66 - Michael T. Goodrich:
Randomized Shellsort: A Simple Data-Oblivious Sorting Algorithm. 27:1-27:26 - Bernhard Haeupler, Barna Saha, Aravind Srinivasan:
New Constructive Aspects of the Lovász Local Lemma. 28:1-28:28 - Victor Vianu:
Invited Article Foreword. 29:1 - Rahul Jain, Zhengfeng Ji, Sarvagya Upadhyay, John Watrous:
QIP = PSPACE. 30:1-30:27
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-07-15 20:50 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
