Skip to search formSkip to main content

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
A number of concurrent, relaxed priority queues have recently been proposed and implemented. Results are commonly reported for a… Expand
  • figure 1
  • figure 3
  • figure 2
  • table 1
  • figure 4
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… Expand
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2010
2010
We propose and demonstrate Kinetic Tiles, modular con-struction units for Interactive Kinetic Surfaces (IKSs). We aimed to design… Expand
  • figure 1
  • figure 2
  • figure 5
  • figure 3
  • figure 4
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… Expand
  • 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… Expand
  • figure 1
  • figure 2
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… Expand
  • figure 1
  • table II
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
1996
Highly Cited
1996
Priority queues are some of the most fundamental data structures. For example, they are used directly for task scheduling in… Expand
Is this relevant?
1995
1995
It is well recognised that artifacts can occur due to changing activity during SPECT acquisition in tracer kinetic studies… Expand
  • figure 1
  • figure 3
Is this relevant?
1994
1994
We present an efficient algorithm which can check the answers given by the fundamental abstract data types priority queues and… Expand
  • figure 1
  • table 1
  • table 2
  • table 3
  • table 4
Is this relevant?