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.
2013
2013
Options based reserve procurement strategy for wind generators - Using binomial trees
Wind and solar PV are the most mature forms of renewable energy and are integral to our clean energy strategy. Their… 
2012
2012
Analysis and Optimization of Financial Analytics Benchmark on Modern Multi- and Many-core IA-Based Architectures
In the past 20 years, computerization has driven explosive growth in the volume of financial markets and in the variety of traded… 
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
1997
1997
Embedding of binomial trees in hypercubes with link faults
We study the embedding of binomial trees with variable roots in n-dimensional hypercubes (n-cubes) with faulty links. A simple… 
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
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
Optimal broadcasting in hypercubes with link faults using limited global information
1994
1994
An Optimal Fault-Tolerant Nonredundant Broadcasting Scheme in Injured Hypercubes
  • Jie Wu
  • J. Parallel Distributed Comput.
  • 1994
  • Corpus ID: 42778533
Abstract We propose a nonredundant broadcasting scheme for injured hypercube multicomputers with direct-connection capability… 
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)