Hartmut Klauck

Available identifiers

zbMath Open klauck.hartmutDBLP27/5687WikidataQ57448594 ScholiaQ57448594MaRDI QIDQ407592

List of research outcomes

Publication	Date of Publication	Type
The Power of One Clean Qubit in Communication Complexity	2023-08-08	Paper
The complexity of quantum disjointness	2020-05-26	Paper
Quadratically tight relations for randomized query complexity	2020-02-27	Paper
Quadratically tight relations for randomized query complexity	2018-11-28	Paper
Distributed Computation of Large-scale Graph Problems	2017-10-05	Paper
Correlation in Hard Distributions in Communication Complexity	2017-08-31	Paper
Streaming computations with a loquacious prover	2017-05-16	Paper
New Bounds for the Garden-Hose Model	2017-04-25	Paper
https://portal.mardi4nfdi.de/entity/Q2957903	2017-01-30	Paper
New bounds on the classical and quantum communication complexity of some graph properties	2017-01-26	Paper
Equality, Revisited	2015-09-16	Paper
Can quantum communication speed up distributed computation?	2015-09-03	Paper
Interaction in quantum communication and the complexity of set disjointness	2015-02-27	Paper
Two Results about Quantum Messages	2014-10-14	Paper
On quantum and probabilistic communication	2014-09-26	Paper
A strong direct product theorem for disjointness	2014-08-13	Paper
An Improved Interactive Streaming Algorithm for the Distinct Elements Problem	2014-07-01	Paper
Optimal direct sum results for deterministic and randomized decision tree complexity	2012-03-27	Paper
Quantum time-space tradeoffs for sorting	2010-08-16	Paper
Depth-Independent Lower Bounds on the Communication Complexity of Read-Once Boolean Formulas	2010-07-20	Paper
https://portal.mardi4nfdi.de/entity/Q5302084	2009-01-05	Paper
Interaction in Quantum Communication	2008-12-21	Paper
One-Way Communication Complexity and the Nečiporuk Lower Bound on Formula Size	2008-04-22	Paper
Lower Bounds for Quantum Communication Complexity	2008-03-28	Paper
Quantum and Classical Strong Direct Product Theorems and Optimal Time‐Space Tradeoffs	2007-10-22	Paper
STACS 2004	2007-10-01	Paper
Individual communication complexity	2007-08-23	Paper
FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science	2005-08-12	Paper
Quantum and approximate privacy	2005-01-25	Paper
https://portal.mardi4nfdi.de/entity/Q4736851	2004-08-11	Paper
Algorithms for Parity Games	2003-07-16	Paper
Communication complexity method for measuring nondeterminism in finite automata	2003-01-14	Paper
https://portal.mardi4nfdi.de/entity/Q2754144	2001-11-11	Paper
https://portal.mardi4nfdi.de/entity/Q4258580	1999-09-13	Paper
On the hardness of global and local approximation	1998-02-08	Paper

Research outcomes over time

This page was built for person: Hartmut Klauck