The optimal binary search tree for Andersson's search algorithm
Article Properties
-
LanguageEnglish
-
DOI (url)
-
Publication Date1993/05/01
-
Journal
-
Indian UGC (journal)
-
Refrences6
-
David Spuler
Journal Categories
Science
Mathematics
Instruments and machines
Electronic computers
Computer science
Science
Science (General)
Cybernetics
Information theory
Technology
Electrical engineering
Electronics
Nuclear engineering
Telecommunication
Technology
Technology (General)
Industrial engineering
Management engineering
Information technology
You May Also Like
- A New Approach to Abstract Syntax with Variable Binding
- Soundness of workflow nets: classification, decidability, and analysis
- Automatic Verification of a Behavioural Subset of UML Statechart Diagrams Using the SPIN Model-checker
- Uppaal in a nutshell
- Coloured Petri Nets and CPN Tools for modelling and validation of concurrent systems
Refrences
| Title | Journal | Journal Categories | Citations | Publication Date |
|---|---|---|---|---|
A note on searching in a binary search tree | Software: Practice and Experience |
| 6 | 1991 |
| Optimal Computer Search Trees and Variable-Length Alphabetical Codes | SIAM Journal on Applied Mathematics |
| 116 | 1971 |
| 10.1007/BF00264289 | 1971 | |||
| The optimal binary search tree for Andersson's search algorithm | 1992 | |||
| The best algorithm for searching a binary search tree | 1992 |