Home News About Us Contact Contributors Disclaimer Privacy Policy Help FAQ

Home
Search
Quick Search
Advanced
Fulltext
Browse
Collections
Persons
My eDoc
Session History
Login
Name:
Password:
Documentation
Help
Support Wiki
Direct access to
document ID:


          Institute: MPI für Informatik     Collection: Algorithms and Complexity Group     Display Documents



ID: 231238.0, MPI für Informatik / Algorithms and Complexity Group
Worst case instances are fragile: average case and smoothed competitive analysis of algorithms
Authors:Schäfer, Guido
Language:English
Name of University:Universität des Saarlandes
Place of University:Saarbrücken
Audience:Experts Only
Last Change of the Resource (YYYY-MM-DD):2005-02-02
Document Type:PhD-Thesis
Communicated by:Kurt Mehlhorn
Affiliations:MPI für Informatik/Algorithms and Complexity Group
Identifiers:LOCALID:C1256428004B93B8-16D055C6351F1DBCC1256F9C0032A4EE-...
The scope and number of records on eDoc is subject to the collection policies defined by each institute - see "info" button in the collection browse view.