Skip to search formSkip to main contentSkip to account menu

Skew heap

Known as: Self-adjusting heap 
A skew heap (or self-adjusting heap) is a heap data structure implemented as a binary tree. Skew heaps are advantageous because of their ability to… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Title of thesis: DEVELOPMENT OF A REAL-TIME HIERARCHICAL 3D PATH PLANNING ALGORITHM FOR UNMANNED AERIAL VEHICLES Matthew David… 
2014
2014
  • 2014
  • Corpus ID: 44599180
Skew heaps are an amazingly simple and lightweight implementation of priority queues. They were invented by Sleator and Tarjan [1… 
2014
2014
The scientific study of programming languages requires a formal specification of their semantics. However, the incentives of… 
Review
2013
Review
2013
1 Overview of the Field In recent years, the extension of classical Gaussian-based statistical models to non-Gaussian ones has… 
2011
2011
One goal of the SIS18 upgrade scheme is concerned about improving the multi-turn injection (MTI) efficiency, in order to reach… 
2007
2007
As cycle times grow relative to memory speeds, the cache performance of algorithms has an increasingly large impact on overall… 
1998
1998
Reproductive skew among cooperatively breeding animals has recently attracted considerable interest. In social insects… 
1993
1993
The implementation of the pending event set (PES) is crucial to the execution speed of discrete event simulation programs. This… 
1987
1987
In testing Sleator and Tarjan’s skew heap implementations of priority queues, a problem with the bottom-up variant was found. The…