Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
When agents can learn about their abilities as active investors, they rationally "trade to learn" even if they expect to lose… Expand
  • figure 1
  • figure 2
  • table 1
  • table 2
  • table 3
Is this relevant?
2008
2008
We develop and implement an optimal broadcast algorithm for fully connected processor networks under a bidirectional… Expand
Is this relevant?
2004
2004
We introduce an architecture independent approach in describing how computations such as those involved in American or European… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2003
Highly Cited
2003
  • J. Walsh
  • Finance Stochastics
  • 2003
  • Corpus ID: 5381115
Abstract. We study the detailed convergence of the binomial tree scheme. It is known that the scheme is first order. We find the… Expand
Is this relevant?
Highly Cited
2000
Highly Cited
2000
The efficient implementation of collective communication operations has received much attention. Initial efforts modeled network… Expand
  • figure 1
  • figure 2
  • figure 7
  • figure 8
  • figure 9
Is this relevant?
Highly Cited
1999
Highly Cited
1999
American exercise has always presented a problem for option pricing models. For put options and calls on underlying assets with a… Expand
Is this relevant?
Highly Cited
1995
Highly Cited
1995
In its exposure draft, "Accounting for Stock-based Compensation," FASB proposes that either the Black-Scholes or binomial option… Expand
  • table I
  • table II
  • table III
  • table XI
Is this relevant?
Highly Cited
1994
Highly Cited
1994
This article develops a new method for inferring risk-neutral probabilities (or state-contingent prices) from the simultaneously… Expand
  • table III
Is this relevant?
Highly Cited
1989
Highly Cited
1989
Four different communication problems are addressed in Boolean n-cube configured multiprocessors: (1) one-to-all broadcasting… Expand
  • figure 1
  • table I
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1988
Highly Cited
1988
We introduce a new representation of a priority queue in an array such that the operation of insert can be performed in constant… Expand
Is this relevant?