Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Scharbrodt, Mark"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A new average case analysis for completion time scheduling
Mark Scharbrodt
,
Thomas Schickinger
,
Angelika Steger
Journal of the ACM
53
(1), 2006, pp. 121-146
A new average case analysis for completion time scheduling
Mark Scharbrodt
,
Thomas Schickinger
,
Angelika Steger
Proceedings of the 34th Annual ACM Symposium on Theory of Computing, STOC'2002 (Montreal, Quebec, Canada, May 19-21, 2002)
, 2002, pp. 170-178
Models and efficient algorithms for parallel architectures and schedules
Mark Scharbrodt
SFB 342 Final Colloquium: Methods and Tools for the Efficient use of Parallel Systems, 2000, pp. 105-123
Approximability of scheduling with fixed jobs
Mark Scharbrodt
,
Angelika Steger
,
Horst Weisser
Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'99 (Baltimore, Maryland, January 17-19, 1999)
, 1999, pp. 961-962
The thickness of graphs: A survey
Petra Mutzel
,
Thomas Odenthal
,
Mark Scharbrodt
Graphs and Combinatorics
14
(1), 1998, pp. 59-73