Recurrence relations on heaps
type: Item
instance of: scholarly article
title: Recurrence relations on heaps
zbMATH Open document ID: 0846.68049
DOI: 10.1007/BF01955045
published in: Algorithmica
publication date: 1996-05-27T00:00:00Z
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 881761
zbMATH Keywords: priority queues
zbMATH Keywords: heap
author: Renzo Sprugnoli
MaRDI profile type: Publication
cites work: Min-max heaps and generalized priority queues
cites work: Repeated random insertion into a priority queue
cites work: A variant of heapsort with almost optimal number of comparisons
cites work: Average-case results on heapsort
cites work: A note on the construction of the data structure ``deap''
cites work: An average case analysis of Floyd's algorithm to construct heaps
cites work: Q3783549
cites work: On the random construction of heaps
cites work: Heaps on Heaps
cites work: Bounds for min-max heaps
cites work: Average case analysis of heap building by repeated insertion
cites work: Q4428915
cites work: Q5585020
cites work: Building heaps fast
cites work: The Analysis of Heapsort
cites work: A data structure for manipulating priority queues
Recommended article: Q5208779
Recommended article: Q4763425
Recommended article: Divide-and-conquer recurrences associated with generalized heaps, optimal merge, and related structures
Recommended article: On the ``heap'' problem
Recommended article: Heaps and two exponential structures
Recommended article: A characterization of heaps and its applications
Recommended article: Q3580462
Recommended article: Refined complexity analysis for heap operations
Recommended article: Strict fibonacci heaps
Recommended article: Heapable Sequences and Subseqeuences
description: scientific article; zbMATH DE number 881761