Heap (data structure)

Known as: Max-heap property, Min-heap, Min heap order 
In computer science, a heap is a specialized tree-based data structure that satisfies the heap property: If A is a parent node of B then the key (the… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
There are many applications of program (or heap) partitioning, such as computation offloading, region-based memory management… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 6
  • figure 7
Is this relevant?
2012
2012
The weak heap is a priority queue that was introduced as a competitive structure for sorting. Its array-based form supports the… (More)
  • figure 1
  • figure 9
  • figure 10
  • table 1
  • figure 11
Is this relevant?
2010
2010
Heap spraying is an attack technique commonly used in hijacking browsers to download and execute malicious code. In this attack… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Is this relevant?
2010
2010
We give a priority queue that achieves the same amortized bounds as Fibonacci heaps. Namely, find-min requires O(1) worst-case… (More)
Is this relevant?
Highly Cited
2010
Highly Cited
2010
Most systems based on separation logic consider only restricted forms of implication or non-separating conjunction, as full… (More)
  • figure 2
  • figure 4
  • figure 3
  • figure 6
Is this relevant?
Highly Cited
2005
Highly Cited
2005
The goal of this work is to develop compile-time algorithms for automatically verifying properties of imperative programs that… (More)
  • figure 1
  • figure 4
  • figure 2
  • figure 5
  • figure 3
Is this relevant?
2003
2003
While the semantics of local variables in programming languages is by now wellunderstood, the semantics of pointer-addressed heap… (More)
  • figure 1
Is this relevant?
Highly Cited
1988
Highly Cited
1988
The relaxed heap is a priority queue data structure that achieves the same amortized time bounds as the Fibonacci heap—a sequence… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1987
Highly Cited
1987
In this paper we develop a new data structure for implementing heaps (priority queues). Our structure, <italic>Fibonacci heaps… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1986
Highly Cited
1986
A simple implementation of double-ended priority queues is presented. The proposed structure, called a min-max heap, can be built… (More)
  • figure 1
  • table I
  • table II
Is this relevant?