default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEvgeny Lakshtanov
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i6]Rui Martins, Evgeny Lakshtanov:
A C++ implementation of the discrete adjoint sensitivity analysis method for explicit adaptive Runge-Kutta methods enabled by automatic adjoint differentiation and SIMD vectorization. CoRR abs/2410.01911 (2024)- 2022
- [j11]Dmitri Goloubentsev, Evgeny Lakshtanov
:
Automatic adjoint differentiation for gradient descent and model calibration. Int. J. Wavelets Multiresolution Inf. Process. 20(3): 2040004:1-2040004:6 (2022) - 2021
- [i5]Andrei Goloubentsev, Dmitri Goloubentsev, Evgeny Lakshtanov:
Adjoint Differentiation for generic matrix functions. CoRR abs/2109.04913 (2021)
2010 – 2019
- 2019
- [i4]Dmitri Goloubentsev, Evgeny Lakshtanov:
Remarks on stochastic automatic adjoint differentiation and financial models calibration. CoRR abs/1901.04200 (2019) - 2017
- [j10]Evgeny Lakshtanov, Jorge Tejero, Boris Vainberg:
Uniqueness in the Inverse Conductivity Problem for Complex-Valued Lipschitz Conductivities in the Plane. SIAM J. Math. Anal. 49(5): 3766-3775 (2017) - 2016
- [j9]Evgeny Lakshtanov, Armin Lechleiter:
Difference Factorizations and Monotonicity in Inverse Medium Scattering for Contrasts with Fixed Sign on the Boundary. SIAM J. Math. Anal. 48(6): 3688-3707 (2016) - 2015
- [j8]Evgeny Lakshtanov, Boris Vainberg:
Sharp Weyl Law for Signed Counting Function of Positive Interior Transmission Eigenvalues. SIAM J. Math. Anal. 47(4): 3212-3234 (2015) - 2013
- [j7]Evgeny Lakshtanov, Alena I. Aleksenko:
Finiteness in the Beggar-My-Neighbor card game. Probl. Inf. Transm. 49(2): 163-166 (2013) - 2012
- [j6]Evgeny Lakshtanov, Brian D. Sleeman, Boris Vainberg:
High Frequency Scattering by a Classically Invisible Body. SIAM J. Appl. Math. 72(2): 646-669 (2012) - [j5]Evgeny Lakshtanov, Boris Vainberg:
Ellipticity in the Interior Transmission Problem in Anisotropic Media. SIAM J. Math. Anal. 44(2): 1165-1174 (2012) - [j4]Evgeny Lakshtanov, Vera Roshchina:
On Finiteness in the Card Game of War. Am. Math. Mon. 119(4): 318-323 (2012) - 2011
- [j3]Alena I. Aleksenko, Evgeny Lakshtanov:
Examples of admissible simplification of mathematical theories. Kybernetes 40(9/10): 1523-1529 (2011) - [i3]Alena I. Aleksenko, Evgeny Lakshtanov:
Finiteness of the playing time in 'Beggar-my-neighbour' card game. CoRR abs/1109.1460 (2011) - 2010
- [i2]Evgeny Lakshtanov, Vera Roshchina:
Finiteness in the Card Game of War. CoRR abs/1007.1371 (2010)
2000 – 2009
- 2008
- [i1]Oleg German, Evgeny Lakshtanov:
"Minesweeper" without a computer. CoRR abs/0806.3480 (2008) - 2006
- [j2]Evgeny Lakshtanov, E. S. Langvagen:
Entropy of multidimensional cellular automata. Probl. Inf. Transm. 42(1): 38-45 (2006) - 2004
- [j1]Evgeny Lakshtanov, E. S. Langvagen:
Criterion of Infinite Topological Entropy for Multidimensional Cellular Automata. Probl. Inf. Transm. 40(2): 165-167 (2004)
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-11-11 21:31 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:
