Skip to main navigation
Skip to search
Skip to main content
Bar-Ilan University Home
Help & FAQ
Home
Researchers
Organisations
Research output
Prizes
Student theses
Activities
Projects
Press/Media
Datasets
Equipment
Search by expertise, name or affiliation
Bounding the depth of search trees
A. S. Fraenkel
Weizmann Institute of Science
Research output
:
Contribution to journal
›
Article
›
peer-review
13
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Bounding the depth of search trees'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Optimal Codes
100%
Search Tree
100%
Search Depth
100%
Codeword
50%
Average Path Length
50%
Huffman Algorithm
50%
Minimum-redundancy Codes
50%
Ordered Sequences
50%
Mathematics
Optimal Code
100%
Upper Bound
50%
Complexity Space
50%
Huffman
50%
Path Length
50%