Treap (English Wikipedia)

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

Last modified: 21:58:16, 10 August 2026 (UTC)

Ref.Un. Ref.Website

Global rank English rank

2^nd place

15^th place

8^th place

1,171^st place

736^th place

182^nd place

172^nd place

doi.org (Global: 2^nd place; English: 2^nd place)

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/BF01940876
Naor, M.; Nissim, K. (April 2000), "Certificate revocation and certificate update", IEEE Journal on Selected Areas in Communications, 18 (4): 561–570, doi:10.1109/49.839932, S2CID 13833836
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

Naor, M.; Nissim, K. (April 2000), "Certificate revocation and certificate update", IEEE Journal on Selected Areas in Communications, 18 (4): 561–570, doi:10.1109/49.839932, S2CID 13833836
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

Seidel, Raimund; Aragon, Cecilia R. (1996), "Randomized Search Trees", Algorithmica, 16 (4/5): 464–497, doi:10.1007/BF01940876