# Binary heap

## Papers overview

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

2014

2014

- ArXiv
- 2014

Let n denote the number of elements currently in a data structure. An in-place heap is stored in the first n locations of anâ€¦Â (More)

Is this relevant?

2011

2011

- J. Symb. Comput.
- 2011

In 1974, Johnson showed how to multiply and divide sparse polynomials using a binary heap. This paper introduces a new algorithmâ€¦Â (More)

Is this relevant?

2010

2010

- Proceedings of the 17th International Conferenceâ€¦
- 2010

For event based routing using global timestamps a sorting and buffering component is required. This work describes theâ€¦Â (More)

Is this relevant?

2009

2009

- IEEE International Symposium on Parallelâ€¦
- 2009

Much research has been done in the area of software transactional memory (STM) as a new programming paradigm to help ease theâ€¦Â (More)

Is this relevant?

2006

2006

- APLAS
- 2006

The static determination of approximated values of string expressions has many potential applications. For instance, approximatedâ€¦Â (More)

Is this relevant?

Highly Cited

2001

Highly Cited

2001

- INFOCOM
- 2001

We present a new algorithm, A*Prune, to list (in order of increasing length) the first K Multiple-Constrained-Shortest-Pathâ€¦Â (More)

Is this relevant?

Highly Cited

1999

Highly Cited

1999

- ECOOP
- 1999

We present an analysis of the memory usage for six of the Java programs in the SPECjvm98 benchmark suite. Most of the programsâ€¦Â (More)

Is this relevant?

1998

1998

- SWAT
- 1998

Comparator networks for constructing binary heaps of size n are presented which have size O(n log log n) and depth O(log n). Aâ€¦Â (More)

Is this relevant?

1992

1992

- MPC
- 1992

In this paper we derive a linear-time, constant-space algorithm to construct a binary heap whose inorder traversal equals a givenâ€¦Â (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?