חיפוש אקספוננציאלי (Hebrew Wikipedia)

Analysis of information sources in references of the Wikipedia article "חיפוש אקספוננציאלי" in Hebrew language version.

refsWebsite

Global rank Hebrew rank

2^nd place

10^th place

5^th place

31^st place

626^th place

239^th place

doi.org

Baeza-Yates, Ricardo; Salinger, Alejandro (2010), "Fast intersection algorithms for sorted sequences", in Elomaa, Tapio; Mannila, Heikki; Orponen, Pekka (eds.), Algorithms and Applications: Essays Dedicated to Esko Ukkonen on the Occasion of His 60th Birthday, Lecture Notes in Computer Science, vol. 6060, Springer, pp. 45–61, doi:10.1007/978-3-642-12476-1_3, ISBN 9783642124754.
Bentley, Jon L.; Yao, Andrew C. (באוגוסט 1976). "An almost optimal algorithm for unbounded searching". Information Processing Letters. 5 (3): 82–87. doi:10.1016/0020-0190(76)90071-5. ISSN 0020-0190. {{cite journal}}: (עזרה)
Andersson, Arne; Thorup, Mikkel (ביוני 2007). "Dynamic ordered sets with exponential search trees". Journal of the ACM. 54 (3): 13. doi:10.1145/1236457.1236460. ISSN 0004-5411. {{cite journal}}: (עזרה)

Bentley, Jon L.; Yao, Andrew C. (באוגוסט 1976). "An almost optimal algorithm for unbounded searching". Information Processing Letters. 5 (3): 82–87. doi:10.1016/0020-0190(76)90071-5. ISSN 0020-0190. {{cite journal}}: (עזרה)
Andersson, Arne; Thorup, Mikkel (ביוני 2007). "Dynamic ordered sets with exponential search trees". Journal of the ACM. 54 (3): 13. doi:10.1145/1236457.1236460. ISSN 0004-5411. {{cite journal}}: (עזרה)