Раширено дрво (Serbian Wikipedia)

Analysis of information sources in references of the Wikipedia article "Раширено дрво" in Serbian language version.

refsWebsite

Global rank Serbian rank

2^nd place

4^th place

2,869^th place

8,841^st place

1,564^th place

2,673^rd place

18^th place

28^th place

69^th place

240^th place

arxiv.org

Pettie, Seth (2008), „Splay Trees, Davenport-Schinzel Sequences, and the Deque Conjecture”, Proceedings of the 19th ACM-SIAM Symposium on Discrete Algorithms, 0707: 1115—1124, Bibcode:2007arXiv0707.2160P, arXiv:0707.2160

Sleator, Daniel D.; Tarjan, Robert E. (1985), „Self-Adjusting Binary Search Trees” (PDF), Journal of the ACM (Association for Computing Machinery), 32 (3): 652—686, doi:10.1145/3828.3835

Sleator, Daniel D.; Tarjan, Robert E. (1985), „Self-Adjusting Binary Search Trees” (PDF), Journal of the ACM (Association for Computing Machinery), 32 (3): 652—686, doi:10.1145/3828.3835
Cole, Richard (2000), „On the Dynamic Finger Conjecture for Splay Trees. Part II: The Proof”, SIAM Journal on Computing, 30: 44—85, doi:10.1137/S009753979732699X
Tarjan, Robert E. (1985), „Sequential access in splay trees takes linear time”, Combinatorica, 5 (4): 367—378, doi:10.1007/BF02579253
Sundar, Rajamani (1992), „On the Deque conjecture for the splay algorithm”, Combinatorica, 12 (1): 95—124, doi:10.1007/BF01191208

Pettie, Seth (2008), „Splay Trees, Davenport-Schinzel Sequences, and the Deque Conjecture”, Proceedings of the 19th ACM-SIAM Symposium on Discrete Algorithms, 0707: 1115—1124, Bibcode:2007arXiv0707.2160P, arXiv:0707.2160