Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 238,332,640 papers from all fields of science
Search
Sign In
Create Free Account
Binary heap
Known as:
Heap tree
, Binary min heap
, Binary min-heap
Expand
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
45 relations
A* search algorithm
Array data structure
Bentley–Ottmann algorithm
Best, worst and average case
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Implementation and Evaluation of Multi-Mode Real-Time Tasks under Different Scheduling Algorithms
Anas Toma
,
Vincent Meyers
,
Jian-Jia Chen
2018
Corpus ID: 96440706
Tasks in the multi-mode real-time model have different execution modes according to an external input. Every mode represents a…
Expand
2017
2017
Abortion Rights: “ash heap of history” or Surviving the Smoke?
A. Whitley
2017
Corpus ID: 157221069
2016
2016
Determine the Optimal Path of Content Adaptation Services with Max Heap Tree
Shilan Rahmani Azr
,
Siavash Emtiyaz
2016
Corpus ID: 65267315
2016
2016
Garbage Collection Technique using Erasure Interval for NAND Flash Memory-based Storage Systems
Sung Kim
,
Jong Wook Kwak
2016
Corpus ID: 83273
Recently, many storage systems use SSD based on NAND flash memory, which has many advantages such as low power, low access…
Expand
2010
2010
A* Algorithm for Multicore Graphics Processors
Inam Rafia
2010
Corpus ID: 58487084
Graphics processors are becoming more and more popular among many application developers as commodity data-parallel coprocessors…
Expand
2008
2008
Fuzzy Shortest Paths Approximation for Solving the Fuzzy Steiner Tree Problem in Graphs
M. Seda
2008
Corpus ID: 642755
— 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…
Expand
2007
2007
Concurrent implementation of caches
Antal Tátrai
,
I. Fekete
2007
Corpus ID: 55146805
Caches are typically used in the practice for making the respond time faster when of accessing remote data. Every case when…
Expand
2004
2004
Identification of ectomycorrhizal fungi isolated from roots of birch growing on metallurgic heap
P. Krupa
,
Z. Piotrowska-Seget
2004
Corpus ID: 85253434
Protective role of mycorrhizal fungus for plants against contamination with heavy metals makes a possibility to use fungi inocula…
Expand
1996
1996
SOP: a reconfigurable massively parallel system and its control-data-flow based compiling method
Tsukasa Yamauchi
,
S. Nakaya
,
N. Kajihara
Proceedings IEEE Symposium on FPGAs for Custom…
1996
Corpus ID: 21948576
This paper describes reconfigurable massively parallel computer system called SOP (Sea Of Processors) that has ability to change…
Expand
1989
1989
A note on constructing min-max heaps
T. Strothotte
,
Patrik Eriksson
,
Sören Vallner
BIT
1989
Corpus ID: 39887476
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…
Expand