نتایج جستجو برای: binary search
تعداد نتایج: 404927 فیلتر نتایج به سال:
1996
Seonghun Cho
We develop a new class of weight balanced binary search trees called-balanced binary search trees (-BBSTs).-BBSTs are designed to have reduced internal path length. As a result, they are expected to exhibit good search time characteristics. Individual search, insert, and delete operations in an n node-BBST take O(log n) time for 0 < p 2?1. Experimental results comparing the performance of-BBSTs...
Journal:
:Information and Control
1984
Journal:
:Theoretical Computer Science
2003
Journal:
:Journal of Discrete Algorithms
2003
Journal:
:IEEE Transactions on Aerospace and Electronic Systems
2015
Journal:
:Journal of Inequalities and Applications
2013
Journal:
:Proceedings of the National Academy of Sciences
2010
Journal:
:Optics Letters
2011
Journal:
:Journal of Modeling and Optimization
2021
Journal:
:Theoretical Computer Science
2002
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید