Angelika Steger

According to our database, Angelika Steger authored at least 125 papers between 1989 and 2023.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2023

Discovering modular solutions that generalize compositionally.

Simon Schug, Seijin Kobayashi, Yassir Akram, Maciej Wolczyk, Alexandra Proca, Johannes von Oswald, Razvan Pascanu, João Sacramento, Angelika Steger

CoRR, 2023

Gated recurrent neural networks discover attention.

Nicolas Zucchet, Seijin Kobayashi, Yassir Akram, Johannes von Oswald, Maxime Larcher, Angelika Steger, João Sacramento

CoRR, 2023

A Simple Optimal Algorithm for the 2-Arm Bandit Problem.

Maxime Larcher, Robert Meier, Angelika Steger

Proceedings of the 2023 Symposium on Simplicity in Algorithms, 2023

2022

Triangle resilience of the square of a Hamilton cycle in random graphs.

Manuela Fischer, Nemanja Skoric, Angelika Steger, Milos Trujic

J. Comb. Theory, Ser. B, 2022

Random initialisations performing above chance and how to find them.

Frederik Benzing, Simon Schug, Robert Meier, Johannes von Oswald, Yassir Akram, Nicolas Zucchet, Laurence Aitchison, Angelika Steger

CoRR, 2022

Solving Static Permutation Mastermind using $O(n \log n)$ Queries.

Maxime Larcher, Anders Martinsson, Angelika Steger

Electron. J. Comb., 2022

2021

Evaluating Disentanglement of Structured Latent Representations.

Raphaël Dang-Nhu, Angelika Steger

CoRR, 2021

An O(N) Time Algorithm for Finding Hamilton Cycles with High Probability.

Rajko Nenadov, Angelika Steger, Pascal Su

Proceedings of the 12th Innovations in Theoretical Computer Science Conference, 2021

2020

A general lower bound for collaborative tree exploration.

Yann Disser, Frank Mousset, Andreas Noever, Nemanja Skoric, Angelika Steger

Theor. Comput. Sci., 2020

Adaptive Tuning Curve Widths Improve Sample Efficient Learning.

Florian Meier, Raphaël Dang-Nhu, Angelika Steger

Frontiers Comput. Neurosci., 2020

An Optimal Decentralized (Δ + 1)-Coloring Algorithm.

Daniel Bertschinger, Johannes Lengler, Anders Martinsson, Robert Meier, Angelika Steger, Milos Trujic, Emo Welzl

Proceedings of the 28th Annual European Symposium on Algorithms, 2020

2019

The linear hidden subset problem for the (1 + 1) EA with scheduled and adaptive mutation rates.

Hafsteinn Einarsson, Marcelo Matheus Gauy, Johannes Lengler, Florian Meier, Asier Mujika, Angelika Steger, Felix Weissenberger

Theor. Comput. Sci., 2019

Resilience of perfect matchings and Hamiltonicity in random graph processes.

Rajko Nenadov, Angelika Steger, Milos Trujic

Random Struct. Algorithms, 2019

Bootstrap percolation with inhibition.

Hafsteinn Einarsson, Johannes Lengler, Frank Mousset, Konstantinos Panagiotou, Angelika Steger

Random Struct. Algorithms, 2019

Mutual Inhibition with Few Inhibitory Cells via Nonlinear Inhibitory Synaptic Interaction.

Felix Weissenberger, Marcelo Matheus Gauy, Xun Zou, Angelika Steger

Neural Comput., 2019

Improving Gradient Estimation in Evolutionary Strategies With Past Descent Directions.

Florian Meier, Asier Mujika, Marcelo Matheus Gauy, Angelika Steger

CoRR, 2019

Decoupling Hierarchical Recurrent Neural Networks With Locally Computable Losses.

Asier Mujika, Felix Weissenberger, Angelika Steger

CoRR, 2019

Optimal Kronecker-Sum Approximation of Real Time Recurrent Learning.

Frederik Benzing, Marcelo Matheus Gauy, Asier Mujika, Anders Martinsson, Angelika Steger

Proceedings of the 36th International Conference on Machine Learning, 2019

The (1 + 1)-EA with mutation rate (1 + ϵ)/<i>n</i> is efficient on monotone functions: an entropy compression argument. (hot-off-the-press track at GECCO 2019).

Johannes Lengler, Anders Martinsson, Angelika Steger

Proceedings of the Genetic and Evolutionary Computation Conference Companion, 2019

The Maximum Label Propagation Algorithm on Sparse Random Graphs.

Charlotte Knierim, Johannes Lengler, Pascal Pfister, Ulysse Schaller, Angelika Steger

