Hartmut Klauck - Concepedia

Author

Hartmut Klauck

Centre for Quantum Technologies ORCID

Also Known As

H. Klauck, Hartmut Klauck, Hourani, Khalid, Klauck, Hartmut

Publications

1.3K

Citations

H-Index

Concepts

All Affiliations

Centre for Quantum Technologies Nanyang Technological University Centrum Wiskunde & Informatica Goethe University Frankfurt Institute for Advanced Study

About

Hartmut Klauck is an author at Centre for Quantum Technologies specializing in engineering, computational complexity, and computer science.

Top Concepts

#	Concept	H-Index	Publications	Citations
1	Engineering	19	22	922
2	Computer Science	17	19	844
3	Natural Sciences	3	3	119
4	Communication	2	2	54
5	Arts	1	1	35

Hartmut Klauck

Publications

1.1K

Citations

H-Index

Page 1

	Year	Citations
Quantum and Classical Strong Direct Product Theorems and Optimal Time‐Space Tradeoffs Hartmut Klauck, Robert Špalek, Ronald de Wolf SIAM Journal on Computing EngineeringComputational ComplexityCommunication ComplexityQuantum ComputingQuantum Optimization Algorithm	2007	93
Rectangle size bounds and threshold covers in communication complexity Hartmut Klauck Majority CoversEngineeringRectangle Size BoundsMulti-terminal Information TheoryLower Bound	2004	84
Communication Complexity Method for Measuring Nondeterminism in Finite Automata Juraj Hromkovič, Sebastian Seibert, Juhani Karhumäki, Information and Computation EngineeringCommunication Complexity MethodFormal MethodsComputational ComplexityCommunication Complexity	2002	80
On quantum and probabilistic communication Hartmut Klauck	2000	79
Lower Bounds for Quantum Communication Complexity Hartmut Klauck SIAM Journal on Computing Theory Of ComputingQuantum ScienceFourier TransformEngineeringQuantum Computing	2007	69
The Partition Bound for Classical Communication Complexity and Query Complexity Rahul Jain, Hartmut Klauck Computational Complexity TheoryEngineeringComputational ComplexityCommunication ComplexityComplexity	2010	68
Interaction in quantum communication and the complexity of set disjointness Hartmut Klauck, Ashwin Nayak, Amnon Ta‐Shma, EngineeringComputational ComplexityCommunication ComplexityQuantum ComputingQuantum States	2001	64
A strong direct product theorem for disjointness Hartmut Klauck Mathematical ProgrammingComputational Complexity TheoryK Independent InstancesEngineeringAlgorithmic Information Theory	2010	63
Interaction in Quantum Communication Hartmut Klauck, Ashwin Nayak, Amnon Ta‐Shma, IEEE Transactions on Information Theory	2007	47
Lower bounds for quantum communication complexity Hartmut Klauck ArXiv.org Theory Of ComputingQuantum ScienceFourier TransformQuantum SecurityEngineering	2001	47

Page 1