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=2002
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Fast context-free grammar parsing requires fast Boolean matrix multiplication
Lillian Lee
Journal of the ACM
49
(1), 2002, pp. 1-15
An optimal minimum spanning tree algorithm
Seth Pettie
,
Vijaya Ramachandran
Journal of the ACM
49
(1), 2002, pp. 16-34
On a model of indexability and its bounds for range queries
Joseph M. Hellerstein
,
Elias Koutsoupias
,
Daniel P. Miranker
,
Christos H. Papadimitriou
,
Vasilis Samoladas
Journal of the ACM
49
(1), 2002, pp. 35-55
Expressiveness of structured document query languages based on attribute grammars
Frank Neven
,
Jan van den Bussche
Journal of the ACM
49
(1), 2002, pp. 56-100
Bounded concurrent timestamp systems using vector clocks
Sibsankar Haldar
,
Paul Vitányi
Journal of the ACM
49
(1), 2002, pp. 101-126
Map graphs
Zhi-Zhong Chen
,
Michelangelo Grigni
,
Christos H. Papadimitriou
Journal of the ACM
49
(2), 2002, pp. 127-138
Polynomial-time approximation schemes for geometric min-sum median clustering
Rafail Ostrovsky
,
Yuval Rabani
Journal of the ACM
49
(2), 2002, pp. 139-156
On the closest string and substring problems
Ming Li
,
Bin Ma
,
Lusheng Wang
Journal of the ACM
49
(2), 2002, pp. 157-171
Timed regular expressions
Eugene Asarin
,
Paul Caspi
,
Oded Maler
Journal of the ACM
49
(2), 2002, pp. 172-206
Understanding TACP Vegas: A duality model
Steven H. Low
,
Larry L. Peterson
,
Limin Wang
Journal of the ACM
49
(2), 2002, pp. 207-235
How bad is selfish routing?
Tim Roughgarden
,
Éva Tardos
Journal of the ACM
49
(2), 2002, pp. 236-259
Task assignment with unknown duration
Mor Harchol-Balter
Journal of the ACM
49
(2), 2002, pp. 260-288
All pairs shortest paths using bridging sets and rectangular matrix multiplication
Uri Zwick
Journal of the ACM
49
(3), 2002, pp. 289-317
Compactly encoding unstructured inputs with differential compression
Miklos Ajtai
,
Randal Burns
,
Ronald Fagin
,
Darrell D.E. Long
,
Larry Stockmeyer
Journal of the ACM
49
(3), 2002, pp. 318-367
On XML integrity constraints in the presence of DTDs
Wenfei Fan
,
Leonid Libkin
Journal of the ACM
49
(3), 2002, pp. 368-406
Paradoxes in distributed decisions on optimal load balancing for networks of homogeneous computers
Hisao Kameda
,
Odile Pourtallier
Journal of the ACM
49
(3), 2002, pp. 407-433
Tight bounds on cache use for stencil operations on rectangular grids
Michael A. Frumkin
,
Rob F. van der Wijngaart
Journal of the ACM
49
(3), 2002, pp. 434-453
Qualitative decision theory: From Savage's axioms to nonmonotonic reasoning
Didier Dubois
,
Hélène Fargier
,
Henri Prade
,
Patrice Perny
Journal of the ACM
49
(4), 2002, pp. 455-495
Dense quantum coding and quantum finite automata
Andris Ambainis
,
Ashwin Nayak
,
Amnon Ta-Shma
,
Umesh Vazirani
Journal of the ACM
49
(4), 2002, pp. 496-511
On the complexity analysis of static analyses
David McAllester
Journal of the ACM
49
(4), 2002, pp. 512-537
Formal verification of standards for distance vector routing protocols
Karthikeyan Bhargavan
,
Davor Obradovic
,
Carl A. Gunter
Journal of the ACM
49
(4), 2002, pp. 538-576
Truth revelation in approximately efficient combinatorial auctions
Daniel Lehmann
,
Liadan Ita O'Callaghan
,
Yoav Shoham
Journal of the ACM
49
(5), 2002, pp. 577-602
The greedy path-merging algorithm for Contig Scaffolding
Daniel H. Huson
,
Knut Reinert
,
Eugene W. Myers
Journal of the ACM
49
(5), 2002, pp. 603-615
Approximation algorithms for classification problems with pairwise relationships: Metric labeling and Markov random fields
Jon Kleinberg
,
Éva Tardos
Journal of the ACM
49
(5), 2002, pp. 616-639
On the online bin packing problem
Steven S. Seiden
Journal of the ACM
49
(5), 2002, pp. 640-671
Seiten 1
2
>