Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

scientific article; zbMATH DE number 5046289

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

zbMATH Open1107.68127MaRDI QIDQ5482923

Timo Lilja

Publication date: 15 August 2006



Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.


zbMATH Keywords

amortized analysis\(B\)-trees


Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40)



Related Items (3)

Cost allocation in asymmetric trees โ‹ฎ Splay trees: a reweighing lemma and a proof of competitiveness vs. dynamic balanced trees โ‹ฎ A balanced search tree O(1) worst-case update time


Recommendations

  • Unnamed Item ๐Ÿ‘ ๐Ÿ‘Ž
  • Unnamed Item ๐Ÿ‘ ๐Ÿ‘Ž
  • Unnamed Item ๐Ÿ‘ ๐Ÿ‘Ž
  • On a recursion connected with tree balancing algorithms ๐Ÿ‘ ๐Ÿ‘Ž
  • Balance in AVL trees and space cost of brother trees ๐Ÿ‘ ๐Ÿ‘Ž
  • A linear time algorithm for balance vertices on trees ๐Ÿ‘ ๐Ÿ‘Ž
  • Expected Costs in Some Classes of Binary Search Trees ๐Ÿ‘ ๐Ÿ‘Ž
  • A TOP-DOWN UPDATING ALGORITHM FOR WEIGHT-BALANCED TREES ๐Ÿ‘ ๐Ÿ‘Ž
  • On Optimal Balance in B-Trees: What Does It Cost to Stay in Perfect Shape? ๐Ÿ‘ ๐Ÿ‘Ž





This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5482923&oldid=30033671"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 7 March 2024, at 04:00.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki