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=2012
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A quantum Lovász local lemma
Andris Ambainis
,
Julia Kempe
,
Or Sattath
Journal of the ACM
59
(5), 2012, pp. 24: 1-24
Polylogarithmic concurrent data structures from monotone circuits
James Aspnes
,
Hagit Attiya
,
Keren Censor-Hillel
Journal of the ACM
59
(1), 2012, pp. 2: 1-24
SINR diagrams: Convexity and its applications in wireless networks
Chen Avin
,
Yuval Emek
,
Erez Kantor
,
Zvi Lotker
,
David Peleg
,
Liam Roditty
Journal of the ACM
59
(4), 2012, pp. 18: 1-34
On the trade-off between network connectivity, round complexity, and communication complexity of reliable message transmission
Ashwinkumar Badanidiyuru
,
Arpita Patra
,
Ashish Choudhury
,
Kannan Srinathan
,
C. Pandu Rangan
Journal of the ACM
59
(5), 2012, pp. 22: 1-35
Probabilistic
\omega
-automata
Christel Baier
,
Marcus Grösser
,
Nathalie Bertrand
Journal of the ACM
59
(1), 2012, pp. 1: 1-52
Graph expansion and communication costs of fast matrix multiplication
Grey Ballard
,
James Demmel
,
Olga Holtz
,
Oded Schwartz
Journal of the ACM
59
(6), 2012, pp. 32: 1-23
A primal-dual randomized algorithm for weighted paging
Nikhil Bansal
,
Niv Buchbinder
,
Joseph (Seffi) Naor
Journal of the ACM
59
(4), 2012, pp. 19: 1-24
On the (im)possibility of obfuscating programs
Boaz Barak
,
Oded Goldreich
,
Russell Impagliazzo
,
Steven Rudich
,
Amit Sahai
,
Salil Vadhan
,
Ke Yang
Journal of the ACM
59
(2), 2012, pp. 6: 1-48
New combinatorial topology bounds for renaming: The upper bound
Armando Castañeda
,
Sergio Rajsbaum
Journal of the ACM
59
(1), 2012, pp. 3: 1-49
From almost optimal algorithms to logics for complexity classes via listings and a halting problem
Yijia Chen
,
Jörg Flum
Journal of the ACM
59
(4), 2012, pp. 17: 1-34
Sublinear optimization for machine learning
Kenneth L. Clarkson
,
Elad Hazan
,
David P. Woodruff
Journal of the ACM
59
(5), 2012, pp. 23: 1-49
Continuous sampling from distributed streams
Graham Cormode
,
S. Muthukrishnan
,
Ke Yi
,
Qin Zhang
Journal of the ACM
59
(2), 2012, pp. 10: 1-25
Theories, solvers and static analysis by abstract interpretation
Patrick Cousot
,
Radhia Cousot
,
Laurent Mauborgne
Journal of the ACM
59
(6), 2012, pp. 31: 1-56
The dichotomy of probabilistic inference for unions of conjunctive queries
Nilesh Dalvi
,
Dan Suciu
Journal of the ACM
59
(6), 2012, pp. 30: 1-87
Approximating the partition function of the ferromagnetic Potts model
Leslie Ann Goldberg
,
Mark Jerrum
Journal of the ACM
59
(5), 2012, pp. 25: 1-31
A theory of goal-oriented communication
Oded Goldreich
,
Brendan Juba
,
Madhu Sudan
Journal of the ACM
59
(2), 2012, pp. 8: 1-65
Size and treewidth bounds for conjunctive queries
Georg Gottlob
,
Stephanie Tien Lee
,
Gregory Valiant
,
Paul Valiant
Journal of the ACM
59
(3), 2012, pp. 16: 1-35
Fixed-point definability and polynomial time on graphs with excluded minors
Martin Grohe
Journal of the ACM
59
(5), 2012, pp. 27: 1-64
New techniques for noninteractive zero-knowledge
Jens Groth
,
Rafail Ostrovsky
,
Amit Sahai
Journal of the ACM
59
(3), 2012, pp. 11: 1-35
An invariance principle for polytopes
Prahladh Harsha
,
Adam Klivans
,
Raghu Meka
Journal of the ACM
59
(6), 2012, pp. 29: 1-25
An efficient rigorous approach for identifying statistically significant frequent itemsets
Adam Kirsch
,
Michael Mitzenmacher
,
Andrea Pietracaprina
,
Geppino Pucci
,
Eli Upfal
,
Fabio Vandin
Journal of the ACM
59
(3), 2012, pp. 12: 1-22
The effectiveness of Lloyd-type methods for the
k
-means problem
Rafail Ostrovsky
,
Yuval Rabani
,
Leonard J. Schulman
,
Chaitanya Swamy
Journal of the ACM
59
(6), 2012, pp. 28: 1-22
Highly acyclic groups, hypergraph covers, and the guarded fragment
Martin Otto
Journal of the ACM
59
(1), 2012, pp. 5: 1-40
The power of simple tabulation hashing
Mihai Pȃtraşcu
,
Mikkel Thorup
Journal of the ACM
59
(3), 2012, pp. 14: 1-50
The notion of a rational convex program, and an algorithm for the Arrow-Debreu Nash bargaining game
Vijay V. Vazirani
Journal of the ACM
59
(2), 2012, pp. 7: 1-36
Seiten 1
2
>