Treap (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Treap" in English language version.

refsWebsite

Global rank English rank

2^nd place

2^nd place

3semanticscholar.org

11^th place

8^th place

207^th place

136^th place

1washington.edu

1,067^th place

749^th place

low place

low place

69^th place

59^th place

18^th place

17^th place

383^rd place

320^th place

1cp-algorithms.com

low place

low place

arxiv.org

Liljenzin, Olle (2013). "Confluently Persistent Sets and Maps". arXiv:1301.3388. Bibcode:2013arXiv1301.3388L. {{cite journal}}: Cite journal requires |journal= (help)

cp-algorithms.com

"Treap - Competitive Programming Algorithms". cp-algorithms.com. Retrieved 2021-11-21.

doi.org

Aragon, Cecilia R.; Seidel, Raimund (1989), "Randomized Search Trees" (PDF), 30th Annual Symposium on Foundations of Computer Science, Washington, D.C.: IEEE Computer Society Press, pp. 540–545, doi:10.1109/SFCS.1989.63531, ISBN 0-8186-1982-1
Seidel, Raimund; Aragon, Cecilia R. (1996), "Randomized Search Trees", Algorithmica, 16 (4/5): 464–497, doi:10.1007/s004539900061 (inactive 2024-04-18){{citation}}: CS1 maint: DOI inactive as of April 2024 (link)
Naor, M.; Nissim, K. (April 2000), "Certificate revocation and certificate update" (PDF), IEEE Journal on Selected Areas in Communications, 18 (4): 561–570, doi:10.1109/49.839932, S2CID 13833836^{[permanent dead link]}.
Blelloch, Guy E.; Reid-Miller, Margaret (1998), "Fast set operations using treaps", Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures - SPAA '98, New York, NY, USA: ACM, pp. 16–26, doi:10.1145/277651.277660, ISBN 0-89791-989-0, S2CID 7342709.
Martínez, Conrado; Roura, Salvador (1997), "Randomized binary search trees", Journal of the ACM, 45 (2): 288–323, doi:10.1145/274787.274812, S2CID 714621

github.com

Confluent Sets and Maps on GitHub

harvard.edu

ui.adsabs.harvard.edu

Liljenzin, Olle (2013). "Confluently Persistent Sets and Maps". arXiv:1301.3388. Bibcode:2013arXiv1301.3388L. {{cite journal}}: Cite journal requires |journal= (help)

kfupm.edu.sa

eprints.kfupm.edu.sa

Naor, M.; Nissim, K. (April 2000), "Certificate revocation and certificate update" (PDF), IEEE Journal on Selected Areas in Communications, 18 (4): 561–570, doi:10.1109/49.839932, S2CID 13833836^{[permanent dead link]}.

psu.edu

citeseer.ist.psu.edu

Seidel, Raimund; Aragon, Cecilia R. (1996), "Randomized Search Trees", Algorithmica, 16 (4/5): 464–497, doi:10.1007/s004539900061 (inactive 2024-04-18){{citation}}: CS1 maint: DOI inactive as of April 2024 (link)
Martínez, Conrado; Roura, Salvador (1997), "Randomized binary search trees", Journal of the ACM, 45 (2): 288–323, doi:10.1145/274787.274812, S2CID 714621

semanticscholar.org

api.semanticscholar.org

Naor, M.; Nissim, K. (April 2000), "Certificate revocation and certificate update" (PDF), IEEE Journal on Selected Areas in Communications, 18 (4): 561–570, doi:10.1109/49.839932, S2CID 13833836^{[permanent dead link]}.
Blelloch, Guy E.; Reid-Miller, Margaret (1998), "Fast set operations using treaps", Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures - SPAA '98, New York, NY, USA: ACM, pp. 16–26, doi:10.1145/277651.277660, ISBN 0-89791-989-0, S2CID 7342709.
Martínez, Conrado; Roura, Salvador (1997), "Randomized binary search trees", Journal of the ACM, 45 (2): 288–323, doi:10.1145/274787.274812, S2CID 714621

washington.edu

faculty.washington.edu

Aragon, Cecilia R.; Seidel, Raimund (1989), "Randomized Search Trees" (PDF), 30th Annual Symposium on Foundations of Computer Science, Washington, D.C.: IEEE Computer Society Press, pp. 540–545, doi:10.1109/SFCS.1989.63531, ISBN 0-8186-1982-1