Binary heap

Known as: Heap tree, Binary min heap, Binary min-heap

A binary heap is a heap data structure that takes the form of a binary tree. Binary heaps are a common way of implementing priority queues. A binary…

Papers overview

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

2016

Existing Searchable Encryption (SE) solutions are able to handle simple Boolean search queries, such as single or multi-keyword…

2016

2010

Graphics processors are becoming more and more popular among many application developers as commodity data-parallel coprocessors…

2008

— In this paper, we deal with the Steiner tree problem (STP) on a graph in which a fuzzy number, instead of a real number, is…

2005

2004

Protective role of mycorrhizal fungus for plants against contamination with heavy metals makes a possibility to use fungi inocula…

1989

In this paper we show that to construct an implicit, double-ended priority queue organized as a min-max heap, 17/9n = 1.88 ...n…

1988

In this paper we study the computational complexity of constructing implicit, doubleended priority queues organized as min-max…

1988

1987

Very recently a new data structure, called a min-max heap, was presented for implementing the double-ended priority queue. A min…