| 2009 |
|---|
| 33 | EE | Rahul Jain,
Hartmut Klauck:
New Results in the Simultaneous Message Passing Model
CoRR abs/0902.3056: (2009) |
| 2008 |
|---|
| 32 | EE | Rahul Jain,
Hartmut Klauck,
Ashwin Nayak:
Direct product theorems for classical communication complexity via subdistribution bounds: extended abstract.
STOC 2008: 599-608 |
| 2007 |
|---|
| 31 | EE | Rahul Jain,
Hartmut Klauck,
Ashwin Nayak:
Direct Product Theorems for Communication Complexity via Subdistribution Bounds.
Electronic Colloquium on Computational Complexity (ECCC) 14(064): (2007) |
| 30 | EE | Hartmut Klauck,
Ashwin Nayak,
Amnon Ta-Shma,
David Zuckerman:
Interaction in Quantum Communication.
IEEE Transactions on Information Theory 53(6): 1970-1982 (2007) |
| 29 | EE | Harry Buhrman,
Hartmut Klauck,
Nikolai K. Vereshchagin,
Paul M. B. Vitányi:
Individual communication complexity.
J. Comput. Syst. Sci. 73(6): 973-985 (2007) |
| 28 | EE | Hartmut Klauck,
Robert Spalek,
Ronald de Wolf:
Quantum and Classical Strong Direct Product Theorems and Optimal Time-Space Tradeoffs.
SIAM J. Comput. 36(5): 1472-1493 (2007) |
| 27 | EE | Hartmut Klauck:
Lower Bounds for Quantum Communication Complexity.
SIAM J. Comput. 37(1): 20-46 (2007) |
| 26 | EE | Hartmut Klauck:
One-Way Communication Complexity and the Ne[c-caron]iporuk Lower Bound on Formula Size.
SIAM J. Comput. 37(2): 552-583 (2007) |
| 2004 |
|---|
| 25 | EE | Hartmut Klauck,
Robert Spalek,
Ronald de Wolf:
Quantum and Classical Strong Direct Product Theorems and Optimal Time-Space Tradeoffs.
FOCS 2004: 12-21 |
| 24 | EE | Hartmut Klauck:
Quantum and Classical Communication-Space Tradeoffs from Rectangle Bounds.
FSTTCS 2004: 384-395 |
| 23 | EE | Harry Buhrman,
Hartmut Klauck,
Nikolai K. Vereshchagin,
Paul M. B. Vitányi:
Individual Communication Complexity: Extended Abstract.
STACS 2004: 19-30 |
| 22 | EE | Hartmut Klauck:
Quantum and Classical Communication-Space Tradeoffs from Rectangle Bounds
CoRR abs/quant-ph/0412088: (2004) |
| 21 | EE | Hartmut Klauck,
Robert Spalek,
Ronald de Wolf:
Quantum and Classical Strong Direct Product Theorems and Optimal Time-Space Tradeoffs
CoRR quant-ph/0402123: (2004) |
| 20 | EE | Hartmut Klauck,
Robert Spalek,
Ronald de Wolf:
Quantum and Classical Strong Direct Product Theorems and Optimal Time-Space Tradeoffs
Electronic Colloquium on Computational Complexity (ECCC)(045): (2004) |
| 19 | EE | Hartmut Klauck:
Quantum and Approximate Privacy.
Theory Comput. Syst. 37(1): 221-246 (2004) |
| 2003 |
|---|
| 18 | EE | Hartmut Klauck:
Rectangle Size Bounds and Threshold Covers in Communication Complexity.
IEEE Conference on Computational Complexity 2003: 118-134 |
| 17 | EE | Hartmut Klauck:
Quantum time-space tradeoffs for sorting.
STOC 2003: 69-76 |
| 16 | EE | Harry Buhrman,
Hartmut Klauck,
Nikolai K. Vereshchagin,
Paul M. B. Vitányi:
Individual Communication Complexity
CoRR cs.CC/0304012: (2003) |
| 2002 |
|---|
| 15 | EE | Hartmut Klauck:
On Quantum and Approximate Privacy.
STACS 2002: 335-346 |
| 14 | EE | Hartmut Klauck:
Rectangle Size Bounds and Threshold Covers in Communication Complexity
CoRR cs.CC/0208006: (2002) |
| 13 | EE | Hartmut Klauck:
Quantum Time-Space Tradeoffs for Sorting
CoRR quant-ph/0211174: (2002) |
| 12 | EE | Juraj Hromkovic,
Sebastian Seibert,
Juhani Karhumäki,
Hartmut Klauck,
Georg Schnitger:
Communication Complexity Method for Measuring Nondeterminism in Finite Automata.
Inf. Comput. 172(2): 202-217 (2002) |
| 2001 |
|---|
| 11 | EE | Hartmut Klauck:
Algorithms for Parity Games.
Automata, Logics, and Infinite Games 2001: 107-129 |
| 10 | | Hartmut Klauck:
Lower Bounds for Quantum Communication Complexity.
FOCS 2001: 288-297 |
| 9 | EE | Hartmut Klauck,
Ashwin Nayak,
Amnon Ta-Shma,
David Zuckerman:
Interaction in quantum communication and the complexity of set disjointness.
STOC 2001: 124-133 |
| 8 | EE | Hartmut Klauck:
One-way communication complexity and the Neciporuk lower bound on formula size
CoRR cs.CC/0111062: (2001) |
| 2000 |
|---|
| 7 | EE | Juraj Hromkovic,
Juhani Karhumäki,
Hartmut Klauck,
Georg Schnitger,
Sebastian Seibert:
Measures of Nondeterminism in Finite Automata.
ICALP 2000: 199-210 |
| 6 | | Hartmut Klauck:
Quantum Communication Complexity.
ICALP Satellite Workshops 2000: 241-252 |
| 5 | EE | Hartmut Klauck:
On quantum and probabilistic communication: Las Vegas and one-way protocols.
STOC 2000: 644-651 |
| 4 | EE | Juraj Hromkovic,
Juhani Karhumäki,
Hartmut Klauck,
Georg Schnitger,
Sebastian Seibert:
Measures of Nondeterminism in Finite Automata
Electronic Colloquium on Computational Complexity (ECCC) 7(76): (2000) |
| 1998 |
|---|
| 3 | EE | Hartmut Klauck:
Lower Bounds for Computation with Limited Nondeterminism.
IEEE Conference on Computational Complexity 1998: 141- |
| 1997 |
|---|
| 2 | | Hartmut Klauck:
On the Size of Probabilistic Formulae.
ISAAC 1997: 243-252 |
| 1996 |
|---|
| 1 | | Hartmut Klauck:
On the Hardness of Global and Local Approximation.
SWAT 1996: 88-99 |
