Theoretical computer science. Computability and complexity in analysis.

1. Ivan Georgiev, Lars Kristiansen, Frank Stephan, “Computable irrational numbers with representations of surprising complexity”, Annals of Pure and Applied Logic, 172:2 (2021), 102893
2. Ivan Georgiev, “Dedekind Cuts and Long Strings of Zeros in Base Expansions”, Computability in Europe, Lecture Notes in Computer Science, 12813, Springer, 2021, 248-259
3. Ivan Georgiev, “On subrecursive complexity of integration”, Annals of Pure and Applied Logic, 171:4 (2020), 102777
4. Ivan Georgiev, “Uniform and Conditional $M^2$-computability of Some Nonelementary Real Functions”, Comptes rendus de l'Academie bulgare des Sciences, 73:3 (2020), 306-314
5. Ivan Georgiev, Lars Kristiansen, Frank Stephan, “On General Sum Approximations of Irrational Numbers”, Computability in Europe, Lecture Notes in Computer Sceince, 10936, Springer, 2018, 194-203

• Sofia University St. Kliment Ohridski