Proceedings of the Approximation, 2019

When Does Hillclimbing Fail on Monotone Functions: An entropy compression argument.

Johannes Lengler, Anders Martinsson, Angelika Steger

Proceedings of the Sixteenth Workshop on Analytic Algorithmics and Combinatorics, 2019

2018

Local resilience of an almost spanning k-cycle in random graphs.

Nemanja Skoric, Angelika Steger, Milos Trujic

Random Struct. Algorithms, 2018

Drift Analysis and Evolutionary Algorithms Revisited.

Johannes Lengler, Angelika Steger

Comb. Probab. Comput., 2018

Approximating Real-Time Recurrent Learning with Random Kronecker Factors.

Asier Mujika, Florian Meier, Angelika Steger

Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Even Flying Cops Should Think Ahead.

Anders Martinsson, Florian Meier, Patrick Schnider, Angelika Steger

Proceedings of the Combinatorial Optimization - 5th International Symposium, 2018

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

Proceedings of the Genetic and Evolutionary Computation Conference, 2018

2017

Multiassociative Memory: Recurrent Synapses Increase Storage Capacity.

Marcelo Matheus Gauy, Florian Meier, Angelika Steger

Neural Comput., 2017

An algorithmic framework for obtaining lower bounds for random Ramsey problems.

Rajko Nenadov, Yury Person, Nemanja Skoric, Angelika Steger

J. Comb. Theory, Ser. B, 2017

Long Synfire Chains Emerge by Spike-Timing Dependent Plasticity Modulated by Population Activity.

Felix Weissenberger, Florian Meier, Johannes Lengler, Hafsteinn Einarsson, Angelika Steger

Int. J. Neural Syst., 2017

A Model of Fast Hebbian Spike Latency Normalization.

Hafsteinn Einarsson, Marcelo M. Gauy, Johannes Lengler, Angelika Steger

Frontiers Comput. Neurosci., 2017

Local Resilience for Squares of Almost Spanning Cycles in Sparse Random Graphs.

Andreas Noever, Angelika Steger

Electron. J. Comb., 2017

Unique reconstruction threshold for random jigsaw puzzles.

Rajko Nenadov, Pascal Pfister, Angelika Steger

Chic. J. Theor. Comput. Sci., 2017

Note on the coefficient of variations of neuronal spike trains.

Johannes Lengler, Angelika Steger

Biol. Cybern., 2017

Fast-Slow Recurrent Neural Networks.

Asier Mujika, Florian Meier, Angelika Steger

Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

2016

On the threshold for the Maker-Breaker <i>H</i>-game.

Rajko Nenadov, Angelika Steger, Milos Stojakovic

Random Struct. Algorithms, 2016

Random directed graphs are robustly Hamiltonian.

Dan Hefetz, Angelika Steger, Benny Sudakov

Random Struct. Algorithms, 2016

A Short Proof of the Random Ramsey Theorem.

Rajko Nenadov, Angelika Steger

Comb. Probab. Comput., 2016

Polynomial Lower Bound for Distributed Graph Coloring in a Weak LOCAL Model.

Dan Hefetz, Fabian Kuhn, Yannic Maus, Angelika Steger

Proceedings of the Distributed Computing - 30th International Symposium, 2016

2015

Maximizing the Minimum Load for Random Processing Times.

Stefanie Gerke, Konstantinos Panagiotou, Justus Schwartz, Angelika Steger

ACM Trans. Algorithms, 2015

An algorithmic framework for obtaining lower bounds for random Ramsey problems <i>extended abstract</i>.

Rajko Nenadov, Nemanja Skoric, Angelika Steger

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

Normalization Phenomena in Asynchronous Networks.

Amin Karbasi, Johannes Lengler, Angelika Steger

Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

2014

On the Number of Graphs Without Large Cliques.

Frank Mousset, Rajko Nenadov, Angelika Steger

SIAM J. Discret. Math., 2014

A high-capacity model for one shot association learning in the brain.

Hafsteinn Einarsson, Johannes Lengler, Angelika Steger

Frontiers Comput. Neurosci., 2014

The Game Chromatic Number of Dense Random Graphs.

Ralph Keusch, Angelika Steger

Electron. J. Comb., 2014

2013

On the Insertion Time of Cuckoo Hashing.

Nikolaos Fountoulakis, Konstantinos Panagiotou, Angelika Steger

SIAM J. Comput., 2013

2012

Extremal subgraphs of random graphs.

Graham R. Brightwell, Konstantinos Panagiotou, Angelika Steger

