English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
 Local TagsRelease HistoryDetailsSummary
  A New Data Structure for Representing Sorted Lists

Mehlhorn, K. (1980). A New Data Structure for Representing Sorted Lists. In Graph-theoretic concepts in computer science (WG-80): 6th international workshop (pp. 90-112). Berlin, Germany: Springer.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-0014-AF6A-1 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-0024-3FD6-A
Genre: Conference Paper

Files

show Files

Locators

show

Creators

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

Content

show

Details

show
hide
Language(s): eng - English
 Dates: 2006-09-211980
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 344658
Other: Local-ID: C1256428004B93B8-6043825C1A1D0D9DC12571C2007BB357-mehlhorn80dz
 Degree: -

Event

show
hide
Title: Untitled Event
Place of Event: Bad Honnef/Bonn, Germany
Start-/End Date: 1980-06-15

Legal Case

show

Project information

show

Source 1

show
hide
Title: Graph-theoretic concepts in computer science (WG-80) : 6th international workshop
Source Genre: Proceedings
 Creator(s):
Affiliations:
Publ. Info: Berlin, Germany : Springer
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 90 - 112 Identifier: ISBN: 3-540-10291-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: -