Optimum multiway search trees (Q1138383)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Optimum multiway search trees	scientific article

Statements

scholarly article

0 references

Optimum multiway search trees (English)

0 references

0 references

Vijay K. Vaishnavi

0 references

Hans-Peter Kriegel

0 references

Acta Informatica

0 references

publication date

1980

0 references

zbMATH Keywords

optimum multiway search trees

0 references

construction algorithms

0 references

MaRDI profile type

MaRDI publication profile

0 references

Self-Organizing Binary Search Trees

0 references

Symmetric binary B-trees: Data structure and maintenance algorithms

0 references

Organization and maintenance of large ordered indexes

0 references

0 references

A New Algorithm for Minimum Cost Binary Trees

0 references

Optimal Binary Search Trees with Restricted Maximal Depth

0 references

The construction of optimal multiway search trees and the monotonicity principle

0 references

Optimal Computer Search Trees and Variable-Length Alphabetical Codes

0 references

Optimal Alphabetic Trees

0 references

Optimum binary search trees

0 references

0 references

Nearly optimal binary search trees

0 references

A Best Possible Bound for The Weighted Path Length of Binary Search Trees

0 references

Dynamic Binary Search

0 references

Optimal 2,3-Trees

0 references

1-2 Brother Trees or AVL Trees Revisited

0 references

Minimal-Comparison $2,3$-Trees

0 references

Optimal alphabetic search trees with restricted maximal height

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/BF00288540

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1138383

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1138383&oldid=34638746"