On the average running time of odd-even merge sort

Rüb, Christine

Item

ITEM ACTIONSEXPORT

DownloadE-Mail

Please note that a newer version of this item is available:
https://pure.mpg.de/pubman/item/item_1331555_2

DetailsSummary

On the average running time of odd-even merge sort

Rüb, C. (1997). On the average running time of odd-even merge sort. Journal of Algorithms, 22(2), 329-346.

Item is Released

show all hide all

Basic

show hide

Item Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-395C-4 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-395D-2

Genre: Journal Article

Files

show Files

Locators

show

Creators

show

hide

Creators:
Rüb, Christine¹, Author

Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019

Content

show

Details

show

hide

Language(s): eng - English

Dates: Modified: 2010-03-02Date issued: 1997

Publication Status: Issued

Pages: -

Publishing info: -

Table of Contents: -

Rev. Type: Peer

Identifiers: eDoc: 517712
Other: Local-ID: C1256428004B93B8-27BE4CC6B4F9D708C125648400528284-Rueb-1-97

Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show

hide

Title: Journal of Algorithms

Source Genre: Journal

Creator(s):

Affiliations:

Publ. Info: -

Pages: - Volume / Issue: 22 (2) Sequence Number: - Start / End Page: 329 - 346 Identifier: -