# Heap (data structure)

## Papers overview

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

2017

2017

- CC
- 2017

There are many applications of program (or heap) partitioning, such as computation offloading, region-based memory managementâ€¦Â (More)

Is this relevant?

2012

2012

- J. Discrete Algorithms
- 2012

The weak heap is a priority queue that was introduced as a competitive structure for sorting. Its array-based form supports theâ€¦Â (More)

Is this relevant?

2010

2010

- ACSAC
- 2010

Heap spraying is an attack technique commonly used in hijacking browsers to download and execute malicious code. In this attackâ€¦Â (More)

Is this relevant?

2010

2010

- Discrete Math., Alg. and Appl.
- 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

- POPL
- 2010

Most systems based on separation logic consider only restricted forms of implication or non-separating conjunction, as fullâ€¦Â (More)

Is this relevant?

Highly Cited

2005

Highly Cited

2005

- POPL
- 2005

The goal of this work is to develop compile-time algorithms for automatically verifying properties of imperative programs thatâ€¦Â (More)

Is this relevant?

2003

2003

- ESOP
- 2003

While the semantics of local variables in programming languages is by now wellunderstood, the semantics of pointer-addressed heapâ€¦Â (More)

Is this relevant?

Highly Cited

1988

Highly Cited

1988

- Commun. ACM
- 1988

The relaxed heap is a priority queue data structure that achieves the same amortized time bounds as the Fibonacci heapâ€”a sequenceâ€¦Â (More)

Is this relevant?

Highly Cited

1987

Highly Cited

1987

- J. ACM
- 1987

In this paper we develop a new data structure for implementing heaps (priority queues). Our structure, <italic>Fibonacci heapsâ€¦Â (More)

Is this relevant?

Highly Cited

1986

Highly Cited

1986

- Commun. ACM
- 1986

A simple implementation of double-ended priority queues is presented. The proposed structure, called a min-max heap, can be builtâ€¦Â (More)

Is this relevant?