Angelika Steger

Affiliations:
  • ETH Zurich, Switzerland


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

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Discovering modular solutions that generalize compositionally.
CoRR, 2023

Gated recurrent neural networks discover attention.
CoRR, 2023

A Simple Optimal Algorithm for the 2-Arm Bandit Problem.
Proceedings of the 2023 Symposium on Simplicity in Algorithms, 2023

2022
Triangle resilience of the square of a Hamilton cycle in random graphs.
J. Comb. Theory B, 2022

Random initialisations performing above chance and how to find them.
CoRR, 2022

Solving Static Permutation Mastermind using $O(n \log n)$ Queries.
Electron. J. Comb., 2022

2021
Evaluating Disentanglement of Structured Latent Representations.
CoRR, 2021

An O(N) Time Algorithm for Finding Hamilton Cycles with High Probability.
Proceedings of the 12th Innovations in Theoretical Computer Science Conference, 2021

2020
A general lower bound for collaborative tree exploration.
Theor. Comput. Sci., 2020

Adaptive Tuning Curve Widths Improve Sample Efficient Learning.
Frontiers Comput. Neurosci., 2020

An Optimal Decentralized (Δ + 1)-Coloring Algorithm.
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.
Theor. Comput. Sci., 2019

Resilience of perfect matchings and Hamiltonicity in random graph processes.
Random Struct. Algorithms, 2019

Bootstrap percolation with inhibition.
Random Struct. Algorithms, 2019

Mutual Inhibition with Few Inhibitory Cells via Nonlinear Inhibitory Synaptic Interaction.
Neural Comput., 2019

Improving Gradient Estimation in Evolutionary Strategies With Past Descent Directions.
CoRR, 2019

Decoupling Hierarchical Recurrent Neural Networks With Locally Computable Losses.
CoRR, 2019

Optimal Kronecker-Sum Approximation of Real Time Recurrent Learning.
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).
Proceedings of the Genetic and Evolutionary Computation Conference Companion, 2019

The Maximum Label Propagation Algorithm on Sparse Random Graphs.
Proceedings of the Approximation, 2019

When Does Hillclimbing Fail on Monotone Functions: An entropy compression argument.
Proceedings of the Sixteenth Workshop on Analytic Algorithmics and Combinatorics, 2019

2018
Local resilience of an almost spanning k-cycle in random graphs.
Random Struct. Algorithms, 2018

Drift Analysis and Evolutionary Algorithms Revisited.
Comb. Probab. Comput., 2018

Approximating Real-Time Recurrent Learning with Random Kronecker Factors.
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.
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.
Proceedings of the Genetic and Evolutionary Computation Conference, 2018

2017
Multiassociative Memory: Recurrent Synapses Increase Storage Capacity.
Neural Comput., 2017

An algorithmic framework for obtaining lower bounds for random Ramsey problems.
J. Comb. Theory B, 2017

Long Synfire Chains Emerge by Spike-Timing Dependent Plasticity Modulated by Population Activity.
Int. J. Neural Syst., 2017

A Model of Fast Hebbian Spike Latency Normalization.
Frontiers Comput. Neurosci., 2017

Local Resilience for Squares of Almost Spanning Cycles in Sparse Random Graphs.
Electron. J. Comb., 2017

Unique reconstruction threshold for random jigsaw puzzles.
Chic. J. Theor. Comput. Sci., 2017

Note on the coefficient of variations of neuronal spike trains.
Biol. Cybern., 2017

Fast-Slow Recurrent Neural Networks.
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.
Random Struct. Algorithms, 2016

Random directed graphs are robustly Hamiltonian.
Random Struct. Algorithms, 2016

A Short Proof of the Random Ramsey Theorem.
Comb. Probab. Comput., 2016

Polynomial Lower Bound for Distributed Graph Coloring in a Weak LOCAL Model.
Proceedings of the Distributed Computing - 30th International Symposium, 2016

2015
Maximizing the Minimum Load for Random Processing Times.
ACM Trans. Algorithms, 2015

