On the Hardness of Global and Local Approximation. - Hartmut Klauck (SWAT, 1996)

On the Size of Probabilistic Formulae. - Hartmut Klauck (ISAAC, 1997)

Lower Bounds for Computation with Limited Nondeterminism. - Hartmut Klauck (CCC, 1998)

Quantum Communication Complexity. - Hartmut Klauck (ICALP Satellite Workshops, 2000)

On quantum and probabilistic communication: Las Vegas and one-way protocols. - Hartmut Klauck (STOC, 2000)

Measures of Nondeterminism in Finite Automata - Juraj Hromkovic; Juhani Karhumäki; Hartmut Klauck; Georg Schnitger; Sebastian Seibert (Electron. Colloquium Comput. Complex., 2000)

Über beschränkte Interaktion in der Kommunikationskomplexität. - Hartmut Klauck (2000)

Algorithms for Parity Games. - Hartmut Klauck (Automata, Logics, and Infinite Games, 2001)

Interaction in quantum communication and the complexity of set disjointness. - Hartmut Klauck; Ashwin Nayak 001; Amnon Ta-Shma; David Zuckerman (STOC, 2001)

One-way communication complexity and the Neciporuk lower bound on formula size - Hartmut Klauck (CoRR, 2001)

Communication Complexity Method for Measuring Nondeterminism in Finite Automata. - Juraj Hromkovic; Sebastian Seibert; Juhani Karhumäki; Hartmut Klauck; Georg Schnitger (Inf. Comput., 2002)

Rectangle Size Bounds and Threshold Covers in Communication Complexity. - Hartmut Klauck (CCC, 2003)

Quantum time-space tradeoffs for sorting. - Hartmut Klauck (STOC, 2003)

Quantum and Classical Communication-Space Tradeoffs from Rectangle Bounds. - Hartmut Klauck (FSTTCS, 2004)

Individual Communication Complexity: Extended Abstract. - Harry Buhrman; Hartmut Klauck; Nikolai K. Vereshchagin; Paul M. B. Vitányi (STACS, 2004)

Quantum and Approximate Privacy. - Hartmut Klauck (Theory Comput. Syst., 2004)

Direct Product Theorems for Communication Complexity via Subdistribution Bounds. - Rahul Jain 001; Hartmut Klauck; Ashwin Nayak 001 (Electron. Colloquium Comput. Complex., 2007)

Individual communication complexity. - Harry Buhrman; Hartmut Klauck; Nikolai K. Vereshchagin; Paul M. B. Vitányi (J. Comput. Syst. Sci., 2007)

Lower Bounds for Quantum Communication Complexity. - Hartmut Klauck (SIAM J. Comput., 2007)

One-Way Communication Complexity and the Ne[c-caron]iporuk Lower Bound on Formula Size. - Hartmut Klauck (SIAM J. Comput., 2007)

Quantum and Classical Strong Direct Product Theorems and Optimal Time-Space Tradeoffs. - Hartmut Klauck; Robert Spalek; Ronald de Wolf (SIAM J. Comput., 2007)

Interaction in Quantum Communication. - Hartmut Klauck; Ashwin Nayak 001; Amnon Ta-Shma; David Zuckerman (IEEE Trans. Inf. Theory, 2007)

Direct product theorems for classical communication complexity via subdistribution bounds: extended abstract. - Rahul Jain 001; Hartmut Klauck; Ashwin Nayak 001 (STOC, 2008)

New Results in the Simultaneous Message Passing Model via Information Theoretic Techniques. - Rahul Jain 001; Hartmut Klauck (CCC, 2009)

New Results in the Simultaneous Message Passing Model - Rahul Jain 001; Hartmut Klauck (CoRR, 2009)

The Partition Bound for Classical Communication Complexity and Query Complexity. - Rahul Jain 001; Hartmut Klauck (CCC, 2010)

Depth-Independent Lower Bounds on the Communication Complexity of Read-Once Boolean Formulas. - Rahul Jain 001; Hartmut Klauck; Shengyu Zhang 002 (COCOON, 2010)

A strong direct product theorem for disjointness. - Hartmut Klauck (STOC, 2010)

Optimal direct sum results for deterministic and randomized decision tree complexity. - Rahul Jain 001; Hartmut Klauck; Miklos Santha (Inf. Process. Lett., 2010)

On Arthur Merlin Games in Communication Complexity. - Hartmut Klauck (CCC, 2011)

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 (FSTTCS, 2012)

Quantum Distributed Network Computing: Lower Bounds and Techniques - Michael Elkin; Hartmut Klauck; Danupon Nanongkai; Gopal Pandurangan (CoRR, 2012)

Streaming computations with a loquacious prover. - Hartmut Klauck; Ved Prakash (ITCS, 2013)

Fooling One-Sided Quantum Protocols. - Hartmut Klauck; Ronald de Wolf (STACS, 2013)

The Distributed Complexity of Large-scale Graph Processing. - Hartmut Klauck; Danupon Nanongkai; Gopal Pandurangan; Peter Robinson 002 (CoRR, 2013)

Dagstuhl Report 13082: Communication Complexity, Linear Optimization, and lower bounds for the nonnegative rank of matrices - LeRoy Beasely; Troy Lee; Hartmut Klauck; Dirk Oliver Theis (CoRR, 2013)

Communication Complexity, Linear Optimization, and lower bounds for the nonnegative rank of matrices (Dagstuhl Seminar 13082). - LeRoy B. Beasley; Hartmut Klauck; Troy Lee; Dirk Oliver Theis (Dagstuhl Reports, 2013)

New Bounds for the Garden-Hose Model. - Hartmut Klauck; Supartha Podder (FSTTCS, 2014)

An Improved Interactive Streaming Algorithm for the Distinct Elements Problem. - Hartmut Klauck; Ved Prakash (ICALP (1), 2014)

Two Results about Quantum Messages. - Hartmut Klauck; Supartha Podder (MFCS (2), 2014)

Can quantum communication speed up distributed computation? - Michael Elkin; Hartmut Klauck; Danupon Nanongkai; Gopal Pandurangan (PODC, 2014)

Correlation in Hard Distributions in Communication Complexity. - Ralph Bottesch; Dmitry Gavinsky; Hartmut Klauck (APPROX-RANDOM, 2015)

Equality, Revisited. - Ralph Bottesch; Dmitry Gavinsky; Hartmut Klauck (MFCS (2), 2015)

Distributed Computation of Large-scale Graph Problems. - Hartmut Klauck; Danupon Nanongkai; Gopal Pandurangan; Peter Robinson 002 (SODA, 2015)

Limitations of convex programming: lower bounds on extended formulations and factorization ranks (Dagstuhl Seminar 15082). - Hartmut Klauck; Troy Lee; Dirk Oliver Theis; Rekha R. Thomas (Dagstuhl Reports, 2015)

The Complexity of Quantum Disjointness. - Hartmut Klauck (MFCS, 2017)

Quadratically Tight Relations for Randomized Query Complexity. - Dmitry Gavinsky; Rahul Jain 001; Hartmut Klauck; Srijita Kundu; Troy Lee; Miklos Santha; Swagato Sanyal; Jevgenijs Vihrovs (Electron. Colloquium Comput. Complex., 2017)

The aBc Problem and Equator Sampling Renyi Divergences. - Hartmut Klauck; Debbie Lim (CoRR, 2019)

Quadratically Tight Relations for Randomized Query Complexity. - Rahul Jain 001; Hartmut Klauck; Srijita Kundu; Troy Lee; Miklos Santha; Swagato Sanyal; Jevgenijs Vihrovs (Theory Comput. Syst., 2020)

The Power of One Clean Qubit in Communication Complexity. - Hartmut Klauck; Debbie Lim (MFCS, 2021)