Random Struct. Algorithms, 2012

The maximum degree of random planar graphs.

Michael Drmota, Omer Giménez, Marc Noy, Konstantinos Panagiotou, Angelika Steger

Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

Recurrent competitive networks can learn locally excitatory topologies.

Florian Jug, Matthew Cook, Angelika Steger

Proceedings of the 2012 International Joint Conference on Neural Networks (IJCNN), 2012

2011

Explosive Percolation in Erdős-Rényi-Like Random Graph Processes.

Konstantinos Panagiotou, Reto Spöhel, Angelika Steger, Henning Thomas

Electron. Notes Discret. Math., 2011

A Randomized Version of Ramsey's Theorem.

Luca Gugelmann, Yury Person, Angelika Steger, Henning Thomas

Electron. Notes Discret. Math., 2011

Pegging Graphs Yields a Small Diameter.

Stefanie Gerke, Angelika Steger, Nicholas C. Wormald

Comb. Probab. Comput., 2011

On the Degree Distribution of Random Planar Graphs.

Konstantinos Panagiotou, Angelika Steger

Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

Interacting maps for fast visual interpretation.

Matthew Cook, Luca Gugelmann, Florian Jug, Christoph Krautz, Angelika Steger

Proceedings of the 2011 International Joint Conference on Neural Networks, 2011

2010

Maximal biconnected subgraphs of random planar graphs.

Konstantinos Panagiotou, Angelika Steger

ACM Trans. Algorithms, 2010

Offline thresholds for Ramsey-type games on random graphs.

Michael Krivelevich, Reto Spöhel, Angelika Steger

Random Struct. Algorithms, 2010

On properties of random dissections and triangulations.

Nicla Bernasconi, Konstantinos Panagiotou, Angelika Steger

Comb., 2010

Synchrony and Asynchrony in Neural Networks.

Fabian Kuhn, Konstantinos Panagiotou, Joel Spencer, Angelika Steger

Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

Unsupervised Learning of Relations.

Matthew Cook, Florian Jug, Christoph Krautz, Angelika Steger

Proceedings of the Artificial Neural Networks - ICANN 2010, 2010

2009

Asymmetric Ramsey properties of random graphs involving cliques.

Martin Marciniszyn, Jozef Skokan, Reto Spöhel, Angelika Steger

Random Struct. Algorithms, 2009

A tight bound on the collection of edges in MSTs of induced subgraphs.

Gregory B. Sorkin, Angelika Steger, Rico Zenklusen

J. Comb. Theory, Ser. B, 2009

A quasi-polynomial time approximation scheme for minimum weight triangulation.

Jan Remy, Angelika Steger

J. ACM, 2009

Coloring the edges of a random graph without a monochromatic giant component.

Reto Spöhel, Angelika Steger, Henning Thomas

Electron. Notes Discret. Math., 2009

A note on the chromatic number of a dense random graph.

Konstantinos Panagiotou, Angelika Steger

Discret. Math., 2009

Online Ramsey Games in Random Graphs.

Martin Marciniszyn, Reto Spöhel, Angelika Steger

Comb. Probab. Comput., 2009

Upper Bounds for Online Ramsey Games in Random Graphs.

Martin Marciniszyn, Reto Spöhel, Angelika Steger

Comb. Probab. Comput., 2009

The Degree Sequence of Random Graphs from Subcritical Classes.

Nicla Bernasconi, Konstantinos Panagiotou, Angelika Steger

Comb. Probab. Comput., 2009

Approximation Schemes for Node-Weighted Geometric Steiner Tree Problems.

Jan Remy, Angelika Steger

Algorithmica, 2009

Optimal Algorithms for <i>k</i>-Search with Application in Option Pricing.

Julian Lorenz, Konstantinos Panagiotou, Angelika Steger

Algorithmica, 2009

2008

Fehlererkennende Codes: Was ist eigentlich EAN?.

Alexander Souza, Angelika Steger

Proceedings of the Taschenbuch der Algorithmen, 2008

The random planar graph process.

Stefanie Gerke, Dirk Schlatter, Angelika Steger, Anusch Taraz

Random Struct. Algorithms, 2008

On the chromatic number of random graphs.

Amin Coja-Oghlan, Konstantinos Panagiotou, Angelika Steger

J. Comb. Theory, Ser. B, 2008

On the Resilience of Long Cycles in Random Graphs.

Domingos Dellamonica Jr., Yoshiharu Kohayakawa, Martin Marciniszyn, Angelika Steger

Electron. J. Comb., 2008

On the Degree Sequences of Random Outerplanar and Series-Parallel Graphs.

