The B∗ tree search algorithm: A best-first proof procedure

1979 Artificial Intelligence 188 citations

Keywords

Search treeTree (set theory)Node (physics)AlgorithmMathematicsSet (abstract data type)Upper and lower boundsRoot (linguistics)Search algorithmConjectureComputer scienceCombinatorics

Affiliated Institutions

Related Publications

Channel coding with multilevel/phase signals

A coding technique is described which improves error performance of synchronous data links without sacrificing data rate or requiring more bandwidth. This is achieved by channel...

1982 IEEE Transactions on Information Theory 3729 citations

Publication Info

Year
1979
Type
article
Volume
12
Issue
1
Pages
23-40
Citations
188
Access
Closed

External Links

Social Impact

Social media, news, blog, policy document mentions

Citation Metrics

188
OpenAlex

Cite This

Hans Berliner (1979). The B∗ tree search algorithm: A best-first proof procedure. Artificial Intelligence , 12 (1) , 23-40. https://doi.org/10.1016/0004-3702(79)90003-1

Identifiers

DOI
10.1016/0004-3702(79)90003-1