An algorithmic framework for obtaining lower bounds for random Ramsey problems <i>extended abstract</i>.
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

Normalization Phenomena in Asynchronous Networks.
Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

2014
On the Number of Graphs Without Large Cliques.
SIAM J. Discret. Math., 2014

A high-capacity model for one shot association learning in the brain.
Frontiers Comput. Neurosci., 2014

The Game Chromatic Number of Dense Random Graphs.
Electron. J. Comb., 2014

2013
On the Insertion Time of Cuckoo Hashing.
SIAM J. Comput., 2013

2012
Extremal subgraphs of random graphs.
Random Struct. Algorithms, 2012

The maximum degree of random planar graphs.
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

Recurrent competitive networks can learn locally excitatory topologies.
Proceedings of the 2012 International Joint Conference on Neural Networks (IJCNN), 2012

2011
Explosive Percolation in Erdős-Rényi-Like Random Graph Processes.
Electron. Notes Discret. Math., 2011

A Randomized Version of Ramsey's Theorem.
Electron. Notes Discret. Math., 2011

Pegging Graphs Yields a Small Diameter.
Comb. Probab. Comput., 2011

On the Degree Distribution of Random Planar Graphs.
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

Interacting maps for fast visual interpretation.
Proceedings of the 2011 International Joint Conference on Neural Networks, 2011

2010
Maximal biconnected subgraphs of random planar graphs.
ACM Trans. Algorithms, 2010

Offline thresholds for Ramsey-type games on random graphs.
Random Struct. Algorithms, 2010

On properties of random dissections and triangulations.
Comb., 2010

Synchrony and Asynchrony in Neural Networks.
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

Unsupervised Learning of Relations.
Proceedings of the Artificial Neural Networks - ICANN 2010, 2010

2009
Asymmetric Ramsey properties of random graphs involving cliques.
Random Struct. Algorithms, 2009

A tight bound on the collection of edges in MSTs of induced subgraphs.
J. Comb. Theory B, 2009

A quasi-polynomial time approximation scheme for minimum weight triangulation.
J. ACM, 2009

Coloring the edges of a random graph without a monochromatic giant component.
Electron. Notes Discret. Math., 2009

A note on the chromatic number of a dense random graph.
Discret. Math., 2009

Online Ramsey Games in Random Graphs.
Comb. Probab. Comput., 2009

Upper Bounds for Online Ramsey Games in Random Graphs.
Comb. Probab. Comput., 2009

The Degree Sequence of Random Graphs from Subcritical Classes.
Comb. Probab. Comput., 2009

Approximation Schemes for Node-Weighted Geometric Steiner Tree Problems.
Algorithmica, 2009

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

2008
Fehlererkennende Codes: Was ist eigentlich EAN?.
Proceedings of the Taschenbuch der Algorithmen, 2008

The random planar graph process.
Random Struct. Algorithms, 2008

On the chromatic number of random graphs.
J. Comb. Theory B, 2008

On the Resilience of Long Cycles in Random Graphs.
Electron. J. Comb., 2008

On the Degree Sequences of Random Outerplanar and Series-Parallel Graphs.
Proceedings of the Approximation, 2008

2007
A probabilistic counting lemma for complete graphs.
Random Struct. Algorithms, 2007

Small subsets inherit sparse epsilon-regularity.
J. Comb. Theory B, 2007

On an Online Spanning Tree Problem in Randomly Weighted Graphs.
Comb. Probab. Comput., 2007

A Characterization for Sparse epsilon-Regular Pairs.
Electron. J. Comb., 2007

<i>K</i> <sub>4</sub>-free subgraphs of random graphs revisited.
Comb., 2007

Observational Learning in Random Networks.
Proceedings of the Learning Theory, 20th Annual Conference on Learning Theory, 2007

2006
Balanced Allocations: The Heavily Loaded Case.
SIAM J. Comput., 2006

The Expected Competitive Ratio for Weighted Completion Time Scheduling.
Theory Comput. Syst., 2006

