5 citations · 6 across the 6 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
cs.FL2018
Synchronizing Random Almost-Group Automata
Mikhail V. Berlinkov, Cyril Nicaud
In this paper we address the question of synchronizing random automata in the critical settings of almost-group automata. Group automata are automata where all letters act as permu…
cs.DS2018
On the Worst-Case Complexity of TimSort
Nicolas Auger, Vincent Jugé, Cyril Nicaud +1
TimSort is an intriguing sorting algorithm designed in 2002 for Python, whose worst-case complexity was announced, but not proved until our recent preprint. In fact, there are two…