Mikhail Isaev

Orcid: 0000-0002-2599-9741

According to our database1, Mikhail Isaev authored at least 20 papers between 2011 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Degree sequences of sufficiently dense random uniform hypergraphs.
Comb. Probab. Comput., March, 2023

On the Chromatic Number in the Stochastic Block Model.
Electron. J. Comb., 2023

Calculon: a methodology and tool for high-level co-design of systems and large language models.
Proceedings of the International Conference for High Performance Computing, 2023

2022
Distribution of tree parameters by martingale approach.
Comb. Probab. Comput., 2022

Spanning trees in random regular uniform hypergraphs.
Comb. Probab. Comput., 2022

Numerical reconstruction from the Fourier transform on the ball using prolate spheroidal wave functions.
CoRR, 2022

ParaGraph: An application-simulator interface and toolkit for hardware-software co-design.
Proceedings of the 51st International Conference on Parallel Processing, 2022

2021
Subgraph counts for dense random graphs with specified degrees.
Comb. Probab. Comput., 2021

2020
A threshold result for loose Hamiltonicity in random regular uniform hypergraphs.
J. Comb. Theory, Ser. B, 2020

Using Multiple Decomposition Methods and Cluster Analysis to Find and Categorize Typical Patterns of EEG Activity in Motor Imagery Brain-Computer Interface Experiments.
Frontiers Robotics AI, 2020

Integer Quantization for Deep Learning Inference: Principles and Empirical Evaluation.
CoRR, 2020

Asymptotic Enumeration of Orientations of a Graph as a Function of the Out-Degree Sequence.
Electron. J. Comb., 2020

Sandwiching random regular graphs between binomial random graphs.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

2019
Practical and efficient incremental adaptive routing for HyperX networks.
Proceedings of the International Conference for High Performance Computing, 2019

2018
Complex martingales and asymptotic enumeration.
Random Struct. Algorithms, 2018

SuperSim: Extensible Flit-Level Simulation of Large-Scale Interconnection Networks.
Proceedings of the IEEE International Symposium on Performance Analysis of Systems and Software, 2018

2017
The average number of spanning trees in sparse graphs with given degrees.
Eur. J. Comb., 2017

2013
New Global Stability Estimates for Monochromatic Inverse Acoustic Scattering.
SIAM J. Math. Anal., 2013

2012
On the class of gamma-mixing graphs
CoRR, 2012

2011
Asymptotic Behaviour of the Number of Eulerian Circuits.
Electron. J. Comb., 2011


  Loading...