| 2021 | MFCS | The Power of One Clean Qubit in Communication Complexity. | Hartmut Klauck, Debbie Lim |
| 2018 | CSR | Quadratically Tight Relations for Randomized Query Complexity. | Rahul Jain, Hartmut Klauck, Srijita Kundu, Troy Lee, Miklos Santha, Swagato Sanyal, Jevgenijs Vihrovs |
| 2017 | MFCS | The Complexity of Quantum Disjointness. | Hartmut Klauck |
| 2015 | MFCS | Equality, Revisited. | Ralph Bottesch, Dmitry Gavinsky, Hartmut Klauck |
| 2015 | SODA | Distributed Computation of Large-scale Graph Problems. | Hartmut Klauck, Danupon Nanongkai, Gopal Pandurangan, Peter Robinson |
| 2014 | ICALP | An Improved Interactive Streaming Algorithm for the Distinct Elements Problem. | Hartmut Klauck, Ved Prakash |
| 2014 | MFCS | Two Results about Quantum Messages. | Hartmut Klauck, Supartha Podder |
| 2014 | PODC | Can quantum communication speed up distributed computation? | Michael Elkin, Hartmut Klauck, Danupon Nanongkai, Gopal Pandurangan |
| 2013 | STACS | Fooling One-Sided Quantum Protocols. | Hartmut Klauck, Ronald de Wolf |
| 2010 | COCOON | Depth-Independent Lower Bounds on the Communication Complexity of Read-Once Boolean Formulas. | Rahul Jain, Hartmut Klauck, Shengyu Zhang |
| 2010 | STOC | A strong direct product theorem for disjointness. | Hartmut Klauck |
| 2008 | STOC | Direct product theorems for classical communication complexity via subdistribution bounds: extended abstract. | Rahul Jain, Hartmut Klauck, Ashwin Nayak |
| 2004 | FOCS | Quantum and Classical Strong Direct Product Theorems and Optimal Time-Space Tradeoffs. | Hartmut Klauck, Robert Spalek, Ronald de Wolf |
| 2004 | STACS | Individual Communication Complexity: Extended Abstract. | Harry Buhrman, Hartmut Klauck, Nikolai K. Vereshchagin, Paul M. B. Vitnyi |
| 2003 | STOC | Quantum time-space tradeoffs for sorting. | Hartmut Klauck |
| 2002 | STACS | On Quantum and Approximate Privacy. | Hartmut Klauck |
| 2001 | FOCS | Lower Bounds for Quantum Communication Complexity. | Hartmut Klauck |
| 2001 | STOC | Interaction in quantum communication and the complexity of set disjointness. | Hartmut Klauck, Ashwin Nayak, Amnon Ta-Shma, David Zuckerman |
| 2000 | ICALP | Measures of Nondeterminism in Finite Automata. | Juraj Hromkovic, Juhani Karhumki, Hartmut Klauck, Georg Schnitger, Sebastian Seibert |
| 2000 | ICALP | Quantum Communication Complexity. | Hartmut Klauck |
| 2000 | STOC | On quantum and probabilistic communication: Las Vegas and one-way protocols. | Hartmut Klauck |
| 1997 | ISAAC | On the Size of Probabilistic Formulae. | Hartmut Klauck |