Hartmut Klauck

Centre for Quantum Technologies — Singapore

Computer Science · Physical Sciences

21h-index1.3kcitations82works0.02yr avg
OpenAlex↗ORCID↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Complexity and Algorithms in Graphs(49), Quantum Computing Algorithms and Architecture(43), Cryptography and Data Security(30), Quantum Information and Cryptography(19), Machine Learning and Algorithms(15)

Publications82 total

The aBc Problem and Equator Sampling Renyi Divergences
arXiv (Cornell University)·2019· 1 citedOpen Access
Quadratically Tight Relations for Randomized Query Complexity
Theory of Computing Systems·2019· 1 cited
The Power of One Clean Qubit in Communication Complexity
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)·2018· 2 citedOpen Access
Quadratically Tight Relations for Randomized Query Complexity
Lecture notes in computer science·2018Open Access
Quadratically Tight Relations for Randomized Query Complexity
arXiv (Cornell University)·2017Open Access
The Complexity of Quantum Disjointness
DR-NTU (Nanyang Technological University)·2017· 3 citedOpen Access
Correlation in Hard Distributions in Communication Complexity
arXiv (Cornell University)·2015· 1 citedOpen Access
Limitations of Convex Programming: Lower Bounds on Extended Formulations and Factorization Ranks (Dagstuhl Seminar 15082)
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)·2015· 8 citedOpen Access
Quantum Communication Complexity
Open Collections·2015· 35 citedOpen Access
Correlation in Hard Distributions in Communication Complexity
ASEP·2015Open Access
Equality, Revisited
Lecture notes in computer science·2015Open Access
Distributed Computation of Large-scale Graph Problems
2014· 38 citedOpen Access
Can quantum communication speed up distributed computation?
2014· 37 cited
An Improved Interactive Streaming Algorithm for the Distinct Elements\n Problem
arXiv (Cornell University)·2014Open Access
An Improved Interactive Streaming Algorithm for the Distinct Elements Problem
arXiv (Cornell University)·2014· 5 citedOpen Access
Two Results about Quantum Messages
arXiv (Cornell University)·2014Open Access
An Improved Interactive Streaming Algorithm for the Distinct Elements Problem
Lecture notes in computer science·2014· 7 cited
Two Results about Quantum Messages
Lecture notes in computer science·2014· 7 cited
New Bounds for the Garden-Hose Model
DR-NTU (Nanyang Technological University)·2014· 1 citedOpen Access
Distributed Algorithms for Large-Scale Graphs
arXiv (Cornell University)·2013Open Access
page 1 of 5Next →

Frequent Co-authors

Rahul Jain(7), Ronald de Wolf(5), Ashwin Nayak(5), Danupon Nanongkai(4), Gopal Pandurangan(4), Miklós Sántha(3), Ved Prakash(3), Troy Lee(3), Robert Špalek(2), Juraj Hromkovič(2), Sebastian Seibert(2), Juhani Karhumäki(2), Georg Schnitger(2), Amnon Ta‐Shma(2), David Zuckerman(2), Peter Robinson(2), Michael Elkin(2), Dirk Oliver Theis(2), Harry Buhrman(2), Nikolay Vereshchagin(2)