Kinetic priority queue

A Kinetic Priority Queue is an abstract kinetic data structure. It is a variant of a priority queue designed to maintain the maximum (or minimum… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1975-2018
01219752018

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Priority queues with parallel access are an attractive data structure for applications like prioritized online scheduling… (More)
  • figure 3
  • figure 4
  • figure 5
  • figure 6
  • figure 7
Is this relevant?
2012
2012
We introduce the notion of a k-FIFO queue which may dequeue elements out of FIFO order up to a constant k ≥ 0. Retrieving the… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • figure 4
Is this relevant?
2007
2007
Priority queues are data structures that maintain a list of data sorted first by priority and second by order of insertion (first… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 4
Is this relevant?
2004
2004
We consider the implementation of meldable priority queues with integer keys in the RAM model. We present two new general… (More)
  • figure 1
  • figure 2
Is this relevant?
2004
2004
We show that any priority queue data structure that supports <i>insert</i>, <i>delete</i>, and <i>find-min</i> operations in <i… (More)
  • figure 1
  • figure 2
Is this relevant?
2002
2002
We propose algorithms for maintaining two variants of kd-trees of a set of moving points in the plane. A pseudo kd-tree allows… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
1997
Highly Cited
1997
Priority queues are used in many applications including real-time systems, operating systems, and simulations. Their… (More)
  • figure 1
  • table II
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
1997
1997
A k-bounded priority queue transforms an input sequence CT into an output sequence z which is a re-ordering of the sequence c… (More)
Is this relevant?
Highly Cited
1996
Highly Cited
1996
Priority queues are some of the most fundamental data structures. They are used directly for, say, task scheduling in operating… (More)
Is this relevant?