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=52
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Approximate distance oracles
Mikkel Thorup
,
Uri Zwick
Journal of the ACM
52
(1), 2005, pp. 1-24
Determining approximate shortest paths on weighted polyhedral surfaces
L. Aleksandrov
,
A. Maheshwari
,
J.-R. Sack
Journal of the ACM
52
(1), 2005, pp. 25-53
Aggregate operators in probabilistic databases
Robert Ross
,
V.S. Subrahmanian
,
John Grant
Journal of the ACM
52
(1), 2005, pp. 54-101
Analyzing security protocols with secrecy types and logic programs
Martín Abadi
,
Bruno Blanchet
Journal of the ACM
52
(1), 2005, pp. 102-146
Trade-offs for fully dynamic transitive closure on DAGs: Breaking through the
O(n^2)
barrier
Camil Demetrescu
,
Giuseppe F. Italiano
Journal of the ACM
52
(2), 2005, pp. 147-156
Lower bounds for linear degeneracy testing
Nir Ailon
,
Bernard Chazelle
Journal of the ACM
52
(2), 2005, pp. 157-171
Simple extractors for all min-entropies and a new pseudorandom generator
Ronen Shaltiel
,
Christopher Umans
Journal of the ACM
52
(2), 2005, pp. 172-216
Trade-offs in probabilistic packet marking for
IP
traceback
Micah Adler
Journal of the ACM
52
(2), 2005, pp. 217-244
An information-theoretic approach to normal forms for relational and XML data
Marcelo Arenas
,
Leonid Libkin
Journal of the ACM
52
(2), 2005, pp. 246-283
The complexity of XPath query evaluation and XML typing
Georg Gottlob
,
Christoph Koch
,
Reinhard Pichler
,
Luc Segoufin
Journal of the ACM
52
(2), 2005, pp. 284-335
An improved exponential-time algorithm for
k
-SAT
Ramamohan Paturi
,
Pavel Pudlák
,
Michael E. Saks
,
Francis Zane
Journal of the ACM
52
(3), 2005, pp. 337-364
Simplify: A theorem prover for program checking
David Detlefs
,
Greg Nelson
,
James B. Saxe
Journal of the ACM
52
(3), 2005, pp. 365-473
Beyond proof-of-compliance: Security analysis in trust management
Ninghui Li
,
John C. Mitchell
,
William H. Winsborough
Journal of the ACM
52
(3), 2005, pp. 474-514
An in-place sorting with
O(n \log n)
comparisons and
O(n)
moves
Gianni Franceschini
,
Viliam Geffert
Journal of the ACM
52
(4), 2005, pp. 515-537
Asymmetric
k
-center is log
^*
n
-hard to approximate
Julia Chuzhoy
,
Sudipto Guha
,
Eran Halperin
,
Sanjeev Khanna
,
Guy Kortsarz
,
Robert Krauthgamer
,
Joseph (Seffi) Naor
Journal of the ACM
52
(4), 2005, pp. 538-551
Indexing compressed text
Paolo Ferragina
,
Giovanni Manzini
Journal of the ACM
52
(4), 2005, pp. 552-581
Source routing and scheduling in packet networks
Matthew Andrews
,
Antonio Fernández
,
Ashish Goel
,
Lisa Zhang
Journal of the ACM
52
(4), 2005, pp. 582-601
Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs
Haim Kaplan
,
Moshe Lewenstein
,
Nira Shafrir
,
Maxim Sviridenko
Journal of the ACM
52
(4), 2005, pp. 602-626
Remote attribute grammars
John Tang Boyland
Journal of the ACM
52
(4), 2005, pp. 627-687
Boosting textual compression in optimal linear time
Paolo Ferragina
,
Raffaele Giancarlo
,
Giovanni Manzini
,
Marinella Sciortino
Journal of the ACM
52
(4), 2005, pp. 688-713
Frontier search
Richard E. Korf
,
Weixiong Zhang
,
Ignacio Thayer
,
Heath Hohwald
Journal of the ACM
52
(5), 2005, pp. 715-748
Lattice problems in
NP \cap coNP
Dorit Aharonov
,
Oded Regev
Journal of the ACM
52
(5), 2005, pp. 749-765
On the impossibility of dimension reduction in
l_1
Bo Brinkman
,
Moses Charikar
Journal of the ACM
52
(5), 2005, pp. 766-788
Hardness of approximating the shortest vector problem in lattices
Subhash Khot
Journal of the ACM
52
(5), 2005, pp. 789-808
Scheduling over a time-varying user-dependent channel with applications to high-speed wireless data
Matthew Andrews
,
Lisa Zhang
Journal of the ACM
52
(5), 2005, pp. 809-834
Seiten 1
2
>