Skip to main content
Home

St. Petersburg Department
of Steklov Mathematical Institute
of Russian Academy of Sciences

27 Fontanka, St. Petersburg, Russia

Main menu

  • Institute structure
    • Administration
    • EIMI
    • Laboratories
    • Researchers
    • Academic council
    • Center of Research and Education
    • Publishing Department
    • Contacts
  • Activities
    • Conferences
    • Seminars
    • Dissertation Councils
    • Journal "Algebra and Analysis"
    • Journal "Zapiski Nauchnykh Seminarov POMI"
    • Preprints (partially in Russian)
    • Publications
  • Search
  • Resources
    • Video records
    • History of the Institute
    • Digital libraries (in Russian)
    • Links (in Russian)
    • Former Employees
    • Remembering Olga Ladyzhenskaya
    • PDMI Library

теория информации

Александр Владимирович Смаль

лаборатория математической логики и дискретной математики
Position: 
Junior Researcher
Scientific Degree: 
Candidate of Sciences
Email: 
smal [at] pdmi.ras.ru
Homepage: 
http://logic.pdmi.ras.ru/~smal/
Scientific Interests: 
Теория сложности булевых схем
коммуникационная сложность
теория информации
алгоритмы

Образование:

2008 Университет ИТМО, факультет информационных технологий и программирования, прикладная математика и информатика.

Публикации:

  1. Ivan Mihajlin, Alexander Smal: Toward Better Depth Lower Bounds: The XOR-KRW Conjecture. CCC 2021: 38:1-38:24.
  2. Kenneth Hoover, Russell Impagliazzo, Ivan Mihajlin, Alexander V. Smal: Half-Duplex Communication Complexity. ISAAC 2018: 10:1-10:12.
  3. Alexander V. Smal, Navid Talebanfard: Prediction from partial information and hindsight, an alternative proof. Inf. Process. Lett. 136: 102-104 (2018).
  4. Alexander Golovnev, Alexander S. Kulikov, Alexander V. Smal, Suguru Tamaki: Gate elimination: Circuit size lower bounds and #SAT upper bounds. Theor. Comput. Sci. 719: 46-63 (2018).
  5. Edward A. Hirsch, Dmitry Itsykson, Ivan Monakhov, Alexander Smal: On Optimal Heuristic Randomized Semidecision Procedures, with Applications to Proof Complexity and Cryptography. Theory Comput. Syst. 51(2): 179-195 (2012).

https://dblp.uni-trier.de/pid/74/8864.html

  • Русский Русский
  • English English