Skip to search formSkip to main contentSkip to account menu

Strictly-Regular Number System and Data Structures

A new number system is introduced, which efficiently supports the operations: digit-increment, digit-decrement, cut, concatenate, and add, and is superior to the regular system for its efficient support to decrements, and to the extended-regular system for being more compact by using three symbols instead of four.
View via Publisher (opens in a new tab)

Relaxed Weak Queues: An Alternative to Run-Relaxed Heaps

A simplification of a run-relaxed heap, called a relaxed weak queue, is presented, which supports all operations as efficiently as the original: find-min, insert, and decrease (also called decrease-key) in O(1) worst-case time, and delete in O("n") worst- case time, n denoting the number of elements stored prior to the operation.

Multipartite priority queues

A sorting algorithm is obtained that is optimally adaptive with respect to the inversion measure of disorder, and that sorts a sequence having n elements and I inversions with at most log (<i>I</i>/<i>n</i>) + <i>O</i) element comparisons.
View on ACM (opens in a new tab)

Two-tier relaxed heaps

A data structure is introduced which provides efficient heap operations with respect to the number of element comparisons performed and supports melding of two heaps of size m and n at the worst-case cost of O(min {lg m, lg n}).
View on Springer (opens in a new tab)

Two Skew-Binary Numeral Systems and One Application

The basic message is that some data-structural problems are better formulated at the level of a numeral system, and the relationship between number representations and data representations, as well as operations on them, can be utilized for an elegant description and a clean analysis of algorithms.
View on Springer (opens in a new tab)

Two new methods for constructing double-ended priority queues from priority queues

A meldable double-ended priority queue is obtained which guarantees the worst-case cost of O(1) for find-min, find-max, insert, extract; the best- case cost of Lg n + O(lg lg n) element comparisons for delete; and the Worst-Case cost ofO(min {lg m, lgN}) for meld.
View on Springer (opens in a new tab)

The Magic of a Number System

A new number system that supports increments with a constant number of digit changes is introduced, and the weight of the ith digit is 2i-1, and hence a priority queue as a forest of heap-ordered complete binary trees is implemented.
View via Publisher (opens in a new tab)

On the Power of Structural Violations in Priority Queues

By mimicking a priority queue that allows heap-order violations with one that only allows structural violations, the bound on the number of element comparisons per deletion is improved to lg n + O(lg lG n).
View Paper (opens in a new tab)

A Framework for Speeding Up Priority-Queue Operations

A priority queue is given which guarantees the worst-case cost of O(1) per minimum finding and insertion, and theworst- case cost of Logn with at most logn+O( 1) element comparisons per minimum deletion and deletion, improving the bound of 2logn + O(2) on the number of element comparisons known for binomial queues.

Experimental evaluation of Navigation piles

A pointer-based navigation pile is introduced which is inherently dynamic in its nature and can be made to support deletions as well and is given a new and simple way of dynamizing a static navigation pile.
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)