Worst-case analysis of a generalized heapsort algorithm

Authors:
A. Paulik
Affiliations:
-
Venue:
Information Processing Letters
Year:
1990

Citing 0
Cited 2

The *M-ary tree and *Ternary hillsort

CSC '92 Proceedings of the 1992 ACM annual conference on Communications
Divide-and-conquer recurrences associated with generalized heaps, optimal merge, and related structures

Theoretical Computer Science - Algorithms,automata, complexity and games

Quantified Score

Hi-index	0.89

Visualization

Abstract