Hartmut Klauck

ORCID

Publication Activity (10 Years)

Years Active: 1996-2021
Publications (10 Years): 14

Top Venues

Goethe University Frankfurt, Frankfurt am Main, Germany (PHD)

Education History

Goethe University Frankfurt, Frankfurt am Main, Germany

PHD

Publications

Hartmut Klauck, Debbie Lim
The Power of One Clean Qubit in Communication Complexity. MFCS (2021)
Rahul Jain, Hartmut Klauck, Srijita Kundu, Troy Lee, Miklos Santha, Swagato Sanyal, Jevgenijs Vihrovs
Quadratically Tight Relations for Randomized Query Complexity. Theory Comput. Syst. 64 (1) (2020)
Hartmut Klauck, Debbie Lim
The aBc Problem and Equator Sampling Renyi Divergences. CoRR (2019)
Hartmut Klauck, Debbie Lim
The Power of One Clean Qubit in Communication Complexity. CoRR (2018)
Rahul Jain, Hartmut Klauck, Srijita Kundu, Troy Lee, Miklos Santha, Swagato Sanyal, Jevgenijs Vihrovs
Quadratically Tight Relations for Randomized Query Complexity. CSR (2018)
Dmitry Gavinsky, Rahul Jain, Hartmut Klauck, Srijita Kundu, Troy Lee, Miklos Santha, Swagato Sanyal, Jevgenijs Vihrovs
Quadratically Tight Relations for Randomized Query Complexity. Electron. Colloquium Comput. Complex. 24 (2017)
Dmitry Gavinsky, Rahul Jain, Hartmut Klauck, Srijita Kundu, Troy Lee, Miklos Santha, Swagato Sanyal, Jevgenijs Vihrovs
Quadratically Tight Relations for Randomized Query Complexity. CoRR (2017)
Hartmut Klauck
The Complexity of Quantum Disjointness. MFCS (2017)
Ralph Bottesch, Dmitry Gavinsky, Hartmut Klauck
Correlation in Hard Distributions in Communication Complexity. CoRR (2015)
Hartmut Klauck, Troy Lee, Dirk Oliver Theis, Rekha R. Thomas
Limitations of convex programming: lower bounds on extended formulations and factorization ranks (Dagstuhl Seminar 15082). Dagstuhl Reports 5 (2) (2015)
Ralph C. Bottesch, Dmitry Gavinsky, Hartmut Klauck
Equality, Revisited. CoRR (2015)
Ralph Bottesch, Dmitry Gavinsky, Hartmut Klauck
Correlation in Hard Distributions in Communication Complexity. APPROX-RANDOM (2015)
Hartmut Klauck, Danupon Nanongkai, Gopal Pandurangan, Peter Robinson
Distributed Computation of Large-scale Graph Problems. SODA (2015)
Ralph Bottesch, Dmitry Gavinsky, Hartmut Klauck
Equality, Revisited. MFCS (2) (2015)
Hartmut Klauck, Supartha Podder
Two Results about Quantum Messages. MFCS (2) (2014)
Hartmut Klauck, Supartha Podder
Two Results about Quantum Messages. CoRR (2014)
Hartmut Klauck, Supartha Podder
New Bounds for the Garden-Hose Model. CoRR (2014)
Hartmut Klauck, Ved Prakash
An Improved Interactive Streaming Algorithm for the Distinct Elements Problem. CoRR (2014)
Hartmut Klauck, Supartha Podder
New Bounds for the Garden-Hose Model. FSTTCS (2014)
Michael Elkin, Hartmut Klauck, Danupon Nanongkai, Gopal Pandurangan
Can quantum communication speed up distributed computation? PODC (2014)
Hartmut Klauck, Ved Prakash
An Improved Interactive Streaming Algorithm for the Distinct Elements Problem. ICALP (1) (2014)
LeRoy Beasely, Troy Lee, Hartmut Klauck, Dirk Oliver Theis
Dagstuhl Report 13082: Communication Complexity, Linear Optimization, and lower bounds for the nonnegative rank of matrices CoRR (2013)
Hartmut Klauck, Ronald de Wolf
Fooling One-Sided Quantum Protocols. STACS (2013)
Hartmut Klauck, Ved Prakash
Streaming computations with a loquacious prover. ITCS (2013)
LeRoy B. Beasley, Hartmut Klauck, Troy Lee, Dirk Oliver Theis
Communication Complexity, Linear Optimization, and lower bounds for the nonnegative rank of matrices (Dagstuhl Seminar 13082). Dagstuhl Reports 3 (2) (2013)
Hartmut Klauck, Danupon Nanongkai, Gopal Pandurangan, Peter Robinson
The Distributed Complexity of Large-scale Graph Processing. CoRR (2013)
Hartmut Klauck, Ronald de Wolf
Fooling One-Sided Quantum Protocols CoRR (2012)
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 (2012)
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)
Michael Elkin, Hartmut Klauck, Danupon Nanongkai, Gopal Pandurangan
Quantum Distributed Network Computing: Lower Bounds and Techniques CoRR (2012)
Hartmut Klauck
On Arthur Merlin Games in Communication Complexity. Computational Complexity Conference (2011)
Hartmut Klauck
On Arthur Merlin Games in Communication Complexity CoRR (2011)
Rahul Jain, Hartmut Klauck, Miklos Santha
Optimal Direct Sum Results for Deterministic and Randomized Decision Tree Complexity CoRR (2010)
Hartmut Klauck
A strong direct product theorem for disjointness. STOC (2010)
Rahul Jain, Hartmut Klauck, Miklos Santha
Optimal direct sum results for deterministic and randomized decision tree complexity. Inf. Process. Lett. 110 (20) (2010)
Rahul Jain, Hartmut Klauck, Shengyu Zhang
Depth-Independent Lower Bounds on the Communication Complexity of Read-Once Boolean Formulas. COCOON (2010)
Rahul Jain, Hartmut Klauck
The Partition Bound for Classical Communication Complexity and Query Complexity. Computational Complexity Conference (2010)
Rahul Jain, Hartmut Klauck, Shengyu Zhang
Depth-Independent Lower bounds on the Communication Complexity of Read-Once Boolean Formulas CoRR (2009)
Rahul Jain, Hartmut Klauck
New Results in the Simultaneous Message Passing Model CoRR (2009)
Hartmut Klauck
A Strong Direct Product Theorem for Disjointness CoRR (2009)
Rahul Jain, Hartmut Klauck
The Partition Bound for Classical Communication Complexity and Query Complexity CoRR (2009)
Rahul Jain, Hartmut Klauck
New Results in the Simultaneous Message Passing Model via Information Theoretic Techniques. Computational Complexity Conference (2009)
Rahul Jain, Hartmut Klauck, Ashwin Nayak
Direct product theorems for classical communication complexity via subdistribution bounds: extended abstract. STOC (2008)
Hartmut Klauck
One-Way Communication Complexity and the Ne[c-caron]iporuk Lower Bound on Formula Size. SIAM J. Comput. 37 (2) (2007)
Hartmut Klauck
Lower Bounds for Quantum Communication Complexity. SIAM J. Comput. 37 (1) (2007)
Harry Buhrman, Hartmut Klauck, Nikolai K. Vereshchagin, Paul M. B. Vitányi
Individual communication complexity. J. Comput. Syst. Sci. 73 (6) (2007)
Hartmut Klauck, Robert Spalek, Ronald de Wolf
Quantum and Classical Strong Direct Product Theorems and Optimal Time-Space Tradeoffs. SIAM J. Comput. 36 (5) (2007)
Hartmut Klauck, Ashwin Nayak, Amnon Ta-Shma, David Zuckerman
Interaction in Quantum Communication. IEEE Trans. Inf. Theory 53 (6) (2007)
Rahul Jain, Hartmut Klauck, Ashwin Nayak
Direct Product Theorems for Communication Complexity via Subdistribution Bounds. Electron. Colloquium Comput. Complex. 14 (064) (2007)
Hartmut Klauck
Quantum and Approximate Privacy. Theory Comput. Syst. 37 (1) (2004)
Hartmut Klauck, Robert Spalek, Ronald de Wolf
Quantum and Classical Strong Direct Product Theorems and Optimal Time-Space Tradeoffs Electron. Colloquium Comput. Complex. (045) (2004)
Harry Buhrman, Hartmut Klauck, Nikolai K. Vereshchagin, Paul M. B. Vitányi
Individual Communication Complexity: Extended Abstract. STACS (2004)
Hartmut Klauck, Robert Spalek, Ronald de Wolf
Quantum and Classical Strong Direct Product Theorems and Optimal Time-Space Tradeoffs CoRR (2004)
Hartmut Klauck
Quantum and Classical Communication-Space Tradeoffs from Rectangle Bounds CoRR (2004)
Hartmut Klauck
Quantum and Classical Communication-Space Tradeoffs from Rectangle Bounds. FSTTCS (2004)
Hartmut Klauck, Robert Spalek, Ronald de Wolf
Quantum and Classical Strong Direct Product Theorems and Optimal Time-Space Tradeoffs. FOCS (2004)
Hartmut Klauck
Rectangle Size Bounds and Threshold Covers in Communication Complexity. Computational Complexity Conference (2003)
Harry Buhrman, Hartmut Klauck, Nikolai K. Vereshchagin, Paul M. B. Vitányi
Individual Communication Complexity CoRR (2003)
Hartmut Klauck
Quantum time-space tradeoffs for sorting. STOC (2003)
Juraj Hromkovic, Sebastian Seibert, Juhani Karhumäki, Hartmut Klauck, Georg Schnitger
Communication Complexity Method for Measuring Nondeterminism in Finite Automata. Inf. Comput. 172 (2) (2002)
Hartmut Klauck
Rectangle Size Bounds and Threshold Covers in Communication Complexity CoRR (2002)
Hartmut Klauck
On Quantum and Approximate Privacy. STACS (2002)
Hartmut Klauck
Quantum Time-Space Tradeoffs for Sorting CoRR (2002)
Hartmut Klauck, Ashwin Nayak, Amnon Ta-Shma, David Zuckerman
Interaction in quantum communication and the complexity of set disjointness. STOC (2001)
Hartmut Klauck
Lower Bounds for Quantum Communication Complexity. FOCS (2001)
Hartmut Klauck
Algorithms for Parity Games. Automata, Logics, and Infinite Games (2001)
Hartmut Klauck
One-way communication complexity and the Neciporuk lower bound on formula size CoRR (2001)
Hartmut Klauck
On quantum and probabilistic communication: Las Vegas and one-way protocols. STOC (2000)
Hartmut Klauck
Quantum Communication Complexity. ICALP Satellite Workshops (2000)
Juraj Hromkovic, Juhani Karhumäki, Hartmut Klauck, Georg Schnitger, Sebastian Seibert
Measures of Nondeterminism in Finite Automata. ICALP (2000)
Juraj Hromkovic, Juhani Karhumäki, Hartmut Klauck, Georg Schnitger, Sebastian Seibert
Measures of Nondeterminism in Finite Automata Electron. Colloquium Comput. Complex. 7 (76) (2000)
Hartmut Klauck
Lower Bounds for Computation with Limited Nondeterminism. Computational Complexity Conference (1998)
Hartmut Klauck
On the Size of Probabilistic Formulae. ISAAC (1997)
Hartmut Klauck
On the Hardness of Global and Local Approximation. SWAT (1996)

Hartmut Klauck.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Hartmut Klauck