Data structures and network algorithms
Data structures and network algorithms
The pairing heap: a new form of self-adjusting heap
Algorithmica
SIAM Journal on Computing
Relaxed heaps: an alternative to Fibonacci heaps with applications to parallel computation
Communications of the ACM
An implicit binomial queue with constant insertion time
No. 318 on SWAT 88: 1st Scandinavian workshop on algorithm theory
An optimal algorithm for deleting the roof of a heap
Information Processing Letters
A survey of adaptive sorting algorithms
ACM Computing Surveys (CSUR)
Journal of Algorithms
A unifying look at data structures
Communications of the ACM
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
Introduction to Algorithms
Priority Queues, Pairing, and Adaptive Sorting
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Adaptive Sorting and the Information Theoretic Lower Bound
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Scaling and related techniques for geometry problems
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
A programming and problem-solving seminar
A programming and problem-solving seminar
Navigation piles with applications to sorting, priority queues, and priority deques
Nordic Journal of Computing
ACM Transactions on Algorithms (TALG)
Adaptive sorting: an information theoretic perspective
Acta Informatica
FUN'10 Proceedings of the 5th international conference on Fun with algorithms
Strictly-Regular number system and data structures
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
Two constant-factor-optimal realizations of adaptive heapsort
IWOCA'11 Proceedings of the 22nd international conference on Combinatorial Algorithms
Fat heaps without regular counters
WALCOM'12 Proceedings of the 6th international conference on Algorithms and computation
The weak-heap data structure: Variants and applications
Journal of Discrete Algorithms
The weak-heap family of priority queues in theory and praxis
CATS '12 Proceedings of the Eighteenth Computing: The Australasian Theory Symposium - Volume 128
Journal of Discrete Algorithms
| Hi-index | 0.00 |
We introduce a framework for reducing the number of element comparisons performed in priority-queue operations. In particular, we give a priority queue which guarantees the worst-case cost of O(1) per minimum finding and insertion, and the worst-case cost of O(log n) with at most log n + O(1) element comparisons per deletion, improving the bound of 2 log n + O(1) known for binomial queues. Here, n denotes the number of elements stored in the data structure prior to the operation in question, and log n equals log2(max {2, n}). As an immediate application of the priority queue developed, we obtain a sorting algorithm 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 n log (I/n) + O(n) element comparisons.