Optimal binary search tree (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Optimal binary search tree" in English language version.

refsWebsite

Global rank English rank

8doi.org

2^nd place

4semanticscholar.org

11^th place

8^th place

2worldcat.org

5^th place

1sciencedirect.com

149^th place

178^th place

1ieee.org

652^nd place

515^th place

1mpg.de

1,624^th place

1,592^nd place

1erikdemaine.org

low place

1psu.edu

207^th place

136^th place

1unisciel.fr

low place

1arxiv.org

69^th place

59^th place

arxiv.org (Global: 69^th place; English: 59^th place)

Iacono, John (2013), "In pursuit of the dynamic optimality conjecture", arXiv:1306.0207 [cs.DS]

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

doi.org

Knuth, Donald E. (1971), "Optimum binary search trees", Acta Informatica, 1 (1): 14–25, doi:10.1007/BF00264289, S2CID 62777263
Nagaraj, S. V. (1997-11-30). "Optimal binary search trees". Theoretical Computer Science. 188 (1): 1–44. doi:10.1016/S0304-3975(96)00320-9. ISSN 0304-3975. S2CID 33484183.
Gilbert, E. N.; Moore, E. F. (July 1959). "Variable-Length Binary Encodings". Bell System Technical Journal. 38 (4): 933–967. doi:10.1002/j.1538-7305.1959.tb01583.x.
Hu, T. C.; Tucker, A. C. (December 1971). "Optimal Computer Search Trees and Variable-Length Alphabetical Codes". SIAM Journal on Applied Mathematics. 21 (4): 514–532. doi:10.1137/0121057. ISSN 0036-1399.
Mehlhorn, Kurt (1975), "Nearly optimal binary search trees", Acta Informatica, 5 (4): 287–295, doi:10.1007/BF00264563, S2CID 17188103
Demaine, Erik D.; Harmon, Dion; Iacono, John; Patrascu, Mihai (2004), "Dynamic optimality—almost" (PDF), Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science, pp. 484–490, CiteSeerX 10.1.1.99.4964, doi:10.1109/FOCS.2004.23, ISBN 978-0-7695-2228-9
Sleator, Daniel; Tarjan, Robert (1985), "Self-adjusting binary search trees", Journal of the ACM, 32 (3): 652–686, doi:10.1145/3828.3835, S2CID 1165848

dx.doi.org

Hu, T. C.; Tucker, A. C. (December 1971). "Optimal Computer Search Trees and Variable-Length Alphabetical Codes". SIAM Journal on Applied Mathematics. 21 (4): 514–532. doi:10.1137/0121057. ISSN 0036-1399.

erikdemaine.org (Global: low place; English: low place)

Demaine, Erik D.; Harmon, Dion; Iacono, John; Patrascu, Mihai (2004), "Dynamic optimality—almost" (PDF), Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science, pp. 484–490, CiteSeerX 10.1.1.99.4964, doi:10.1109/FOCS.2004.23, ISBN 978-0-7695-2228-9

ieee.org (Global: 652^nd place; English: 515^th place)

ieeexplore.ieee.org

Gilbert, E. N.; Moore, E. F. (July 1959). "Variable-Length Binary Encodings". Bell System Technical Journal. 38 (4): 933–967. doi:10.1002/j.1538-7305.1959.tb01583.x.

mpg.de (Global: 1,624^th place; English: 1,592^nd place)

edoc.mpg.de

Mehlhorn, Kurt (1975), "Nearly optimal binary search trees", Acta Informatica, 5 (4): 287–295, doi:10.1007/BF00264563, S2CID 17188103

psu.edu (Global: 207^th place; English: 136^th place)

citeseerx.ist.psu.edu

Demaine, Erik D.; Harmon, Dion; Iacono, John; Patrascu, Mihai (2004), "Dynamic optimality—almost" (PDF), Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science, pp. 484–490, CiteSeerX 10.1.1.99.4964, doi:10.1109/FOCS.2004.23, ISBN 978-0-7695-2228-9

sciencedirect.com (Global: 149^th place; English: 178^th place)

Nagaraj, S. V. (1997-11-30). "Optimal binary search trees". Theoretical Computer Science. 188 (1): 1–44. doi:10.1016/S0304-3975(96)00320-9. ISSN 0304-3975. S2CID 33484183.

semanticscholar.org (Global: 11^th place; English: 8^th place)

api.semanticscholar.org

Knuth, Donald E. (1971), "Optimum binary search trees", Acta Informatica, 1 (1): 14–25, doi:10.1007/BF00264289, S2CID 62777263
Nagaraj, S. V. (1997-11-30). "Optimal binary search trees". Theoretical Computer Science. 188 (1): 1–44. doi:10.1016/S0304-3975(96)00320-9. ISSN 0304-3975. S2CID 33484183.
Mehlhorn, Kurt (1975), "Nearly optimal binary search trees", Acta Informatica, 5 (4): 287–295, doi:10.1007/BF00264563, S2CID 17188103
Sleator, Daniel; Tarjan, Robert (1985), "Self-adjusting binary search trees", Journal of the ACM, 32 (3): 652–686, doi:10.1145/3828.3835, S2CID 1165848

unisciel.fr (Global: low place; English: low place)

ressources.unisciel.fr

Cormen, Thomas H.; Leiserson, Charles E.; Rivest, Ronald; Stein, Clifford (2009). Introduction to algorithms (PDF) (Third ed.). The MIT Press. p. 503. ISBN 978-0-262-03384-8. Retrieved 31 October 2017.

worldcat.org (Global: 5^th place; English: 5^th place)

search.worldcat.org

Nagaraj, S. V. (1997-11-30). "Optimal binary search trees". Theoretical Computer Science. 188 (1): 1–44. doi:10.1016/S0304-3975(96)00320-9. ISSN 0304-3975. S2CID 33484183.
Hu, T. C.; Tucker, A. C. (December 1971). "Optimal Computer Search Trees and Variable-Length Alphabetical Codes". SIAM Journal on Applied Mathematics. 21 (4): 514–532. doi:10.1137/0121057. ISSN 0036-1399.