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: Booktitle=Proceedings of the 35th Annual ACM Symposium on Theory of Computing, STOC'2003 (San Diego, California, USA, June 9-11, 2003)
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Hidden translation and orbit coset in quantum computing
Katalin Friedl
,
Gábor Ivanyos
,
Frédéric Magniez
,
Miklos Santha
,
Pranab Sen
Proceedings of the 35th Annual ACM Symposium on Theory of Computing, STOC'2003 (San Diego, California, USA, June 9-11, 2003)
, 2003, pp. 1-9
Classical deterministic complexity of Edmonds' problem and quantum entanglement
Leonid Gurvits
Proceedings of the 35th Annual ACM Symposium on Theory of Computing, STOC'2003 (San Diego, California, USA, June 9-11, 2003)
, 2003, pp. 10-19
Adiabatic quantum state generation and statistical zero knowledge
Dorit Aharonov
,
Amnon Ta-Shma
Proceedings of the 35th Annual ACM Symposium on Theory of Computing, STOC'2003 (San Diego, California, USA, June 9-11, 2003)
, 2003, pp. 20-29
Better streaming algorithms for clustering problems
Moses Charikar
,
Liadan O'Callaghan
,
Rina Panigrahy
Proceedings of the 35th Annual ACM Symposium on Theory of Computing, STOC'2003 (San Diego, California, USA, June 9-11, 2003)
, 2003, pp. 30-39
Approximation algorithms for hierarchical location problems
C. Greg Plaxton
Proceedings of the 35th Annual ACM Symposium on Theory of Computing, STOC'2003 (San Diego, California, USA, June 9-11, 2003)
, 2003, pp. 40-49
Approximation schemes for clustering problems
W. Fernandez de la Vega
,
Marek Karpinski
,
Claire Kenyon
,
Yuval Rabani
Proceedings of the 35th Annual ACM Symposium on Theory of Computing, STOC'2003 (San Diego, California, USA, June 9-11, 2003)
, 2003, pp. 50-58
Exponential algorithmic speedup by a quantum walk
Andrew M. Childs
,
Richard Cleve
,
Enrico Deotto
,
Edward Farhi
,
Sam Gutmann
,
Daniel A. Spielman
Proceedings of the 35th Annual ACM Symposium on Theory of Computing, STOC'2003 (San Diego, California, USA, June 9-11, 2003)
, 2003, pp. 59-68
Quantum time-space tradeoffs for sorting
Hartmut Klauck
Proceedings of the 35th Annual ACM Symposium on Theory of Computing, STOC'2003 (San Diego, California, USA, June 9-11, 2003)
, 2003, pp. 69-76
On the power of quantum fingerprinting
Andrew Chi-Chih Yao
Proceedings of the 35th Annual ACM Symposium on Theory of Computing, STOC'2003 (San Diego, California, USA, June 9-11, 2003)
, 2003, pp. 77-81
Management of multi-queue switches in QoS networks
Yossi Azar
,
Yossi Richter
Proceedings of the 35th Annual ACM Symposium on Theory of Computing, STOC'2003 (San Diego, California, USA, June 9-11, 2003)
, 2003, pp. 82-89
Constant factor approximation of vertex-cuts in planar graphs
Eyal Amir
,
Robert Krauthgamer
,
Satish Rao
Proceedings of the 35th Annual ACM Symposium on Theory of Computing, STOC'2003 (San Diego, California, USA, June 9-11, 2003)
, 2003, pp. 90-99
The online set cover problem
Noga Alon
,
Baruch Awerbuch
,
Yossi Azar
,
Niv Buchbinder
,
Joseph (Seffi) Naor
Proceedings of the 35th Annual ACM Symposium on Theory of Computing, STOC'2003 (San Diego, California, USA, June 9-11, 2003)
, 2003, pp. 100-105
Exponential lower bound for 2-query locally decodable codes via a quantum argument
Iordanis Kerenidis
,
Ronald de Wolf
Proceedings of the 35th Annual ACM Symposium on Theory of Computing, STOC'2003 (San Diego, California, USA, June 9-11, 2003)
, 2003, pp. 106-115
Optimal probabilistic fingerprint codes
Gábor Tardos
Proceedings of the 35th Annual ACM Symposium on Theory of Computing, STOC'2003 (San Diego, California, USA, June 9-11, 2003)
, 2003, pp. 116-125
Linear time encodable and list decodable codes
Venkatesan Guruswami
,
Piotr Indyk
Proceedings of the 35th Annual ACM Symposium on Theory of Computing, STOC'2003 (San Diego, California, USA, June 9-11, 2003)
, 2003, pp. 126-135
Reconstructing curves in three (and higher) dimensional space from noisy data
Don Coppersmith
,
Madhu Sudan
Proceedings of the 35th Annual ACM Symposium on Theory of Computing, STOC'2003 (San Diego, California, USA, June 9-11, 2003)
, 2003, pp. 136-142
Short path queries in planar graphs in constant time
Łukasz Kowalik
,
Maciej Kurowski
Proceedings of the 35th Annual ACM Symposium on Theory of Computing, STOC'2003 (San Diego, California, USA, June 9-11, 2003)
, 2003, pp. 143-148
Integer priority queues with decrease key in constant time and the single source shortest paths problem
Mikkel Thorup
Proceedings of the 35th Annual ACM Symposium on Theory of Computing, STOC'2003 (San Diego, California, USA, June 9-11, 2003)
, 2003, pp. 149-158
A new approach to dynamic all pairs shortest paths
Camil Demetrescu
,
Giuseppe F. Italiano
Proceedings of the 35th Annual ACM Symposium on Theory of Computing, STOC'2003 (San Diego, California, USA, June 9-11, 2003)
, 2003, pp. 159-166
A fast algorithm for computing Steiner edge connectivity
Richard Cole
,
Ramesh Hariharan
Proceedings of the 35th Annual ACM Symposium on Theory of Computing, STOC'2003 (San Diego, California, USA, June 9-11, 2003)
, 2003, pp. 167-176
The computational complexity of some Julia sets
Robert Rettinger
,
Klaus Weihrauch
Proceedings of the 35th Annual ACM Symposium on Theory of Computing, STOC'2003 (San Diego, California, USA, June 9-11, 2003)
, 2003, pp. 177-185
Time-space tradeoff lower bounds for integer multiplication and graphs of arithmetic functions
Martin Sauerhoff
,
Philipp Woelfel
Proceedings of the 35th Annual ACM Symposium on Theory of Computing, STOC'2003 (San Diego, California, USA, June 9-11, 2003)
, 2003, pp. 186-195
Boosting in the presence of noise
Adam Kalai
,
Rocco A. Servedio
Proceedings of the 35th Annual ACM Symposium on Theory of Computing, STOC'2003 (San Diego, California, USA, June 9-11, 2003)
, 2003, pp. 196-205
Learning juntas
Elchanan Mossel
,
Ryan O'Donnell
,
Rocco A. Servedio
Proceedings of the 35th Annual ACM Symposium on Theory of Computing, STOC'2003 (San Diego, California, USA, June 9-11, 2003)
, 2003, pp. 206-212
Generating random regular graphs
Jeong Han Kim
,
Van H. Vu
Proceedings of the 35th Annual ACM Symposium on Theory of Computing, STOC'2003 (San Diego, California, USA, June 9-11, 2003)
, 2003, pp. 213-222
Seiten 1
2
3
4
>