A new average case analysis for completion time scheduling.
J. ACM, 2006

Threshold Functions for Asymmetric Ramsey Properties Involving Cliques.
Proceedings of the Approximation, 2006

2005
Random planar graphs.
J. Comb. Theory B, 2005

On the Evolution of Triangle-Free Graphs.
Comb. Probab. Comput., 2005

Fast Algorithms for Weighted Bipartite Matching.
Proceedings of the Experimental and Efficient Algorithms, 4th InternationalWorkshop, 2005

Random planar graphs with <i>n</i> nodes and a fixed number of edges.
Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

The sparse regularity lemma and its applications.
Proceedings of the Surveys in Combinatorics, 2005

The Online Clique Avoidance Game on Random Graphs.
Proceedings of the Approximation, 2005

2004
K<sub>5</sub>-free subgraphs of random graphs.
Random Struct. Algorithms, 2004

E-Jigsaw: Computergestützte Rekonstruktion zerrissener Stasi-Unterlagen.
Inform. Spektrum, 2004

2002
A note on triangle-free and bipartite graphs.
Discret. Math., 2002

2001
Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries.
Theor. Comput. Sci., 2001

On the structure of clique-free graphs.
Random Struct. Algorithms, 2001

Phase Transitions in the Evolution of Partial Orders.
J. Comb. Theory A, 2001

Asymptotic enumeration, global structure, and constrained evolution.
Discret. Math., 2001

Counting Partial Orders With A Fixed Number Of Comparable Pairs.
Comb. Probab. Comput., 2001

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

Simplified Witness Tree Arguments.
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.
Comb. Probab. Comput., 1999

Randomized and Adversarial Load Balancing.
Proceedings of the Eleventh Annual ACM Symposium on Parallel Algorithms and Architectures, 1999

Approximability of Scheduling with Fixed Jobs.
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

Load Balancing Using Bisectors - A Tight Average-Case Analysis.
Proceedings of the Algorithms, 1999

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

"Balls into Bins" - A Simple and Tight Analysis.
Proceedings of the Randomization and Approximation Techniques in Computer Science, 1998

1997
RNC-Approximation Algorithms for the Steiner Problem.
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.
J. Graph Theory, 1996

Tidier Examples for Lower Bounds on Diagonal Ramsey Numbers.
J. Comb. Theory A, 1996

The Average Number of Linear Extensions of a Partial Order.
J. Comb. Theory A, 1996

Counting H-free graphs.
Discret. Math., 1996

1995
Random I-Cororable Graphs.
Random Struct. Algorithms, 1995

1994
Probabilistically checkable proofs and their consequences for approximation algorithms.
Discret. Math., 1994

Testing Hereditary Properties Efficiently on Average.
Proceedings of the Orders, 1994

1993
On induced matchings.
Discret. Math., 1993

Excluding Induced Subgraphs II: Extremal Graphs.
Discret. Appl. Math., 1993

Extremal Graph Problems for Graphs with a Color-Critical Vertex.
Comb. Probab. Comput., 1993

1992
Coloring Clique-free Graphs in Linear Expected Time.
Random Struct. Algorithms, 1992

Almost all Berge Graphs are Perfect.
Comb. Probab. Comput., 1992

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

1991
Excluding Induced Subgraphs: Quadrilaterals.
Random Struct. Algorithms, 1991

The asymptotic structure of H-free graphs.
Proceedings of the Graph Structure Theory, 1991

1990
Globale und lokale Verdrahtungsalgorithmen für Sea-of-Cells Design.
Inform. Forsch. Entwickl., 1990

Finding Clusters in VLSI Circuits.
Proceedings of the IEEE/ACM International Conference on Computer-Aided Design, 1990

VLSI: placement based on routing and timing information.
Proceedings of the European Design Automation Conference, 1990

1989
Combining partitioning and global routing in sea-of-cells design.
Proceedings of the 1989 IEEE International Conference on Computer-Aided Design, 1989


  Loading...