Hochschulschrift
Design of competitive paging algorithms with good behaviour in practice
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Dimensions
-
30 cm
- Extent
-
VIII, 145 S.
- Language
-
Englisch
- Notes
-
graph. Darst.
Enth. 4 Sonderabdr. aus verschiedenen Zeitschr. und Publ.
Frankfurt (Main), Univ., Diss., 2013 (Nicht für den Austausch)
- Creator
- Table of contents
- Rights
-
Bei diesem Objekt liegt nur das Inhaltsverzeichnis digital vor. Der Zugriff darauf ist unbeschränkt möglich.
- Last update
-
11.06.2025, 1:48 PM CEST
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.
Object type
- Hochschulschrift
Associated
Other Objects (12)
Design of competitive paging algorithms with good behaviour in practice
Competitive Algorithms for Multistage Online Scheduling
Good features beat algorithms
Delay-Induced Periodic Behaviour in Competitive Populations
Good practice guide
Good engineering practice
Uncertainty exploration : algorithms, competitive analysis, and computational experiments
Fraudulence and the competitive supply of public goods
Good Practice - 8: Orientierung
Good Practice - 9: Publizieren
Improved space bounds for strongly competitive randomized paging algorithms
Round-Competitive Algorithms for Uncertainty Problems with Parallel Queries
Design of competitive paging algorithms with good behaviour in practice
Competitive Algorithms for Multistage Online Scheduling
Good features beat algorithms
Delay-Induced Periodic Behaviour in Competitive Populations
Good practice guide
Good engineering practice
Uncertainty exploration : algorithms, competitive analysis, and computational experiments
Fraudulence and the competitive supply of public goods
Good Practice - 8: Orientierung
Good Practice - 9: Publizieren
Improved space bounds for strongly competitive randomized paging algorithms
Round-Competitive Algorithms for Uncertainty Problems with Parallel Queries
Design of competitive paging algorithms with good behaviour in practice
Competitive Algorithms for Multistage Online Scheduling
Good features beat algorithms
Delay-Induced Periodic Behaviour in Competitive Populations
Good practice guide
Good engineering practice
Uncertainty exploration : algorithms, competitive analysis, and computational experiments
Fraudulence and the competitive supply of public goods
Good Practice - 8: Orientierung
Good Practice - 9: Publizieren
Improved space bounds for strongly competitive randomized paging algorithms