English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
 DetailsSummary
  An Efficient Algorithm for Constructing Nearly Optimal Prefix Codes

Mehlhorn, K. (1980). An Efficient Algorithm for Constructing Nearly Optimal Prefix Codes. IEEE Transactions on Information Theory, 26, 513-517.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-0014-AF6F-8 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-0014-AF70-2
Genre: Journal Article

Files

show Files
hide Files
:
Mehlhorn24.pdf (Publisher version), 18MB
 
File Permalink:
-
Name:
Mehlhorn24.pdf
Description:
-
OA-Status:
Visibility:
Private
MIME-Type / Checksum:
application/pdf
Technical Metadata:
Copyright Date:
-
Copyright Info:
-
License:
-

Locators

show

Creators

show
hide
 Creators:
Mehlhorn, Kurt1, Author           
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show

Details

show
hide
Language(s): eng - English
 Dates: 2008-03-061980
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: Peer
 Identifiers: eDoc: 344676
Other: Local-ID: C1256428004B93B8-E7590FFFB6FD8EAAC12571C3001592EE-mehlhorn80f
 Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show
hide
Title: IEEE Transactions on Information Theory
Source Genre: Journal
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: 26 Sequence Number: - Start / End Page: 513 - 517 Identifier: -