Evolutionary Algorithms for Quantum Computers
D. Johannsen, J. Lengler, and P. Kurur
Algorithmica 68(1), 2014, 152-189.
Coloring random graphs online without creating monochromatic subgraphs
T. Mütze, T. Rast, and R. Spöhel
Random Struct. Algorithms 44(4), 2014, 419-464.
On balanced coloring games in random graphs
L. Gugelmann and R. Spöhel
Eur. J. Comb. 35(4), 2014, 297-312.
A high-capacity model for one shot association learning in the brain
H. Einarsson, J. Lengler, and A. Steger
Frontiers in Computational Neuroscience, 07 November 2014.
On the number of graphs without large cliques
F. Mousset, R. Nenadov. and A. Steger
SIAM J. Discrete Math. 28(4), 2014, 1980-1986.
The game chromatic number of dense random graphs
R. Keusch and A. Steger
Electronic J. Comb. 21(4), 2014, P4.47.
A Construction of Almost Steiner Systems
A. Ferber, R. Hod, M. Krivelevich and B. Sudakov
J. of Combinatorial Designs 22(11), 2014, 488-494.
Weak and strong k-connectivity games
A. Ferber and D. Hefetz
Eur. J. Comb. 35, 2014, 169-183.
Internal DLA: Efficient Simulation of a Physical Growth Model
K. Bringmann, F. Kuhn, K. Panagiotou, U. Peter, and H. Thomas
In Proceedings of the 41th International Colloquium on Automata, Languages, and Programming (ICALP '14) 8572, 2014, 247–258.
