Angelika Steger
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
34
Venues
16
Active years
1989–2025
Best venue rank
A*
Where they publish
Papers
34 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2025 | ICLR | Learning Randomized Algorithms with Transformers. | Johannes von Oswald, Seijin Kobayashi, Yassir Akram, Angelika Steger |
| 2024 | ICLR | Discovering modular solutions that generalize compositionally. | Simon Schug, Seijin Kobayashi, Yassir Akram, Maciej Wolczyk, Alexandra Maria Proca, Johannes von Oswald, Razvan Pascanu, Joo Sacramento, Angelika Steger |
| 2020 | ESA | An Optimal Decentralized (Δ + 1)-Coloring Algorithm. | Daniel Bertschinger, Johannes Lengler, Anders Martinsson, Robert Meier, Angelika Steger, Milos Trujic, Emo Welzl |
| 2019 | GECCO | The (1 + 1)-EA with mutation rate (1 + ϵ)/ | Johannes Lengler, Anders Martinsson, Angelika Steger |
| 2019 | ICML | Optimal Kronecker-Sum Approximation of Real Time Recurrent Learning. | Frederik Benzing, Marcelo Matheus Gauy, Asier Mujika, Anders Martinsson, Angelika Steger |
| 2018 | GECCO | The linear hidden subset problem for the (1 + 1) EA with scheduled and adaptive mutation rates. | Hafsteinn Einarsson, Johannes Lengler, Marcelo Matheus Gauy, Florian Meier, Asier Mujika, Angelika Steger, Felix Weissenberger |
| 2017 | SIROCCO | A General Lower Bound for Collaborative Tree Exploration. | Yann Disser, Frank Mousset, Andreas Noever, Nemanja Skoric, Angelika Steger |
| 2015 | ICALP | Normalization Phenomena in Asynchronous Networks. | Amin Karbasi, Johannes Lengler, Angelika Steger |
| 2015 | SODA | An algorithmic framework for obtaining lower bounds for random Ramsey problems | Rajko Nenadov, Nemanja Skoric, Angelika Steger |
| 2012 | IJCNN | Recurrent competitive networks can learn locally excitatory topologies. | Florian Jug, Matthew Cook, Angelika Steger |
| 2012 | SODA | The maximum degree of random planar graphs. | Michael Drmota, Omer Gimnez, Marc Noy, Konstantinos Panagiotou, Angelika Steger |
| 2011 | IJCNN | Interacting maps for fast visual interpretation. | Matthew Cook, Luca Gugelmann, Florian Jug, Christoph Krautz, Angelika Steger |
| 2011 | SODA | On the Degree Distribution of Random Planar Graphs. | Konstantinos Panagiotou, Angelika Steger |
| 2010 | ICANN | Unsupervised Learning of Relations. | Matthew Cook, Florian Jug, Christoph Krautz, Angelika Steger |
| 2010 | SODA | Synchrony and Asynchrony in Neural Networks. | Fabian Kuhn, Konstantinos Panagiotou, Joel Spencer, Angelika Steger |
| 2009 | SODA | Maximal biconnected subgraphs of random planar graphs. | Konstantinos Panagiotou, Angelika Steger |
| 2008 | SODA | On properties of random dissections and triangulations. | Nicla Bernasconi, Konstantinos Panagiotou, Angelika Steger |
| 2007 | COLT | Observational Learning in Random Networks. | Julian Lorenz, Martin Marciniszyn, Angelika Steger |
| 2007 | ESA | Optimal Algorithms for | Julian Lorenz, Konstantinos Panagiotou, Angelika Steger |
| 2007 | ICALP | On the Chromatic Number of Random Graphs. | Amin Coja-Oghlan, Konstantinos Panagiotou, Angelika Steger |
| 2007 | SODA | On extremal subgraphs of random graphs. | Graham R. Brightwell, Konstantinos Panagiotou, Angelika Steger |
| 2006 | STOC | A quasi-polynomial time approximation scheme for minimum weight triangulation. | Jan Remy, Angelika Steger |
| 2005 | SODA | Random planar graphs with | Stefanie Gerke, Colin McDiarmid, Angelika Steger, Andreas Weil |
| 2004 | STACS | The Expected Competitive Ratio for Weighted Completion Time Scheduling. | Alexander Souza, Angelika Steger |
| 2002 | STOC | A new average case analysis for completion time scheduling. | Mark Scharbrodt, Thomas Schickinger, Angelika Steger |
| 2000 | STOC | Balanced allocations: the heavily loaded case. | Petra Berenbrink, Artur Czumaj, Angelika Steger, Berthold Vcking |
| 2000 | SOFSEM | Simplified Witness Tree Arguments. | Thomas Schickinger, Angelika Steger |
| 1999 | ESA | Load Balancing Using Bisectors - A Tight Average-Case Analysis. | Stefan Bischof, Thomas Schickinger, Angelika Steger |
| 1999 | SODA | Approximability of Scheduling with Fixed Jobs. | Mark Scharbrodt, Angelika Steger, Horst Weisser |
| 1999 | SPAA | Randomized and Adversarial Load Balancing. | Petra Berenbrink, Tom Friedetzky, Angelika Steger |
| 1997 | ALT | Learning One-Variable Pattern Languages Very Efficiently on Average, in Parallel, and by Asking Queries. | Thomas Erlebach, Peter Rossmanith, Hans Stadtherr, Angelika Steger, Thomas Zeugmann |
| 1997 | STACS | RNC-Approximation Algorithms for the Steiner Problem. | Hans Jrgen Prmel, Angelika Steger |
| 1990 | ICCAD | Finding Clusters in VLSI Circuits. | Jrn Garbers, Hans Jrgen Prmel, Angelika Steger |
| 1989 | ICCAD | Combining partitioning and global routing in sea-of-cells design. | Bernhard Korte, Hans Jrgen Prmel, Angelika Steger |