Maksim Zhukovskii
Scholar

Maksim Zhukovskii

Google Scholar ID: sd_xBDQAAAAJ
The University of Sheffield
Graph theoryrandom graphsfirst order logicdescriptive complexityextremal combinatorics
Google Scholar↗
Citations & Impact
All-time
Citations
869
 
H-index
15
 
i10-index
26
 
Publications
20
 
Co-authors
28
list available
Contact
No contact links provided.
Publications
6 items
What can be computed in average anonymous networks?
2026
Cited
0
Canonical labelling of random regular graphs
2026
Cited
0
Functionality of Random Graphs
2024
Cited
0
New bounds for the optimal density of covering single-insertion codes via the Turán density
IEEE Transactions on Information Theory · 2024
Cited
1
Canonization of a random circulant graph by counting walks
Workshop on Algorithms and Computation · 2023
Cited
3
A very sharp threshold for first order logic distinguishability of random graphs
arXiv.org · 2022
Cited
1
Resume (English only)
Co-authors
28 total
Gleb Gusev
Gleb Gusev
Sber AI Lab, Moscow Institute of Physics and Technology
Co-author 2
Co-author 2
Oleg Verbitsky
Oleg Verbitsky
Інститут прикладних проблем механіки і математики ім.Я.С.Підстригача, Humboldt Universität zu Berlin
Alexander Gasnikov
Alexander Gasnikov
Innopolis University
Pavel Dvurechensky
Pavel Dvurechensky
Weierstrass Institute for Applied Analysis and Stochastics
Co-author 6
Co-author 6
Co-author 7
Co-author 7
Yury Demidovich
Yury Demidovich
Postdoctoral Fellow, KAUST