Skip to search formSkip to main content>Semantic Scholar Semantic Scholar's Logo

Search

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

2013

2013

A weak heap is a priority queue that supports the operations construct, minimum, insert, and extract-min. To store n elements, it… Expand

Review

2013

Review

2013

A weak heap is a variant of a binary heap where, for each node, the heap ordering is enforced only for one of its two children… Expand

Review

2013

Review

2013

A weak heap is a variant of a binary heap where, for each node, the heap ordering is enforced only for one of its two children… Expand

2012

2012

The weak heap is a priority queue that was introduced as a competitive structure for sorting. Its array-based form supports the… Expand

2012

2012

An array-based weak heap is an efficient data structure for realizing an elementary priority queue. In this paper we focus on the… Expand

2011

2011

In this paper we introduce two efficient priority queues. For both, insert requires O(1) amortized time and extract-min$O(\lg n… Expand

2010

2010

In this paper we describe an experimental study where we evaluated the practical efficiency of three worst-case efficient… Expand

2005

2005

A simplification of a run-relaxed heap, called a relaxed weak queue, is presented. This new priority-queue implementation… Expand