Speciality: 01.01.06 (Mathematical logic, algebra, and number theory)
Birth date: 21.11.1981
E-mail:
Website: https://igorssergeev.github.io
Keywords: Boolean circuits, complexity, depth, Boolean functions, finite fields
UDC: 519.7

Subject:

complexity of computing

Main publications:

1. Sergeev I.S., “Circuits of logarithmic depth for inversion in finite fields of characteristic 2”, Matematicheskie voprosy kibernetiki. Issue 15 (in Russian), Nauka, Moscow, 2006, 35–64
2. Sergeev I.S., “On the complexity of parallel prefix circuits”, Electronic Colloquium on Computational Complexity, 2013, TR13-041
3. Sergeev I.S., “Upper bounds on the depth of symmetric Boolean functions”, Moscow University Computational Mathematics and Cybernetics, 37:4 (2013), 195–201
4. Jukna Stasys, Sergeev Igor, “Complexity of linear Boolean operators”, Foundations and Trends in Theoretical Computer Science, 9:1 (2013), 1–123
5. Sergeev I.S., “On the asymptotic complexity of sorting”, Electronic Colloquium on Computational Complexity, 2020, TR20-096

Publications in Math-Net.Ru

Presentations in Math-Net.Ru

Personal pages:

• 
• 
• 
• ISTINA

Organisations:

• Research Institute "Kvant", Moscow
• Lomonosov Moscow State University, Faculty of Mechanics and Mathematics