Skip to search formSkip to main contentSkip to account menu

Binomial heap

Known as: Binomial queue, Binomial, Binomial Tree 
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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

18 relations
Abstract data typeAlgorithmic efficiencyBinary heapBinary logarithm

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
The Value of IS-Enabled Flexibility in Electricity Demand - a Real Options Approach
As the transition to renewable energy sources progresses, their inte- gration makes electricity production increasingly… 
2013
2013
Learning Black Scholes option pricing the fun way via mobile apps
In the recent past, technology has advanced significantly to promote e-learning as an effective learning tool. Where physical… 
2011
2011
Acceleration of Binomial Options Pricing via Parallelizing along time-axis on a GPU
Since the introduction of organized trading of options for commodities and equities, computing fair prices for options has been… 
2005
2005
Parallel algorithm for pricing American Asian options with multi-dimensional assets
In this paper, we develop parallel algorithms for pricing American-style Asian options employing binomial tree method. We… 
2004
2004
Architecture independent parallel binomial tree option price valuations
Highly Cited
1997
Highly Cited
1997
Multicast on irregular switch-based networks with wormhole routing
This paper presents efficient multicasting with reduced contention on irregular networks with switch-based wormhole… 
1997
1997
Conflict-free template access in k-ary and binomial trees
Load balanced data distribution among various memory modules in a multiprocessor architecture or among multiple disks in a… 
1996
1996
Optimal broadcasting in hypercubes with link faults using limited global information
1996
1996
Parallel and distributed meldable priority queues based on binomial heaps
On the parallel random access machine (PRAM) models, we present an optimal implementation of a meldable priority queue based on… 
1996
1996
The Valuation of American-Style Options on Bonds
A Two-factor Lognormal Model of the Term Structure and the Valuation of American-Style Options on Bonds We build a no-arbitrage… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)