Now you are in the 1st Lithuanian (.LT) domain. 
Prof. Habil. Dr. Stasys Jukna
Department: Cyber-Social Systems Engineering Group
Position: Affiliated Researcher
Home page: https://web.vu.lt/mif/s.jukna/
Education
- 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
Books
- S. Jukna, Extremal Combinatorics with Applications in Computer Science, Springer-Verlag, (2001) xvii+375 p., ISBN 3-540-66313-4.
- S. Jukna, Extremal Combinatorics with Applications in Computer Science, Springer-Verlag, (2011) xxii+411 p., ISBN 978-3-642-17363-9. Second, fully renewed edition, 30-40% of the material replaced. The title remained the same by the wish of Springer-Verlag.
- S. Jukna, Boolean Function Complexity: Advances and Frontiers, SpringGerman Research Foudationer- Verlag (2012), xv+617 p., ISBN 978-3-642-24507-7.
- S. Jukna and I. Sergeev, Complexity of Linear Boolean Operators, NOW publishers Inc., USA (2013), 123 p., ISBN 978-1-60198-726-6-24507-7.
- S. Jukna, Crashkurs Mathematik für Informatiker, xii+315 Seiten, 78 Abb., Buchreihe: Leitfäden der Informatik, B. G. Teubner Verlag ISBN 978-3-8351-0216-3 (in German).
- S. Jukna, Tropical Circuit Complexity: Limits of Pure Dynamic Programming, Springer Nature, (2023), X+119 p., SpringerBriefs in Mathematics, ISBN 978-3-031-42353-6
Research grants
German Research Foudation (DFG, Deutsche Forschungsgemeinschaft) :
- Recourcenschranken (Limits of computational recources), at Uni Trier, 1993-95
- Fusionsmethode in der Berechnungskomplexität (The fusion method in computationl complexity), at Uni Trier, 1995-99
- Kommunikationkomplexität (Communication complexity), at Uni Frankfurt, 2005-06
- Die Graphstruktur boolescher Funktionen (Graph strucure of Boolean functions) , at Uni Frankfurt, 2007-10
- Grenzen von Algorithmenparadigmen (Limits of algorithmic paradigms), at Uni Frankfurt, 2010-13
- Grenzen der dynamischen Programmierung (Limits of dynamic programming), at Uni Frankfurt, 2013-16
- Approximationsgrenzen der dynamischen Programmierung (Limits of approximating dynamic programming) , at Uni Frankfurt 2017-20
Editoril service
- Lithuanian Mathematical Journal
- Electronic Colloquium on Computational Complexity [this preprint server was made by me (with the software support from my collegues) during my stay in Trier 1994 (Germany)]