Asymptotic Behaviour of the Number of Eulerian Circuits. - Mikhail Isaev (Electron. J. Comb., 2011)

On the class of gamma-mixing graphs - Mikhail Isaev; K. V. Isaeva (CoRR, 2012)

New Global Stability Estimates for Monochromatic Inverse Acoustic Scattering. - Mikhail Isaev; Roman G. Novikov (SIAM J. Math. Anal., 2013)

The average number of spanning trees in sparse graphs with given degrees. - Catherine S. Greenhill; Mikhail Isaev; Matthew Kwan 001; Brendan D. McKay (Eur. J. Comb., 2017)

SuperSim: Extensible Flit-Level Simulation of Large-Scale Interconnection Networks. - Nic McDonald; Adriana Flores; Al Davis; Mikhail Isaev; John Kim 001; Doug Gibson (ISPASS, 2018)

Complex martingales and asymptotic enumeration. - Mikhail Isaev; Brendan D. McKay (Random Struct. Algorithms, 2018)

Practical and efficient incremental adaptive routing for HyperX networks. - Nic McDonald; Mikhail Isaev; Adriana Flores; Al Davis; John Kim 001 (SC, 2019)

Sandwiching random regular graphs between binomial random graphs. - Pu Gao; Mikhail Isaev; Brendan D. McKay (SODA, 2020)

Asymptotic Enumeration of Orientations of a Graph as a Function of the Out-Degree Sequence. - Mikhail Isaev; Tejas Iyer; Brendan D. McKay (Electron. J. Comb., 2020)

Integer Quantization for Deep Learning Inference: Principles and Empirical Evaluation. - Hao Wu; Patrick Judd; Xiaojie Zhang; Mikhail Isaev; Paulius Micikevicius (CoRR, 2020)

Using Multiple Decomposition Methods and Cluster Analysis to Find and Categorize Typical Patterns of EEG Activity in Motor Imagery Brain-Computer Interface Experiments. - Alexander A. Frolov; Pavel Bobrov; Elena Biryukova; Mikhail Isaev; Yaroslav Kerechanin; Dmitry Bobrov; Alexander Lekin (Frontiers Robotics AI, 2020)

A threshold result for loose Hamiltonicity in random regular uniform hypergraphs. - Daniel Altman; Catherine S. Greenhill; Mikhail Isaev; Reshma Ramadurai (J. Comb. Theory B, 2020)

Subgraph counts for dense random graphs with specified degrees. - Catherine S. Greenhill; Mikhail Isaev; Brendan D. McKay (Comb. Probab. Comput., 2021)

ParaGraph: An application-simulator interface and toolkit for hardware-software co-design. - Mikhail Isaev; Nic McDonald; Jeffrey Young 001; Richard W. Vuduc (ICPP, 2022)

Numerical reconstruction from the Fourier transform on the ball using prolate spheroidal wave functions. - Mikhail Isaev; Roman G. Novikov; Grigory V. Sabinin (CoRR, 2022)

Spanning trees in random regular uniform hypergraphs. - Catherine S. Greenhill; Mikhail Isaev; Gary Liang (Comb. Probab. Comput., 2022)

Distribution of tree parameters by martingale approach. - Mikhail Isaev; Angus Southwell; Maksim Zhukovskii (Comb. Probab. Comput., 2022)

Calculon: a methodology and tool for high-level co-design of systems and large language models. - Mikhail Isaev; Nic McDonald; Larry Dennison; Richard W. Vuduc (SC, 2023)

On the Chromatic Number in the Stochastic Block Model. - Mikhail Isaev; Mihyun Kang (Electron. J. Comb., 2023)

Degree sequences of sufficiently dense random uniform hypergraphs. - Catherine S. Greenhill; Mikhail Isaev; Tamás Makai; Brendan D. McKay (Comb. Probab. Comput., 2023)

Methodologies for co-designing supercomputer-scale systems and deep learning software. - Mikhail Isaev (2024)

Brief Announcement: Optimality Conditions for Parallel Communication-Avoiding Matrix Multiplication with Overlapped Communication. - Mikhail Isaev; Srinivas Eswar; Richard W. Vuduc (SPAA, 2025)

Decomposing random regular graphs into stars. - Michelle Delcourt; Catherine S. Greenhill; Mikhail Isaev; Bernard Lidický; Luke Postle (Eur. J. Comb., 2025)

On the maximum number of common neighbours in dense random regular graphs. - Mikhail Isaev; Maksim Zhukovskii (Eur. J. Comb., 2025)

Cumulant expansion for counting Eulerian orientations. - Mikhail Isaev; Brendan D. McKay; Rui-Ray Zhang (J. Comb. Theory B, 2025)