Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNikolajs Nahimovs
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j4]Adam Glos
, Nikolajs Nahimovs, Konstantin Balakirev, Kamil Khadiev:
Upperbounds on the probability of finding marked connected components using quantum walks. Quantum Inf. Process. 20(1): 6 (2021)- 2020
- [i3]Nikolajs Nahimovs:
Lackadaisical quantum walks on triangular and honeycomb 2D grids. CoRR abs/2007.13564 (2020)
2010 – 2019
- 2019
- [c9]Nikolajs Nahimovs:
Lackadaisical Quantum Walks with Multiple Marked Vertices. SOFSEM 2019: 368-378 - [i2]Adam Glos, Nikolajs Nahimovs, Konstantin Balakirev, Kamil Khadiev:
Upperbounds on the probability of finding marked connected components using quantum walks. CoRR abs/1903.01482 (2019) - 2018
- [j3]Dmitry Kravchenko, Nikolajs Nahimovs, Alexander Rivosh:
Grover's Search with Faults on Some Marked Elements. Int. J. Found. Comput. Sci. 29(4): 647-662 (2018) - [j2]Nikolajs Nahimovs, Alexander Rivosh:
Quantum Walks on Two-Dimensional Grids with Multiple Marked Locations. Int. J. Found. Comput. Sci. 29(4): 687-700 (2018) - 2017
- [c8]Nikolajs Nahimovs, Raqueline A. M. Santos:
Adjacent Vertices Can Be Hard to Find by Quantum Walks. SOFSEM 2017: 256-267 - 2016
- [c7]Dmitry Kravchenko, Nikolajs Nahimovs, Alexander Rivosh:
Grover's Search with Faults on Some Marked Elements. SOFSEM 2016: 344-355 - [c6]Nikolajs Nahimovs, Alexander Rivosh:
Quantum Walks on Two-Dimensional Grids with Multiple Marked Locations. SOFSEM 2016: 381-391 - 2015
- [c5]Nikolajs Nahimovs, Alexander Rivosh:
Exceptional Configurations of Quantum Walks with Grover's Coin. MEMICS 2015: 79-92 - 2012
- [c4]Andris Ambainis, Arturs Backurs, Nikolajs Nahimovs, Alexander Rivosh:
Grover's Algorithm with Errors. MEMICS 2012: 180-189 - [c3]Andris Ambainis, Arturs Backurs, Nikolajs Nahimovs, Raitis Ozols, Alexander Rivosh:
Search by Quantum Walks on Two-Dimensional Grid without Amplitude Amplification. TQC 2012: 87-97 - 2011
- [i1]Andris Ambainis, Arturs Backurs, Nikolajs Nahimovs, Raitis Ozols, Alexander Rivosh:
Search by quantum walks on two-dimensional grid without amplitude amplification. CoRR abs/1112.3337 (2011) - 2010
- [c2]Andris Ambainis, Dmitry Kravchenko, Nikolajs Nahimovs, Alexander Rivosh:
Nonlocal Quantum XOR Games for Large Number of Players. TAMC 2010: 72-83
2000 – 2009
- 2009
- [j1]Andris Ambainis, Nikolajs Nahimovs:
Improved constructions of quantum automata. Theor. Comput. Sci. 410(20): 1916-1922 (2009) - 2008
- [c1]Andris Ambainis, Nikolajs Nahimovs:
Improved Constructions of Quantum Automata. TQC 2008: 47-56
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).
load content from web.archive.org
Privacy notice: By enabling the option above, your browser will contact the API of web.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.
Tweets on dblp homepage
Show tweets from 
on the dblp homepage.
Privacy notice: By enabling the option above, your browser will contact twitter.com and twimg.com to load tweets curated by our Twitter account. At the same time, Twitter will persistently store several cookies with your web browser. While we did signal Twitter to not track our users by setting the "dnt" flag, we do not have any control over how Twitter uses your data. So please proceed with care and consider checking the Twitter privacy policy.
last updated on 2022-08-25 04:55 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:
