Пожалуйста, войдите в систему, чтобы принять участие в дискуссии (добавить собственные рецензию, или комментарий)
Цитировать эту публикацию
%0 Journal Article
%1 journals/access/SantosMCO23
%A Santos, Sara
%A Monteiro, Francisco A.
%A Coutinho, Bruno C.
%A Omar, Yasser
%D 2023
%J IEEE Access
%K dblp
%P 7180-7194
%T Shortest Path Finding in Quantum Networks With Quasi-Linear Complexity.
%U http://dblp.uni-trier.de/db/journals/access/access11.html#SantosMCO23
%V 11
@article{journals/access/SantosMCO23,
added-at = {2024-05-07T00:00:00.000+0200},
author = {Santos, Sara and Monteiro, Francisco A. and Coutinho, Bruno C. and Omar, Yasser},
biburl = {https://www.bibsonomy.org/bibtex/24e7b999e571b226192a5ac41b778cdda/dblp},
ee = {https://doi.org/10.1109/ACCESS.2023.3237997},
interhash = {fd00fafcfde48b4f2610646192e7e42c},
intrahash = {4e7b999e571b226192a5ac41b778cdda},
journal = {IEEE Access},
keywords = {dblp},
pages = {7180-7194},
timestamp = {2024-05-13T07:12:41.000+0200},
title = {Shortest Path Finding in Quantum Networks With Quasi-Linear Complexity.},
url = {http://dblp.uni-trier.de/db/journals/access/access11.html#SantosMCO23},
volume = 11,
year = 2023
}