Prof. Habil. Dr. Stasys Jukna

Department: Cyber-Social Systems Engineering Group
Position: Affiliated Researcher


Home page:




  • 1971-76 Study of mathematics at  Vilnius university Lithuania
  • 1976 Master degree in mathematics
  • 1979-80 Doctoral sudy at Lomonosov Moscow State University
  • 1980 PhD in mathematics. Thesis: Optimal synthesis methods of self-correcting programs
  • 1999 Habilitation (second doctoral degree) at Trier university, Germany. Thesis: Combinatorics of finite computations: the lower bounds problem

Postdoctoral studies

  • 1985-86 Postdoc researcher at dept. of Math. of  Moscow University, USSR
  • 1992-93 Akexander von Humboldt fellow  at  Dortmundo university, Germany

Research interests

  • Computational coplexity. Boolean circuit complexity, with special attention to proving lower bounds: show (prove!) that humans cannot solve a given problem efficiently not because they are not "clever enought," but because efficient algorithms for this problem do not exist at all! 
  • Discrete mathematics
  • Combinatorics


Research outcome


Publications with VU Institute of Data Science and Digital Technologies & Institute of Mathematics and Informatics affiliation

PDF files of all my papers since 1981 can be downloaded from my  home page



Research grants

German Research Foudation (DFG,  Deutsche Forschungsgemeinschaft) :

  1.  Recourcenschranken (Limits of computational recources), at Uni Trier, 1993-95
  2.  Fusionsmethode in der Berechnungskomplexität (The fusion method in computationl complexity), at Uni Trier, 1995-99
  3.  Kommunikationkomplexität (Communication complexity), at Uni Frankfurt, 2005-06
  4.  Die Graphstruktur boolescher Funktionen (Graph strucure of Boolean functions) , at Uni Frankfurt, 2007-10
  5.  Grenzen von Algorithmenparadigmen (Limits of algorithmic paradigms), at Uni Frankfurt, 2010-13
  6.  Grenzen der dynamischen Programmierung (Limits of dynamic programming), at Uni Frankfurt, 2013-16
  7. Approximationsgrenzen der dynamischen Programmierung (Limits of approximating dynamic programming) , at Uni Frankfurt 2017-20


Editoril service


Language skills

  • German (can speak and write free)
  • English (can write free)
  • Russian (can understand written and spoken, but speaking is worse)
  • Lithuanian (mother tongue)