The following pages link to Hartmut Klauck (Q407592):
Displaying 34 items.
- Optimal direct sum results for deterministic and randomized decision tree complexity (Q407594) (← links)
- Quantum and approximate privacy (Q705071) (← links)
- Communication complexity method for measuring nondeterminism in finite automata (Q1854501) (← links)
- Individual communication complexity (Q2643018) (← links)
- (Q2754144) (← links)
- A strong direct product theorem for disjointness (Q2875134) (← links)
- Two Results about Quantum Messages (Q2922630) (← links)
- Can quantum communication speed up distributed computation? (Q2943619) (← links)
- Equality, Revisited (Q2946382) (← links)
- New bounds on the classical and quantum communication complexity of some graph properties (Q2957488) (← links)
- (Q2957903) (← links)
- New Bounds for the Garden-Hose Model (Q2978538) (← links)
- Streaming computations with a loquacious prover (Q2986880) (← links)
- On quantum and probabilistic communication (Q3192036) (← links)
- Interaction in Quantum Communication (Q3548810) (← links)
- Depth-Independent Lower Bounds on the Communication Complexity of Read-Once Boolean Formulas (Q3578302) (← links)
- Quantum time-space tradeoffs for sorting (Q3581266) (← links)
- (Q4258580) (← links)
- On the hardness of global and local approximation (Q4375641) (← links)
- Algorithms for Parity Games (Q4412830) (← links)
- (Q4736851) (← links)
- The complexity of quantum disjointness (Q5111229) (← links)
- An Improved Interactive Streaming Algorithm for the Distinct Elements Problem (Q5167803) (← links)
- Interaction in quantum communication and the complexity of set disjointness (Q5175960) (← links)
- (Q5302084) (← links)
- STACS 2004 (Q5309684) (← links)
- Correlation in Hard Distributions in Communication Complexity (Q5351922) (← links)
- Distributed Computation of Large-scale Graph Problems (Q5362982) (← links)
- One-Way Communication Complexity and the Nečiporuk Lower Bound on Formula Size (Q5386213) (← links)
- Quantum and Classical Strong Direct Product Theorems and Optimal Time‐Space Tradeoffs (Q5422496) (← links)
- Lower Bounds for Quantum Communication Complexity (Q5454242) (← links)
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science (Q5465870) (← links)
- Quadratically tight relations for randomized query complexity (Q5915578) (← links)
- The Power of One Clean Qubit in Communication Complexity (Q6168487) (← links)
