In computer science, a mergeable heap (also called a meldable heap) is an abstract data type, which is a heap supporting a merge operation.

Semantic Scholar uses AI to extract papers important to this topic.

2009

2009

- David Letterman
- 2009

If we never had to use DELETEMIN, mergeable heaps would be completely trivial. Each “heap” just stores to maintain the single… (More)

Is this relevant?

2002

2002

- Haim Kaplan, Nira Shafrir, Robert E. Tarjan
- STOC
- 2002

In the classical meldable heap data type we maintain an item-disjoint collection of heaps under the operations <i>find-min</i… (More)

Is this relevant?

Highly Cited

1986

Highly Cited

1986

- Daniel Dominic Sleator, Robert E. Tarjan
- SIAM J. Comput.
- 1986

In this paper we explore two themes in data structure design: amortized computational complexity and self-adjustment. We are… (More)

Is this relevant?

Highly Cited

1977

Highly Cited

1977

- Peter van Emde Boas, Rolf Sommer Kaas, Eric Zijlstra
- Mathematical systems theory
- 1977

We present a data structure, based upon a hierarchically decomposed tree, which enables us to manipulate on-line a priority queue… (More)

Is this relevant?

Highly Cited

1975

Highly Cited

1975

- Peter Van Emde Boas
- 16th Annual Symposium on Foundations of Computer…
- 1975

We present a data structure, based upon a stratified binary tree, which enables us to manipulate on-line a priority queue whose… (More)

Is this relevant?