English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
  On Batcher's Merge Sorts as Parallel Sorting Algorithms

Rüb, C. (1998). On Batcher's Merge Sorts as Parallel Sorting Algorithms. In M. Morvan, C. Meinel, & D. Krob (Eds.), Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science (STACS-98) (pp. 410-420). Berlin, Germany: Springer.

Item is

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-021998
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 517999
Other: Local-ID: C1256428004B93B8-7B23045DB2CAB53CC12567440035B5BE-Rüb98
 Degree: -

Event

show
hide
Title: Untitled Event
Place of Event: Paris, France
Start-/End Date: 1998

Legal Case

show

Project information

show

Source 1

show
hide
Title: Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science (STACS-98)
Source Genre: Proceedings
 Creator(s):
Morvan, Michel, Editor
Meinel, Christoph, Editor
Krob, Daniel, Editor
Affiliations:
-
Publ. Info: Berlin, Germany : Springer
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 410 - 420 Identifier: ISBN: 3-540-64230-7

Source 2

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