default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlexander Vasiliev
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j3]Virginie Solans
, Dimitri Rochman, Christian Brazell, Alexander Vasiliev, Hakim Ferroukhi, Andreas Pautz:
Optimisation of used nuclear fuel canister loading using a neural network and genetic algorithm. Neural Comput. Appl. 33(23): 16627-16639 (2021)- 2020
- [c7]Farid M. Ablayev, Marat Ablayev, Alexander Vasiliev:
Quantum Hashing and Fingerprinting for Quantum Cryptography and Computations. CSR 2020: 1-15 - [c6]Farid M. Ablayev, Sergey N. Andrianov, Sergey A. Moiseev, Alexander Vasiliev:
Integrated-Optics Quantum Processor Based on Entangled Photons in Coupled Cavities. EWDTS 2020: 1-4
2010 – 2019
- 2018
- [c5]Farid M. Ablayev, Marat Ablayev, Kamil Khadiev, Alexander Vasiliev:
Classical and Quantum Computations with Restricted Memory. Adventures Between Lower Bounds and Higher Altitudes 2018: 129-155 - [i5]D. Sapaev, D. Bulychkov, Farid M. Ablayev, Alexander Vasiliev, Mansur Ziatdinov:
Quantum-Assisted Blockchain. CoRR abs/1802.06763 (2018) - 2016
- [j2]Farid M. Ablayev, Marat Ablayev, Alexander Vasiliev, Mansur Ziatdinov:
Quantum Fingerprinting and Quantum Hashing. Computational and Cryptographical Aspects. Balt. J. Mod. Comput. 4(4) (2016) - [i4]Alexander Vasiliev:
Quantum Hashing for Finite Abelian Groups. CoRR abs/1603.02209 (2016) - 2014
- [c4]Farid M. Ablayev, Alexander Vasiliev:
Computing Boolean Functions via Quantum Hashing. Computing with New Resources 2014: 149-160 - 2013
- [j1]Farid M. Ablayev, Alexander Vasiliev:
Algorithms for Quantum Branching Programs Based on Fingerprinting. Int. J. Softw. Informatics 7(4): 485-500 (2013) - [i3]Alexander Vasiliev:
Quantum Communications Based on Quantum Hashing. CoRR abs/1312.1661 (2013) - 2011
- [c3]Farid M. Ablayev, Alexander Vasiliev:
Classical and Quantum Parallelism in the Quantum Fingerprinting Method. PaCT 2011: 1-12 - 2010
- [c2]Farid M. Ablayev, Alexander Vasiliev:
On Computational Power of Quantum Read-Once Branching Programs. HPC 2010: 1-12 - [e1]Farid M. Ablayev, Bob Coecke, Alexander Vasiliev:
Proceedings CSR 2010 Workshop on High Productivity Computations, HPC 2010, Kazan, Russia, June 21-22, 2010. EPTCS 52, 2010 [contents]
2000 – 2009
- 2009
- [c1]Farid M. Ablayev, Alexander Vasiliev:
Algorithms for Quantum Branching Programs Based on Fingerprinting. DCM 2009: 1-11 - 2008
- [i2]Farid M. Ablayev, Airat Khasianov, Alexander Vasiliev:
On Complexity of Quantum Branching Programs Computing Equality-like Boolean Functions. Electron. Colloquium Comput. Complex. TR08 (2008) - [i1]Farid M. Ablayev, Alexander Vasiliev:
On the Computation of Boolean Functions by Quantum Branching Programs via Fingerprinting. Electron. Colloquium Comput. Complex. TR08 (2008)
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-25 05:56 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:
