Следене
Angelika Steger
Angelika Steger
Потвърден имейл адрес: inf.ethz.ch
Заглавие
Позовавания
Позовавания
Година
“Balls into bins”—A simple and tight analysis
M Raab, A Steger
International Workshop on Randomization and Approximation Techniques in …, 1998
4971998
Generating random regular graphs quickly
A Steger, NC Wormald
Combinatorics, Probability and Computing 8 (4), 377-396, 1999
3351999
The Steiner tree problem: a tour through graphs, algorithms, and complexity
HJ Prömel, A Steger
Springer Science & Business Media, 2012
3032012
Balanced allocations: The heavily loaded case
P Berenbrink, A Czumaj, A Steger, B Vöcking
Proceedings of the thirty-second annual ACM symposium on Theory of computing …, 2000
2832000
Diskrete Strukturen: Band 1: Kombinatorik, Graphentheorie, Algebra
A Steger
Springer-Verlag, 2007
1842007
Random planar graphs
C McDiarmid, A Steger, DJA Welsh
Journal of Combinatorial Theory, Series B 93 (2), 187-205, 2005
1642005
A new approximation algorithm for the Steiner tree problem with performance ratio 5/3
HJ Prömel, A Steger
Journal of Algorithms 36 (1), 89-101, 2000
1502000
Finding clusters in VLSI circuits
J Garbers, HJ Promel, A Steger
1990 IEEE International Conference on Computer-Aided Design, 520,521,522,523 …, 1990
1471990
Interacting maps for fast visual interpretation
M Cook, L Gugelmann, F Jug, C Krautz, A Steger
The 2011 International Joint Conference on Neural Networks, 770-776, 2011
1312011
Excluding induced subgraphs III: a general asymptotic
HJ Prömel, A Steger
Random Structures & Algorithms 3 (1), 19-31, 1992
1311992
The sparse regularity lemma and its applications.
S Gerke, A Steger
BCC, 227-258, 2005
1052005
Steiner trees in VLSI-layout
B Korte, HJ Prömel, A Steger
Paths, Flows, and VLSI-layout 9, 185-214, 1990
1041990
Excluding induced subgraphs: quadrilaterals
HJ Prömel, A Steger
Random Structures and Algorithms 2 (1), 55-71, 1991
911991
Fast-slow recurrent neural networks
A Mujika, F Meier, A Steger
Advances in Neural Information Processing Systems 30, 2017
882017
Lectures on proof verification and approximation algorithms
EW Mayr, HJ Prömel, A Steger
Springer, 2006
832006
Optimal algorithms for k-search with application in option pricing
J Lorenz, K Panagiotou, A Steger
Algorithmica 55 (2), 311-328, 2009
812009
Excluding induced subgraphs II: extremal graphs
HJ Prömel, A Steger
Discrete Applied Mathematics 44 (1-3), 283-294, 1993
781993
A new average case analysis for completion time scheduling
M Scharbrodt, T Schickinger, A Steger
Journal of the ACM (JACM) 53 (1), 121-146, 2006
75*2006
On induced matchings
A Steger, M Yu
Discrete Mathematics 120 (1-3), 291-295, 1993
751993
Almost all Berge graphs are perfect
HJ Prömel, A Steger
Combinatorics, Probability and Computing 1 (1), 53-79, 1992
721992
Системата не може да изпълни операцията сега. Опитайте отново по-късно.
Статии 1–20