External Links

Journal: Journal of the ACM

Volume 57, Issue 6

31 -- 0Ronald Fagin, Alan Nash. The structure of inverses in schema mappings
32 -- 0Santosh Vempala. A random-sampling-based algorithm for learning intersections of halfspaces
33 -- 0Javier Esparza, Stefan Kiefer, Michael Luttenberger. Newtonian program analysis
34 -- 0Sean Hallgren, Cristopher Moore, Martin Rötteler, Alexander Russell, Pranab Sen. Limitations of quantum coset states for graph isomorphism

Volume 57, Issue 5

0 -- 0Lawrence Mandow, José-Luis Pérez-de-la-Cruz. Multiobjective A:::*::: search with consistent heuristics
0 -- 0Boris Motik, Riccardo Rosati. Reconciling description logics and rules
0 -- 0Mark Braverman. Polylogarithmic independence fools ::::AC:::::::0::: circuits
0 -- 0Dana Moshkovitz, Ran Raz. Two-query PCP with subconstant error

Volume 57, Issue 4

0 -- 0Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui. Tight failure detection bounds on atomic object implementations
0 -- 0Shlomi Dolev, Yuval Elovici, Rami Puzis. Routing betweenness centrality
0 -- 0Alon Altman, Moshe Tennenholtz. An axiomatic approach to personalized ranking systems
0 -- 0Boaz Barak, Guy Kindler, Ronen Shaltiel, Benny Sudakov, Avi Wigderson. Simulating independence: New constructions of condensers, ramsey graphs, dispersers, and extractors
0 -- 0Prasad Chebolu, Alan M. Frieze, Páll Melsted. Finding a maximum matching in a sparse random graph in ::::O::::(::::n::::) expected time
0 -- 0T.-H. Hubert Chan, Anupam Gupta, Kunal Talwar. Ultra-low-dimensional embeddings for doubling metrics
0 -- 0Witold Charatonik, Leszek Pacholski. Set constraints with projections

Volume 57, Issue 3

0 -- 0Eric Allender, Michal Koucký. Amplifying lower bounds by means of self-reducibility
0 -- 0Victor Vianu. Editorial: JACM at the start of a new decade
0 -- 0Balder ten Cate, Luc Segoufin. Transitive closure logic, nested tree walking automata, and XPath
0 -- 0Maria-Florina Balcan, Avrim Blum. A discriminative model for semi-supervised learning
0 -- 0Timothy M. Chan. A dynamic data structure for 3-D convex hulls and 2-D nearest neighbor queries
0 -- 0Gabriel Nivasch. Improved bounds and new techniques for Davenport--Schinzel sequences and their generalizations
0 -- 0Punyashloka Biswal, James R. Lee, Satish Rao. Eigenvalue bounds, spectral partitioning, and metrical deformations via flows
0 -- 0Tetsuo Shibuya. Geometric suffix tree: Indexing protein 3-D structures

Volume 57, Issue 2

0 -- 0David M. Blei, Thomas L. Griffiths, Michael I. Jordan. The nested chinese restaurant process and bayesian nonparametric inference of topic hierarchies
0 -- 0Manuel Bodirsky, Jan Kára. The complexity of temporal constraint satisfaction problems
0 -- 0Christoph Lenzen, Thomas Locher, Roger Wattenhofer. Tight bounds for clock synchronization
0 -- 0Amit Kumar, Yogish Sabharwal, Sandeep Sen. Linear-time approximation schemes for clustering problems in any dimensions
0 -- 0Robin A. Moser, Gábor Tardos. A constructive proof of the general lovász local lemma
0 -- 0Georg Gottlob, Pierre Senellart. Schema mapping discovery from data instances
0 -- 0Kathleen Fisher, Yitzhak Mandelbaum, David Walker. The next 700 data description languages

Volume 57, Issue 1

0 -- 0Sunil Arya, Theocharis Malamatos, David M. Mount. Space-time tradeoffs for approximate nearest neighbor searching
0 -- 0Jonathan Katz, Rafail Ostrovsky, Moti Yung. Efficient and secure authenticated key exchange using weak passwords
0 -- 0Esther Ezra, Micha Sharir. On the union of fat tetrahedra in three dimensions
0 -- 0Paolo Ferragina, Fabrizio Luccio, Giovanni Manzini, S. Muthukrishnan. Compressing and indexing labeled trees, with applications
runs on