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 YEAR=2011
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Dynamic atomic storage without consensus
Marcos K. Aguilera
,
Idit Keidar
,
Dahlia Malkhi
,
Alexander Shraer
Journal of the ACM
58
(2), 2011, pp. 7: 1-32
Smoothed analysis of the
k
-means method
David Arthur
,
Bodo Manthey
,
Heiko Röglin
Journal of the ACM
58
(5), 2011, pp. 19: 1-31
Randomized algorithms for estimating the trace of an implicit symmetric positive semi-definite matrix
Haim Avron
,
Sivan Toledo
Journal of the ACM
58
(2), 2011, pp. 8: 1-17
XML with incomplete information
Pablo Barceló
,
Leonid Libkin
,
Antonella Poggi
,
Cristina Sirangelo
Journal of the ACM
58
(1), 2011, pp. 4: 1-62
Deterministic distributed vertex coloring in polylogarithmic time
Leonid Barenboim
,
Michael Elkin
Journal of the ACM
58
(5), 2011, pp. 23: 1-25
Approximation schemes for Steiner forest on planar graphs and graphs of bounded treewidth
Mohammadhossein Bateni
,
Mohammadtaghi Hajiaghayi
,
Dániel Marx
Journal of the ACM
58
(5), 2011, pp. 21: 1-37
XPath evaluation in linear time
Mikoƚaj Bojańczyk
,
Paweƚ Parys
Journal of the ACM
58
(4), 2011, pp. 17: 1-33
Delaunay triangulations in
O(\mbox {sort}(n))
time and more
Kevin Buchin
,
Wolfgang Mulzer
Journal of the ACM
58
(2), 2011, pp. 6: 1-27
Compositional shape analysis by means of bi-abduction
Cristiano Calcagno
,
Dino Distefano
,
Peter W. O'Hearn
,
Hongseok Yang
Journal of the ACM
58
(6), 2011, pp. 26: 1-66
Robust principal component analysis?
Emmanuel J. Candès
,
Xiaodong Li
,
Yi Ma
,
John Wright
Journal of the ACM
58
(3), 2011, pp. 11: 1-37
Online geometric reconstruction
Bernard Chazelle
,
C. Seshadhri
Journal of the ACM
58
(4), 2011, pp. 14: 1-32
On the competitive ratio of evaluating priced functions
Ferdinando Cicalese
,
Eduardo Sany Laber
Journal of the ACM
58
(3), 2011, pp. 9: 1-40
Epistemic privacy
Alexandre Evfimievski
,
Ronald Fagin
,
David Woodruff
Journal of the ACM
58
(1), 2011, pp. 2: 1-45
Probabilistic data exchange
Ronald Fagin
,
Benny Kimelfeld
,
Phokion G. Kolaitis
Journal of the ACM
58
(4), 2011, pp. 15: 1-55
Randomized Shellsort: A simple data-oblivious sorting algorithm
Michael T. Goodrich
Journal of the ACM
58
(6), 2011, pp. 27: 1-26
Complete fairness in secure two-party computation
S. Dov Gordon
,
Carmit Hazay
,
Jonathan Katz
,
Yehuda Lindell
Journal of the ACM
58
(6), 2011, pp. 24: 1-37
Approximation algorithms for restless bandit problems
Sudipto Guha
,
Kamesh Munagala
,
Peng Shi
Journal of the ACM
58
(1), 2011, pp. 3: 1-50
New constructive aspects of the Lovász Local Lemma
Bernhard Haeupler
,
Barna Saha
,
Aravind Srinivasan
Journal of the ACM
58
(6), 2011, pp. 28: 1-28
QIP = PSPACE
Rahul Jain
,
Zhengfeng Ji
,
Sarvagya Upadhyay
,
John Watrous
Journal of the ACM
58
(6), 2011, pp. 30: 1-27
Breaking the
O(n^2)
bit barrier: Scalable Byzantine agreement with an adaptive adversary
Valerie King
,
Jared Saia
Journal of the ACM
58
(4), 2011, pp. 18: 1-24
Truthful and near-optimal mechanism design via linear programming
Ron Lavi
,
Chaitanya Swamy
Journal of the ACM
58
(6), 2011, pp. 25: 1-24
Hardness of approximating flow and job shop scheduling problems
Monaldo Mastrolilli
,
Ola Svensson
Journal of the ACM
58
(5), 2011, pp. 20: 1-32
On P vs. NP and geometric complexity theory - Dedicated to Sri Ramakrishna
Ketan D. Mulmuley
Journal of the ACM
58
(2), 2011, pp. 5: 1-26
Estimating PageRank on graph streams
Atish Das Sarma
,
Sreenivas Gollapudi
,
Rina Panigrahy
Journal of the ACM
58
(3), 2011, pp. 13: 1-13
Market equilibrium under separable, piecewise-linear, concave utilities
Vijay V. Vazirani
,
Mihalis Yannakakis
Journal of the ACM
58
(3), 2011, pp. 10: 1-25