( en | de | ru )

 

Disambiguation of "Steger, Angelika"

Author of the publication

copydeleteadd this publication to your clipboard
Approximating Real-Time Recurrent Learning with Random Kronecker Factors.

, , and . NeurIPS, page 6594-6603. (2018)

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.

Angelika Steger

Angelika Klara Steger

Walter Steger

Gerhard Steger

Anna Steger

 

Other publications of authors with the same name

Diskrete Strukturen 1. Kombinatorik, Graphentheorie, Algebra.. Springer, Berlin, 1. korr. Nachdruck 2002 edition, (June 2001)Optimal Algorithms for k-Search with Application in Option Pricing., , and . Algorithmica, 55 (2): 311-328 (2009)Approximability of Scheduling with Fixed Jobs., , and . SODA, page 961-962. ACM/SIAM, (1999)The Expected Competitive Ratio for Weighted Completion Time Scheduling., and . STACS, volume 2996 of Lecture Notes in Computer Science, page 620-631. Springer, (2004)Coloring the Edges of a Random Graph without a Monochromatic Giant Component., , and . Electron. J. Comb., (2010)Probabilistically checkable proofs and their consequences for approximation algorithms., , and . Discret. Math., 136 (1-3): 175-223 (1994)The maximum degree of random planar graphs., , , , and . SODA, page 281-287. SIAM, (2012)On the Degree Sequences of Random Outerplanar and Series-Parallel Graphs., , and . APPROX-RANDOM, volume 5171 of Lecture Notes in Computer Science, page 303-316. Springer, (2008)The Online Clique Avoidance Game on Random Graphs., , and . APPROX-RANDOM, volume 3624 of Lecture Notes in Computer Science, page 390-401. Springer, (2005)An algorithmic framework for obtaining lower bounds for random Ramsey problems., , , and . J. Comb. Theory B, (2017)