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

Dynamic weighted binary search trees

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

DOI10.1007/BF00289093zbMath0396.68042OpenAlexW2049311920MaRDI QIDQ1253546

Karl Unterauer

Publication date: 1979

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

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


zbMATH Keywords

Dynamic Weighted Binary Search Trees


Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)


Related Items (2)

Unnamed Item ⋮ Optimal binary search trees



Cites Work

  • Nearly optimal binary search trees
  • Symmetric binary B-trees: Data structure and maintenance algorithms
  • Optimum binary search trees
  • Binary Search Trees of Bounded Balance
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item


This page was built for publication: Dynamic weighted binary search trees

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