VOLUME 8 2003 NUMBER 4
New Dynamic Balanced Search Trees with Worst-Case Constant Update Time
George Lagogiannis, Christos Makris, Yannis Panagis, Spyros Sioutas, Kostas Tsichlas
Pages 607–632



Download Abstract
 Fulltext is accessible with your personal account
 ShowHide BibTeX
BibTeX: 
@article{JALC-2003-607,
  author  = {George Lagogiannis and Christos Makris and Yannis Panagis and Spyros Sioutas and Kostas Tsichlas},
  title   = {New Dynamic Balanced Search Trees with Worst-Case Constant Update Time},
  journal = {Journal of Automata, Languages and Combinatorics},
  volume  = {8},
  number  = {4},
  pages   = {607--632},
  year    = {2003},
  url     = {https://doi.org/10.25596/jalc-2003-607},
  doi     = {10.25596/jalc-2003-607}
}
If you would like to see an embedded preview, try to select preview as the action for Portable Document Format (PDF) in your brower settings.
Keywords: balanced trees, update operations, data structures, complexity
DOI: 10.25596/jalc-2003-607