PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Steger, Angelika"

Author of the publication

copydeleteadd this publication to your clipboard
Approximability of Scheduling with Fixed Jobs.

, , and . SODA, page 961-962. ACM/SIAM, (1999)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Hon. -Prof. Dr. Christian Steger University of Stuttgart

Angelika Edelmann University of Stuttgart

PD Dr. Angelika Karger University of Stuttgart

Angelika Budjan University of Stuttgart

apl. Prof. Dr. Angelika Haußer University of Stuttgart

 

Other publications of authors with the same name

Coloring the Edges of a Random Graph without a Monochromatic Giant Component., , and . Electr. J. Comb., (2010)A high-capacity model for one shot association learning in the brain., , and . Front. Comput. Neurosci., (2014)A new average case analysis for completion time scheduling., , and . J. ACM, 53 (1): 121-146 (2006)Optimal Algorithms for k-Search with Application in Option Pricing., , and . Algorithmica, 55 (2): 311-328 (2009)Probabilistically checkable proofs and their consequences for approximation algorithms., , and . Discrete Mathematics, 136 (1-3): 175-223 (1994)Counting H-free graphs., and . Discrete Mathematics, 154 (1-3): 311-315 (1996)Learning One-Variable Pattern Languages Very Efficiently on Average, in Parallel, and by Asking Queries., , , , and . ALT, volume 1316 of Lecture Notes in Computer Science, page 260-276. Springer, (1997)Load Balancing Using Bisectors - A Tight Average-Case Analysis., , and . ESA, volume 1643 of Lecture Notes in Computer Science, page 172-183. Springer, (1999)Combining partitioning and global routing in sea-of-cells design., , and . ICCAD, page 98-101. IEEE Computer Society, (1989)The Expected Competitive Ratio for Weighted Completion Time Scheduling., and . STACS, volume 2996 of Lecture Notes in Computer Science, page 620-631. Springer, (2004)