English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
 Local TagsRelease HistoryDetailsSummary
  Better Bounds for Online Scheduling

Albers, S. (1997). Better Bounds for Online Scheduling. In Proceedings of the 29th Annual ACM Symposium on Theory of Computing (STOC-97) (pp. 130-139). New York: ACM Press.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-38FA-6 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-38FB-4
Genre: Conference Paper

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Albers, Susanne1, 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-021997
 Publication Status: Issued
 Pages: -
 Publishing info: New York : ACM Press
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 517706
Other: Local-ID: C1256428004B93B8-1E191D59D9A06B37C12565B80036FB0D-Albers97a
 Degree: -

Event

show
hide
Title: Untitled Event
Place of Event: El Paso, Texas
Start-/End Date: 1997

Legal Case

show

Project information

show

Source 1

show
hide
Title: Proceedings of the 29th Annual ACM Symposium on Theory of Computing (STOC-97)
Source Genre: Proceedings
 Creator(s):
Affiliations:
Publ. Info: New York : ACM Press
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 130 - 139 Identifier: -