Hartmut Klauck

1.3k total citations
34 papers, 484 citations indexed

About

Hartmut Klauck is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Computer Networks and Communications. According to data from OpenAlex, Hartmut Klauck has authored 34 papers receiving a total of 484 indexed citations (citations by other indexed papers that have themselves been cited), including 31 papers in Artificial Intelligence, 25 papers in Computational Theory and Mathematics and 4 papers in Computer Networks and Communications. Recurrent topics in Hartmut Klauck's work include Quantum Computing Algorithms and Architecture (20 papers), Complexity and Algorithms in Graphs (19 papers) and Cryptography and Data Security (12 papers). Hartmut Klauck is often cited by papers focused on Quantum Computing Algorithms and Architecture (20 papers), Complexity and Algorithms in Graphs (19 papers) and Cryptography and Data Security (12 papers). Hartmut Klauck collaborates with scholars based in Singapore, Netherlands and Germany. Hartmut Klauck's co-authors include Rahul Jain, Ronald de Wolf, Robert Špalek, Ashwin Nayak, Amnon Ta‐Shma, David Zuckerman, Juraj Hromkovič, Sebastian Seibert, Juhani Karhumäki and Georg Schnitger and has published in prestigious journals such as IEEE Transactions on Information Theory, SIAM Journal on Computing and Journal of Computer and System Sciences.

In The Last Decade

Hartmut Klauck

33 papers receiving 428 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Hartmut Klauck Singapore	14	409	366	74	58	55	34	484
Anup Rao United States	16	340 0.8×	368 1.0×	109 1.5×	23 0.4×	97 1.8×	40	527
Adi Shraibman Israel	11	215 0.5×	240 0.7×	41 0.6×	17 0.3×	44 0.8×	19	335
Frédéric Magniez France	13	715 1.7×	416 1.1×	24 0.3×	178 3.1×	21 0.4×	40	754
Anindya De United States	9	177 0.4×	95 0.3×	25 0.3×	58 1.0×	32 0.6×	34	252
Robert Špalek Netherlands	14	467 1.1×	329 0.9×	24 0.3×	92 1.6×	30 0.5×	23	509
Andrei Romashchenko Russia	7	99 0.2×	175 0.5×	75 1.0×	12 0.2×	100 1.8×	25	293
Santhosh Kumar United States	7	477 1.2×	376 1.0×	184 2.5×	31 0.5×	153 2.8×	16	611
Rahul Santhanam United Kingdom	12	336 0.8×	473 1.3×	95 1.3×	4 0.1×	39 0.7×	72	563
Mika Hirvensalo Finland	10	239 0.6×	188 0.5×	8 0.1×	75 1.3×	14 0.3×	32	326
Rūsiņš Freivalds Latvia	11	419 1.0×	361 1.0×	51 0.7×	15 0.3×	12 0.2×	55	475

Countries citing papers authored by Hartmut Klauck

Since Specialization

Citations

This map shows the geographic impact of Hartmut Klauck's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Hartmut Klauck with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Hartmut Klauck more than expected).

Fields of papers citing papers by Hartmut Klauck

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Hartmut Klauck. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Hartmut Klauck. The network helps show where Hartmut Klauck may publish in the future.

Co-authorship network of co-authors of Hartmut Klauck

This figure shows the co-authorship network connecting the top 25 collaborators of Hartmut Klauck. A scholar is included among the top collaborators of Hartmut Klauck based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Hartmut Klauck. Hartmut Klauck is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Jain, Rahul, et al.. (2019). Quadratically Tight Relations for Randomized Query Complexity. Theory of Computing Systems. 64(1). 101–119.

Klauck, Hartmut. (2015). Quantum Communication Complexity. Open Collections. 241–252. 3 indexed citations

Elkin, Michael, Hartmut Klauck, Danupon Nanongkai, & Gopal Pandurangan. (2014). Can quantum communication speed up distributed computation?. 166–175. 12 indexed citations

Klauck, Hartmut & Ronald de Wolf. (2013). Fooling One-Sided Quantum Protocols. UvA-DARE (University of Amsterdam). 20. 433. 1 indexed citations

Beasley, LeRoy B., Hartmut Klauck, Troy Lee, & Dirk Oliver Theis. (2013). Communication Complexity, Linear Optimization, and lower bounds for the nonnegative rank of matrices (Dagstuhl Seminar 13082). DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 3(2). 127–143. 2 indexed citations

Klauck, Hartmut, Danupon Nanongkai, Gopal Pandurangan, & Peter Robinson. (2013). The Distributed Complexity of Large-scale Graph Processing.. 3 indexed citations

Elkin, Michael, Hartmut Klauck, Danupon Nanongkai, & Gopal Pandurangan. (2012). Quantum Lower Bounds for Distributed Network Computing. arXiv (Cornell University). 1 indexed citations

Elkin, Michael, Hartmut Klauck, Danupon Nanongkai, & Gopal Pandurangan. (2012). Quantum Distributed Network Computing: Lower Bounds and Techniques. arXiv (Cornell University). 3 indexed citations

Ivanyos, Gábor, Hartmut Klauck, Troy Lee, Miklós Sántha, & Ronald de Wolf. (2012). New bounds on the classical and quantum communication complexity of some graph properties. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 8 indexed citations

10.

Klauck, Hartmut. (2011). On Arthur Merlin Games in Communication Complexity. 189–199. 17 indexed citations

11.

Klauck, Hartmut. (2010). A strong direct product theorem for disjointness. 77–86. 35 indexed citations

12.

Jain, Rahul, Hartmut Klauck, & Ashwin Nayak. (2007). Direct Product Theorems for Communication Complexity via Subdistribution Bounds.. Electronic colloquium on computational complexity. 14. 1 indexed citations

13.

Klauck, Hartmut, Robert Špalek, & Ronald de Wolf. (2007). Quantum and Classical Strong Direct Product Theorems and Optimal Time‐Space Tradeoffs. SIAM Journal on Computing. 36(5). 1472–1493. 43 indexed citations

14.

Klauck, Hartmut. (2007). One-Way Communication Complexity and the Nečiporuk Lower Bound on Formula Size. SIAM Journal on Computing. 37(2). 552–583. 3 indexed citations

15.

Buhrman, Harry, Hartmut Klauck, Nikolay Vereshchagin, & Paul Vitányi. (2004). Individual Communication Complexity: Extended Abstract.. 19–30. 1 indexed citations

16.

Klauck, Hartmut, Robert Špalek, & Ronald de Wolf. (2004). Quantum and Classical Strong Direct Product Theorems and Optimal Time-Space Tradeoffs. UvA-DARE (University of Amsterdam). 1 indexed citations

17.

Klauck, Hartmut. (2004). Rectangle size bounds and threshold covers in communication complexity. 118–134. 43 indexed citations

18.

Klauck, Hartmut. (2003). Quantum time-space tradeoffs for sorting. 69–76. 15 indexed citations

19.

Klauck, Hartmut. (2003). Quantum and Approximate Privacy. Theory of Computing Systems. 37(1). 221–246. 12 indexed citations

20.

Hromkovič, Juraj, Sebastian Seibert, Juhani Karhumäki, Hartmut Klauck, & Georg Schnitger. (2002). Communication Complexity Method for Measuring Nondeterminism in Finite Automata. Information and Computation. 172(2). 202–217. 34 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact