- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| c24 |      | |
| c23 | | |
| 2012 | ||
| c22 | | Gábor Ivanyos, Hartmut Klauck, Troy Lee, Miklos Santha, Ronald de Wolf: New bounds on the classical and quantum communication complexity of some graph properties. FSTTCS 2012: 148-159 |
| i18 | | Gábor Ivanyos, Hartmut Klauck, Troy Lee, Miklos Santha, Ronald de Wolf: New bounds on the classical and quantum communication complexity of some graph properties. CoRR abs/1204.4596 (2012) |
| i17 | | |
| i16 | | Michael Elkin, Hartmut Klauck, Danupon Nanongkai, Gopal Pandurangan: Quantum Distributed Network Computing: Lower Bounds and Techniques. CoRR abs/1207.5211 (2012) |
| 2011 | ||
| c21 | | Hartmut Klauck: On Arthur Merlin Games in Communication Complexity. IEEE Conference on Computational Complexity 2011: 189-199 |
| i15 | | |
| 2010 | ||
| j8 | | Rahul Jain, Hartmut Klauck, Miklos Santha: Optimal direct sum results for deterministic and randomized decision tree complexity. Inf. Process. Lett. 110(20): 893-897 (2010) |
| c20 | | Rahul Jain, Hartmut Klauck: The Partition Bound for Classical Communication Complexity and Query Complexity. IEEE Conference on Computational Complexity 2010: 247-258 |
| c19 | | Rahul Jain, Hartmut Klauck, Shengyu Zhang: Depth-Independent Lower Bounds on the Communication Complexity of Read-Once Boolean Formulas. COCOON 2010: 54-59 |
| c18 | | |
| i14 | | Rahul Jain, Hartmut Klauck, Miklos Santha: Optimal Direct Sum Results for Deterministic and Randomized Decision Tree Complexity. CoRR abs/1004.0105 (2010) |
| 2009 | ||
| c17 | | Rahul Jain, Hartmut Klauck: New Results in the Simultaneous Message Passing Model via Information Theoretic Techniques. IEEE Conference on Computational Complexity 2009: 369-378 |
| i13 | | Rahul Jain, Hartmut Klauck: New Results in the Simultaneous Message Passing Model. CoRR abs/0902.3056 (2009) |
| i12 | | |
| i11 | | Rahul Jain, Hartmut Klauck, Shengyu Zhang: Depth-Independent Lower bounds on the Communication Complexity of Read-Once Boolean Formulas. CoRR abs/0908.4453 (2009) |
| i10 | | Rahul Jain, Hartmut Klauck: The Partition Bound for Classical Communication Complexity and Query Complexity. CoRR abs/0910.4266 (2009) |
| 2008 | ||
| c16 | | Rahul Jain, Hartmut Klauck, Ashwin Nayak: Direct product theorems for classical communication complexity via subdistribution bounds: extended abstract. STOC 2008: 599-608 |
| 2007 | ||
| j7 | | Harry Buhrman, Hartmut Klauck, Nikolai K. Vereshchagin, Paul M. B. Vitányi: Individual communication complexity. J. Comput. Syst. Sci. 73(6): 973-985 (2007) |
| j6 | | 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) |
| j5 | | Hartmut Klauck: Lower Bounds for Quantum Communication Complexity. SIAM J. Comput. 37(1): 20-46 (2007) |
| j4 | | 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) |
| j3 | | Hartmut Klauck, Ashwin Nayak, Amnon Ta-Shma, David Zuckerman: Interaction in Quantum Communication. IEEE Transactions on Information Theory 53(6): 1970-1982 (2007) |
| i9 | | Rahul Jain, Hartmut Klauck, Ashwin Nayak: Direct Product Theorems for Communication Complexity via Subdistribution Bounds. Electronic Colloquium on Computational Complexity (ECCC) 14(064) (2007) |
| 2004 | ||
| j2 | | |
| c15 | | Hartmut Klauck, Robert Spalek, Ronald de Wolf: Quantum and Classical Strong Direct Product Theorems and Optimal Time-Space Tradeoffs. FOCS 2004: 12-21 |
| c14 | | Hartmut Klauck: Quantum and Classical Communication-Space Tradeoffs from Rectangle Bounds. FSTTCS 2004: 384-395 |
| c13 | | Harry Buhrman, Hartmut Klauck, Nikolai K. Vereshchagin, Paul M. B. Vitányi: Individual Communication Complexity: Extended Abstract. STACS 2004: 19-30 |
| i8 | | Hartmut Klauck: Quantum and Classical Communication-Space Tradeoffs from Rectangle Bounds. CoRR abs/quant-ph/0412088 (2004) |
| i7 | | Hartmut Klauck, Robert Spalek, Ronald de Wolf: Quantum and Classical Strong Direct Product Theorems and Optimal Time-Space Tradeoffs. CoRR quant-ph/0402123 (2004) |
| i6 | | 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) |
| 2003 | ||
| c12 | | Hartmut Klauck: Rectangle Size Bounds and Threshold Covers in Communication Complexity. IEEE Conference on Computational Complexity 2003: 118-134 |
| c11 | | |
| i5 | | Harry Buhrman, Hartmut Klauck, Nikolai K. Vereshchagin, Paul M. B. Vitányi: Individual Communication Complexity. CoRR cs.CC/0304012 (2003) |
| 2002 | ||
| j1 | | 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) |
| c10 | | |
| i4 | | Hartmut Klauck: Rectangle Size Bounds and Threshold Covers in Communication Complexity. CoRR cs.CC/0208006 (2002) |
| i3 | | |
| 2001 | ||
| c9 | | |
| c8 | | |
| c7 | | Hartmut Klauck, Ashwin Nayak, Amnon Ta-Shma, David Zuckerman: Interaction in quantum communication and the complexity of set disjointness. STOC 2001: 124-133 |
| i2 | | Hartmut Klauck: One-way communication complexity and the Neciporuk lower bound on formula size. CoRR cs.CC/0111062 (2001) |
| 2000 | ||
| c6 | | Juraj Hromkovic, Juhani Karhumäki, Hartmut Klauck, Georg Schnitger, Sebastian Seibert: Measures of Nondeterminism in Finite Automata. ICALP 2000: 199-210 |
| c5 |  | |
| c4 | | Hartmut Klauck: On quantum and probabilistic communication: Las Vegas and one-way protocols. STOC 2000: 644-651 |
| i1 | | 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 | ||
| c3 | | Hartmut Klauck: Lower Bounds for Computation with Limited Nondeterminism. IEEE Conference on Computational Complexity 1998: 141- |
| 1997 | ||
| c2 | | |
| 1996 | ||
| c1 | | |
Colors in the list of coauthors
Last update Sat May 25 16:54:46 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page