Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAleksandr Romanov 0001
Person information
- affiliation: National Research University, Higher School of Economics, Moscow, Russia
- affiliation (PhD 2015): Russian Academy of Sciences, Federal State-Funded Institution of Science Institute for Design Problems in Microelectronics, Zelenograd, Russia
Other persons with the same name
- Aleksandr Romanov 0002
![[0000-0002-2587-2222]](https://dblp1.uni-trier.de/img/orcid-mark.12x12.png "0000-0002-2587-2222")
(aka: Aleksandr Sergeevich Romanov) — Tomsk State University of Control Systems and Radioelectronics, Faculty of Security, Russia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j14]Vitaly G. Stepanyants, Aleksandr Yu. Romanov:
Influence of Realistic Perception and Surroundings on Qualitative Results in Automated and Connected Vehicle Simulation. IEEE Access 12: 43721-43733 (2024)- [j13]Evgenii V. Lezhnev, Vladimir V. Zunin, Aleksandr A. Amerikanov, Aleksandr Yu. Romanov:
Electronic Computer-Aided Design for Low-Level Modeling of Networks-on-Chip. IEEE Access 12: 48750-48763 (2024) - [j12]Vitaly G. Stepanyants, Aleksandr Yu. Romanov:
A Survey of Integrated Simulation Environments for Connected Automated Vehicles: Requirements, Tools, and Architecture. IEEE Intell. Transp. Syst. Mag. 16(2): 6-22 (2024) - [j11]Andrei M. Sukhov, Aleksandr Romanov, Maksim P. Selin:
Virtual Coordinate System Based on a Circulant Topology for Routing in Networks-On-Chip. Symmetry 16(1): 127 (2024) - 2023
- [j10]Ahmed Ibrahim El-Mesady, Aleksandr Yu. Romanov, Aleksandr A. Amerikanov, Alexander Ivannikov:
On Bipartite Circulant Graph Decompositions Based on Cartesian and Tensor Products with Novel Topologies and Deadlock-Free Routing. Algorithms 16(1): 10 (2023) - [j9]Ahmed Ibrahim El-Mesady, Tasneem Farahat, Ramadan A. El-Shanawany, Aleksandr Romanov:
On Orthogonal Double Covers and Decompositions of Complete Bipartite Graphs by Caterpillar Graphs. Algorithms 16(7): 320 (2023) - [j8]Aleksandr Romanov:
The Dataset for Optimal Circulant Topologies. Big Data Cogn. Comput. 7(2): 80 (2023) - [j7]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) - [i2]Alina Rogulina, Olga Volgina, Aleksandr Romanov, Andrej M. Sukhov:
Classification of networks-on-chip in the context of analysis of promising self-organizing routing algorithms. CoRR abs/2306.07448 (2023) - 2022
- [j6]Aleksandr Romanov:
Driving an innovation contest into crisis. Commun. ACM 65(10): 8-9 (2022) - [c6]Vitaly G. Stepanyants, Aleksandr Romanov:
An Object-Oriented Approach to a Structured Description of Machine Perception and Traffic Participant Interactions in Traffic Scenarios. ICITE 2022: 197-203 - 2021
- [j5]Aleksandr Yu. Romanov, Alexander L. Stempkovsky, Ilia V. Lariushkin, Georgy E. Novoselov, Roman A. Solovyev, Vladimir A. Starykh, Irina Romanova, Dmitry V. Telpukhov, Ilya A. Mkrtchan:
Analysis of Posit and Bfloat Arithmetic of Real Numbers for Machine Learning. IEEE Access 9: 82318-82324 (2021) - [j4]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) - [c5]Aleksandr Romanov, Nikolay Myachin, Andrei M. Sukhov:
Fault-Tolerant Routing in Networks-on-Chip Using Self-Organizing Routing Algorithms. IECON 2021: 1-6 - 2020
- [j3]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
- 2019
- [j2]Aleksandr Romanov, Konstantin Lomotin, Ekaterina Kozlova:
Application of Natural Language Processing Algorithms to the Task of Automatic Classification of Russian Scientific Texts. Data Sci. J. 18: 37 (2019) - [i1]Aleksandr Yu. Romanov:
Development of routing algorithms in networks-on-chip based on ring circulant topologies. CoRR abs/1904.09495 (2019) - 2018
- [j1]Aleksandr Romanov, Alexander Ivannikov:
SystemC Language Usage as the Alternative to the HDL and High-level Modeling for NoC Simulation. Int. J. Embed. Real Time Commun. Syst. 9(2): 18-31 (2018) - 2017
- [c4]Aleksandr Romanov, Konstantin Lomotin, Ekaterina Kozlova:
Automatization of Scientific Articles Classification According to Universal Decimal Classifier. AIST (Supplement) 2017: 122-133 - [c3]Aleksandr Romanov, Irina Romanova, Alexander Ivannikov:
Application of exhaustive search, branch and bound, parallel computing and Monte-Carlo methods for the synthesis of quasi-optimal network-on-chip topologies. EWDTS 2017: 1-6 - 2016
- [c2]Alexander Ivannikov, Vladimir P. Kulagin, Aleksandr Romanov, Boris Pozdneev:
Algebraic models of digital system design debugging decomposition. EWDTS 2016: 1-4 - [c1]Aleksandr Romanov, Aleksandr Ivannikov:
SystemC NoC simulation as the alternative to the HDL and high-level modeling. FRUCT 2016: 285-290
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-05-08 23:23 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:
