English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
 Local TagsRelease HistoryDetailsSummary
  Best possible bounds for the weighted path length of optimum binary search trees

Mehlhorn, K. (1975). Best possible bounds for the weighted path length of optimum binary search trees. In Automata Theory and Formal Languages, 2nd GI Conference (pp. 31-41). Berlin, Germany: Springer.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-0014-AFD8-B Version Permalink: https://hdl.handle.net/11858/00-001M-0000-0024-3F97-9
Genre: Conference Paper

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Mehlhorn, Kurt1, Author           
Barkhage, H.2, Editor
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              
2Max Planck Society, ou_persistent13              

Content

show

Details

show
hide
Language(s): eng - English
 Dates: 2006-11-091975
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 344678
Other: Local-ID: C1256428004B93B8-32B72371C30CD6D9C12571C3002E85BC-mehlhorn75by
 Degree: -

Event

show
hide
Title: Untitled Event
Place of Event: Kaiserslautern, Germany
Start-/End Date: 1975-05-20

Legal Case

show

Project information

show

Source 1

show
hide
Title: Automata Theory and Formal Languages, 2nd GI Conference
Source Genre: Proceedings
 Creator(s):
Affiliations:
Publ. Info: Berlin, Germany : Springer
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 31 - 41 Identifier: ISBN: 3-540-07407-4

Source 2

show
hide
Title: Lecture Notes in Computer Science
Source Genre: Series
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: - Identifier: -