default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMikhail Isaev
This is just a disambiguation page, and is not intended to be the bibliography of an actual person. Any publication listed on this page has not been assigned to an actual author yet. If you know the true author of one of the publications listed below, you are welcome to contact us.
Person information
Other persons with a similar name
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[b1]Mikhail Isaev:
Methodologies for co-designing supercomputer-scale systems and deep learning software. Georgia Institute of Technology, Atlanta, GA, USA, 2024- 2023
- [j12]Mikhail Isaev, Mihyun Kang
:
On the Chromatic Number in the Stochastic Block Model. Electron. J. Comb. 30(2) (2023) - [j11]Catherine S. Greenhill, Mikhail Isaev, Tamás Makai, Brendan D. McKay:
Degree sequences of sufficiently dense random uniform hypergraphs. Comb. Probab. Comput. 32(2): 183-224 (2023) - [c5]Mikhail Isaev, Nic McDonald, Larry Dennison, Richard W. Vuduc:
Calculon: a methodology and tool for high-level co-design of systems and large language models. SC 2023: 71:1-71:14 - 2022
- [j10]Catherine S. Greenhill, Mikhail Isaev, Gary Liang:
Spanning trees in random regular uniform hypergraphs. Comb. Probab. Comput. 31(1): 29-53 (2022) - [j9]Mikhail Isaev, Angus Southwell, Maksim Zhukovskii:
Distribution of tree parameters by martingale approach. Comb. Probab. Comput. 31(5): 737-764 (2022) - [c4]Mikhail Isaev, Nic McDonald, Jeffrey Young, Richard W. Vuduc:
ParaGraph: An application-simulator interface and toolkit for hardware-software co-design. ICPP 2022: 63:1-63:13 - [i3]Mikhail Isaev, Roman G. Novikov, Grigory V. Sabinin:
Numerical reconstruction from the Fourier transform on the ball using prolate spheroidal wave functions. CoRR abs/2202.12098 (2022) - 2021
- [j8]Catherine S. Greenhill, Mikhail Isaev, Brendan D. McKay:
Subgraph counts for dense random graphs with specified degrees. Comb. Probab. Comput. 30(3): 460-497 (2021) - 2020
- [j7]Mikhail Isaev, Tejas Iyer, Brendan D. McKay:
Asymptotic Enumeration of Orientations of a Graph as a Function of the Out-Degree Sequence. Electron. J. Comb. 27(1): 1 (2020) - [j6]Alexander A. Frolov, Pavel Bobrov, Elena Biryukova, Mikhail Isaev, Yaroslav Kerechanin, Dmitry Bobrov, Alexander Lekin:
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 7: 88 (2020) - [j5]Daniel Altman, Catherine S. Greenhill, Mikhail Isaev, Reshma Ramadurai:
A threshold result for loose Hamiltonicity in random regular uniform hypergraphs. J. Comb. Theory B 142: 307-373 (2020) - [c3]Pu Gao, Mikhail Isaev, Brendan D. McKay:
Sandwiching random regular graphs between binomial random graphs. SODA 2020: 690-701 - [i2]Hao Wu, Patrick Judd, Xiaojie Zhang, Mikhail Isaev, Paulius Micikevicius:
Integer Quantization for Deep Learning Inference: Principles and Empirical Evaluation. CoRR abs/2004.09602 (2020)
2010 – 2019
- 2019
- [c2]Nic McDonald, Mikhail Isaev, Adriana Flores, Al Davis, John Kim:
Practical and efficient incremental adaptive routing for HyperX networks. SC 2019: 15:1-15:13 - 2018
- [j4]Mikhail Isaev, Brendan D. McKay:
Complex martingales and asymptotic enumeration. Random Struct. Algorithms 52(4): 617-661 (2018) - [c1]Nic McDonald, Adriana Flores, Al Davis, Mikhail Isaev, John Kim, Doug Gibson:
SuperSim: Extensible Flit-Level Simulation of Large-Scale Interconnection Networks. ISPASS 2018: 87-98 - 2017
- [j3]Catherine S. Greenhill, Mikhail Isaev, Matthew Kwan, Brendan D. McKay:
The average number of spanning trees in sparse graphs with given degrees. Eur. J. Comb. 63: 6-25 (2017) - 2013
- [j2]Mikhail Isaev, Roman G. Novikov:
New Global Stability Estimates for Monochromatic Inverse Acoustic Scattering. SIAM J. Math. Anal. 45(3): 1495-1504 (2013) - 2012
- [i1]Mikhail Isaev, K. V. Isaeva:
On the class of gamma-mixing graphs. CoRR abs/1203.6880 (2012) - 2011
- [j1]Mikhail Isaev:
Asymptotic Behaviour of the Number of Eulerian Circuits. Electron. J. Comb. 18(1) (2011)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-29 00:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
