English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
 Local TagsRelease HistoryDetailsSummary
  Scheduling and Traffic Allocation for Tasks with Bounded Splittability

Krysta, P., Sanders, P., & Vöcking, B. (2003). Scheduling and Traffic Allocation for Tasks with Bounded Splittability. In Mathematical foundations of computer science 2003: 28th International Symposium, MFCS 2003 (pp. 500-510). Berlin, Germany: Springer.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-2E00-F Version Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-2E03-9
Genre: Conference Paper

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Krysta, Piotr1, Author           
Sanders, Peter1, Author           
Vöcking, Berthold1, Author           
Rovan, Branislav, Editor
Vojtáš, Peter, Editor
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show

Details

show
hide
Language(s): eng - English
 Dates: 2004-06-152003
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 201864
Other: Local-ID: C1256428004B93B8-572C4F06E92A32BDC1256E1D003E35D2-KSV03
 Degree: -

Event

show
hide
Title: MFCS 2003
Place of Event: Bratislava
Start-/End Date: 2003-08-25 - 2003-08-28

Legal Case

show

Project information

show

Source 1

show
hide
Title: Mathematical foundations of computer science 2003 : 28th International Symposium, MFCS 2003
Source Genre: Proceedings
 Creator(s):
Affiliations:
Publ. Info: Berlin, Germany : Springer
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 500 - 510 Identifier: ISBN: 3540406719

Source 2

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