Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Journal=J. ACM AND Volume=57
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Amplifying lower bounds by means of self-reducibility
Eric Allender
,
Michal Koucký
Journal of the ACM
57
(3), 2010, pp. 14: 1-36
An axiomatic approach to personalized ranking systems
Alon Altman
,
Moshe Tennenholtz
Journal of the ACM
57
(4), 2010, pp. 26: 1-35
Space-time tradeoffs for approximate nearest neighbor searching
Sunil Arya
,
Theocharis Malamatos
,
David M. Mount
Journal of the ACM
57
(1), 2010, pp. 1: 1-54
A discriminative model for semi-supervised learning
Maria-Florina Balcan
,
Avrim Blum
Journal of the ACM
57
(3), 2010, pp. 19: 1-46
Simulating independence: New constructions of condensers, Ramsey graphs, dispersers, and extractors
B. Barak
,
G. Kindler
,
R. Shaltiel
,
B. Sudakov
,
A. Wigderson
Journal of the ACM
57
(4), 2010, pp. 20: 1-52
Eigenvalue bounds, spectral partitioning, and metrical deformations via flows
Punyashloka Biswal
,
James R. Lee
,
Satish Rao
Journal of the ACM
57
(3), 2010, pp. 13: 1-23
The nested Chinese restaurant process and Bayesian nonparametric inference of topic hierarchies
David M. Blei
,
Thomas L. Griffiths
,
Michael I. Jordan
Journal of the ACM
57
(2), 2010, pp. 7: 1-30
The complexity of temporal constraint satisfaction problems
Manuel Bodirsky
,
Jan Kára
Journal of the ACM
57
(2), 2010, pp. 9: 1-41
Polylogarithmic independence fools
AC^0
circuits
Mark Braverman
Journal of the ACM
57
(5), 2010, pp. 28: 1-10
Ultra-low-dimensional embeddings for doubling metrics
T.-H. Hubert Chan
,
Anupam Gupta
,
Kunal Talwar
Journal of the ACM
57
(4), 2010, pp. 21: 1-26
A dynamic data structure for 3-
d
convex hulls and 2-
d
nearest neighbor queries
Timothy M. Chan
Journal of the ACM
57
(3), 2010, pp. 16: 1-15
Set constraints with projections
Witold Charatonik
,
Leszek Pacholski
Journal of the ACM
57
(4), 2010, pp. 23: 1-37
Finding a maximum matching in a sparse random graph in
O(n)
expected time
Prasad Chebolu
,
Alan Frieze
,
Páll Melsted
Journal of the ACM
57
(4), 2010, pp. 24: 1-27
Tight failure detection bounds on atomic object implementations
Carole Delporte-Gallet
,
Hugues Fauconnier
,
Rachid Guerraoui
Journal of the ACM
57
(4), 2010, pp. 22: 1-32
Routing betweenness centrality
Shlomi Dolev
,
Yuval Elovici
,
Rami Puzis
Journal of the ACM
57
(4), 2010, pp. 25: 1-27
Newtonian program analysis
Javier Esparza
,
Stefan Kiefer
,
Michael Luttenberger
Journal of the ACM
57
(6), 2010, pp. 33: 1-47
On the union of fat tetrahedra in three dimensions
Esther Ezra
,
Micha Sharir
Journal of the ACM
57
(1), 2010, pp. 2: 1-23
The structure of inverses in schema mappings
Ronald Fagin
,
Alan Nash
Journal of the ACM
57
(6), 2010, pp. 31: 1-57
Compressing and indexing labeled trees, with applications
Paolo Ferragina
,
Fabrizio Luccio
,
Giovanni Manzini
,
S. Muthukrishnan
Journal of the ACM
57
(1), 2010, pp. 4: 1-33
The next 700 data description languages
Kathleen Fisher
,
Yitzhak Mandelbaum
,
David Walker
Journal of the ACM
57
(2), 2010, pp. 10: 1-51
Schema mapping discovery from data instances
Georg Gottlob
,
Pierre Senellart
Journal of the ACM
57
(2), 2010, pp. 6: 1-37
Limitations of quantum coset states for graph isomorphism
Sean Hallgren
,
Cristopher Moore
,
Martin Rötteler
,
Alexander Russell
,
Pranab Sen
Journal of the ACM
57
(6), 2010, pp. 34: 1-33
Efficient and secure authenticated key exchange using weak passwords
Jonathan Katz
,
Rafail Ostrovsky
,
Moti Yung
Journal of the ACM
57
(1), 2010, pp. 3: 1-39
Linear-time approximation schemes for clustering problems in any dimensions
Amit Kumar
,
Yogish Sabharwal
,
Sandeep Sen
Journal of the ACM
57
(2), 2010, pp. 5: 1-32
Tight bounds for clock synchronization
Christoph Lenzen
,
Thomas Locher
,
Roger Wattenhofer
Journal of the ACM
57
(2), 2010, pp. 8: 1-42
Seiten 1
2
>