default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEmilia A. Monakhova
Person information
- affiliation: Siberian Branch of the Russian Academy of Sciences, Novosibirsk, Russia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j6]Emilia A. Monakhova
, Oleg G. Monakhov, Aleksandr Yu. Romanov:
Routing Algorithms in Optimal Degree Four Circulant Networks Based on Relative Addressing: Comparative Analysis for Networks-on-Chip. IEEE Trans. Netw. Sci. Eng. 10(1): 413-425 (2023)- [c8]Oleg G. Monakhov, Emilia A. Monakhova, Sergey Kireev:
Parallel Generation and Analysis of Optimal Chordal Ring Networks Using Python Tools on Kunpeng Processors. PaCT 2023: 126-135 - 2021
- [j5]Oleg G. Monakhov, Emilia A. Monakhova, Aleksandr Yu. Romanov, Andrej M. Sukhov, Evgenii V. Lezhnev:
Adaptive Dynamic Shortest Path Search Algorithm in Networks-on-Chip Based on Circulant Topologies. IEEE Access 9: 160836-160846 (2021) - 2020
- [j4]Emilia A. Monakhova, Aleksandr Romanov, Evgenii V. Lezhnev:
Shortest Path Search Algorithm in Optimal Two-Dimensional Circulant Networks: Implementation for Networks-on-Chip. IEEE Access 8: 215010-215019 (2020)
2010 – 2019
- 2017
- [j3]Hira Zaheer, Millie Pant, Sushil Kumar, Oleg G. Monakhov, Emilia A. Monakhova, Kusum Deep:
A new guiding force strategy for differential evolution. Int. J. Syst. Assur. Eng. Manag. 8(4s): 2170-2183 (2017) - 2015
- [c7]Hira Zaheer, Millie Pant, Oleg G. Monakhov, Emilia A. Monakhova:
A Portfolio Analysis of Ten National Banks Through Differential Evolution. SocProS (2) 2015: 851-862 - 2012
- [j2]Emilia A. Monakhova:
A Survey on Undirected circulant Graphs. Discret. Math. Algorithms Appl. 4(1) (2012)
2000 – 2009
- 2005
- [c6]Oleg G. Monakhov, Emilia A. Monakhova:
Synthesis of Scientific Algorithms based on Evolutionary Computation and Templates. AAIP 2005: 29-35 - 2003
- [c5]Oleg G. Monakhov, Emilia A. Monakhova:
An Algorithm for Discovery of New Families of Optimal Regular Networks. Discovery Science 2003: 245-255 - 2002
- [c4]Oleg G. Monakhov, Emilia A. Monakhova:
Using evolutionary algorithm for generation of dense families of circulant networks. IEEE Congress on Evolutionary Computation 2002: 1854-1859 - 2000
- [j1]Oleg G. Monakov, Emilia A. Monakhova:
A Class of Parametric Regular Networks for Multicomputer Architectures. Computación y Sistemas 4(2): 85-93 (2000) - [c3]Oleg G. Monakhov, Emilia A. Monakhova:
Parametrically Described Regular Semigroup Interconnection Networks for Large-Scale Multicomputers. ISPAN 2000: 202-209
1990 – 1999
- 1999
- [c2]Emilia A. Monakhova, Oleg G. Monakhov, E. V. Mukhoed:
Genetic Construction of Optimal Circulant Network Designs. EvoWorkshops 1999: 215-223 - 1997
- [c1]Emilia A. Monakhova:
Algorithms and Lower Bounds for P-Gossiping in Circulant Networks. ISPAN 1997: 132-137
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 2025-01-09 13:10 CET 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:
