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
[1]
Hilfe
Suche: Author="Klauck, Hartmut"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
New bounds for the garden-hose model
Hartmut Klauck
,
Supartha Podder
Leibniz International Proceedings in Informatics (LIPIcs)
29
, 2014, pp. 481-492
An improved interactive streaming algorithm for the distinct elements problem
Hartmut Klauck
,
Ved Prakash
Lecture Notes in Computer Science
8572
, 2014, pp. 919-930
Fooling one-sided quantum protocols
Hartmut Klauck
,
Ronald de Wolf
Leibniz International Proceedings in Informatics (LIPIcs)
20
, 2013, pp. 424-433
New bounds on the classical and quantum communication complexity of some graph properties
Gábor Ivanyos
,
Hartmut Klauck
,
Troy Lee
,
Miklos Santha
,
Ronald de Wolf
Leibniz International Proceedings in Informatics (LIPIcs)
18
, 2012, pp. 148-159
Optimal direct sum results for deterministic and randomized decision tree complexity
Rahul Jain
,
Hartmut Klauck
,
Miklos Santha
Information Processing Letters
110
(20), 2010, pp. 893-897
Depth-independent lower bounds on the communication complexity of read-once Boolean formulas
Rahul Jain
,
Hartmut Klauck
,
Shengyu Zhang
Lecture Notes in Computer Science
6196
, 2010, pp. 54-59
A strong direct product theorem for disjointness
Hartmut Klauck
Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC'2010 (Cambridge, Massachusetts, June 5-8, 2010)
, 2010, pp. 77-86
Direct product theorems for classical communication complexity via subdistribution bounds
Rahul Jain
,
Hartmut Klauck
,
Ashwin Nayak
Proceedings of the 40th International ACM Symposium on Theory of Computing, STOC'2008 (Victoria, BC, Canada, May 17-20, 2008)
, 2008, pp. 599-608
Individual communication complexity
Harry Buhrman
,
Hartmut Klauck
,
Nikolai Vereshchagin
,
Paul Vitányi
Journal of Computer and System Sciences
73
(6), 2007, pp. 973-985
Lower bounds for quantum communication complexity
Hartmut Klauck
SIAM Journal on Computing
37
(1), 2007, pp. 20-46
One-way communication complexity and the Nec̑iporuk lower bound on formula size
Hartmut Klauck
SIAM Journal on Computing
37
(2), 2007, pp. 552-583
Quantum and classical strong direct product theorems and optimal time-space tradeoffs
Hartmut Klauck
,
Robert S̑palek
,
Ronald de Wolf
SIAM Journal on Computing
36
(5), 2006-2007, pp. 1472-1493
Individual communication complexity
Harry Buhrman
,
Hartmut Klauck
,
Nikolai Vereshchagin
,
Paul Vitányi
Lecture Notes in Computer Science
2996
, 2004, pp. 19-30
Quantum and classical communication-space tradeoffs from rectangle bounds
Hartmut Klauck
Lecture Notes in Computer Science
3328
, 2004, pp. 384-395
Quantum and approximate privacy
Hartmut Klauck
Theory of Computing Systems
37
(1), 2004, pp. 221-246
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
Communication complexity method for measuring nondeterminism in finite automata
Juraj Hromkovic̑
,
Sebastian Seibert
,
Juhani Karhumáki
,
Hartmut Klauck
,
Georg Schnitger
Information and Computation
172
(2), 2002, pp. 202-217
On quantum and approximate privacy
Hartmut Klauck
Lecture Notes in Computer Science
2285
, 2002, pp. 335-346
Algorithms for parity games
Hartmut Klauck
Lecture Notes in Computer Science
2500
, 2002, pp. 107-129
Interaction in quantum communication and the complexity of set disjointness
Hartmut Klauck
,
Ashwin Nayak
,
Amnon Ta-Shma
,
David Zuckerman
Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, STOC'2001 (Hersonissos, Crete, Greece, July 6-8, 2001)
, 2001, pp. 124-133
Measures of nondeterminism in finite automata
Juraj Hromkoviç
,
Juhani Karhumäki
,
Hartmut Klauck
,
Georg Schnitger
Lecture Notes in Computer Science
1853
, 2000, pp. 199-210
Quantum communication complexity
Hartmut Klauck
Proceedings in Informatics
8
, 2000, pp. 241-252
On quantum and probabilistic communication: Las Vegas and one-way protocols
Hartmut Klauck
Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, STOC'2000 (Portland, Oregon, May 21-23, 2000)
, 2000, pp. 644-651
Lower bounds for computation with limited nondeterminism
Hartmut Klauck
Proceedings of the 13th Annual IEEE Conference on Computational Complexity (Buffalo, New York, June 15-18, 1998)
, 1998, pp. 141-152
On the size of probabilistic formulae
Hartmut Klauck
Lecture Notes in Computer Science
1350
, 1997, pp. 243-252
Seiten 1
2
>