Quantum and classical strong direct product theorems and optimal time-space tradeoffs H Klauck, R Špalek, R De Wolf SIAM Journal on Computing 36 (5), 1472-1493, 2007 | 98 | 2007 |

On quantum and probabilistic communication: Las Vegas and one-way protocols H Klauck Proceedings of the thirty-second annual ACM symposium on Theory of computing …, 2000 | 87 | 2000 |

Rectangle size bounds and threshold covers in communication complexity H Klauck 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings …, 2003 | 81 | 2003 |

Communication complexity method for measuring nondeterminism in finite automata J Hromkovič, S Seibert, J Karhumäki, H Klauck, G Schnitger Information and Computation 172 (2), 202-217, 2002 | 81 | 2002 |

The partition bound for classical communication complexity and query complexity R Jain, H Klauck 2010 IEEE 25th Annual Conference on Computational Complexity, 247-258, 2010 | 77 | 2010 |

Distributed computation of large-scale graph problems H Klauck, D Nanongkai, G Pandurangan, P Robinson Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete …, 2014 | 74* | 2014 |

Lower bounds for quantum communication complexity H Klauck Proceedings 42nd IEEE Symposium on Foundations of Computer Science, 288-297, 2001 | 74 | 2001 |

Interaction in quantum communication and the complexity of set disjointness H Klauck, A Nayak, A Ta-Shma, D Zuckerman Proceedings of the thirty-third annual ACM symposium on Theory of computing …, 2001 | 73 | 2001 |

A strong direct product theorem for disjointness H Klauck Proceedings of the forty-second ACM symposium on Theory of computing, 77-86, 2010 | 60 | 2010 |

New results in the simultaneous message passing model via information theoretic techniques R Jain, H Klauck 2009 24th Annual IEEE Conference on Computational Complexity, 369-378, 2009 | 59* | 2009 |

Lower bounds for quantum communication complexity H Klauck SIAM Journal on Computing 37 (1), 20-46, 2007 | 56 | 2007 |

Interaction in quantum communication H Klauck, A Nayak, A Ta-Shma, D Zuckerman IEEE Transactions on Information Theory 53 (6), 1970-1982, 2007 | 47 | 2007 |

Direct product theorems for classical communication complexity via subdistribution bounds R Jain, H Klauck, A Nayak Proceedings of the fortieth annual ACM symposium on Theory of computing, 599-608, 2008 | 44 | 2008 |

On Arthur Merlin games in communication complexity H Klauck 2011 IEEE 26th Annual Conference on Computational Complexity, 189-199, 2011 | 41 | 2011 |

Quantum communication complexity H Klauck Workshop on Boolean Functions and Applications (July 14) at ICALP 2000 …, 2000 | 39 | 2000 |

Measures of nondeterminism in finite automata J Hromkovič, J Karhumäki, H Klauck, G Schnitger, S Seibert International Colloquium on Automata, Languages, and Programming, 199-210, 2000 | 35 | 2000 |

Can Quantum Communication Speed Up Distributed Computation? M Elkin, H Klauck, D Nanongkai, G Pandurangan PODC '14 Proceedings of the 2014 ACM symposium on Principles of distributed …, 2014 | 34* | 2014 |

On quantum and approximate privacy H Klauck Annual Symposium on Theoretical Aspects of Computer Science, 335-346, 2002 | 26 | 2002 |

Quantum time-space tradeoffs for sorting H Klauck Proceedings of the thirty-fifth annual ACM symposium on Theory of computing …, 2003 | 25 | 2003 |

Algorithms for parity games H Klauck Automata logics, and infinite games, 107-129, 2002 | 24 | 2002 |