Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAngelika Steger
Person information
- affiliation: ETH Zurich, Switzerland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[c50]Maxime Larcher, Robert Meier, Angelika Steger:
A Simple Optimal Algorithm for the 2-Arm Bandit Problem. SOSA 2023: 365-372- 2022
- [j83]Maxime Larcher, Anders Martinsson, Angelika Steger:
Solving Static Permutation Mastermind using $O(n \log n)$ Queries. Electron. J. Comb. 29(1) (2022) - [j82]Manuela Fischer, Nemanja Skoric, Angelika Steger, Milos Trujic
:
Triangle resilience of the square of a Hamilton cycle in random graphs. J. Comb. Theory, Ser. B 152: 171-220 (2022) - [i18]Frederik Benzing, Simon Schug, Robert Meier, Johannes von Oswald, Yassir Akram, Nicolas Zucchet, Laurence Aitchison, Angelika Steger:
Random initialisations performing above chance and how to find them. CoRR abs/2209.07509 (2022) - 2021
- [c49]Rajko Nenadov, Angelika Steger, Pascal Su:
An O(N) Time Algorithm for Finding Hamilton Cycles with High Probability. ITCS 2021: 60:1-60:17 - [i17]Raphaël Dang-Nhu, Angelika Steger:
Evaluating Disentanglement of Structured Latent Representations. CoRR abs/2101.04041 (2021) - 2020
- [j81]Florian Meier, Raphaël Dang-Nhu, Angelika Steger:
Adaptive Tuning Curve Widths Improve Sample Efficient Learning. Frontiers Comput. Neurosci. 14: 12 (2020) - [j80]Yann Disser, Frank Mousset, Andreas Noever, Nemanja Skoric, Angelika Steger:
A general lower bound for collaborative tree exploration. Theor. Comput. Sci. 811: 70-78 (2020) - [c48]Daniel Bertschinger, Johannes Lengler, Anders Martinsson, Robert Meier, Angelika Steger, Milos Trujic, Emo Welzl:
An Optimal Decentralized (Δ + 1)-Coloring Algorithm. ESA 2020: 17:1-17:12 - [i16]Daniel Bertschinger, Johannes Lengler, Anders Martinsson, Robert Meier, Angelika Steger, Milos Trujic, Emo Welzl:
An Optimal Decentralized $(Δ+ 1)$-Coloring Algorithm. CoRR abs/2002.05121 (2020) - [i15]Rajko Nenadov, Angelika Steger, Pascal Su:
An O(n) time algorithm for finding Hamilton cycles with high probability. CoRR abs/2012.02551 (2020)
2010 – 2019
- 2019
- [j79]Felix Weissenberger, Marcelo Matheus Gauy, Xun Zou, Angelika Steger:
Mutual Inhibition with Few Inhibitory Cells via Nonlinear Inhibitory Synaptic Interaction. Neural Comput. 31(11): 2252-2265 (2019) - [j78]Rajko Nenadov, Angelika Steger, Milos Trujic:
Resilience of perfect matchings and Hamiltonicity in random graph processes. Random Struct. Algorithms 54(4): 797-819 (2019) - [j77]Hafsteinn Einarsson, Johannes Lengler, Frank Mousset, Konstantinos Panagiotou, Angelika Steger:
Bootstrap percolation with inhibition. Random Struct. Algorithms 55(4): 881-925 (2019) - [j76]Hafsteinn Einarsson, Marcelo Matheus Gauy, Johannes Lengler, Florian Meier, Asier Mujika, Angelika Steger, Felix Weissenberger:
The linear hidden subset problem for the (1 + 1) EA with scheduled and adaptive mutation rates. Theor. Comput. Sci. 785: 150-170 (2019) - [c47]Johannes Lengler, Anders Martinsson, Angelika Steger:
When Does Hillclimbing Fail on Monotone Functions: An entropy compression argument. ANALCO 2019: 94-102 - [c46]Charlotte Knierim, Johannes Lengler, Pascal Pfister, Ulysse Schaller, Angelika Steger:
The Maximum Label Propagation Algorithm on Sparse Random Graphs. APPROX-RANDOM 2019: 58:1-58:15 - [c45]Johannes Lengler, Anders Martinsson, Angelika Steger:
The (1 + 1)-EA with mutation rate (1 + ϵ)/n is efficient on monotone functions: an entropy compression argument. (hot-off-the-press track at GECCO 2019). GECCO (Companion) 2019: 25-26 - [c44]Frederik Benzing, Marcelo Matheus Gauy, Asier Mujika, Anders Martinsson, Angelika Steger:
Optimal Kronecker-Sum Approximation of Real Time Recurrent Learning. ICML 2019: 604-613 - [i14]Frederik Benzing, Marcelo Matheus Gauy, Asier Mujika, Anders Martinsson, Angelika Steger:
Optimal Kronecker-Sum Approximation of Real Time Recurrent Learning. CoRR abs/1902.03993 (2019) - [i13]Asier Mujika, Felix Weissenberger, Angelika Steger:
Decoupling Hierarchical Recurrent Neural Networks With Locally Computable Losses. CoRR abs/1910.05245 (2019) - [i12]Florian Meier, Asier Mujika, Marcelo Matheus Gauy, Angelika Steger:
Improving Gradient Estimation in Evolutionary Strategies With Past Descent Directions. CoRR abs/1910.05268 (2019) - 2018
- [j75]Johannes Lengler, Angelika Steger:
Drift Analysis and Evolutionary Algorithms Revisited. Comb. Probab. Comput. 27(4): 643-666 (2018) - [j74]Nemanja Skoric, Angelika Steger, Milos Trujic:
Local resilience of an almost spanning k-cycle in random graphs. Random Struct. Algorithms 53(4): 728-751 (2018) - [c43]Hafsteinn Einarsson, Johannes Lengler, Marcelo Matheus Gauy, Florian Meier, Asier Mujika, Angelika Steger, Felix Weissenberger:
The linear hidden subset problem for the (1 + 1) EA with scheduled and adaptive mutation rates. GECCO 2018: 1491-1498 - [c42]Anders Martinsson, Florian Meier, Patrick Schnider, Angelika Steger:
Even Flying Cops Should Think Ahead. ISCO 2018: 326-337 - [c41]Asier Mujika, Florian Meier, Angelika Steger:
Approximating Real-Time Recurrent Learning with Random Kronecker Factors. NeurIPS 2018: 6594-6603 - [i11]Anders Martinsson, Florian Meier, Patrick Schnider, Angelika Steger:
Even flying cops should think ahead. CoRR abs/1801.07193 (2018) - [i10]Asier Mujika, Florian Meier, Angelika Steger:
Approximating Real-Time Recurrent Learning with Random Kronecker Factors. CoRR abs/1805.10842 (2018) - [i9]Johannes Lengler, Anders Martinsson, Angelika Steger:
When Does Hillclimbing Fail on Monotone Functions: An entropy compression argument. CoRR abs/1808.01137 (2018) - [i8]Hafsteinn Einarsson, Marcelo Matheus Gauy, Johannes Lengler, Florian Meier, Asier Mujika, Angelika Steger, Felix Weissenberger:
The linear hidden subset problem for the (1+1) EA with scheduled and adaptive mutation rates. CoRR abs/1808.05566 (2018) - 2017
- [j73]Johannes Lengler, Angelika Steger:
Note on the coefficient of variations of neuronal spike trains. Biol. Cybern. 111(3-4): 229-235 (2017) - [j72]Rajko Nenadov, Pascal Pfister, Angelika Steger:
Unique reconstruction threshold for random jigsaw puzzles. Chic. J. Theor. Comput. Sci. 2017 (2017) - [j71]Andreas Noever, Angelika Steger:
Local Resilience for Squares of Almost Spanning Cycles in Sparse Random Graphs. Electron. J. Comb. 24(4): 4 (2017) - [j70]Hafsteinn Einarsson, Marcelo M. Gauy, Johannes Lengler, Angelika Steger:
A Model of Fast Hebbian Spike Latency Normalization. Frontiers Comput. Neurosci. 11: 33 (2017) - [j69]Felix Weissenberger, Florian Meier, Johannes Lengler, Hafsteinn Einarsson, Angelika Steger:
Long Synfire Chains Emerge by Spike-Timing Dependent Plasticity Modulated by Population Activity. Int. J. Neural Syst. 27(8): 1750044:1-1750044:20 (2017) - [j68]Rajko Nenadov, Yury Person, Nemanja Skoric, Angelika Steger:
An algorithmic framework for obtaining lower bounds for random Ramsey problems. J. Comb. Theory, Ser. B 124: 1-38 (2017) - [j67]Marcelo Matheus Gauy, Florian Meier, Angelika Steger:
Multiassociative Memory: Recurrent Synapses Increase Storage Capacity. Neural Comput. 29(5): 1375-1405 (2017) - [c40]Asier Mujika, Florian Meier, Angelika Steger:
Fast-Slow Recurrent Neural Networks. NIPS 2017: 5915-5924 - [c39]Yann Disser, Frank Mousset, Andreas Noever, Nemanja Skoric, Angelika Steger:
A General Lower Bound for Collaborative Tree Exploration. SIROCCO 2017: 125-139 - [i7]Asier Mujika, Florian Meier, Angelika Steger:
Fast-Slow Recurrent Neural Networks. CoRR abs/1705.08639 (2017) - 2016
- [j66]Rajko Nenadov, Angelika Steger:
A Short Proof of the Random Ramsey Theorem. Comb. Probab. Comput. 25(1): 130-144 (2016) - [j65]Dan Hefetz, Angelika Steger, Benny Sudakov:
Random directed graphs are robustly Hamiltonian. Random Struct. Algorithms 49(2): 345-362 (2016) - [j64]Rajko Nenadov, Angelika Steger, Milos Stojakovic:
On the threshold for the Maker-Breaker H-game. Random Struct. Algorithms 49(3): 558-578 (2016) - [c38]Dan Hefetz, Fabian Kuhn, Yannic Maus, Angelika Steger:
Polynomial Lower Bound for Distributed Graph Coloring in a Weak LOCAL Model. DISC 2016: 99-113 - [i6]Rajko Nenadov, Pascal Pfister, Angelika Steger:
Unique reconstruction threshold for random jigsaw puzzles. CoRR abs/1605.03043 (2016) - [i5]Dan Hefetz, Fabian Kuhn, Yannic Maus, Angelika Steger:
A Polynomial Lower Bound for Distributed Graph Coloring in a Weak LOCAL Model. CoRR abs/1607.05212 (2016) - [i4]Johannes Lengler, Angelika Steger:
Drift Analysis and Evolutionary Algorithms Revisited. CoRR abs/1608.03226 (2016) - [i3]Yann Disser, Frank Mousset, Andreas Noever, Nemanja Skoric, Angelika Steger:
A general lower bound for collaborative tree exploration. CoRR abs/1610.01753 (2016) - 2015
- [j63]Stefanie Gerke, Konstantinos Panagiotou, Justus Schwartz, Angelika Steger:
Maximizing the Minimum Load for Random Processing Times. ACM Trans. Algorithms 11(3): 17:1-17:19 (2015) - [c37]Amin Karbasi, Johannes Lengler, Angelika Steger:
Normalization Phenomena in Asynchronous Networks. ICALP (2) 2015: 688-700 - [c36]Rajko Nenadov, Nemanja Skoric, Angelika Steger:
An algorithmic framework for obtaining lower bounds for random Ramsey problems extended abstract. SODA 2015: 1743-1751 - 2014
- [j62]Ralph Keusch, Angelika Steger:
The Game Chromatic Number of Dense Random Graphs. Electron. J. Comb. 21(4): 4 (2014) - [j61]Hafsteinn Einarsson, Johannes Lengler, Angelika Steger:
A high-capacity model for one shot association learning in the brain. Frontiers Comput. Neurosci. 8: 140 (2014) - [j60]Frank Mousset, Rajko Nenadov, Angelika Steger:
On the Number of Graphs Without Large Cliques. SIAM J. Discret. Math. 28(4): 1980-1986 (2014) - 2013
- [j59]Konstantinos Panagiotou, Reto Spöhel, Angelika Steger, Henning Thomas:
Explosive Percolation in Erdős-Rényi-Like Random Graph Processes. Comb. Probab. Comput. 22(1): 133-145 (2013) - [j58]Nikolaos Fountoulakis, Konstantinos Panagiotou, Angelika Steger:
On the Insertion Time of Cuckoo Hashing. SIAM J. Comput. 42(6): 2156-2181 (2013) - 2012
- [j57]Graham R. Brightwell, Konstantinos Panagiotou, Angelika Steger:
Extremal subgraphs of random graphs. Random Struct. Algorithms 41(2): 147-178 (2012) - [j56]Luca Gugelmann, Yury Person, Angelika Steger, Henning Thomas:
A randomized version of Ramsey's theorem. Random Struct. Algorithms 41(4): 488-505 (2012) - [c35]Florian Jug, Matthew Cook, Angelika Steger:
Recurrent competitive networks can learn locally excitatory topologies. IJCNN 2012: 1-8 - [c34]Michael Drmota, Omer Giménez, Marc Noy, Konstantinos Panagiotou, Angelika Steger:
The maximum degree of random planar graphs. SODA 2012: 281-287 - 2011
- [j55]Stefanie Gerke, Angelika Steger, Nicholas C. Wormald:
Pegging Graphs Yields a Small Diameter. Comb. Probab. Comput. 20(2): 239-248 (2011) - [j54]Luca Gugelmann, Yury Person, Angelika Steger, Henning Thomas:
A Randomized Version of Ramsey's Theorem. Electron. Notes Discret. Math. 38: 431-436 (2011) - [j53]Konstantinos Panagiotou, Reto Spöhel, Angelika Steger, Henning Thomas:
Explosive Percolation in Erdős-Rényi-Like Random Graph Processes. Electron. Notes Discret. Math. 38: 699-704 (2011) - [c33]Matthew Cook, Luca Gugelmann, Florian Jug, Christoph Krautz, Angelika Steger:
Interacting maps for fast visual interpretation. IJCNN 2011: 770-776 - [c32]Konstantinos Panagiotou, Angelika Steger:
On the Degree Distribution of Random Planar Graphs. SODA 2011: 1198-1210 - [i2]Konstantinos Panagiotou, Reto Spöhel, Angelika Steger, Henning Thomas:
Explosive Percolation in Erdös-Rényi-Like Random Graph Processes. CoRR abs/1104.1309 (2011) - 2010
- [j52]Nicla Bernasconi, Konstantinos Panagiotou, Angelika Steger:
On properties of random dissections and triangulations. Comb. 30(6): 627-654 (2010) - [j51]Reto Spöhel, Angelika Steger, Henning Thomas:
Coloring the Edges of a Random Graph without a Monochromatic Giant Component. Electron. J. Comb. 17(1) (2010) - [j50]Michael Krivelevich, Reto Spöhel, Angelika Steger:
Offline thresholds for Ramsey-type games on random graphs. Random Struct. Algorithms 36(1): 57-79 (2010) - [j49]Konstantinos Panagiotou, Angelika Steger:
Maximal biconnected subgraphs of random planar graphs. ACM Trans. Algorithms 6(2): 31:1-31:21 (2010) - [c31]Matthew Cook, Florian Jug, Christoph Krautz, Angelika Steger:
Unsupervised Learning of Relations. ICANN (1) 2010: 164-173 - [c30]Fabian Kuhn, Konstantinos Panagiotou, Joel Spencer, Angelika Steger:
Synchrony and Asynchrony in Neural Networks. SODA 2010: 949-964 - [i1]Nikolaos Fountoulakis, Konstantinos Panagiotou, Angelika Steger:
On the Insertion Time of Cuckoo Hashing. CoRR abs/1006.1231 (2010)
2000 – 2009
- 2009
- [j48]Jan Remy, Angelika Steger:
Approximation Schemes for Node-Weighted Geometric Steiner Tree Problems. Algorithmica 55(1): 240-267 (2009) - [j47]Julian Lorenz, Konstantinos Panagiotou, Angelika Steger:
Optimal Algorithms for k-Search with Application in Option Pricing. Algorithmica 55(2): 311-328 (2009) - [j46]Martin Marciniszyn, Reto Spöhel, Angelika Steger:
Upper Bounds for Online Ramsey Games in Random Graphs. Comb. Probab. Comput. 18(1-2): 259-270 (2009) - [j45]Martin Marciniszyn, Reto Spöhel, Angelika Steger:
Online Ramsey Games in Random Graphs. Comb. Probab. Comput. 18(1-2): 271-300 (2009) - [j44]Nicla Bernasconi, Konstantinos Panagiotou, Angelika Steger:
The Degree Sequence of Random Graphs from Subcritical Classes. Comb. Probab. Comput. 18(5): 647-681 (2009) - [j43]Konstantinos Panagiotou, Angelika Steger:
A note on the chromatic number of a dense random graph. Discret. Math. 309(10): 3420-3423 (2009) - [j42]Reto Spöhel, Angelika Steger, Henning Thomas:
Coloring the edges of a random graph without a monochromatic giant component. Electron. Notes Discret. Math. 34: 615-619 (2009) - [j41]Jan Remy, Angelika Steger:
A quasi-polynomial time approximation scheme for minimum weight triangulation. J. ACM 56(3): 15:1-15:47 (2009) - [j40]Gregory B. Sorkin, Angelika Steger, Rico Zenklusen:
A tight bound on the collection of edges in MSTs of induced subgraphs. J. Comb. Theory, Ser. B 99(2): 428-435 (2009) - [j39]Martin Marciniszyn, Jozef Skokan, Reto Spöhel, Angelika Steger:
Asymmetric Ramsey properties of random graphs involving cliques. Random Struct. Algorithms 34(4): 419-453 (2009) - [c29]Konstantinos Panagiotou, Angelika Steger:
Maximal biconnected subgraphs of random planar graphs. SODA 2009: 432-440 - 2008
- [j38]Domingos Dellamonica Jr., Yoshiharu Kohayakawa, Martin Marciniszyn, Angelika Steger:
On the Resilience of Long Cycles in Random Graphs. Electron. J. Comb. 15(1) (2008) - [j37]Amin Coja-Oghlan, Konstantinos Panagiotou, Angelika Steger:
On the chromatic number of random graphs. J. Comb. Theory, Ser. B 98(5): 980-993 (2008) - [j36]Stefanie Gerke, Dirk Schlatter, Angelika Steger, Anusch Taraz:
The random planar graph process. Random Struct. Algorithms 32(2): 236-261 (2008) - [c28]Nicla Bernasconi, Konstantinos Panagiotou, Angelika Steger:
On the Degree Sequences of Random Outerplanar and Series-Parallel Graphs. APPROX-RANDOM 2008: 303-316 - [c27]Nicla Bernasconi, Konstantinos Panagiotou, Angelika Steger:
On properties of random dissections and triangulations. SODA 2008: 132-141 - [p1]Alexander Souza, Angelika Steger:
Fehlererkennende Codes: Was ist eigentlich EAN?. Taschenbuch der Algorithmen 2008: 213-223 - 2007
- [j35]Stefanie Gerke, Hans Jürgen Prömel, Thomas Schickinger, Angelika Steger, Anusch Taraz:
K 4-free subgraphs of random graphs revisited. Comb. 27(3): 329-365 (2007) - [j34]Stefanie Gerke, Angelika Steger:
A Characterization for Sparse epsilon-Regular Pairs. Electron. J. Comb. 14(1) (2007) - [j33]Jan Remy, Alexander Souza, Angelika Steger:
On an Online Spanning Tree Problem in Randomly Weighted Graphs. Comb. Probab. Comput. 16(1): 127-144 (2007) - [j32]Stefanie Gerke, Yoshiharu Kohayakawa, Vojtech Rödl, Angelika Steger:
Small subsets inherit sparse epsilon-regularity. J. Comb. Theory, Ser. B 97(1): 34-56 (2007) - [j31]Stefanie Gerke, Martin Marciniszyn, Angelika Steger:
A probabilistic counting lemma for complete graphs. Random Struct. Algorithms 31(4): 517-534 (2007) - [c26]Julian Lorenz, Martin Marciniszyn, Angelika Steger:
Observational Learning in Random Networks. COLT 2007: 574-588 - [c25]Julian Lorenz, Konstantinos Panagiotou, Angelika Steger:
Optimal Algorithms for k -Search with Application in Option Pricing. ESA 2007: 275-286 - [c24]Amin Coja-Oghlan, Konstantinos Panagiotou, Angelika Steger:
On the Chromatic Number of Random Graphs. ICALP 2007: 777-788 - [c23]Graham R. Brightwell, Konstantinos Panagiotou, Angelika Steger:
On extremal subgraphs of random graphs. SODA 2007: 477-485 - 2006
- [j30]Mark Scharbrodt, Thomas Schickinger, Angelika Steger:
A new average case analysis for completion time scheduling. J. ACM 53(1): 121-146 (2006) - [j29]Alexander Souza, Angelika Steger:
The Expected Competitive Ratio for Weighted Completion Time Scheduling. Theory Comput. Syst. 39(1): 121-136 (2006) - [j28]Petra Berenbrink, Artur Czumaj, Angelika Steger, Berthold Vöcking:
Balanced Allocations: The Heavily Loaded Case. SIAM J. Comput. 35(6): 1350-1385 (2006) - [c22]Martin Marciniszyn, Jozef Skokan, Reto Spöhel, Angelika Steger:
Threshold Functions for Asymmetric Ramsey Properties Involving Cliques. APPROX-RANDOM 2006: 462-474 - [c21]Jan Remy, Angelika Steger:
A quasi-polynomial time approximation scheme for minimum weight triangulation. STOC 2006: 316-325 - 2005
- [j27]Angelika Steger:
On the Evolution of Triangle-Free Graphs. Comb. Probab. Comput. 14(1-2): 211-224 (2005) - [j26]Colin McDiarmid, Angelika Steger, Dominic J. A. Welsh:
Random planar graphs. J. Comb. Theory, Ser. B 93(2): 187-205 (2005) - [c20]Jan Remy, Angelika Steger:
Approximation Schemes for Node-Weighted Geometric Steiner Tree Problems. APPROX-RANDOM 2005: 221-232 - [c19]Martin Marciniszyn, Reto Spöhel, Angelika Steger:
The Online Clique Avoidance Game on Random Graphs. APPROX-RANDOM 2005: 390-401 - [c18]Stefanie Gerke, Angelika Steger:
The sparse regularity lemma and its applications. BCC 2005: 227-258 - [c17]Stefanie Gerke, Colin McDiarmid, Angelika Steger, Andreas Weißl:
Random planar graphs with n nodes and a fixed number of edges. SODA 2005: 999-1007 - [c16]Justus Schwartz, Angelika Steger, Andreas Weißl:
Fast Algorithms for Weighted Bipartite Matching. WEA 2005: 476-487 - 2004
- [j25]Martin Marciniszyn, Angelika Steger, Andreas Weißl:
E-Jigsaw: Computergestützte Rekonstruktion zerrissener Stasi-Unterlagen. Inform. Spektrum 27(3): 248-254 (2004) - [j24]Stefanie Gerke, Thomas Schickinger, Angelika Steger:
K5-free subgraphs of random graphs. Random Struct. Algorithms 24(2): 194-232 (2004) - [c15]Alexander Souza, Angelika Steger:
The Expected Competitive Ratio for Weighted Completion Time Scheduling. STACS 2004: 620-631 - 2002
- [j23]Hans Jürgen Prömel, Thomas Schickinger, Angelika Steger:
A note on triangle-free and bipartite graphs. Discret. Math. 257(2-3): 531-540 (2002) - [c14]Mark Scharbrodt, Thomas Schickinger, Angelika Steger:
A new average case analysis for completion time scheduling. STOC 2002: 170-178 - 2001
- [j22]Hans Jürgen Prömel, Angelika Steger, Anusch Taraz:
Counting Partial Orders With A Fixed Number Of Comparable Pairs. Comb. Probab. Comput. 10(2): 159-177 (2001) - [j21]Hans Jürgen Prömel, Angelika Steger, Anusch Taraz:
Asymptotic enumeration, global structure, and constrained evolution. Discret. Math. 229(1-3): 213-233 (2001) - [j20]Hans Jürgen Prömel, Angelika Steger, Anusch Taraz:
Phase Transitions in the Evolution of Partial Orders. J. Comb. Theory, Ser. A 94(2): 230-275 (2001) - [j19]