Institute of Discrete Mathematics

Fleischmarkt 22
A-1010 Wien
Österreich
Tel.: +43 (1)-5129184 / 91
Fax: +43 (1)-5129184 / 92

Head

Prof. Dr. Herbert Fleischner

Researchers

Prof. Dr. Harald Niederreiter
Prof. Dr. Reinhard Winkler

Dr. Gerhard Dorfer
Dr. Maharaj Hiren
Dr. Wilfried Meidl
Dr. Gottlieb Pirsic
Dr. Stefan Szeider
Doz. Dr. Arne Winterhof

Administration

Eva Marin

Lasciate ogni speranze, voi ch'entrate!

Bow your head in reverence! You're entering the holy halls of the highest and purest there is in the way of science. You don't know what it is? C'mon! It's mathematics represented here by some select topics like cryptology or computer algebra.

And that's not all! Don't you dare forget about graph theory! Graph theory!!! Where would we be without it? Imagine all those poor chinese postmen and traveling salesmen running around aimlessly and begging for mercy ...

The results achieved here are among the finest you've ever dreamed of. Take a peek and freeze in awe!



Research Areas

Cryptology
Computer Algebra
Finite Fields and Their Applications
Global Function Fields
Quasi-Monte Carlo Methods
Construction of Low-Discrepancy Sequences
Numerical Integration
Pseudorandom Number Generation
Coding Theory
Eulerian and Hamiltonian Graphs
Dominating Cycles
Cycle Double Cover Conjecture

Current Projects

Construction of Low-Discrepancy Sequences
Global Function Fields with Many Rational Places
Multiple-Recursive Matrix Method for Pseudorandom Number Generation
Stream Ciphers and Linear Complexity
Construction of Algebraic-Geometry Codes
Eulerian Graphs and Related Topics

Milestones

Construction of currently best Low-Discrepancy Sequences -

Development of a Factorization Algorithm for Polynomials over Finite Fields -
BEST deterministic algorithm for small characteristics

Design of a Multiple-Recursive Matrix Method for Pseudorandom Number and Vector Generation -
General framework for studying linear methods for pseudorandom number and vector generation

Construction of sequences of Algebraic-Geometry Codes which break the Gilbert-Varshamov bound -

Fleischner's Theorem -
The square of every 2-connected graph is hamiltonian.

Co-work by the solution of Erdös' Cycle-plus-Triangles Problem -
Every 4-regular graph decomposable into a hamiltonian cycle and triangles is 3-vertex-colorable.