A Tight Lower Bound for the Worst Case of Bottom-Up-Heapsort

Fleischer, Rudolf

doi:10.1007/BF01182770

Local TagsRelease HistoryDetailsSummary

A Tight Lower Bound for the Worst Case of Bottom-Up-Heapsort

Fleischer, R. (1994). A Tight Lower Bound for the Worst Case of Bottom-Up-Heapsort. Algorithmica, 11(2), 104-115. doi:10.1007/BF01182770.

Item is Released

show all hide all

Basic

show hide

Item Permalink: https://hdl.handle.net/21.11116/0000-000E-4B06-8 Version Permalink: https://hdl.handle.net/21.11116/0000-000E-4B07-7

Genre: Journal Article

Files

show Files

Locators

show

hide

Locator:
https://rdcu.be/dwTzi (Publisher version) Open Access status unknown

Description:
-

OA-Status:
Not specified

Creators

show

hide

Creators:
Fleischer, Rudolf¹, Author

Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019

Content

show

Details

show

hide

Language(s): eng - English

Dates: Date issued: 1994

Publication Status: Issued

Pages: -

Publishing info: -

Table of Contents: -

Rev. Type: -

Identifiers: BibTex Citekey: Fleischer_Algorithmica94
DOI: 10.1007/BF01182770

Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show

hide

Title: Algorithmica

Source Genre: Journal

Creator(s):

Affiliations:

Publ. Info: New York : Springer-Verlag

Pages: - Volume / Issue: 11 (2) Sequence Number: - Start / End Page: 104 - 115 Identifier: ISSN: 0178-4617
CoNE: https://pure.mpg.de/cone/journals/resource/954925487793