Persistent lists with catenation via recursive slow-down
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Purely functional representations of catenable sorted lists
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Purely functional data structures
Purely functional data structures
Worst-case efficient priority queues
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
A data structure for manipulating priority queues
Communications of the ACM
Meldable heaps and boolean union-find
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
WADS '95 Proceedings of the 4th International Workshop on Algorithms and Data Structures
A new representation for linear lists
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
A programming and problem-solving seminar
A programming and problem-solving seminar
Compilers: Principles, Techniques, and Tools (2nd Edition)
Compilers: Principles, Techniques, and Tools (2nd Edition)
Acta Informatica
ACM Transactions on Algorithms (TALG)
Fat heaps without regular counters
WALCOM'12 Proceedings of the 6th international conference on Algorithms and computation
| Hi-index | 0.00 |
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.