Resources
This page lists some pointers to documents that could be useful to work on particular topics.
Graphs coming from Version Control Systems (Git, Mercurial)
- Theoretical Analysis of Git Bisect, by Julien Courtiel, Paul Dorbec and Romain Lecoq,
paper that initiated research on Git graphs in Caen (complexity in the worst-case scenario, new algorithm
golden bisect, Regression Search Problem and its complexity). - Random Generation of Git graphs, by Julien Courtiel and Martin Pépin, short version, long version currently being drafted (definition and study of a first model for Git graphs).
- Julien's long talk for ALEA summing up the two previous papers (because a little self-promotion never hurts).
Towards a better sorting algorithm?
- An Optimal Algorithm for Sorting Pattern-Avoiding Sequences, by Michal Opler, paper describing a sorting algorithm for permutations avoiding certain patterns.
- GitHub repo implementing Vincent's algo and other, by Pinto and Dutra (former Martin's students).