Skip to search formSkip to main contentSkip to account menu

Pairing heap

A pairing heap is a type of heap data structure with relatively simple implementation and excellent practical amortized performance, introduced by… 
Wikipedia (opens in a new tab)

Related topics

Related topics

14 relations
Binary heapD-ary heapData structureDijkstra's algorithm

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Sum rate maximization for multi-cell downlink OFDMA with subcarrier pair-based opportunistic DF relaying
This paper considers multi-cell decode-and-forward (DF) relay-aided orthogonal frequency division multi-access (OFDMA) downlink… 
2014
2014
A Novel Routing Algorithm Design of Time Evolving Graph Based on Pairing Heap for MEO Satellite Network
As a tradeoff of GEO and LEO, MEO satellite system has more acceptable service performance and it is more appropriate to provide… 
2013
2013
Possible experimental signature of octupole correlations in the 02+states of the actinides
$J^{\pi}$= 0$^+$ states have been investigated in the actinide nucleus ${}^{240}$Pu up to an excitation energy of 3 MeV with a… 
2013
2013
Pairing the Penguins
In this chapter, we will program the main gameplay for the Penguin Pairs game. We will discuss how to move penguins around on the… 
Highly Cited
2008
Highly Cited
2008
Interband superconductivity: Contrasts between Bardeen-Cooper-Schrieffer and Eliashberg theories
recently discovered iron pnictide superconductors apparently present an unusual case of interband-channel pairing… 
2008
2008
A moving object detection algorithm for smart cameras
In video surveillance systems, more intelligent functions are being embedded into cameras. In this paper, we propose a novel… 
Review
2007
Review
2007
On Pairing Inversion Problems
In many aspects, cryptanalyses of pairing based cryptography consider protocol level security and take difficulties of primitives… 
2006
2006
Generating stationary random graphs on Z with prescribed i
Let F be a probability distribution with support on the non-negative integers. Two algorithms are described for generating a… 
1998
1998
Information theoretic implications for pairing heaps
Strikingly simple in design, the pairing heap data structure nonetheless seems difficult to analyze. An information theoretic… 
1994
1994
Checking mergeable priority queues
We present an efficient algorithm which can check the answers given by the fundamental abstract data types priority queues and… 
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)