Alexander V. Smal
Scholar

Alexander V. Smal

Google Scholar ID: uTt5h5EAAAAJ
JetBrains Research
algorithmscomplexity theoryinformation theory
Citations & Impact
All-time
Citations
72
 
H-index
6
 
i10-index
2
 
Publications
20
 
Co-authors
10
list available
Resume (English only)
Academic Achievements
  • - Conference Papers:
  • * Catalytic Computing and Register Programs Beyond Log-Depth, MFCS 2025
  • * Separating Coverage and Submodular: Maximization Subject to a Cardinality Constraint, IPCO 2025
  • * Proving Unsatisfiability with Hitting Formulas, ITCS 2024
  • * Super-Cubic Lower Bound for Generalized Karchmer-Wigderson Games, ISAAC 2022
  • * Toward Better Depth Lower Bounds: The XOR-KRW Conjecture, CCC 2021
  • * New Bounds on the Half-Duplex Communication Complexity, SOFSEM 2021
  • * Half-Duplex Communication Complexity, ISAAC 2018
  • * Circuit Size Lower Bounds and #SAT Upper Bounds Through a General Framework, MFCS 2016
  • - Journal Articles:
  • * Lifting Dichotomies, Computational Complexity, vol. 34, no. 18, 2025
  • * Irreducible Subcube Partitions, Electronic Journal of Combinatorics, vol. 30, no. 3, 2023
  • * Prediction from Partial Information and Hindsight, an Alternative Proof, Information Processing Letters, vol. 136, pp. 102-104, 2018
  • * Gate Elimination: Circuit Size Lower Bounds and #SAT Upper Bounds, Theoretical Computer Science, vol. 719, pp. 46-63, 2018
Research Experience
  • - Researcher, 2024 – Present, JetBrains, Limassol, Cyprus, Member of: Algorithms and Complexity Theory Lab
  • - Postdoctoral Fellow, 2022 – 2024, Technion – Israel Institute of Technology, Haifa, Israel
  • - PhD Student, Researcher, 2008 – Present (on leave), Steklov Institute of Mathematics at St.Petersburg, Russia, Member of: Laboratory of Mathematical Logic
  • - Early Stage Researcher, 2011, Charles University, Prague, Czech Republic
  • - Research Intern, 2011, Microsoft Research Silicon Valley, Mountain View, CA, USA
Education
  • - PhD Student, Researcher, 2008 – Present (on leave), Steklov Institute of Mathematics at St.Petersburg, Russia, Member of: Laboratory of Mathematical Logic
  • - Postdoctoral Fellow, 2022 – 2024, Technion – Israel Institute of Technology, Haifa, Israel, Mentor: Yuval Filmus and Roy Schwartz
  • - Research Intern, 2011, Microsoft Research Silicon Valley, Mountain View, CA, USA, Mentor: Ilya Mironov
  • - Early Stage Researcher, 2011, Charles University, Prague, Czech Republic
Background
  • Research Interests: Complexity Theory, Algorithms, Information Theory. Currently a Researcher at JetBrains.
Miscellany
  • Teaching Experience:
  • - Neapolis University Pafos, Cyprus, 2024 – Present, BSc program, Courses: Information Theory, Mathematical Logic, Mathematical Analysis
  • - ITMO University, St. Petersburg, Russia, 2018 – 2022, Courses: Algorithms, Information Theory
  • - St. Petersburg University, Russia, 2020, Courses: Advanced Algorithms
  • - Higher School of Economics, St. Petersburg, Russia, 2020, Courses: Information Theory
  • - Computer Science Center, St. Petersburg, Russia, 2011 – 2019, Courses: Algorithms, C++
  • - Open Online Course on C++ at Stepik Platform, 2015 – 2017, Part 1, Part 2
  • - St. Petersburg Academic University, Russia, 2008 – 2018, Courses: Algorithms, C++, Information Theory, Foundations of Cryptography