scientific article; zbMATH DE number 2105039

zbMATH Open1088.68553MaRDI QIDQ4820871FDOQ4820871

Authors: George Lagogiannis, Christos Makris, Yannis Panagis, Spyros Sioutas, Kostas Tsichlas 

Publication date: 1 October 2004

Title of this publication is not available (Why is that?)

Recommendations

• A SIMPLE BALANCED SEARCH TREE WITH O(1) WORST-CASE UPDATE TIME
• Deletion without rebalancing in binary search trees
• Optimal finger search trees in the pointer machine
• scientific article; zbMATH DE number 88943
• Improved bounds for finger search on a RAM

zbMATH Keywords

complexitydata structuresbalanced treesupdate operations

Mathematics Subject Classification ID

Data structures (68P05)

Cited In (10)

• Fibonacci BSTs: a new balancing method for binary search trees
• Fast updating of well-balanced trees
• Fully dynamic distributed search trees can be balanced in \(O(\lg^{2} N)\) time.
• Title not available (Why is that?)
• Title not available (Why is that?)
• Deletion without rebalancing in multiway search trees
• Red-black trees with constant update time
• Optimal finger search trees in the pointer machine
• A balanced search tree O(1) worst-case update time
• AVL-trees for localized search

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4820871)