Strictly-regular number system and data structures
Authors:Amr Elmasry, Claus Jensen, and Jyrki Katajainen
Published in:Proceedings of the 12th Scandinavian Symposium and Workshops on Algorithm Theory, Lecture Notes in Computer Science 6139, Springer-Verlag (2010), 26-37
Full text:<pdf.gif>PDF (296 kB)  
Copyright:© Springer-Verlag
Abstract:We introduce a new number system that we call the strictly-regular system, which efficiently supports the operations: digit-increment, digit-decrement, cut, concatenate, and add. Compared to other number systems, the strictly-regular system has distinguishable properties. It is superior to the regular system for its efficient support to decrements, and superior to the extended-regular system for being more compact by using three symbols instead of four. To demonstrate the applicability of the new number system, we modify Brodal’s meldable priority queues making deletion require at most 2 lg n + O(1) element comparisons (improving the bound from 7 lg n + O(1)) while maintaining the efficiency and the asymptotic time bounds for all operations.
Related:<html.gif>HTML (Slides)  <html.gif>HTML (Slides)  
  author = {Amr Elmasry and Claus Jensen and Jyrki Katajainen},
  title = {Strictly-regular number system and data structures},
  booktitle = {Proceedings of the 12th Scandinavian Symposium and Workshops on
    Algorithm Theory},
  series = {Lecture Notes in Computer Science},
  volume = {6139},
  publisher = {Springer-Verlag},
  year = {2010},
  pages = {26--37},
This page was generated by Jyrki Katajainen <> on 10.10.2014.