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=2006
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the sum-of-squares algorithm for bin packing
Janos Csirik
,
David S. Johnson
,
Claire Kenyon
,
James B. Orlin
,
Peter W. Shor
,
Richard R. Weber
Journal of the ACM
53
(1), 2006, pp. 1-65
A dichotomy theorem for constraint satisfaction problems on a 3-element set
Andrei A. Bulatov
Journal of the ACM
53
(1), 2006, pp. 66-120
A new average case analysis for completion time scheduling
Mark Scharbrodt
,
Thomas Schickinger
,
Angelika Steger
Journal of the ACM
53
(1), 2006, pp. 121-146
Hidden word statistics
Philippe Flajolet
,
Wojciech Szpankowski
,
Brigitte Vallée
Journal of the ACM
53
(1), 2006, pp. 147-183
Limits on the ability of quantum states to convey classical messages
Ashwin Nayak
,
Julia Salzman
Journal of the ACM
53
(1), 2006, pp. 184-206
On preservation under homomorphisms and unions of conjunctive queries
Albert Atserias
,
Anuj Dawar
,
Phokion G. Kolaitis
Journal of the ACM
53
(2), 2006, pp. 208-237
Conjunctive queries over trees
Georg Gottlob
,
Christoph Koch
,
Klaus U. Schulz
Journal of the ACM
53
(2), 2006, pp. 238-272
A characterization of first-order topological properties of planar spatial data
Michael Benedikt
,
Bart Kuijpers
,
Christof Löding
,
Jan Van den Bussche
,
Thomas Wilke
Journal of the ACM
53
(2), 2006, pp. 273-305
Stable distributions, pseudorandom generators, embeddings, and data stream computation
Piotr Indyk
Journal of the ACM
53
(3), 2006, pp. 307-323
Dependent rounding and its applications to approximation algorithms
Rajiv Gandhi
,
Samir Khuller
,
Srinivasan Parthasarathy
,
Aravind Srinivasan
Journal of the ACM
53
(3), 2006, pp. 324-360
Interface surfaces for protein-protein complexes
Yih-En Andrew Ban
,
Herbert Edelsbrunner
,
Johannes Rudolph
Journal of the ACM
53
(3), 2006, pp. 361-378
Split-ordered lists: Lock-free extensible hash tables
Ori Shalev
,
Nir Shavit
Journal of the ACM
53
(3), 2006, pp. 379-405
Probabilistic parsing strategies
Mark-Jan Nederhof
,
Giorgio Satta
Journal of the ACM
53
(3), 2006, pp. 406-436
The generalized two-server problem
René A. Sitters
,
Leen Stougie
Journal of the ACM
53
(3), 2006, pp. 437-458
Alpha-structural recursion and induction
Andrew M. Pitts
Journal of the ACM
53
(3), 2006, pp. 459-506
Computing with highly mixed states
Andris Ambainis
,
Leonard J. Schulman
,
Umesh Vazirani
Journal of the ACM
53
(3), 2006, pp. 507-531
Fast and accurate algorithms for protein side-chain packing
Jinbo Xu
,
Bonnie Berger
Journal of the ACM
53
(4), 2006, pp. 533-557
Locally testable codes and PCPs of almost-linear length
Oded Goldreich
,
Madhu Sudan
Journal of the ACM
53
(4), 2006, pp. 558-655
Distribution sort with randomized cycling
Jeffrey Scott Vitter
,
David Alexander Hutchinson
Journal of the ACM
53
(4), 2006, pp. 656-680
Backing up in singly linked lists
Amir M. Ben-Amram
,
Holger Petersen
Journal of the ACM
53
(4), 2006, pp. 681-705
New hardness results for congestion minimization and machine scheduling
Julia Chuzhoy
,
Joseph (Seffi) Naor
Journal of the ACM
53
(5), 2006, pp. 707-721
Finding a maximum likelihood tree is hard
Benny Chor
,
Tamir Tuller
Journal of the ACM
53
(5), 2006, pp. 722-744
Logarithmic hardness of the undirected edge-disjoint paths problem
Matthew Andrews
,
Lisa Zhang
Journal of the ACM
53
(5), 2006, pp. 745-761
Combining expert advice in reactive environments
Daniela Pucci De Farias
,
Nimrod Megiddo
Journal of the ACM
53
(5), 2006, pp. 762-799
Using expander graphs to find vertex connectivity
Harold N. Gabow
Journal of the ACM
53
(5), 2006, pp. 800-844
Seiten 1
2
>