Nicla Bernasconi, Konstantinos Panagiotou, Angelika Steger

Proceedings of the Approximation, 2008

2007

A probabilistic counting lemma for complete graphs.

Stefanie Gerke, Martin Marciniszyn, Angelika Steger

Random Struct. Algorithms, 2007

Small subsets inherit sparse epsilon-regularity.

Stefanie Gerke, Yoshiharu Kohayakawa, Vojtech Rödl, Angelika Steger

J. Comb. Theory, Ser. B, 2007

On an Online Spanning Tree Problem in Randomly Weighted Graphs.

Jan Remy, Alexander Souza, Angelika Steger

Comb. Probab. Comput., 2007

A Characterization for Sparse epsilon-Regular Pairs.

Stefanie Gerke, Angelika Steger

Electron. J. Comb., 2007

<i>K</i> ₄-free subgraphs of random graphs revisited.

Stefanie Gerke, Hans Jürgen Prömel, Thomas Schickinger, Angelika Steger, Anusch Taraz

Comb., 2007

Observational Learning in Random Networks.

Julian Lorenz, Martin Marciniszyn, Angelika Steger

Proceedings of the Learning Theory, 20th Annual Conference on Learning Theory, 2007

2006

Balanced Allocations: The Heavily Loaded Case.

Petra Berenbrink, Artur Czumaj, Angelika Steger, Berthold Vöcking

SIAM J. Comput., 2006

The Expected Competitive Ratio for Weighted Completion Time Scheduling.

Alexander Souza, Angelika Steger

Theory Comput. Syst., 2006

A new average case analysis for completion time scheduling.

Mark Scharbrodt, Thomas Schickinger, Angelika Steger

J. ACM, 2006

Threshold Functions for Asymmetric Ramsey Properties Involving Cliques.

Martin Marciniszyn, Jozef Skokan, Reto Spöhel, Angelika Steger

Proceedings of the Approximation, 2006

2005

Random planar graphs.

Colin McDiarmid, Angelika Steger, Dominic J. A. Welsh

J. Comb. Theory, Ser. B, 2005

On the Evolution of Triangle-Free Graphs.

Angelika Steger

Comb. Probab. Comput., 2005

Fast Algorithms for Weighted Bipartite Matching.

Justus Schwartz, Angelika Steger, Andreas Weißl

Proceedings of the Experimental and Efficient Algorithms, 4th InternationalWorkshop, 2005

Random planar graphs with <i>n</i> nodes and a fixed number of edges.

Stefanie Gerke, Colin McDiarmid, Angelika Steger, Andreas Weißl

Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

The sparse regularity lemma and its applications.

Stefanie Gerke, Angelika Steger

Proceedings of the Surveys in Combinatorics, 2005

The Online Clique Avoidance Game on Random Graphs.

Martin Marciniszyn, Reto Spöhel, Angelika Steger

Proceedings of the Approximation, 2005

2004

K₅-free subgraphs of random graphs.

Stefanie Gerke, Thomas Schickinger, Angelika Steger

Random Struct. Algorithms, 2004

E-Jigsaw: Computergestützte Rekonstruktion zerrissener Stasi-Unterlagen.

Martin Marciniszyn, Angelika Steger, Andreas Weißl

Inform. Spektrum, 2004

2002

A note on triangle-free and bipartite graphs.

Hans Jürgen Prömel, Thomas Schickinger, Angelika Steger

Discret. Math., 2002

2001

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

Theor. Comput. Sci., 2001

On the structure of clique-free graphs.

Hans Jürgen Prömel, Thomas Schickinger, Angelika Steger

Random Struct. Algorithms, 2001

Phase Transitions in the Evolution of Partial Orders.

Hans Jürgen Prömel, Angelika Steger, Anusch Taraz

J. Comb. Theory, Ser. A, 2001

Asymptotic enumeration, global structure, and constrained evolution.

Hans Jürgen Prömel, Angelika Steger, Anusch Taraz

Discret. Math., 2001

Counting Partial Orders With A Fixed Number Of Comparable Pairs.

Hans Jürgen Prömel, Angelika Steger, Anusch Taraz

Comb. Probab. Comput., 2001

2000

A New Approximation Algorithm for the Steiner Tree Problem with Performance Ratio 5/3.

Hans Jürgen Prömel, Angelika Steger

J. Algorithms, 2000

Simplified Witness Tree Arguments.

Thomas Schickinger, Angelika Steger

Proceedings of the SOFSEM 2000: Theory and Practice of Informatics, 27th Conference on Current Trends in Theory and Practice of Informatics, Milovy, Czech Republic, November 25, 2000

1999

Generating Random Regular Graphs Quickly.

Angelika Steger, Nicholas C. Wormald

Comb. Probab. Comput., 1999

Randomized and Adversarial Load Balancing.

Petra Berenbrink, Tom Friedetzky, Angelika Steger

Proceedings of the Eleventh Annual ACM Symposium on Parallel Algorithms and Architectures, 1999

Approximability of Scheduling with Fixed Jobs.

Mark Scharbrodt, Angelika Steger, Horst Weisser

Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

Load Balancing Using Bisectors - A Tight Average-Case Analysis.

Stefan Bischof, Thomas Schickinger, Angelika Steger

Proceedings of the Algorithms, 1999

1998

An Extremal Problem For Random Graphs And The Number Of Graphs With Large Even-Girth.

Yoshiharu Kohayakawa, Bernd Kreuter, Angelika Steger

Comb., 1998

"Balls into Bins" - A Simple and Tight Analysis.

Martin Raab, Angelika Steger

Proceedings of the Randomization and Approximation Techniques in Computer Science, 1998

1997

RNC-Approximation Algorithms for the Steiner Problem.

Hans Jürgen Prömel, Angelika Steger

Proceedings of the STACS 97, 14th Annual Symposium on Theoretical Aspects of Computer Science, Lübeck, Germany, February 27, 1997

1996

On the asymptotic structure of sparse triangle free graphs.

Hans Jürgen Prömel, Angelika Steger

J. Graph Theory, 1996

Tidier Examples for Lower Bounds on Diagonal Ramsey Numbers.

Colin McDiarmid, Angelika Steger

J. Comb. Theory, Ser. A, 1996

The Average Number of Linear Extensions of a Partial Order.

Graham R. Brightwell, Hans Jürgen Prömel, Angelika Steger

J. Comb. Theory, Ser. A, 1996

Counting H-free graphs.

Hans Jürgen Prömel, Angelika Steger

Discret. Math., 1996

1995

Random I-Cororable Graphs.

Hans Jürgen Prömel, Angelika Steger

Random Struct. Algorithms, 1995

1994

Probabilistically checkable proofs and their consequences for approximation algorithms.

Stefan Hougardy, Hans Jürgen Prömel, Angelika Steger

Discret. Math., 1994

Testing Hereditary Properties Efficiently on Average.

Jens Gustedt, Angelika Steger

Proceedings of the Orders, 1994

1993

On induced matchings.

Angelika Steger, Min-Li Yu

Discret. Math., 1993

Excluding Induced Subgraphs II: Extremal Graphs.

Hans Jürgen Prömel, Angelika Steger

Discret. Appl. Math., 1993

Extremal Graph Problems for Graphs with a Color-Critical Vertex.

Christoph Hundack, Hans Jürgen Prömel, Angelika Steger

Comb. Probab. Comput., 1993

1992

Coloring Clique-free Graphs in Linear Expected Time.

Hans Jürgen Prömel, Angelika Steger

Random Struct. Algorithms, 1992

Almost all Berge Graphs are Perfect.

Hans Jürgen Prömel, Angelika Steger

Comb. Probab. Comput., 1992

The asymptotic number of graphs not containing a fixed color-critical subgraph.

Hans Jürgen Prömel, Angelika Steger

Comb., 1992

1991

Excluding Induced Subgraphs: Quadrilaterals.

Hans Jürgen Prömel, Angelika Steger

Random Struct. Algorithms, 1991

The asymptotic structure of H-free graphs.

Hans Jürgen Prömel, Angelika Steger

Proceedings of the Graph Structure Theory, 1991

1990

Globale und lokale Verdrahtungsalgorithmen für Sea-of-Cells Design.

Asmus Hetzel, Bernhard Korte, Roland Krieger, Hans Jürgen Prömel, Ulf-Dietmar Radicke, Angelika Steger

Inform. Forsch. Entwickl., 1990

Finding Clusters in VLSI Circuits.

Jörn Garbers, Hans Jürgen Prömel, Angelika Steger

Proceedings of the IEEE/ACM International Conference on Computer-Aided Design, 1990

VLSI: placement based on routing and timing information.

Jörn Garbers, Bernhard Korte, Hans Jürgen Prömel, E. Schwietzke, Angelika Steger

Proceedings of the European Design Automation Conference, 1990

1989

Combining partitioning and global routing in sea-of-cells design.

Bernhard Korte, Hans Jürgen Prömel, Angelika Steger

Proceedings of the 1989 IEEE International Conference on Computer-Aided Design, 1989