An efficient algorithm for constructing nearly optimal prefix codes

Mehlhorn, Kurt

Local TagsRelease HistoryDetailsSummary

An efficient algorithm for constructing nearly optimal prefix codes

Mehlhorn, K.(1978). An efficient algorithm for constructing nearly optimal prefix codes (A 13/78). Saarbrücken: Fachbereich Informatik, Universität des Saarlandes.

Item is Released

show all hide all

Basic

show hide

Item Permalink: https://hdl.handle.net/11858/00-001M-0000-0014-AF9B-6 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-0024-3FB4-5

Genre: Report

Files

show Files

Locators

show

Creators

show

hide

Creators:
Mehlhorn, Kurt¹, 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: 1978

Publication Status: Issued

Pages: -

Publishing info: Saarbrücken : Fachbereich Informatik, Universität des Saarlandes

Table of Contents: -

Rev. Type: -

Identifiers: eDoc: 344714
Other: Local-ID: C1256428004B93B8-A0F7D7C47933A7D2C12571EE0051A8D8-mehlhorn78y
Report Nr.: A 13/78

Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show

hide

Title: Report

Source Genre: Series

Creator(s):

Affiliations:

Publ. Info: -

Pages: - Volume / Issue: - Sequence Number: - Start / End Page: - Identifier: -