The following pages link to Hartmut Klauck (Q407592):
Displaying 10 items.
- Optimal direct sum results for deterministic and randomized decision tree complexity (Q407594) (← links)
- Individual communication complexity (Q2643018) (← links)
- A strong direct product theorem for disjointness (Q2875134) (← links)
- Streaming computations with a loquacious prover (Q2986880) (← links)
- Interaction in Quantum Communication (Q3548810) (← links)
- Depth-Independent Lower Bounds on the Communication Complexity of Read-Once Boolean Formulas (Q3578302) (← 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)
- One-Way Communication Complexity and the Nečiporuk Lower Bound on Formula Size (Q5386213) (← links)
- Lower Bounds for Quantum Communication Complexity (Q5454242) (← links)
