Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 238,281,314 papers from all fields of science
Search
Sign In
Create Free Account
Binomial heap
Known as:
Binomial queue
, Binomial
, Binomial Tree
Expand
In computer science, a binomial heap is a heap similar to a binary heap but also supports quick merging of two heaps. This is achieved by using a…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
18 relations
Abstract data type
Algorithmic efficiency
Binary heap
Binary logarithm
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Partial Differential Equation Methods to Price Options in the Energy Market
Jin-Hua Yan
2017
Corpus ID: 54924497
We develop partial differential equation methods with well-posed boundary conditions to price average strike options and swing…
Expand
2015
2015
The Value of IS-Enabled Flexibility in Electricity Demand - a Real Options Approach
G. Fridgen
,
Lukas Häfner
,
Christian König
,
Thomas Sachs
Wirtschaftsinformatik
2015
Corpus ID: 15361032
As the transition to renewable energy sources progresses, their inte- gration makes electricity production increasingly…
Expand
2013
2013
Random binomial tree models
N. Ganikhodjaev
,
Kamola Bayram
2013
Corpus ID: 117662177
2008
2008
Analisis Regresi Binomial Negatif Untuk Mengatasi Overdispersion Regresi Poisson Pada Kasus TBC Di Propinsi Jawa Timur Tahun 2005.
Ratna Wahyuningsih
2008
Corpus ID: 125914702
Dalam analisis regresi Poisson, variabel respon (Y) harus memenuhi asumsi equidispersion (nilai varians sama dengan mean). Namun…
Expand
2007
2007
A Binomial Tree Model for Investment in Transmission Assets
J. Contreras
,
R. C. Garcia
,
J. Garcia
,
Marco van Akkeren
International Journal of Electronic Business…
2007
Corpus ID: 39996086
The need for investment in the improvement and expansion of the electric transmission grid has not been met in the new…
Expand
2006
2006
Chopping Up Trees to Improve Spatial Locality in Implicit k-Heaps
Nelson Amaral
,
R. Niewiadomski
2006
Corpus ID: 16373418
Research on the performance of implicit k-heaps has shown that aligning data with cache lines and increasing heap arity are…
Expand
2005
2005
Parallel algorithm for pricing American Asian options with multi-dimensional assets
Kai Huang
,
R. Thulasiram
International Symposium on High Performance…
2005
Corpus ID: 15183922
In this paper, we develop parallel algorithms for pricing American-style Asian options employing binomial tree method. We…
Expand
2004
2004
Constructing Fault-Tolerant Communication Trees in Hypercubes
Po-Jen Chuang
,
Shih-Yuan Chen
,
Juei-Tang Chen
Journal of information science and engineering
2004
Corpus ID: 1350563
A communication tree is a binomial tree embedded in a hypercube, whose communication direction is from its leaves to its root. If…
Expand
2001
2001
Efficient multicast algorithms for switch-based irregular heterogeneous networks of workstations
Amit Singhal
,
M. Banikazemi
,
P. Sadayappan
,
D. Panda
Proceedings, International Parallel and…
2001
Corpus ID: 27447404
This paper considers the problem of efficient multicast on worm-hole routed irregular heterogeneous networks of workstations…
Expand
1996
1996
Parallel and distributed meldable priority queues based on binomial heaps
Vincenzo A. Crupi
,
S. Das
,
M. C. Pinotti
Proceedings of the ICPP Workshop on Challenges…
1996
Corpus ID: 29079476
On the parallel random access machine (PRAM) models, we present an optimal implementation of a meldable priority queue based on…
Expand