default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal 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 - Esther Ezra, Micha Sharir:
On the union of fat tetrahedra in three dimensions. 2:1-2:23 - 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 - Georg Gottlob, Pierre Senellart:
Schema mapping discovery from data instances. 6:1-6:37 - 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 - Manuel Bodirsky, Jan Kára:
The complexity of temporal constraint satisfaction problems. 9:1-9:41 - Kathleen Fisher, Yitzhak Mandelbaum, David Walker:
The next 700 data description languages. 10:1-10:51 - Robin A. Moser, Gábor Tardos:
A constructive proof of the general lovász local lemma. 11:1-11:15
Volume 57, Number 3, March 2010
- Victor Vianu:
Editorial: JACM at the start of a new decade. 12:1-12:3 - Punyashloka Biswal, James R. Lee, Satish Rao:
Eigenvalue bounds, spectral partitioning, and metrical deformations via flows. 13:1-13:23 - Eric Allender, Michal Koucký:
Amplifying lower bounds by means of self-reducibility. 14:1-14:36 - Tetsuo Shibuya:
Geometric suffix tree: Indexing protein 3-D structures. 15:1-15:17 - 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 - Maria-Florina Balcan, Avrim Blum:
A discriminative model for semi-supervised learning. 19:1-19:46
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 - Witold Charatonik, Leszek Pacholski:
Set constraints with projections. 23:1-23:37 - 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 - Shlomi Dolev, Yuval Elovici, Rami Puzis:
Routing betweenness centrality. 25:1-25:27 - Alon Altman, Moshe Tennenholtz:
An axiomatic approach to personalized ranking systems. 26:1-26:35
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 - Mark Braverman:
Polylogarithmic independence fools AC0 circuits. 28:1-28:10 - Dana Moshkovitz, Ran Raz:
Two-query PCP with subconstant error. 29:1-29:29 - Boris Motik, Riccardo Rosati:
Reconciling description logics and rules. 30:1-30:62
Volume 57, Number 6, October 2010
- Ronald Fagin, Alan Nash:
The structure of inverses in schema mappings. 31:1-31:57 - Santosh S. Vempala:
A random-sampling-based algorithm for learning intersections of halfspaces. 32:1-32:14 - Javier Esparza, Stefan Kiefer, Michael Luttenberger:
Newtonian program analysis. 33:1-33:47 - Sean Hallgren, Cristopher Moore, Martin Rötteler, Alexander Russell, Pranab Sen:
Limitations of quantum coset states for graph isomorphism. 34:1-34:33
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-02-07 23:54 CET 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:
