web stats by LogaholicWeb Analytics by Logaholic

Homepage of Stasys Jukna

pass foto 2008          My research interests lie between mathematics and computer science.
I am mainly interested in "concrete" complexity: proving unconditional lower bounds on computational complexity of concrete problems.
Here are just three problems I would like to see solved.

Most of my papers are available on-line.

You can visit the home page of my book

         Extremal Combinatorics: With Applications in Computer Science

or take a look at my teaching last years or my collection of links.

You can also take a look at the home page of my textbook "Math for CS" (in German)

         Crashkurs Mathematik für Informatiker

or of the draft of a new book:

         Boolean Function Complexity: Advances and Frontiers

What else happened during my stay in Frankfurt:
         Sasha Razborov's visit
         my student, Matthias Krieger, has written an interesting paper on monotone circuits.
I am an editor of:
         Lithuanian Mathematical Journal
         Electronic Colloquium on Computational Complexity
Current services:
         PC member of CSR 2010
My work is/was supported by:
   and       and   


Universität Frankfurt
Institut für Informatik
Lst. Theoretische Informatik
Postfach 11 19 32
Robert-Mayer Str.11-15
D-60054 Frankfurt am Main