Angelika Steger
Affiliations:- ETH Zurich, Switzerland
According to our database1,
Angelika Steger
authored at least 125 papers
between 1989 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on id.loc.gov
-
on d-nb.info
-
on dl.acm.org
On csauthors.net:
Bibliography
2024
Proceedings of the Twelfth International Conference on Learning Representations, 2024
2023
Proceedings of the 2023 Symposium on Simplicity in Algorithms, 2023
2022
J. Comb. Theory B, 2022
Electron. J. Comb., 2022
2021
Proceedings of the 12th Innovations in Theoretical Computer Science Conference, 2021
2020
Frontiers Comput. Neurosci., 2020
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
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
CoRR, 2019
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
Proceedings of the Approximation, 2019
Proceedings of the Sixteenth Workshop on Analytic Algorithmics and Combinatorics, 2019
2018
Random Struct. Algorithms, 2018
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018
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
Neural Comput., 2017
J. Comb. Theory B, 2017
Long Synfire Chains Emerge by Spike-Timing Dependent Plasticity Modulated by Population Activity.
Int. J. Neural Syst., 2017
Frontiers Comput. Neurosci., 2017
Electron. J. Comb., 2017
Chic. J. Theor. Comput. Sci., 2017
Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017
2016
Random Struct. Algorithms, 2016
Proceedings of the Distributed Computing - 30th International Symposium, 2016
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
Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015
2014
Frontiers Comput. Neurosci., 2014
2013
2012
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012
Proceedings of the 2012 International Joint Conference on Neural Networks (IJCNN), 2012
2011
Electron. Notes Discret. Math., 2011
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011
Proceedings of the 2011 International Joint Conference on Neural Networks, 2011
2010
Random Struct. Algorithms, 2010
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010
Proceedings of the Artificial Neural Networks - ICANN 2010, 2010
2009
Random Struct. Algorithms, 2009
J. Comb. Theory B, 2009
J. ACM, 2009
Electron. Notes Discret. Math., 2009
Comb. Probab. Comput., 2009
Algorithmica, 2009
Algorithmica, 2009
2008
Proceedings of the Taschenbuch der Algorithmen, 2008
Proceedings of the Approximation, 2008
2007
Comb. Probab. Comput., 2007
Proceedings of the Learning Theory, 20th Annual Conference on Learning Theory, 2007
2006
Theory Comput. Syst., 2006
Proceedings of the Approximation, 2006
2005
Proceedings of the Experimental and Efficient Algorithms, 4th InternationalWorkshop, 2005
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
Proceedings of the Approximation, 2005
2004
Inform. Spektrum, 2004
2002
2001
Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries.
Theor. Comput. Sci., 2001
Discret. Math., 2001
Comb. Probab. Comput., 2001
2000
A New Approximation Algorithm for the Steiner Tree Problem with Performance Ratio 5/3.
J. Algorithms, 2000
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
Proceedings of the Eleventh Annual ACM Symposium on Parallel Algorithms and Architectures, 1999
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999
Proceedings of the Algorithms, 1999
1998
An Extremal Problem For Random Graphs And The Number Of Graphs With Large Even-Girth.
Comb., 1998
Proceedings of the Randomization and Approximation Techniques in Computer Science, 1998
1997
Proceedings of the STACS 97, 14th Annual Symposium on Theoretical Aspects of Computer Science, Lübeck, Germany, February 27, 1997
1996
1995
1994
Probabilistically checkable proofs and their consequences for approximation algorithms.
Discret. Math., 1994
Proceedings of the Orders, 1994
1993
Comb. Probab. Comput., 1993
1992
Comb., 1992
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
Proceedings of the IEEE/ACM International Conference on Computer-Aided Design, 1990
Proceedings of the European Design Automation Conference, 1990
1989
Proceedings of the 1989 IEEE International Conference on Computer-Aided Design, 1989