Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 231,409,081 papers from all fields of science
Search
Sign In
Create Free Account
Self-balancing binary search tree
Known as:
Balanced binary tree
, Height-balanced binary search tree
, Rebalance
Expand
In computer science, a self-balancing (or height-balanced) binary search tree is any node-based binary search tree that automatically keeps its…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
AA tree
AVL tree
Amortized analysis
Array data structure
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Improvement of speed in data collection rate in tree based wireless sensor network
R. Gatti
,
S. S. Kumar
,
Shivashankar
,
K. S. Kumar
,
P. Prasad
IEEE International Conference on Recent Trends in…
2016
Corpus ID: 7119516
Convergecast, the process of data collection from set of sensor nodes and forwards to the sink node over a tree based topology is…
Expand
2010
2010
Regional Trade Policy Cooperation and Architecture in East Asia
S. Chia
2010
Corpus ID: 152445681
The global financial and economic crisis has affected East Asia mainly through the trade channel. The region remains heavily…
Expand
2008
2008
An Online Self-Balancing Binary Search Tree for Hierarchical Shape Matching
Nikolaos Tsapanos
,
A. Tefas
,
I. Pitas
International Conference on Computer Vision…
2008
Corpus ID: 43231813
In this paper we propose a self-balanced binary search tree data structure for shape matching. This was originally developed as a…
Expand
Review
2008
Review
2008
Use of supportive context by younger and older adult listeners: Balancing bottom-up and top-down information processing
M. Pichora-Fuller
2008
Corpus ID: 36222356
Older adults often have more difficulty listening in challenging environments than their younger adult counterparts. On the one…
Expand
Highly Cited
2007
Highly Cited
2007
Robust control of underactuated bipeds using sliding modes
Mehdi Nikkhah
,
H. Ashrafiuon
,
F. Fahimi
Robotica (Cambridge. Print)
2007
Corpus ID: 15792083
SUMMARY The purpose of this paper is to present a robust tracking control algorithm for underactuated biped robots capable of…
Expand
Highly Cited
2007
Highly Cited
2007
mu-tree: an ordered index structure for NAND flash memory
Dongwon Kang
,
Dawoon Jung
,
Jeong-Uk Kang
,
Jin-Soo Kim
International Conference on Embedded Software
2007
Corpus ID: 195351459
As NAND flash memory becomes increasingly popular as data storage for embedded systems, many file systems and database management…
Expand
2005
2005
A power efficient routing protocol based on balanced tree in wireless sensor networks
Hyunsook Kim
,
K. Han
First International Conference on Distributed…
2005
Corpus ID: 18681795
A wireless sensor network consisting of a large number of nodes with limited battery power should minimize energy consumption at…
Expand
2000
2000
Mobile agent and CORBA technologies in the broadband intelligent network
F. Chatzipapadopoulos
,
M. Perdikeas
,
I. Venieris
IEEE Communications Magazine
2000
Corpus ID: 62189787
This article presents an IN architecture that is based on distributed object and mobile agent technologies. It deviates from…
Expand
1995
1995
An empirical assessment of priority queues in event-driven molecular dynamics simulation
Mauricio Marín
,
P. Cordero
1995
Corpus ID: 62143263
1995
1995
Computing the area versus delay trade-off curves in technology mapping
K. Chaudhary
,
Massoud Pedram
IEEE Trans. Comput. Aided Des. Integr. Circuits…
1995
Corpus ID: 6849688
We examine the problem of mapping a Boolean network using gates from a finite size cell library. The objective is to minimize the…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE