- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Erschienen in
-
In: 10.1007/s00453-022-01026-7
- Ereignis
-
Veröffentlichung
- (wo)
-
Aachen
- (wer)
-
Universitätsbibliothek der RWTH Aachen
- (wann)
-
2022
- Urheber
-
Lendl, Stefan
Woeginger, Gerhard
Wulf, Lasse
- DOI
-
10.18154/RWTH-2022-08731
- URN
-
urn:nbn:de:101:1-2022091001375609937390
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
25.03.2025, 13:53 MEZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Lendl, Stefan
- Woeginger, Gerhard
- Wulf, Lasse
- Universitätsbibliothek der RWTH Aachen
Entstanden
- 2022
Ähnliche Objekte (12)
Proof of the tree packing conjecture for bounded degree trees
Analysis of write-back caches under fixed-priority preemptive and non-preemptive scheduling
New Results for Non-preemptive Speed Scaling
Das preemptive Warteverlustsystem
Efficient algorithms for disjoint Steiner trees packing problems in planar graphs
Preventing Preemptive Superpower Suicide
Preemptive investment under uncertainty
Preemptive Investment under Uncertainty
On Packing Low-Diameter Spanning Trees: Q/A Session C - Paper C1.B
Container packing
WCET analysis for preemptive scheduling
Gates, fees, and preemptive runs
Proof of the tree packing conjecture for bounded degree trees
Analysis of write-back caches under fixed-priority preemptive and non-preemptive scheduling
New Results for Non-preemptive Speed Scaling
Das preemptive Warteverlustsystem
Efficient algorithms for disjoint Steiner trees packing problems in planar graphs
Preventing Preemptive Superpower Suicide
Preemptive investment under uncertainty
Preemptive Investment under Uncertainty
On Packing Low-Diameter Spanning Trees: Q/A Session C - Paper C1.B
Container packing
WCET analysis for preemptive scheduling
Gates, fees, and preemptive runs
Proof of the tree packing conjecture for bounded degree trees
Analysis of write-back caches under fixed-priority preemptive and non-preemptive scheduling
New Results for Non-preemptive Speed Scaling
Das preemptive Warteverlustsystem
Efficient algorithms for disjoint Steiner trees packing problems in planar graphs
Preventing Preemptive Superpower Suicide
Preemptive investment under uncertainty
Preemptive Investment under Uncertainty
On Packing Low-Diameter Spanning Trees: Q/A Session C - Paper C1.B
Container packing
WCET analysis for preemptive scheduling