Groverov algoritam (Serbian Wikipedia)
Analysis of information sources in references of the Wikipedia article "Groverov algoritam" in Serbian language version.
refsWebsite
Global rank
Serbian rank
18th place
28th place
11th place
23rd place
580th place
551st place
arxiv.org (Global: 69th place; Serbian: 240th place)
- Michel Boyer; Gilles Brassard; Peter Høyer; Alain Tapp (1998), „Tight Bounds on Quantum Searching”, Fortsch. Phys., 46 (4–5): 493—506, Bibcode:1998ForPh..46..493B, S2CID 10032711, arXiv:quant-ph/9605034
, doi:10.1002/(SICI)1521-3978(199806)46:4/5<493::AID-PROP493>3.0.CO;2-P - Andris Ambainis (2004), „Quantum search algorithms”, SIGACT News, 35 (2): 22—35, S2CID 11326499, arXiv:quant-ph/0504012 , doi:10.1145/992287.992296
- Grover, Lov K.; Radhakrishnan, Jaikumar (2004). „Is partial quantum search of a database any easier?”. Bibcode:2004quant.ph..7122G. arXiv:quant-ph/0407122 .
berkeley.edu (Global: 580th place; Serbian: 551st place)
cs.berkeley.edu
- Bennett C.H., Bernstein E., Brassard G., Vazirani U., The strengths and weaknesses of quantum computation. SIAM Journal on Computing . 26 (5): 1510—1523 http://www.cs.berkeley.edu/~vazirani/pubs/bbbv.ps. Недостаје или је празан параметар
|title=(помоћ) (1997). Shows the optimality of Grover's algorithm.
doi.org (Global: 2nd place; Serbian: 4th place)
- Michel Boyer; Gilles Brassard; Peter Høyer; Alain Tapp (1998), „Tight Bounds on Quantum Searching”, Fortsch. Phys., 46 (4–5): 493—506, Bibcode:1998ForPh..46..493B, S2CID 10032711, arXiv:quant-ph/9605034 , doi:10.1002/(SICI)1521-3978(199806)46:4/5<493::AID-PROP493>3.0.CO;2-P
- Andris Ambainis (2004), „Quantum search algorithms”, SIGACT News, 35 (2): 22—35, S2CID 11326499, arXiv:quant-ph/0504012 , doi:10.1145/992287.992296
harvard.edu (Global: 18th place; Serbian: 28th place)
adsabs.harvard.edu
- Michel Boyer; Gilles Brassard; Peter Høyer; Alain Tapp (1998), „Tight Bounds on Quantum Searching”, Fortsch. Phys., 46 (4–5): 493—506, Bibcode:1998ForPh..46..493B, S2CID 10032711, arXiv:quant-ph/9605034 , doi:10.1002/(SICI)1521-3978(199806)46:4/5<493::AID-PROP493>3.0.CO;2-P
- Grover, Lov K.; Radhakrishnan, Jaikumar (2004). „Is partial quantum search of a database any easier?”. Bibcode:2004quant.ph..7122G. arXiv:quant-ph/0407122 .
semanticscholar.org (Global: 11th place; Serbian: 23rd place)
api.semanticscholar.org
- Michel Boyer; Gilles Brassard; Peter Høyer; Alain Tapp (1998), „Tight Bounds on Quantum Searching”, Fortsch. Phys., 46 (4–5): 493—506, Bibcode:1998ForPh..46..493B, S2CID 10032711, arXiv:quant-ph/9605034 , doi:10.1002/(SICI)1521-3978(199806)46:4/5<493::AID-PROP493>3.0.CO;2-P
- Andris Ambainis (2004), „Quantum search algorithms”, SIGACT News, 35 (2): 22—35, S2CID 11326499, arXiv:quant-ph/0504012 , doi:10.1145/992287.992296