Hartmut Klauck

Assistant Professor at Division of Mathematical Sciences,

Nanyang Technological University

 

Principal Investigator at Centre for Quantum Technologies,
(Computer Science Group)

National University of Singapore


Scientific Interests:
Mainly Quantum Computing and Complexity Theory, 
e.g. Communication Complexity,

Data Streams,

Distributed Networks,

Time Space Tradeoffs,
Limited Nondeterminism,
Circuit Complexity

 

Address:

S15, 3 Science Drive 2, National University of Singapore, Singapore 117543

Office:   S15-04-07 (at CQT) and SPMS-MAS-05-44 (at NTU)
Phone:  +65 65165624, 
+65 6513 7190

Fax:     +65 6516 6897 (Attn. H. Klauck)
Email:  

 

Short CV.


Upcoming: Program on Semidefinite and Matrix Methods for Optimization and Communication, IMS.  Jan-Feb 2016.

I have been an organizer (with Troy Lee, Dirk Oliver Theis, Rekha R. Thomas) of the Dagstuhl Workshop

Limitations of convex programming: lower bounds on extended formulations and factorization ranks Feb. 15-20, 2015,

see the report here.

The previous workshop Communication complexity, linear optimization, and lower bounds for the nonnegative rank

we held in  February 2013, see the report here or here.

 

Teaching:

Fall 2015: Computational Economics.
Fall 2014: MAS 714 Algorithms and Theory of Computing, see
here.

Fall 2013: MAS 714 Algorithms and Theory of Computing, see here.
Fall 2012: Linear Algebra I

Spring 2012: Quantum Computing

Fall 2011: Introduction to Scientific Programming

Fall 2010: Introduction to Scientific Programming



Papers:


Journal version: 
J.Hromkovic, J.Karhumäki, H.Klauck, G.Schnitger, S.Seibert
Communication Complexity Method for Measuring Nondeterminism in Finite Automata;  Information and Computation, vol. 172(2), pp.202-217, 2002.


Thesis (unfortunately only in German): 
Über beschränkte Interaktion in der Kommunikationskomplexität.

 English Abstract.

Award: Preis für den naturwissenschaftlichen Nachwuchs 2001
of the Johann Wolfgang Goethe Universität Frankfurt am Main.

Master's thesis: On the Complexity of Approximation, Local Search, and Local Approximation

Old Teaching (University of Frankfurt, mostly in German):

Parallel and Distributed Algorithms, Winter 07/08

Information und Kommunikation, Sommer 07

Beweissysteme Winter 06/07

Effiziente Algorithmen Sommer 06

Quantum Computing, Winter 05/06

Black Box Algorithmen, Sommer 05


Quantum Computing, Winter 04