default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNikolai L. Zamarashkin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
[j4]Stanislav S. Budzinskiy
, Nikolai L. Zamarashkin:
Tensor train completion: Local recovery guarantees via Riemannian optimization. Numer. Linear Algebra Appl. 30(6) (2023)- 2014
- [j3]Neville J. Ford, Dmitry V. Savostyanov, Nickolai L. Zamarashkin:
On the Decay of the Elements of Inverse Triangular Toeplitz Matrices. SIAM J. Matrix Anal. Appl. 35(4): 1288-1302 (2014) - 2012
- [j2]Dmitry V. Savostyanov, Eugene E. Tyrtyshnikov, Nickolai L. Zamarashkin:
Fast truncation of mode ranks for bilinear tensor operations. Numer. Linear Algebra Appl. 19(1): 103-111 (2012) - 2011
- [j1]Ivan V. Oseledets, Eugene E. Tyrtyshnikov, Nickolai L. Zamarashkin:
Tensor-Train Ranks for Matrices and Their Inverses. Comput. Methods Appl. Math. 11(3): 394-403 (2011)
Conference and Workshop Papers
- 2019
- [c3]Stanislav Morozov, Dmitry A. Zheltkov, Nikolai L. Zamarashkin:
On the Problem of Decoupling Multivariate Polynomials. LSSC 2019: 133-139 - 2018
- [c2]Nikolai L. Zamarashkin, Dmitry A. Zheltkov:
Block Lanczos-Montgomery Method over Large Prime Fields with GPU Accelerated Dense Operations. RuSCDays 2018: 40-49 - 2017
- [c1]Nikolai L. Zamarashkin, Dmitry A. Zheltkov:
GPU Acceleration of Dense Matrix and Block Operations for Lanczos Method for Systems over Large Prime Finite Field. RuSCDays 2017: 14-26
Informal and Other Publications
- 2023
- [i8]Sergey Petrov, Nikolai L. Zamarashkin:
Theoretical Bounds for Noise Filtration using Low-Rank Tensor Approximations. CoRR abs/2312.02088 (2023) - 2022
- [i7]Stanislav Morozov, Nikolai L. Zamarashkin, Eugene Tyrtyshnikov:
On the algorithm of best approximation by low rank matrices in the Chebyshev norm. CoRR abs/2201.12301 (2022) - [i6]Stanislav S. Budzinskiy, Nikolai L. Zamarashkin:
Variational Bayesian inference for CP tensor completion with side information. CoRR abs/2206.12486 (2022) - [i5]Stanislav Morozov, Matvey Smirnov, Nikolai L. Zamarashkin:
On the optimal rank-1 approximation of matrices in the Chebyshev norm. CoRR abs/2212.01438 (2022) - 2021
- [i4]Stanislav S. Budzinskiy, Nikolai L. Zamarashkin:
Tensor train completion: local recovery guarantees via Riemannian optimization. CoRR abs/2110.03975 (2021) - 2020
- [i3]Stanislav S. Budzinskiy, Nikolai L. Zamarashkin:
Note: low-rank tensor train completion with side information based on Riemannian optimization. CoRR abs/2006.12798 (2020) - 2012
- [i2]Gregory Bonik, Sergei A. Goreinov, Nickolai L. Zamarashkin:
Construction and analysis of polar and concatenated polar codes: practical approach. CoRR abs/1207.4343 (2012) - [i1]Gregory Bonik, Sergei A. Goreinov, Nickolai L. Zamarashkin:
A variant of list plus CRC concatenated polar code. CoRR abs/1207.4661 (2012)
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-04-24 22:46 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:
