Deutsch | English
     Sitemap     Search Extended Search     Impressum   
{$naviAltText}

FACULTY OF COMPUTER SCIENCE AND AUTOMATION
Complexity Theory and Efficient Algorithms


Univ.-Prof. Dr. Martin Dietzfelbinger

Address

Fachgebiet Komplexitätstheorie und Effiziente Algorithmen
Fakultät für Informatik und Automatisierungstechnik
Technische Universität Ilmenau
P.O. Box 100565
98684 Ilmenau

Office

Informatikgebäude, Room 306
Helmholtzplatz 1
98693 Ilmenau

Phone

+49 3677 69-2656
+49 3677 69-2655 (secr.)

Fax

+49 3677 69-1237

Email

martin<dot>dietzfelbinger<at>tu-ilmenau.de

 

Publications:

 DBLP

 Textbook: "Primality Testing In Polynomial Time"

Research interests:

Complexity Theory and Algorithmics

in particular

  • Randomized Algorithms
  • Data Structures
  • Experimental Algorithms
  • Complexity of Parallel and Distributed Computation
  • Parallel Algorithms


Short CV

 
 
  Last update:  Tue, 13 Oct 2009
PRINT PAGE