Angelika Steger | Academic Influence

Angelika Steger's AcademicInfluence.com Rankings

Angelika Steger

Computer Science

#3651

World Rank

#3836

Historical Rank

computer-science Degrees

Angelika Steger

Mathematics

#3306

World Rank

#4911

Historical Rank

Measure Theory

#2924

World Rank

#3472

Historical Rank

mathematics Degrees

Download Badge

Computer Science
Mathematics

Angelika Steger's Degrees

PhD Computer Science University of Bonn

Similar Degrees You Can Earn

Best Online PhD of Computer Science (Doctorates) 2025

Why Is Angelika Steger Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Angelika Steger is a mathematician and computer scientist whose research interests include graph theory, randomized algorithms, and approximation algorithms. She is a professor at ETH Zurich. Education and career After earlier studies at the University of Freiburg and Heidelberg University, Steger earned a master's degree from Stony Brook University in 1985. She completed a doctorate from the University of Bonn in 1990, under the supervision of Hans Jürgen Prömel, with a dissertation on random combinatorial structures, and earned her habilitation from Bonn in 1994. After a visiting position at the University of Kiel, she became a professor at the University of Duisburg in 1995, moved to the Technical University of Munich in 1996, and moved again to ETH Zurich in 2003.

(See a Problem?)

Angelika Steger's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

The Steiner Tree Problem (2002) (737)
"Balls into Bins" - A Simple and Tight Analysis (1998) (505)
Generating Random Regular Graphs Quickly (1999) (229)
On induced matchings (1993) (225)
Balanced allocations: the heavily loaded case (2000) (221)
The Steiner Tree Problem: A Tour through Graphs, Algorithms, and Complexity (2002) (160)
Random planar graphs (2005) (141)
Finding clusters in VLSI circuits (1990) (127)
A New Approximation Algorithm for the Steiner Tree Problem with Performance Ratio 5/3 (2000) (115)
Excluding Induced Subgraphs III: A General Asymptotic (1992) (108)
Interacting maps for fast visual interpretation (2011) (94)
The sparse regularity lemma and its applications (2005) (90)
Fast-Slow Recurrent Neural Networks (2017) (75)
Excluding Induced Subgraphs: Quadrilaterals (1991) (72)
Optimal Algorithms for k-Search with Application in Option Pricing (2007) (69)
RNC-Approximation Algorithms for the Steiner Problem (1997) (66)
Excluding Induced Subgraphs II: Extremal Graphs (1993) (64)
A new average case analysis for completion time scheduling (2006) (60)
An Extremal Problem For Random Graphs And The Number Of Graphs With Large Even-Girth (1998) (55)
Almost all Berge Graphs are Perfect (1992) (53)
The asymptotic number of graphs not containing a fixed color-critical subgraph (1992) (52)
Extremal subgraphs of random graphs (2007) (51)
Approximating Real-Time Recurrent Learning with Random Kronecker Factors (2018) (50)
Small subsets inherit sparse ε-regularity (2004) (50)
Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries (1997) (50)
A Short Proof of the Random Ramsey Theorem (2014) (44)
Random Graphs from Planar and Other Addable Classes (2006) (43)
The Average Number of Linear Extensions of a Partial Order (1996) (41)
Drift Analysis and Evolutionary Algorithms Revisited (2016) (40)
Fast Algorithms for Weighted Bipartite Matching (2005) (40)
On the Resilience of Long Cycles in Random Graphs (2008) (40)
Lectures on Proof Verification and Approximation Algorithms (1998) (38)
Reliable Neuronal Systems: The Importance of Heterogeneity (2013) (37)
Maximal biconnected subgraphs of random planar graphs (2009) (37)
On properties of random dissections and triangulations (2008) (37)
Approximability of scheduling with fixed jobs (1999) (35)
Online Ramsey Games in Random Graphs (2009) (35)
Random planar graphs with n nodes and a fixed number of edges (2005) (34)
Explosive Percolation in Erdős–Rényi-Like Random Graph Processes (2011) (34)
K5‐free subgraphs of random graphs (2004) (32)
The Expected Competitive Ratio for Weighted Completion Time Scheduling (2004) (31)
Upper Bounds for Online Ramsey Games in Random Graphs (2009) (31)
On the Insertion Time of Cuckoo Hashing (2010) (30)
The random planar graph process (2008) (30)
The Degree Sequence of Random Graphs from Subcritical Classes† (2009) (28)
An Extension of Karmarkar’s Algorithm for Bounded Linear Programming Problems (1988) (27)
An algorithmic framework for obtaining lower bounds for random Ramsey problems (2014) (25)
On the asymptotic structure of sparse triangle free graphs (1996) (24)
Small subsets inherit sparse epsilon-regularity (2007) (24)
On the chromatic number of random graphs (2007) (23)
Asymmetric Ramsey properties of random graphs involving cliques (2009) (22)
A probabilistic counting lemma for complete graphs (2007) (22)
Coloring Clique-free Graphs in Linear Expected Time (1992) (22)
Extremal Graph Problems for Graphs with a Color-Critical Vertex (1993) (21)
On the threshold for the Maker‐Breaker H‐game (2014) (20)
Resilience of perfect matchings and Hamiltonicity in random graph processes (2017) (20)
RANDOM PLANAR GRAPHS WITH GIVEN AVERAGE DEGREE (2007) (20)
A note on triangle-free and bipartite graphs (2002) (19)
K4-free subgraphs of random graphs revisited (2007) (19)
Asymptotic enumeration, global structure, and constrained evolution (2001) (19)
The maximum degree of random planar graphs (2012) (19)
A note on the chromatic number of a dense random graph (2009) (18)
A General Lower Bound for Collaborative Tree Exploration (2016) (18)
On the Degree Sequences of Random Outerplanar and Series-Parallel Graphs (2008) (17)
Probabilistically checkable proofs and their consequences for approximation algorithms (1994) (17)
Approximation Schemes for Node-Weighted Geometric Steiner Tree Problems (2005) (17)
Polynomial Lower Bound for Distributed Graph Coloring in a Weak LOCAL Model (2016) (17)
Random directed graphs are robustly Hamiltonian (2014) (17)
When Does Hillclimbing Fail on Monotone Functions: An entropy compression argument (2018) (16)
Optimal Kronecker-Sum Approximation of Real Time Recurrent Learning (2019) (16)
A quasi-polynomial time approximation scheme for minimum weight triangulation (2006) (16)
Phase Transitions in the Evolution of Partial Orders (2001) (16)
SYMMETRIC AND ASYMMETRIC RAMSEY PROPERTIES IN RANDOM HYPERGRAPHS (2016) (14)
Local Resilience for Squares of Almost Spanning Cycles in Sparse Random Graphs (2016) (14)
Unsupervised Learning of Relations (2010) (14)
A quasi-polynomial time approximation scheme for minimum weight triangulation (2009) (14)
Long Synfire Chains Emerge by Spike-Timing Dependent Plasticity Modulated by Population Activity (2017) (14)
Counting H-free graphs (1996) (13)
Unique reconstruction threshold for random jigsaw puzzles (2016) (13)
The Online Clique Avoidance Game on Random Graphs (2005) (13)
Local resilience of an almost spanning k‐cycle in random graphs (2017) (13)
On an Online Spanning Tree Problem in Randomly Weighted Graphs (2006) (12)
Triangle resilience of the square of a Hamilton cycle in random graphs (2018) (11)
On the Number of Graphs Without Large Cliques (2013) (10)
Randomized and adversarial load balancing (1999) (10)
Coloring the edges of a random graph without a monochromatic giant component (2009) (10)
The asymptotic structure of H-free graphs (1991) (10)
On the Evolution of Triangle-Free Graphs (2005) (10)
Testing Hereditary Properties Efficiently on Average (1994) (10)
A new average case analysis for completion time scheduling (2002) (10)
Recurrent competitive networks can learn locally excitatory topologies (2012) (9)
VLSI-placement based on routing and timing information (1990) (9)
Improving Gradient Estimation in Evolutionary Strategies With Past Descent Directions (2019) (9)
Counting Partial Orders with a Fixed Number of Comparable Pairs (2001) (9)
Offline thresholds for Ramsey‐type games on random graphs (2010) (9)
The linear hidden subset problem for the (1 + 1) EA with scheduled and adaptive mutation rates (2018) (9)
Random I-Cororable Graphs (1995) (8)
A Model of Fast Hebbian Spike Latency Normalization (2017) (8)
A Hippocampal Model for Behavioral Time Acquisition and Fast Bidirectional Replay of Spatio-Temporal Memory Sequences (2018) (8)
Random initialisations performing above chance and how to find them (2022) (8)
Spiking networks and their rate-based equivalents : does it make sense to use Siegert neurons ? (2011) (8)
Combining partitioning and global routing in sea-of-cells design (1989) (8)
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms: Preface (2006) (8)
A high-capacity model for one shot association learning in the brain (2014) (8)
On the degree distribution of random planar graphs (2011) (8)
The Game Chromatic Number of Dense Random Graphs (2014) (7)
On the structure of clique‐free graphs (2001) (7)
Note on the coefficient of variations of neuronal spike trains (2017) (7)
Simplified Witness Tree Arguments (2000) (7)
Synchrony and asynchrony in neural networks (2010) (7)
Observational Learning in Random Networks (2007) (6)
Bootstrap percolation with inhibition (2014) (6)
Optimal Algorithms for k -Search with Application in Option Pricing (2007) (6)
General deletion lemmas via the Harris inequality (2013) (5)
A characterization for sparse -regular pairs. (2007) (5)
An O(n) time algorithm for finding Hamilton cycles with high probability (2020) (5)
A randomized version of Ramsey's theorem (2011) (4)
Threshold Functions for Asymmetric Ramsey Properties Involving Cliques (2006) (4)
Presynaptic stochasticity improves energy efficiency and helps alleviate the stability-plasticity dilemma (2021) (4)
Maximizing the Minimum Load for Random Processing Times (2015) (3)
Multiassociative Memory: Recurrent Synapses Increase Storage Capacity (2017) (3)
Solving Static Permutation Mastermind using $O(n \log n)$ Queries (2021) (3)
Tidier Examples for Lower Bounds on Diagonal Ramsey Numbers (1996) (3)
Load Balancing Using Bisectors - A Tight Average-Case Analysis (1999) (3)
Normalization Phenomena in Asynchronous Networks (2015) (3)
Voltage dependence of synaptic plasticity is essential for rate based learning with short stimuli (2018) (3)
Efficient learning of One-Variable Patttern Languages From Positive Data (1996) (3)
A tight bound on the collection of edges in MSTs of induced subgraphs (2007) (3)
Lectures on Proof Verification and Approximation Algorithms. (the book grow out of a Dagstuhl Seminar, April 21-25, 1997) (1998) (3)
A dynamic architecture of life (2015) (2)
An algorithmic framework for obtaining lower bounds for random Ramsey problems extended abstract (2015) (2)
Local resilience of a random graph throughout its evolution (2017) (2)
Note on the coefficient of variations of neuronal spike trains (2017) (2)
Geometric Steiner Problems (2002) (2)
Adaptive Tuning Curve Widths Improve Sample Efficient Learning (2019) (2)
An Optimal Decentralized $(Δ+ 1)$-Coloring Algorithm (2020) (2)
Offline thresholds for Ramsey-type games on random graphs (2010) (1)
A Characterization for Sparse epsilon-Regular Pairs (2007) (1)
Extremal Subgraphs of Random Graphs: an Extended Version (2009) (1)
On the origin of lognormal network synchrony in CA1 (2018) (1)
The Maximum Label Propagation Algorithm on Sparse Random Graphs (2019) (1)
Learning One-Variable Pattern Languages Very Efficiently (1997) (1)
Pegging Graphs Yields a Small Diameter (2010) (1)
Connectivity Thresholds for Bounded Size Rules (2014) (1)
The Santa Claus Problem in a Probabilistic Setting (2008) (0)
Approximability of NP-Optimization Problems (2003) (0)
Probability , and Computing Solutions KW 40 HS 15 General rules for solving exercises (2014) (0)
Probability , and Computing Solutions KW 42 HS 16 Solution of in-class exercise 1 : Number of Cells in Arrangements (2016) (0)
Probability , and Computing Fall 2012 Exercise Sheet 3-Master Solution Exercise 1-Comparisons in Quicksort (2013) (0)
Limits of Approximability (2002) (0)
Algorithms , Probability , and Computing Fall 2011 Special Assignment Set 2 (2011) (0)
A model of functional recovery after significant loss of neural tissue: biofeedback based healing of vestibular dysfunction (2010) (0)
Randomness as a Building Block for Reproducibility in Local Cortical Networks (2016) (0)
Evaluating Disentanglement of Structured Latent Representations (2021) (0)
Probability , and Computing Solutions for SPA 1 HS 17 Solution 1 : From Ancestors to Parents (2017) (0)
Basics III: Complexity (2002) (0)
Probability , and Computing Solutions KW 45 HS 16 Solution 1 : Randomized Algebraic Algorithms (2016) (0)
Basics II: Algorithms (2002) (0)
More on Approximation Algorithms (2002) (0)
Probability , and Computing Fall 2011 Exercise Sheet 6-Master Solution Exercise 1-Pfaffian Orientations (2011) (0)
Decoupling Hierarchical Recurrent Neural Networks With Locally Computable Losses (2019) (0)
Solution of in-class exercise 1 : Bounding a sequence (2016) (0)
Probability , and Computing Solutions for SPA 1 HS 18 Solution (2018) (0)
Mutual Inhibition with Few Inhibitory Cells via Nonlinear Inhibitory Synaptic Interaction (2019) (0)
An Optimal Decentralized p∆ ` 1q-Coloring Algorithm (2020) (0)
Even flying cops should think ahead (2018) (0)
The Maximum Label Propagation Algorithm onSparse Random Graphs (2019) (0)
On the Chromatic Number of Random Graphs 1 (2007) (0)
Fachbereich 3 Mathematik Testing Hereditary Properties Efficiently on Average Testing Hereditary Properties Eeciently on Average ? (2007) (0)
Presynaptic Stochasticity Improves Energy Efficiency and Alleviates the Stability-Plasticity Dilemma (2021) (0)
An Optimal Decentralized $(\Delta + 1)$-Coloring Algorithm (2020) (0)
Combinatorics, Geometry and Probability: Extremal Graph Problems for Graphs with a Color-Critical Vertex (1997) (0)
Resting Enhances Learning of Coherent Signals on Cellular Level in STDP Simulations (2012) (0)
0 O ct 2 01 3 On the Insertion Time of Cuckoo Hashing ∗ (2013) (0)
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) (2019) (0)
Basics I: Graphs (2002) (0)
Combinatorics, Probability and Computing (2020) (0)
LearningfromEACHother–handling practicalquestionsinresearch” (2010) (0)
Probability , and Computing Solutions KW 39 HS 18 Solution 1 (2018) (0)
Knowing Less is More: Observational Learning in Random Networks (2007) (0)
The Threshold for the Balancedness of Colored Graphs (2006) (0)
Special Terminal Sets (2002) (0)
A Simple Optimal Algorithm for the 2-Arm Bandit Problem (2023) (0)
Author response: Presynaptic stochasticity improves energy efficiency and helps alleviate the stability-plasticity dilemma (2021) (0)
Adaptive Tuning Curve Widths Improve Sample Efficient Learning (2020) (0)

This paper list is powered by the following services:

Other Resources About Angelika Steger

en.wikipedia.org

What Schools Are Affiliated With Angelika Steger?

Angelika Steger is affiliated with the following schools:

Image Attributions

Image Source for Angelika Steger