Back in 1964 Williams introduced the binary heap as a basic priority queue data structure
supporting the operations Insert and ExtractMin in logarithmic time. Since then numerous …

A priority queue—a data structure supporting, inter alia, the operations minimum (top), insert
(push), and extract-min (pop)—is said to operate in-place if it uses O (1) extra space in …

A weak heap is a priority queue that supports the operations construct, minimum, insert, and
extract-min. To store n elements, it uses an array of n elements and an array of n bits. In this …

© University of Pretoria Page 1 © University of Pretoria Page 2 Topic Maps for Specifying
Algorithm Taxonomies: A Case Study using Transitive Closure Algorithms Vreda Pieterse …

Sorting objects based on preference is integral to experimental research and applications
across various disciplines, including psychology, marketing, and education. Under the …

We obtain an essentially optimal tradeoff between the amortized cost of the three basic
priority queue operations insert, delete and find-min in the comparison model. More …

An in-place priority queue is a data structure that is stored in an array, uses constant extra
space in addition to the array elements, and supports the operations top top (find find-min …

Let $ n $ denote the number of elements currently in a data structure. An in-place heap is
stored in the first $ n $ locations of an array, uses $ O (1) $ extra space, and supports the …

Статья посвящена одной из разновидностей пирамидальных структур данных,
используемых при решении различных задач, слабой пирамиде. Рассмотрены …

We consider space-bounded computations on a random-access machine (RAM) where the
input is given on a read-only random-access medium, the output is to be produced to a write …