Angelika Steger

According to our database1, Angelika Steger authored at least 110 papers between 1989 and 2018.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

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

Drift Analysis and Evolutionary Algorithms Revisited.
Combinatorics, Probability & Computing, 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 Computation, 2017

An algorithmic framework for obtaining lower bounds for random Ramsey problems.
J. Comb. Theory, Ser. 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.
Front. Comput. Neurosci., 2017

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

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

Note on the coefficient of variations of neuronal spike trains.
Biological Cybernetics, 2017

A General Lower Bound for Collaborative Tree Exploration.
Proceedings of the Structural Information and Communication Complexity, 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 H-game.
Random Struct. Algorithms, 2016

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

A Short Proof of the Random Ramsey Theorem.
Combinatorics, Probability & Computing, 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 extended abstract.
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. Discrete Math., 2014

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

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

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

Explosive Percolation in Erdős-Rényi-Like Random Graph Processes.
Combinatorics, Probability & Computing, 2013

2012
A randomized version of Ramsey's theorem.
Random Struct. Algorithms, 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.
Electronic Notes in Discrete Mathematics, 2011

A Randomized Version of Ramsey's Theorem.
Electronic Notes in Discrete Mathematics, 2011

Pegging Graphs Yields a Small Diameter.
Combinatorics, Probability & Computing, 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
Offline thresholds for Ramsey-type games on random graphs.
Random Struct. Algorithms, 2010

Coloring the Edges of a Random Graph without a Monochromatic Giant Component.
Electr. J. 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, Ser. B, 2009

Coloring the edges of a random graph without a monochromatic giant component.
Electronic Notes in Discrete Mathematics, 2009

A note on the chromatic number of a dense random graph.
Discrete Mathematics, 2009

Online Ramsey Games in Random Graphs.
Combinatorics, Probability & Computing, 2009

Upper Bounds for Online Ramsey Games in Random Graphs.
Combinatorics, Probability & Computing, 2009

The Degree Sequence of Random Graphs from Subcritical Classes.
Combinatorics, Probability & Computing, 2009

Optimal Algorithms for k-Search with Application in Option Pricing.
Algorithmica, 2009

Maximal biconnected subgraphs of random planar graphs.
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 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 Resilience of Long Cycles in Random Graphs.
Electr. J. Comb., 2008

On properties of random dissections and triangulations.
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 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, Ser. B, 2007

On an Online Spanning Tree Problem in Randomly Weighted Graphs.
Combinatorics, Probability & Computing, 2007

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

K 4-free subgraphs of random graphs revisited.
Combinatorica, 2007

On extremal subgraphs of random graphs.
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

On the Chromatic Number of Random Graphs.
Proceedings of the Automata, Languages and Programming, 34th International Colloquium, 2007

Optimal Algorithms for k -Search with Application in Option Pricing.
Proceedings of the Algorithms, 2007

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

2006
A quasi-polynomial time approximation scheme for minimum weight triangulation.
Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006

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

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

On the Evolution of Triangle-Free Graphs.
Combinatorics, Probability & Computing, 2005

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

Random planar graphs with n 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

Approximation Schemes for Node-Weighted Geometric Steiner Tree Problems.
Proceedings of the Approximation, 2005

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

2004
K5-free subgraphs of random graphs.
Random Struct. Algorithms, 2004

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

The Expected Competitive Ratio for Weighted Completion Time Scheduling.
Proceedings of the STACS 2004, 2004

2002
A note on triangle-free and bipartite graphs.
Discrete Mathematics, 2002

A new average case analysis for completion time scheduling.
Proceedings of the Proceedings on 34th Annual ACM Symposium on Theory of Computing, 2002

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

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

Asymptotic enumeration, global structure, and constrained evolution.
Discrete Mathematics, 2001

Counting Partial Orders With A Fixed Number Of Comparable Pairs.
Combinatorics, Probability & Computing, 2001

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

Balanced allocations: the heavily loaded case.
Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 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.
Combinatorics, Probability & Computing, 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.
Combinatorica, 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

Learning One-Variable Pattern Languages Very Efficiently on Average, in Parallel, and by Asking Queries.
Proceedings of the Algorithmic Learning Theory, 8th International Conference, 1997

1996
On the asymptotic structure of sparse triangle free graphs.
Journal of Graph Theory, 1996

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

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

Counting H-free graphs.
Discrete Mathematics, 1996

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

1994
Probabilistically checkable proofs and their consequences for approximation algorithms.
Discrete Mathematics, 1994

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

1993
On induced matchings.
Discrete Mathematics, 1993

Excluding Induced Subgraphs II: Extremal Graphs.
Discrete Applied Mathematics, 1993

Extremal Graph Problems for Graphs with a Color-Critical Vertex.
Combinatorics, Probability & Computing, 1993

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

Almost all Berge Graphs are Perfect.
Combinatorics, Probability & Computing, 1992

The asymptotic number of graphs not containing a fixed color-critical subgraph.
Combinatorica, 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...