Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 225,190,744 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.
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
2004
2004
Architecture independent parallel binomial tree option price valuations
A. Gerbessiotis
Parallel Computing
2004
Corpus ID: 6567726
2004
2004
The American put under transactions costs
Stylianos Perrakis
,
J. Lefoll
2004
Corpus ID: 73581127
2004
2004
Hierarchical gather/scatter algorithms with graceful degradation
J. L. Traff
18th International Parallel and Distributed…
2004
Corpus ID: 18119579
Summary form only given. We present and implement simple, binomial-tree based algorithms for the gather and scatter operations of…
Expand
1997
1997
Conflict-free template access in k-ary and binomial trees
M. C. Pinotti
,
Sajal K. Das
,
F. Sarkar
International Conference on Supercomputing
1997
Corpus ID: 17280463
Load balanced data distribution among various memory modules in a multiprocessor architecture or among multiple disks in a…
Expand
Highly Cited
1997
Highly Cited
1997
Multicast on irregular switch-based networks with wormhole routing
R. Kesavan
,
K. Bondalapati
,
D. Panda
Proceedings Third International Symposium on High…
1997
Corpus ID: 10650798
This paper presents efficient multicasting with reduced contention on irregular networks with switch-based wormhole…
Expand
1996
1996
Parallel and distributed meldable priority queues based on binomial heaps
Vincenzo A. Crupi
,
Sajal K. 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
1996
1996
The Valuation of American-Style Options on Bonds
T. Ho
,
R. Stapleton
,
M. Subrahmanyam
1996
Corpus ID: 2574249
A Two-factor Lognormal Model of the Term Structure and the Valuation of American-Style Options on Bonds We build a no-arbitrage…
Expand
Highly Cited
1995
Highly Cited
1995
On the Accounting Valuation of Employee Stock Options
M. Rubinstein.
1995
Corpus ID: 18399653
In its exposure draft, "Accounting for Stock-based Compensation," FASB proposes that either the Black-Scholes or binomial option…
Expand
1991
1991
Eecient Simulation of Multiple Cache Conngurations Using Binomial Trees
R. Sugumar
,
S. Abraham
1991
Corpus ID: 17534417
Simulation time is often the bottleneck in the cache design process. In this paper, algorithms for the eecient simulation of…
Expand
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)
ACCEPT & CONTINUE