English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
 DetailsSummary
  On the Average Running Time of Odd-Even Merge Sort

Rüb, C. (1995). On the Average Running Time of Odd-Even Merge Sort. In E. W. Mayr, & C. Puech (Eds.), STACS95: 12th Annual Symposium on Theoretical Aspects of Computer Science (pp. 491-501). Berlin: Springer.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-0014-ACA9-7 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-0014-ACAA-5
Genre: Conference Paper

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Rüb, Christine1, Author           
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show

Details

show
hide
Language(s): eng - English
 Dates: 2010-03-021995
 Publication Status: Issued
 Pages: -
 Publishing info: Berlin : Springer
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 517786
Other: Local-ID: C1256428004B93B8-865039B076FE30B4C125645A004E9F82-Rueb95
 Degree: -

Event

show
hide
Title: Untitled Event
Place of Event: Munich, Germany
Start-/End Date: 1995

Legal Case

show

Project information

show

Source 1

show
hide
Title: STACS95: 12th Annual Symposium on Theoretical Aspects of Computer Science
Source Genre: Proceedings
 Creator(s):
Mayr, Ernst W., Editor
Puech, Claude, Editor
Affiliations:
-
Publ. Info: Berlin : Springer
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 491 - 501 Identifier: -

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: -