Presynaptic stochasticity improves energy efficiency and helps alleviate the stability-plasticity dilemma
S. Schug*, F. Benzing*, A. Steger
eLife, 10/2021
Kr-Factors in Graphs with Low Independence Number
C. Knierim, P. Su
Journal of Combinatorial Theory, Series B 148, 60-83
Long cycles, heavy cycles and cycle decompositions in digraphs
C. Knierim, M. Larcher, A. Martinsson and A. Noever
Journal of Combinatorial Theory, Series B, 148, 125-148
The complex parameter landscape of the compact genetic algorithm
J. Lengler, D. Sudholt, C. Witt
Algorithmica 83, 1096–1137
Exponential slowdown for larger populations: The (mu+1)-EA on monotone functions
J. Lengler, X. Zou
Theoretical Computer Science 875, 28-51
Penalising transmission to hubs in scale-free spatial random graphs
J, Komjáthy, J. Lapinskas, J. Lengler
Annales de l'Institut Henri Poincaré, Probabilités et Statistiques 57(4), 1968-2016
Self-Adjusting Mutation Rates with Provably Optimal Success Rules
B. Doerr, C. Doerr, J. Lengler
Algorithmica 83, 3108–3147
Bootstrap Percolation on Geometric Inhomogeneous Random Graphs
C. Koch, J. Lengler
Internet Mathematics 18995
Greedy Routing and the Algorithmic Small-World Phenomenom
K. Bringmann, R. Keusch, J. Lengler, Y. Maus, A. Molla
Journal of Computer and System Science 125, 59-105
Sprinkling a
few random edges doubles the power
R. Nenadov, M. Trujić
SIAM Journal on Discrete Mathematics 35, 988-1004
Note on Long Paths in Eulerian Digraphs
C. Knierim, M. Larcher, A. Martinsson
Electronic Journal of Combinatorics 28, P2.37
Arithmetic Progressions in Sumsets of Sparse Sets
N. Alon, R. Alweiss, Y. Liu, A. Martinsson, S. Narayanan.
Integers 21A - Ron Graham Memorial Volume, A3
An O(n) time algorithm for finding Hamilton
cycles with high probability
R. Nenadov, A. Steger, P. Su
12th Conference on Innovations in Theoretical Computer Science (ITCS'21), 2021.
Learning where to learn: Gradient sparsity in meta and continual learning
J. von Oswald*, D. Zhao*, S. Kobayashi, S. Schug, M. Caccia, N. Zucchet and J. Sacramento
35th Conference on Neural Information Processing Systems (NeurIPS 2021), 2021.
Posterior Meta-Replay for Continual Learning
C. Henning*, M. R. Cervera*, F. D'Angelo, J. von Oswald, R. Traber, B. Ehret, S. Kobayashi, B. F. Grewe and J. Sacramento
35th Conference on Neural Information Processing Systems (NeurIPS 2021), 2021.
Runtime Analysis of the (mu+1)-EA on the Dynamic BinVal Function (full version preprint), (conference version)
J. Lengler, S. Riedi
21st European Conference on Evolutionary Computation in Combinatorial Optimisation (EvoCOP 2021), 2021.
Schur’s Theorem for Randomly Perturbed Sets (Extended Abstract)
S. Das, C. Knierim, P. Morris
Extended Abstracts EuroComb 2021 Trends in Mathematics Vol 14
