- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Dimensions
-
21 cm
- Extent
-
22 S.
- Language
-
Englisch
- Bibliographic citation
-
Dagstuhl-Seminar-Report ; 119
- Event
-
Veröffentlichung
- (where)
-
Saarbrücken
- (who)
-
Geschäftsstelle Schloss Dagstuhl, Univ. des Saarlandes
- (when)
-
1996
- Contributor
- Table of contents
- Rights
-
Bei diesem Objekt liegt nur das Inhaltsverzeichnis digital vor. Der Zugriff darauf ist unbeschränkt möglich.
- Last update
-
11.03.2025, 12:02 PM CET
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Flajolet, Philippe
- Internationales Begegnungs- und Forschungszentrum für Informatik
- Geschäftsstelle Schloss Dagstuhl, Univ. des Saarlandes
Time of origin
- 1996
Other Objects (12)
Fundamentals of the average case analysis of particular algorithms
Worst case instances are fragile : average case and smoothed competitive analysis of algorithms
Worst case instances are fragile : average case and smoothed competitive analysis of algorithms
Average case analysis of numerical problems
Structural average case complexity
k-shortest path: average-case analysis and practical improvements
Towards average case complexity analysis of NP optimization problems
Average-case intractability vs. worst-case intractability
Average case considerations for Mergelnsertion
Structure in average case complexity
Average Case Analyse baumorientierter Datenstrukturen
"Avarage case" analysis of algorithms : 07.07. - 11.07.97
Fundamentals of the average case analysis of particular algorithms
Worst case instances are fragile : average case and smoothed competitive analysis of algorithms
Worst case instances are fragile : average case and smoothed competitive analysis of algorithms
Average case analysis of numerical problems
Structural average case complexity
k-shortest path: average-case analysis and practical improvements
Towards average case complexity analysis of NP optimization problems
Average-case intractability vs. worst-case intractability
Average case considerations for Mergelnsertion
Structure in average case complexity
Average Case Analyse baumorientierter Datenstrukturen
"Avarage case" analysis of algorithms : 07.07. - 11.07.97
Fundamentals of the average case analysis of particular algorithms
Worst case instances are fragile : average case and smoothed competitive analysis of algorithms
Worst case instances are fragile : average case and smoothed competitive analysis of algorithms
Average case analysis of numerical problems
Structural average case complexity
k-shortest path: average-case analysis and practical improvements
Towards average case complexity analysis of NP optimization problems
Average-case intractability vs. worst-case intractability
Average case considerations for Mergelnsertion
Structure in average case complexity
Average Case Analyse baumorientierter Datenstrukturen