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… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Process scheduling algorithm plays a crucial role in operating system performance and so does the data-structure used for its… (More)
  • figure 2
  • figure 1
  • figure 3
  • table I
Is this relevant?
2011
2011
Whenagents can learn about their abilities as active investors, they rationally “trade to learn” even if they expect to lose from… (More)
  • figure 1
  • figure 2
  • table 1
  • table 2
  • table 3
Is this relevant?
2010
2010
Modern high performance computing systems are being increasingly deployed in a hierarchical fashion with multi-core computing… (More)
  • figure 1
  • table 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2005
Highly Cited
2005
This paper presents the exchanged hypercube, a new interconnection network obtained by systematically removing links from a… (More)
  • table 1
  • figure 1
  • table 2
  • figure 2
  • figure 3
Is this relevant?
2004
2004
We introduce an architecture independent approach in describing how computations such as those involved in American or European… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2000
Highly Cited
2000
Despite its success, the Black-Scholes formula has become increasingly unreliable over time in the very markets where one would… (More)
  • table III
Is this relevant?
Highly Cited
1997
Highly Cited
1997
This paper presents efficient multicasting with reduced contention on irregular networks with switchbased wormhole… (More)
  • figure 12
Is this relevant?
1991
1991
Simulation time is often the bottleneck in the cache design process. In this paper, algorithms for the eecient simulation of… (More)
Is this relevant?
Highly Cited
1989
Highly Cited
1989
Effective utilization of communication resources is crucial for good overall performance in highly concurrent systems. In this… (More)
  • figure 1
  • table I
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1988
Highly Cited
1988
The relaxed heap is a priority queue data structure that achieves the same amortized time bounds as the Fibonacci heap—a sequence… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?