Subject Areas

8 hits in 0.006 sec.

A faster combinatorial approximation algorithm for scheduling unrelated parallel machines [Score: 100%]
Author / Editor: Gairing, Martin; Monien, Burkhard; Woclaw, Andreas |  Place of publication: Berlin [u.a.] |  Publisher: Springer |  Year of Publication: 2005 | 12 s.
Journal / Series / Collection: Automata, languages and programming
Subject Area: Informatik
[Search within document] [PDF-Download]
Exact price of anarchy for polynomial congestion games [Score: 100%]
Author / Editor: Aland, Sebastian; Monien, Burkhard |  Place of publication: Berlin [u.a.] |  Publisher: Springer |  Year of Publication: 2006 | 12 s.
Journal / Series / Collection: STACS 2006
Subject Area: Informatik
[Search within document] [PDF-Download]
Two-way multihead automata over a one-letter alphabet [Score: 100%]
Author / Editor: Monien, Burkhard |  Place of publication: Paris |  Publisher: Dunod |  Year of Publication: 1980 | 16 s.
Journal / Series / Collection: Revue française d'automatique, d'informatique et de recherche opérationnelle; 14
Subject Area: Informatik
[Search within document] [PDF-Download]
Computing nash equilibria for scheduling on restricted parallel links [Score: 100%]
Author / Editor: Gairing, Martin; Monien, Burkhard |  Place of publication: New York, NY |  Publisher: Association for Computing Machinery |  Year of Publication: 2004 | 10 s.
Journal / Series / Collection: Proceedings of the 36th ACM Symposion on Theory of Computing, Chicago, Ill., June 13-15,2004
Subject Area: Informatik
[Search within document] [PDF-Download]
Selfish routing with incomplete information [Score: 100%]
Author / Editor: Gairing, Martin; Monien, Burkhard; Tiemann, Karsten |  Place of publication: New York, NY |  Publisher: Association for Computing Machinery |  Year of Publication: 2005 | 10 s.
Journal / Series / Collection: SPAA 2005 : Seventeenth Annual ACM Symposium on parallelism in algorithms and architectures, July 18-20, 2005, Las Vegas, Nevada, USA
Subject Area: Informatik
[Search within document] [PDF-Download]
[External link] How to find long paths efficiently [Score: 100%]
Author / Editor: Monien, Burkhard |  Place of publication: Amsterdam |  Publisher: North-Holland Publishing |  Year of Publication: 1985
Journal / Series / Collection: Annals of discrete mathematics; 109
Subject Area: Mathematik; Informatik
[External link] Efficient schemes for nearest neighbor load balancing; 7 [Score: 100%]
Author / Editor: Diekmann, Ralf; Frommer, Andreas; Monien, Burkhard |  Place of publication: Amsterdam [u.a.] |  Publisher: Elsevier |  Year of Publication: 1999
Journal / Series / Collection: Parallel computing; 25
Subject Area: Informatik
[External link] Sparse topologies with small spectrum size; 3 [Score: 100%]
Author / Editor: Elsässer, Robert; Královič, Richard; Monien, Burkhard |  Place of publication: Amsterdam [u.a.] |  Publisher: Elsevier |  Year of Publication: 2003
Journal / Series / Collection: Theoretical computer science; 307
Subject Area: Informatik

Active filters [Remove filter]

Drill down result

Language