Sign in
Author

Conference

Journal

Organization

Year

DOI
Look for results that meet for the following criteria:
since
equal to
before
between
and
Search in all fields of study
Limit my searches in the following fields of study
Agriculture Science
Arts & Humanities
Biology
Chemistry
Computer Science
Economics & Business
Engineering
Environmental Sciences
Geosciences
Material Science
Mathematics
Medicine
Physics
Social Science
Multidisciplinary
Keywords
(2)
Binary Search Tree
Cost Effectiveness
Subscribe
Academic
Publications
Weightbalanced trees
Weightbalanced trees,10.1145/1499949.1500040,Jeanloup Baer
Edit
Weightbalanced trees
(
Citations: 11
)
BibTex

RIS

RefWorks
Download
Jeanloup Baer
It is now recognized that
binary search
trees are structures which can be used efficiently for the organization of files and directories. The ease of insertion and deletion of nodes makes trees very appealing for directories which are often modified. By comparison with a sequential table organization, some additional memory is required for the links between nodes. From a costeffective viewpoint, this is generally more than compensated for by the savings in searching (for a linear table) and inserting (for an ordered table).
Conference:
AFIPS Spring Conference  AFIPS
, pp. 467472, 1975
DOI:
10.1145/1499949.1500040
Cumulative
Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
(
portal.acm.org
)
(
portal.acm.org
)
(
www.informatik.unitrier.de
)
(
doi.acm.org
)
More »
Citation Context
(4)
...<{[SECTION]}>smaller internal paths than AVL trees. Baer [
2
] derives a...
Gaston H. Gonnet
.
Balancing binary trees by internal path reduction
...I1 [initialize] /<HEADER; L~1; P [1]~P [
2
] <N (L is the level counter and P contains the references to the left and right free pointers);...
...Baer, in [
2
], proposes a balancing scheme for weighted binary trees involving only simple and double rotations...
R. Sprugnoli
.
Randomly balanced binary trees
...[
3
]) to restore this property when necessary after an insertion...
...[
3
, 26]). 6. Algorithm R, a "movetoroot" algorithm, which simply moves a node to the root whenever it is referenced (cf...
William E. Wright
.
Binary search trees in secondary memory
...Algorithms AVL and BB rebalance the tree when necessary by performing a single or double rotation [
2
]...
William E. Wright
.
Dynamic Binary Search Trees
References
(11)
Organization and Maintenance of Large Ordered Indexes
(
Citations: 406
)
Rudolf Bayer
,
Edward M. Mccreight
Conference:
International Conference on Management of Data  SIGMOD
, pp. 107141, 1970
Nearly Optimal Binary Search Trees
(
Citations: 8
)
John L. Bruno
,
Edward G. Coffman Jr.
Conference:
World Computer Congress  IFIP
, pp. 99103, 1971
A generalization of AVL trees
(
Citations: 22
)
Caxton C. Foster
Journal:
Communications of The ACM  CACM
, vol. 16, no. 8, pp. 513517, 1973
On Binary Search Trees
(
Citations: 10
)
Jürg Nievergelt
,
C. K. Wong
Conference:
World Computer Congress  IFIP
, pp. 9198, 1971
Binary search trees of bounded balance
(
Citations: 110
)
Jürg Nievergelt
,
Edward M. Reingold
Conference:
ACM Symposium on Theory of Computing  STOC
, pp. 137142, 1972
Sort by:
Citations
(11)
Selfassessment procedure XIII: a selfassessment procedure dealing with binary search trees and Btrees
(
Citations: 1
)
Gopal K. Gupta
Journal:
Communications of The ACM  CACM
, vol. 27, no. 5, pp. 435443, 1984
Balancing binary trees by internal path reduction
(
Citations: 15
)
Gaston H. Gonnet
Journal:
Communications of The ACM  CACM
, vol. 26, no. 12, pp. 10741081, 1983
An Index Organization for Applications with Highly Skewed Access Patterns
Christer Hulten
Conference:
International Conference on Software Engineering  ICSE
, pp. 7178, 1981
Randomly balanced binary trees
(
Citations: 3
)
R. Sprugnoli
Journal:
Calcolo
, vol. 17, no. 2, pp. 99117, 1980
An empirical evaluation of algorithms for dynamically maintaining binary search trees
(
Citations: 3
)
William E. Wright
Published in 1980.