Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 228,600,542 papers from all fields of science
Search
Sign In
Create Free Account
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)
Create Alert
Alert
Related topics
Related topics
7 relations
Abstract data type
Binomial heap
Computer science
Fibonacci heap
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Mergeable Functional Encryption
Vincenzo Iovino
,
Karol Zebrowski
Provable Security
2017
Corpus ID: 4727835
In this paper we put forward a new generalization of Functional Encryption (FE) that we call Mergeable FE (mFE). In a mFE system…
Expand
2015
2015
Mergeable flexible routing tables: A design framework for reusable structured overlay algorithms
Hiroya Nagao
,
Kazuyuki Shudo
International Conference on Information…
2015
Corpus ID: 15583999
In structured overlay networks with millions of nodes, it is essential to optimize the extent to which routing paths are…
Expand
2013
2013
Soft Heaps Simplified
Haim Kaplan
,
R. Tarjan
,
Uri Zwick
SIAM journal on computing (Print)
2013
Corpus ID: 207065610
In 1998, Chazelle [J. ACM, 47 (2000), pp. 1012--1027] introduced a new kind of meldable heap (priority queue) called the soft…
Expand
2011
2011
A note on meldable heaps relying on data-structural bootstrapping
Claus Jensen
2011
Corpus ID: 57714206
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…
Expand
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)
ACCEPT & CONTINUE