Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarJournal of the ACM, Volume 57
Volume 57, Number 1, November 2009
Sunil Arya, Theocharis Malamatos, David M. Mount:
Space-time tradeoffs for approximate nearest neighbor searching. 1:1-1:54- Jonathan Katz, Rafail Ostrovsky, Moti Yung:
Efficient and secure authenticated key exchange using weak passwords. 3:1-3:39 - Paolo Ferragina, Fabrizio Luccio, Giovanni Manzini, S. Muthukrishnan:
Compressing and indexing labeled trees, with applications. 4:1-4:33
Volume 57, Number 2, January 2010
- Amit Kumar, Yogish Sabharwal, Sandeep Sen:
Linear-time approximation schemes for clustering problems in any dimensions. 5:1-5:32 - David M. Blei, Thomas L. Griffiths, Michael I. Jordan:
The nested chinese restaurant process and bayesian nonparametric inference of topic hierarchies. 7:1-7:30 - Christoph Lenzen, Thomas Locher, Roger Wattenhofer:
Tight bounds for clock synchronization. 8:1-8:42 - Kathleen Fisher, Yitzhak Mandelbaum, David Walker:
The next 700 data description languages. 10:1-10:51
Volume 57, Number 3, March 2010
- Punyashloka Biswal, James R. Lee, Satish Rao:
Eigenvalue bounds, spectral partitioning, and metrical deformations via flows. 13:1-13:23 - Timothy M. Chan:
A dynamic data structure for 3-D convex hulls and 2-D nearest neighbor queries. 16:1-16:15 - Gabriel Nivasch:
Improved bounds and new techniques for Davenport-Schinzel sequences and their generalizations. 17:1-17:44 - Balder ten Cate, Luc Segoufin:
Transitive closure logic, nested tree walking automata, and XPath. 18:1-18:41
Volume 57, Number 4, April 2010
- Boaz Barak, Guy Kindler, Ronen Shaltiel, Benny Sudakov, Avi Wigderson:
Simulating independence: New constructions of condensers, ramsey graphs, dispersers, and extractors. 20:1-20:52 - T.-H. Hubert Chan, Anupam Gupta, Kunal Talwar:
Ultra-low-dimensional embeddings for doubling metrics. 21:1-21:26 - Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui:
Tight failure detection bounds on atomic object implementations. 22:1-22:32 - Prasad Chebolu, Alan M. Frieze, Páll Melsted:
Finding a maximum matching in a sparse random graph in O(n) expected time. 24:1-24:27
Volume 57, Number 5, June 2010
- Lawrence Mandow, José-Luis Pérez-de-la-Cruz:
Multiobjective A* search with consistent heuristics. 27:1-27:25
Volume 57, Number 6, October 2010
- Santosh Vempala:
A random-sampling-based algorithm for learning intersections of halfspaces. 32:1-32:14 - Sean Hallgren, Cristopher Moore, Martin Rötteler, Alexander Russell, Pranab Sen:
Limitations of quantum coset states for graph isomorphism. 34:1-34:33
maintained by 
at 
at 
last updated on 2018-09-26 02:25 CEST by the dblp team
data released under the ODC-BY 1.0 license
see also: Terms of Use | Privacy Policy | Imprint