Skip to search formSkip to main contentSkip to account menu

Mergeable heap

Known as: Meldable heap 
In computer science, a mergeable heap (also called a meldable heap) is an abstract data type, which is a heap supporting a merge operation.
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Interactive analytics increasingly involves querying for quantiles over sub-populations of high cardinality datasets. Data… 
2017
2017
In this paper we put forward a new generalization of Functional Encryption (FE) that we call Mergeable FE (mFE). In a mFE system… 
2015
2015
In structured overlay networks with millions of nodes, it is essential to optimize the extent to which routing paths are… 
2013
2013
In 1998, Chazelle [J. ACM, 47 (2000), pp. 1012--1027] introduced a new kind of meldable heap (priority queue) called the soft… 
2011
2011
We introduce a meldable heap which guarantees the worst-case cost of O(1) for find-min, insert, and meld with at most 0, 3, and 3… 
2002
2002
In the classical meldable heap data type we maintain an item-disjoint collection of heaps under the operations find-min, insert… 
Highly Cited
1986
Highly Cited
1986
In this paper we explore two themes in data structure design: amortized computational complexity and self adjustment. We are… 
Highly Cited
1976
Highly Cited
1976
AbstractWe present a data structure, based upon a hierarchically decomposed tree, which enables us to manipulate on-line a…