default search action
Sergey Egorov
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c11]Sergey Egorov, Gregory V. Chockler, Brijesh Dongol, Dan O'Keeffe, Sadegh Keshavarzi:
Mangosteen: Fast Transparent Durability for Linearizable Applications using NVM. USENIX ATC 2024: 799-815 - [i4]Vasiliy Usatyuk, Denis Sapozhnikov, Sergey Egorov:
Topology-Aware Exploration of Energy-Based Models Equilibrium: Toric QC-LDPC Codes and Hyperbolic MET QC-LDPC Codes. CoRR abs/2401.14749 (2024) - [i3]Vasiliy Usatyuk, Yury Kuznetsov, Sergey Egorov:
Cyclic Group Projection for Enumerating Quasi-Cyclic Codes Trapping Sets. CoRR abs/2401.14810 (2024) - 2023
- [i2]Vasiliy Usatyuk, Sergey Egorov, Denis Sapozhnikov:
Spherical and Hyperbolic Toric Topology-Based Codes On Graph Embedding for Ising MRF Models: Classical and Quantum Topology Machine Learning. CoRR abs/2307.15778 (2023) - 2022
- [i1]Sergey Egorov, Narek Gevorgyan, Alexey Zaytsev:
Self-supervised similarity models based on well-logging data. CoRR abs/2209.12444 (2022) - 2020
- [j2]Sergey Egorov, Alexey Kapitanov, Vladimir Mitrofanov, Leonid Shvartsburg, Natalia Ivanova, Sergey Ryabov:
Modelling of flexible manufacturing systems. Int. J. Manuf. Technol. Manag. 34(3): 245-258 (2020) - [c10]Vasiliy Usatyuk
, Sergey Egorov:
Hyper Neural Network as the Diffeomorphic Domain for Short Code Soft Decision Beyound Belief Propagation Decoding Problem. EWDTS 2020: 1-6
2010 – 2019
- 2019
- [c9]German Svistunov
Protograph Sieving Method for Construction Moderate Length Multi-Edge Type QC-LDPC Codes. EWDTS 2019: 1-4 - [c8]Vasiliy Usatyuk
Construction of Length and Rate Adaptive MET QC-LDPC Codes by Cyclic Group Decomposition. EWDTS 2019: 1-5 - 2018
- [c7]Ilya Vorobyev, Nikita Polyanskii, German Svistunov
Generalization of Floor Lifting for QC-LDPC Codes: Theoretical Properties and Applications. EWDTS 2018: 1-6 - 2017
- [c6]Vasiliy Usatyuk
Generalization of floor lifting for QC-LDPC codes. EWDTS 2017: 1-6 - 2013
- [c5]Sergey Egorov:
A list decoding algorithm for practical reed-solomon codes. EWDTS 2013: 1-4
2000 – 2009
- 2005
- [c4]Roy Armoni, Sergey Egorov, Ranan Fraer, Dmitry Korchemny, Moshe Y. Vardi:
Efficient LTL compilation for SAT-based model checking. ICCAD 2005: 877-884 - 2004
- [j1]Sergey Egorov
A modified Blahut algorithm for decoding Reed-Solomon codes beyond half the minimum distance. IEEE Trans. Commun. 52(12): 2052-2056 (2004) - [c3]Sergey Egorov, Garik Markarian:
An algorithm for t+1 error correction in Reed-Solomon codes. ICC 2004: 651-655 - [c2]Sergey Egorov, Garik Markarian:
An enhanced Reed-Solomon decoder for wireless communication systems. ISWCS 2004: 198-202
1990 – 1999
- 1999
- [c1]Lubomir Birov, Arkady Prokofiev, Yuri Bartenev, Anatoly Vargin, Avijit Purkayastha, Yoginder S. Dandass, Vladimir Erzunov, Elena Shanikova, Anthony Skjellum, Purushotham V. Bangalore, Eugeny Shuvalov, Vitaly Ovechkin, Nataly Frolova, Sergey Orlov, Sergey Egorov:
The Parallel Mathematical Libraries Project (PMLP): Overview, Design Innovations, and Preliminary Results. PaCT 1999: 186-193
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-10-07 21:21 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: