Papers include but are not limited to: 'The aBc Problem and Equator Sampling Renyi Divergences', submitted; 'The Power of One Clean Qubit in Communication Complexity', MFCS 2021; 'Quadratically Tight Relations for Randomized Query Complexity', CSR 2018, also in Theory Comput. Syst., 64(1), 101-119, 2020; plus numerous other conference papers.
Research Experience
Jan-Feb 2016: Organizer (with Troy Lee, Dirk Oliver Theis, Rekha R. Thomas) of the Program on Semidefinite and Matrix Methods for Optimization and Communication, IMS; Feb. 15-20, 2015: Organizer of the Dagstuhl Workshop 'Limitations of convex programming: lower bounds on extended formulations and factorization ranks'; February 2013: Held a workshop on 'Communication complexity, linear optimization, and lower bounds for the nonnegative rank'.
Background
Mainly Quantum Computing and Complexity Theory, e.g. Communication Complexity, Data Streams, Distributed Networks, Time Space Tradeoffs, Limited Nondeterminism, Circuit Complexity.
Miscellany
Email: hklauck@gmail.com. Supervised students: Debbie Lim, Ralph Bottesch (graduated 2016), Supartha Podder (graduated 2016), Ved Prakash (graduated 2015).