Skip to search formSkip to main contentSkip to account menu

Soft heap

In computer science, a soft heap is a variant on the simple heap data structure that has constant amortized time for 5 types of operations. This is… 
Wikipedia (opens in a new tab)

Related topics

Related topics

13 relations
Amortized analysisBinomial heapComputer scienceData structure

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2020
2020
Soft Sequence Heaps
Chazelle [JACM00] introduced the soft heap as a building block for efficient minimum spanning tree algorithms, and recently… 
2020
2020
Selection on $X_1 + X_1 + \cdots X_m$ via Cartesian product tree
Selection on the Cartesian product is a classic problem in computer science. Recently, an optimal algorithm for selection on $X+Y… 
2013
2013
Soft Heaps Simplified
In 1998, Chazelle [J. ACM, 47 (2000), pp. 1012--1027] introduced a new kind of meldable heap (priority queue) called the soft… 
2012
2012
External Memory Soft Heap, and Hard Heap, a Meldable Priority Queue
An external memory version of soft heap that we call “External Memory Soft Heap” (EMSH) is presented. It supports Insert, Findmin… 
2010
2010
Efficient Algorithms and Data Structures for Massive Data Sets
For many algorithmic problems, traditional algorithms that optimise on the number of instructions executed prove expensive on I… 
2009
2009
A simpler implementation and analysis of Chazelle's soft heaps
Chazelle (JACM 47(6), 2000) devised an approximate meldable priority queue data structure, called Soft Heaps, and used it to… 
1998
1998
Car-Pooling as a Data Structuring Device: The Soft Heap
A simple variant of a priority queue, called a soft heap, is introduced. The data structure supports the usual operations: insert… 
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)