This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision | |||
|
teaching:2025winter:journalclub [2025/11/24 13:53] jstoye [Schedule] |
teaching:2025winter:journalclub [2025/11/25 11:17] (current) luca [Schedule] |
||
|---|---|---|---|
| Line 17: | Line 17: | ||
| | 24.11.2025 | [[https://doi.org/10.1145/3356020|Anderson & Merkle: A Generic Framework for Engineering Graph Canonization | | 24.11.2025 | [[https://doi.org/10.1145/3356020|Anderson & Merkle: A Generic Framework for Engineering Graph Canonization | ||
| Algorithms]]. Exp. Algorithmics 25, 1, Article 1.2, 2020. | Luca P | | Algorithms]]. Exp. Algorithmics 25, 1, Article 1.2, 2020. | Luca P | | ||
| - | | 01.12.2025 | | Leonard B | | + | | 01.12.2025 | [[https://www.sciencedirect.com/science/article/pii/0196677481900134| Fast canonization of circular strings]], Journal of Algorithms, Volume 2, Issue 2, 1981, | Leonard B | |
| - | | 08.12.2025 | | Kamil H | | + | | 08.12.2025 | [[https://www.sciencedirect.com/science/article/pii/089054019190016U| Optimal canonization of all substrings of a string]], Information and Computation, Volume 95, Issue 1, 1991| Kamil H | |
| - | | 15.12.2025 | | | | + | | 15.12.2025 |[[https://www.sciencedirect.com/science/article/pii/S1570866717300175| Practical algorithms to rank necklaces, Lyndon words, and de Bruijn sequences]], Journal of Discrete Algorithms, Volume 43, 2017| | |
| | Winter break ||| | | Winter break ||| | ||
| | 05.01.2026 | | | | | 05.01.2026 | | | | ||