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=2007
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Fast computation of low-rank matrix approximations
Dimitris Achlioptas
,
Frank McSherry
Journal of the ACM
54
(2), 2007, pp. 9: 1-19
On the maximum satisfiability of random formulas
Dimitris Achlioptas
,
Assaf Naor
,
Yuval Peres
Journal of the ACM
54
(2), 2007, pp. 10: 1-21
Dynamic ordered sets with exponential search trees
Arne Andersson
,
Mikkel Thorup
Journal of the ACM
54
(3), 2007, pp. 13: 1-40
A characterization of regular expressions under bisimulation
J.C.M. Baeten
,
F. Corradini
,
C.A. Grabmayer
Journal of the ACM
54
(2), 2007, pp. 6: 1-28
Speed scaling to manage energy and temperature
Nikhil Bansal
,
Tracy Kimbrel
,
Kirk Pruhs
Journal of the ACM
54
(1), 2007, pp. 3: 1-39
The rational numbers as an abstract data type
J.A. Bergstra
,
J.V. Tucker
Journal of the ACM
54
(2), 2007, pp. 7: 1-25
(Almost) tight bounds and existence theorems for single-commodity confluent flows
Jiangzhuo Chen
,
Robert D. Kleinberg
,
László Lovász
,
Rajmohan Rajaraman
,
Ravi Sundaram
,
Adrian Vetta
Journal of the ACM
54
(4), 2007, pp. 16: 1-32
A testing scenario for probabilistic processes
Ling Cheung
,
Mariëlle Stoelinga
,
Frits Vaandrager
Journal of the ACM
54
(6), 2007, pp. 29: 1-45
Deciding equivalences among conjunctive aggregate queries
Sara Cohen
,
Werner Nutt
,
Yehoshua Sagiv
Journal of the ACM
54
(2), 2007, pp. 5: 1-50
Optimal pants decompositions and shortest homotopic cycles on an orientable surface
Éric Colin de Verdière
,
Francis Lazarus
Journal of the ACM
54
(4), 2007, pp. 18: 1-27
When are elections with few candidates hard to manipulate?
Vincent Conitzer
,
Tuomas Sandholm
,
Jérôme Lang
Journal of the ACM
54
(3), 2007, pp. 14: 1-33
The measurement calculus
Vincent Danos
,
Elham Kashefi
,
Prakash Panangaden
Journal of the ACM
54
(2), 2007, pp. 8: 1-45
The PCP theorem by gap amplification
Irit Dinur
Journal of the ACM
54
(3), 2007, pp. 12: 1-44
Priority sampling for estimation of arbitrary subset sums
Nick Duffield
,
Carsten Lund
,
Mikkel Thorup
Journal of the ACM
54
(6), 2007, pp. 32: 1-37
On counting homomorphisms to directed acyclic graphs
Martin Dyer
,
Leslie Ann Goldberg
,
Mike Paterson
Journal of the ACM
54
(6), 2007, pp. 27: 1-23
On computing all abductive explanations from a propositional Horn theory
Thomas Eiter
,
Kazuhisa Makino
Journal of the ACM
54
(5), 2007, pp. 24: 1-54
Time lower bounds for implementations of multi-writer snapshots
Faith Ellen
,
Panagiota Fatourou
,
Eric Ruppert
Journal of the ACM
54
(6), 2007, pp. 30: 1-34
Lossless abstraction of imperfect information games
Andrew Gilpin
,
Tuomas Sandholm
Journal of the ACM
54
(5), 2007, pp. 25: 1-30
The complexity of homomorphism and constraint satisfaction problems seen from the other side
Martin Grohe
Journal of the ACM
54
(1), 2007, pp. 1: 1-24
Approximation via cost sharing: Simpler and better approximation algorithms for network design
Anupam Gupta
,
Amit Kumar
,
Martin Pál
,
Tim Roughgarden
Journal of the ACM
54
(3), 2007, pp. 11: 1-38
On specification of read/write shared variables
Sibsankar Haldar
,
K. Vidyasankar
Journal of the ACM
54
(6), 2007, pp. 31: 1-19
Polynomial-time quantum algorithms for Pell's equation and the principal ideal problem
Sean Hallgren
Journal of the ACM
54
(1), 2007, pp. 4: 1-19
Characterizing and reasoning about probabilistic and non-probabilistic expectation
Joseph Y. Halpern
,
Riccardo Pucella
Journal of the ACM
54
(3), 2007, pp. 15: 1-49
Periodicity and unbordered words: A proof of the extended Duval conjecture
Tero Harju
,
Dirk Nowotka
Journal of the ACM
54
(4), 2007, pp. 20: 1-20
Polymorphic higher-order recursive path orderings
Jean-Pierre Jouannaud
,
Albert Rubio
Journal of the ACM
54
(1), 2007, pp. 2: 1-48
Seiten 1
2
>