#### Filter Results:

- Full text PDF available (23)

#### Publication Year

1990

2018

- This year (2)
- Last 5 years (12)
- Last 10 years (27)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Hartmut Klauck
- FOCS
- 2001

We prove new lower bounds on quantum bounded error communication complexity. Our methods are based on the Fourier transform of the considered functions. First we generalize a method for proving… (More)

- Hartmut Klauck
- IEEE Conference on Computational Complexity
- 2003

We investigate the power of the most important lower bound technique in randomized communication complexity, which is based on an evaluation of the maximal size of approximately monochromatic… (More)

- Hartmut Klauck
- STOC
- 2000

We investigate the power of quantum communication protocols compared to classical probabilistic protocols. In our first result we describe a total Boolean function that has a quantum Las Vegas… (More)

- Rahul Jain, Hartmut Klauck
- IEEE 25th Annual Conference on Computational…
- 2010

We describe new lower bounds for randomized communication complexity and query complexity which we call the partition bounds. They are expressed as the optimum value of linear programs. For… (More)

Motivated by the increasing need for fast distributed processing of large-scale graphs such as the Web graph and various social networks, we study a number of fundamental graph problems in the… (More)

- Hartmut Klauck, Robert Spalek, Ronald de Wolf
- SIAM J. Comput.
- 2006

- Hartmut Klauck
- STOC
- 2010

A strong direct product theorem states that if we want to compute k independent instances of a function, using less than k times the resources needed for one instance, then the overall success… (More)

- Hartmut Klauck, Ved Prakash
- ITCS
- 2013

We define a new model of data streaming algorithms that employ a prover/helper to outsource difficult computations in a verifiable way. While for the verifier the usual time (per symbol read) and… (More)

- Juraj Hromkovic, Sebastian Seibert, Juhani Karhumäki, Hartmut Klauck, Georg Schnitger
- Inf. Comput.
- 2002

While deterministic finite automata seem to be well understood, surprisingly many important problems concerning nondeterministic finite automata (nfa’s) remain open. One such problem area is the… (More)

- Hartmut Klauck
- IEEE 26th Annual Conference on Computational…
- 2011

We show several results related to interactive proof modes of communication complexity. First we show lower bounds for the QMA-communication complexity of the functions Inner Product and… (More)