On the random construction of heaps (Q1108784): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0020-0190(88)90101-9 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1984625335 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Repeated random insertion into a priority queue / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Probability Inequalities for Sums of Bounded Random Variables / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4057549 / rank | |||
Normal rank | |||
Latest revision as of 17:58, 18 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the random construction of heaps |
scientific article |
Statements
On the random construction of heaps (English)
0 references
1988
0 references
We give a simple proof of the result of \textit{B. Bollobás} and \textit{I. Simon} [J. Algorithms 6, 466-477 (1985; Zbl 0592.68022)] on the linear expected time construction of a binary heap. We also give bounds on the probability that the construction time is much more than this and generalize the result to d-heaps, \(d\geq 2\).
0 references
upper bound
0 references
binary heap
0 references
d-heaps
0 references
