Dej-Stout-Varen algoritam (Serbian Wikipedia)

Analysis of information sources in references of the Wikipedia article "Dej-Stout-Varen algoritam" in Serbian language version.

refsWebsite

Global rank Serbian rank

2^nd place

4^th place

459^th place

471^st place

14^th place

22^nd place

low place

low place

6^th place

5^th place

archive.org

Drozdek, Adam (1996). Data Structures and Algorithms in C++. PWS Publishing Co. стр. 173–175. ISBN 0-534-94974-6.

archive.today

Rolfe, Timothy J. (2002). „One-Time Binary Search Tree Balancing: The Day/Stout/Warren (DSW) Algorithm”. SIGCSE Bulletin. ACM SIGCSE. 34 (4): 85—88. doi:10.1145/820127.820173. Архивирано из оригинала 13. 12. 2012. г. Приступљено 06. 02. 2017.

doi.org

Stout, Quentin F.; Warren, Bette L. (1986). „Tree rebalancing in optimal space and time” (PDF). CACM. 29 (9): 902—908. doi:10.1145/6592.6599.
Day, A. Colin (1976). „Balancing a Binary Tree”. Comput. J. 19 (4): 360—361. doi:10.1093/comjnl/19.4.360 .
Rolfe, Timothy J. (2002). „One-Time Binary Search Tree Balancing: The Day/Stout/Warren (DSW) Algorithm”. SIGCSE Bulletin. ACM SIGCSE. 34 (4): 85—88. doi:10.1145/820127.820173. Архивирано из оригинала 13. 12. 2012. г. Приступљено 06. 02. 2017.

ewu.edu

penguin.ewu.edu

Rolfe, Timothy J. (2002). „One-Time Binary Search Tree Balancing: The Day/Stout/Warren (DSW) Algorithm”. SIGCSE Bulletin. ACM SIGCSE. 34 (4): 85—88. doi:10.1145/820127.820173. Архивирано из оригинала 13. 12. 2012. г. Приступљено 06. 02. 2017.

umich.edu

eecs.umich.edu

Stout, Quentin F.; Warren, Bette L. (1986). „Tree rebalancing in optimal space and time” (PDF). CACM. 29 (9): 902—908. doi:10.1145/6592.6599.