Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

Optimal \(\alpha -\beta\) trees with capacity constraint

From MaRDI portal
Publication:1247173
Jump to:navigation, search

DOI10.1007/BF00264321zbMath0379.68032OpenAlexW2032661515MaRDI QIDQ1247173

K. Appert

Publication date: 1978

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00264321



Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Information storage and retrieval of data (68P20) Algorithms in computer science (68W99)


Related Items (1)

Operations research applications of dichotomous search




Cites Work

  • Organization and maintenance of large ordered indexes
  • Bounds for optimalα-β binary trees
  • Unnamed Item




This page was built for publication: Optimal \(\alpha -\beta\) trees with capacity constraint

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1247173&oldid=13332701"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
This page was last edited on 31 January 2024, at 08:31.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki