Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 238,346,477 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
A Real Option Approach to Valuing the Option to Defer in a Residential Project in Melbourne, Australia
Kwabena Mintah
,
D. Higgins
,
J. Callanan
,
R. Wakefield
2017
Corpus ID: 86653378
Property development feasibility evaluation is a precursor to any real estate development activity. The evaluation is…
Expand
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
2013
2013
Random binomial tree models
N. Ganikhodjaev
,
Kamola Bayram
2013
Corpus ID: 117662177
2012
2012
Analysis and Optimization of Financial Analytics Benchmark on Modern Multi- and Many-core IA-Based Architectures
M. Smelyanskiy
,
Jason D. Sewall
,
+10 authors
Ekaterina Gonina
SC Companion: High Performance Computing…
2012
Corpus ID: 14213320
In the past 20 years, computerization has driven explosive growth in the volume of financial markets and in the variety of traded…
Expand
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
Using Computer Algebra Packages to Complement the Spreadsheet Construction of Binomial Option Trees: The Example of Mathcad
Alejandro Hazera
,
Allan W. Graham
,
Salvador Marín Hernández
2007
Corpus ID: 118099184
In this paper we show how the mathematical programming package Mathcad can be used to complement the construction of a binomial…
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
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