| No. |
Title |
Author |
Year |
| 1 |
The Computational Complexity of Evil Hangman |
Barbay, Jérémy et al. |
2020 |
| 2 |
Synergies between Adaptive Analysis of Algorithms, Parameterized Complexity, Compressed Data Structures and Compressed Indices (Dagstuhl Seminar 18281) |
Barbay, Jérémy et al. |
2019 |
| 3 |
Synergistic Solutions on MultiSets |
Barbay, Jérémy et al. |
2017 |
| 4 |
Optimal Prefix Free Codes with Partial Sorting |
Barbay, Jérémy |
2016 |
| 5 |
Selenite Towers Move Faster Than Hanoï Towers, But Still Require Exponential Time |
Barbay, Jérémy |
2016 |
| 6 |
09171 Abstracts Collection -- Adaptive, Output Sensitive, Online and Parameterized Algorithms |
Barbay, Jérémy et al. |
2009 |
| 7 |
09171 Executive Summary -- Adaptive, Output Sensitive, Online and Parameterized Algorithms |
Barbay, Jérémy et al. |
2009 |
| 8 |
Compressed Representations of Permutations, and Applications |
Barbay, Jeremy et al. |
2009 |
