ICPS
- Pôle API
- Boulevard Sébastien Brant
- F-67400 ILLKIRCH
- E-mail : clauss@icps.u-strasbg.fr
- Phone : (+33) 03 90 24 45 37
- Fax : (+33) 03 90 24 45 47
[Research area] [Curriculum
Vitae] [Publications
(postscripts)] [Ehrhart
Polynomials for Parallel Programs] [Eugène Ehrhart]
[Scientific links][Symbolic
Bernstein Expansion]
- The PCO team
(Program Compilation & Optimization)
- Past PhD students:
- Current PhD student(s):
Automatic parallelization - loop nest parallelization -
cache locality - compilation and optimization of programs - parameterized polytopes
- Ehrhart polynomials
I am professor in computer science at the University Louis Pasteur
at Strasbourg. I submitted my doctorate in 1990 at the University of Besançon
and my "Habilitation à diriger les recherches" in 2000 at the
University Louis Pasteur of Strasbourg. I am managing the ICPS team in Strasbourg
and i am particularly involved in the PCO
team. I am also co-managing the french CNRS national research network "Architecture
des machines & Compilation" with Pascal
Sainrat, and co-managing the CNRS national research initiative "Compilation
pour les systèmes embarqués" with Christine
Eisenbeis. I am also involved in the french
INRIA research project A3.
My research work is concerned with compilation and optimization
of programs. I am developping tools and mathematic methods dedicated to precise
code analysis and optimization. The main application domains are embedded systems,
EPIC processors and parallel computers.
The slides of my talk at CC'2004: A
Symbolic Approach to Bernstein Expansion for Program Analysis and Optimization
List
of Ehrhart's publications 1947-1996
Some
nice drawings by E. Ehrhart himself !
Personnal Homepages
- Page Maison
de Simon Plouffe, a specialist of integer series, generating functions
and recurrences.
- G.M.
Ziegler, a specialist of the theory on polytopes.
- Alexander
Barvinok, he knows many things about Ehrhart polynomials...
- Richard
Stanley, one of the first combinatorics specialist who met E. Ehrhart
and who expanded and proved some results...
- Jesus
A. De Loera, author of the first ever implementation of Barvinok's algorithm for computing the
rational generating function of a polytope.
- Doran K.
Wilde, the man who links convex geometry and computer science, author
of the Polyhedron library.
Bibliography search
- MATH database
1931-1996
- Bibliographies
on Mathematics
- Trans.
on Mathematical Software - Table of Contents
- Geometry
Center Preprint Series
- Computational
mathematics archive (optimisation)
- The
World-Wide Web Virtual Library: Mathematics
- American
Mathematical Society Publications - DIMACS Volume Series
- The
Electronic Journal of Combinatorics and World Combinatorics Exchange
Institutions
- IFOR
(Inst. Op. Research Zurich)
- DIMACS, Center
for Discrete Mathematics and Theoretical Computer Science
- IRMA, Institut
de Recherche Mathématique Avancée Strasbourg
- MIT
Department of Mathematics
- Mathematics
Department Web Servers
- AMERICAN MATHEMATICAL
SOCIETY
- MATHEMATICAL
OPTIMIZATION TU Braunschweig
Soft Geometric & Arithmetic
- The Polyhedral
Library by Doran Wilde
- The Omega
Project by W. Pugh
- LattE
: first ever implementation of Barvinok's algorithm for computing the
rational generating function of a polytope by Jesus
A. De Loera and his group
- barvinok
: a program computing the Ehrhart polynomial of a parameterized polytope
based on Barvinok's algorithm by Sven Verdoolaege
- Geometry
in Action
- Computational
Geometry Code
- Directory
of /pub/mathprog (ftp zib-berlin)
- Directory
of Computational Geometry Software
- ACM Trans.
on Math. Soft.
ICPS Staff
ICPS Home Page