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=2004
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Containment and equivalence for a fragment of Xpath
Gerome Miklau
,
Dan Suciu
Journal of the ACM
51
(1), 2004, pp. 2-45
From discrepancy to declustering: Near-optimal multidimensional declustering strategies for range queries
Chung-Min Chen
,
Christine T. Cheng
Journal of the ACM
51
(1), 2004, pp. 46-73
Monadic datalog and the expressive power of languages for web information extraction
Georg Gottlob
,
Christoph Koch
Journal of the ACM
51
(1), 2004, pp. 74-113
Resolution lower bounds for the weak pigeonhole principle
Ran Raz
Journal of the ACM
51
(2), 2004, pp. 115-138
Lenses in arrangements of pseudo-circles and their applications
Pankaj K. Agarwal
,
Eran Nevo
,
János Pach
,
Rom Pinchasi
,
Micha Sharir
,
Shakhar Smorodinsky
Journal of the ACM
51
(2), 2004, pp. 139-186
The security of all RSA and discrete log bits
Johan Håstad
,
Mats Näslund
Journal of the ACM
51
(2), 2004, pp. 187-230
Number-theoretic constructions of efficient pseudo-random functions
Moni Naor
,
Omer Reingold
Journal of the ACM
51
(2), 2004, pp. 231-262
Segmentation problems
Jon Kleinberg
,
Christos Papadimitriou
,
Prabhakar Raghavan
Journal of the ACM
51
(2), 2004, pp. 263-280
On sufficient conditions for unsatisfiability of random formulas
Albert Atserias
Journal of the ACM
51
(2), 2004, pp. 281-311
Existential second-order logic over graphs: Charting the tractability frontier
Georg Gottlob
,
Phokion G. Kolaitis
,
Thomas Schwentick
Journal of the ACM
51
(2), 2004, pp. 312-362
Polynomial-time data reduction for dominating set
Jochen Alber
,
Michael R. Fellows
,
Rolf Niedermeier
Journal of the ACM
51
(3), 2004, pp. 363-384
Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time
Daniel A. Spielman
,
Shang-Hua Teng
Journal of the ACM
51
(3), 2004, pp. 385-463
Lower bounds on the bounded coefficient complexity of bilinear maps
Peter Bürgisser
,
Martin Lotz
Journal of the ACM
51
(3), 2004, pp. 464-482
Satisfiability of word equations with constants is in PSPACE
Wojciech Plandowski
Journal of the ACM
51
(3), 2004, pp. 483-496
On clusterings: Good, bad and spectral
Ravi Kannan
,
Santosh Vempala
,
Adrian Vetta
Journal of the ACM
51
(3), 2004, pp. 497-515
Nonclairvoyant scheduling to minimize the total flow time on single and parallel machines
Luca Becchetti
,
Stefano Leonardi
Journal of the ACM
51
(4), 2004, pp. 517-539
Solving convex programs by random walks
Dimitris Bertsimas
,
Santosh Vempala
Journal of the ACM
51
(4), 2004, pp. 540-556
The random oracle methodology, revisited
Ran Canetti
,
Oded Goldreich
,
Shai Halevi
Journal of the ACM
51
(4), 2004, pp. 557-594
Quantum lower bounds for the collision and the element distinctness problems
Scott Aaronson
,
Yaoyun Shi
Journal of the ACM
51
(4), 2004, pp. 595-605
Approximating extent measures of points
Pankaj K. Agarwal
,
Sariel Har-Peled
,
Kasturi R. Varadarajan
Journal of the ACM
51
(4), 2004, pp. 606-635
Edge-disjoint routing in plane switch graphs in linear time
Jan M. Hochstein
,
Karsten Weihe
Journal of the ACM
51
(4), 2004, pp. 636-670
A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries
Mark Jerrum
,
Alistair Sinclair
,
Eric Vigoda
Journal of the ACM
51
(4), 2004, pp. 671-697
Almost tight upper bounds for vertical decompositions in four dimensions
Vladlen Koltun
Journal of the ACM
51
(5), 2004, pp. 699-730
Automatic information extraction from large websites
Valter Crescenzi
,
Giansalvatore Mecca
Journal of the ACM
51
(5), 2004, pp. 731-779
Self-stabilizing clock synchronization in the presence of Byzantine faults
Shlomi Dolev
,
Jennifer L. Welch
Journal of the ACM
51
(5), 2004, pp. 780-799
Seiten 1
2
>