Page Not Found
Page not found. Your pixels are in another canvas.
A list of all the posts and pages found on the site. For you robots out there is an XML version available for digesting as well.
Page not found. Your pixels are in another canvas.
About me
This is a page not in th emain menu
Published:
This post will show up by default. To disable scheduling of future posts, edit config.yml and set future: false.
Published:
This is a sample blog post. Lorem ipsum I can’t remember the rest of lorem ipsum and don’t have an internet connection right now. Testing testing testing this blog post. Blog posts are cool.
Published:
This is a sample blog post. Lorem ipsum I can’t remember the rest of lorem ipsum and don’t have an internet connection right now. Testing testing testing this blog post. Blog posts are cool.
Published:
This is a sample blog post. Lorem ipsum I can’t remember the rest of lorem ipsum and don’t have an internet connection right now. Testing testing testing this blog post. Blog posts are cool.
Published:
This is a sample blog post. Lorem ipsum I can’t remember the rest of lorem ipsum and don’t have an internet connection right now. Testing testing testing this blog post. Blog posts are cool.
Short description of portfolio item number 1
Short description of portfolio item number 2 
Published in Proceedings of FSCD, LIPIcs 337, 13:1-13:22, 2025
Abstract : We introduce ultrarings, which simultaneously generalize commutative rings and Boolean lextensive categories. As such, they allow to blend together standard algebraic notions (from commutative algebra) and logical notions (from categorical logic), providing a unifying descriptive framework in which complexity classes over arbitrary rings (as in the Blum, Schub, Smale model) and usual, Boolean complexity classes may be captured in a uniform way.’ Download paper here
Recommended citation: Baptiste Chanus and Damiano Mazza and Morgan Rogers (2025). "Unifying Boolean and Algebraic Descriptive Complexity." Proceedings of FSCD. 1(1). https://bchanus.github.io/files/UnifDescComp.pdf
Published:
Presentation to the rest of the team during the team’s annual seminar
Published:
Presentation during the annual meeting of the SCALP group Slides
Published:
Presentation during the complexity days Slides
Published:
Presentation at the IHPST Slides
Licence 2, Université Sorbonne Paris Nord, Département d'informatique, 2022
Responsable du cours : Pierre Rousselin Volume horaire : 18h de TD
Licence 1, Université Sorbonne Paris Nord, Département d'informatique, 2023
Responsable du cours : Marie Kerjean Volume horaire : 18h de TD
Licence 3, Université Sorbonne Paris Nord, Département d'informatique, 2023
Responsable du cours : Joseph Le Roux Volume horaire : 19.5h de TP + 6h de TD
Licence 3, Université Sorbonne Paris Nord, Département d'informatique, 2023
Responsable du cours : Frédérique Roupin Volume horaire : 19.5h de TP
Licence 2, Université Sorbonne Paris Nord, Département d'informatique, 2024
Responsable du cours : Thierry Monteil Volume horaire : 30h de TP
Licence 1, Université Sorbonne Paris Nord, Département d'informatique, 2024
Responsable du cours : Sergueï Lenglet Volume horaire : 18h de TD
Licence 2, Université Sorbonne Paris Nord, Département d'informatique, 2024
Responsable du cours : Flavien Breuvart Volume horaire : 16.5h de TD
Licence 2, Université Sorbonne Paris Nord, Département d'informatique, 2025
Responsable du cours : Thierry Monteil Volume horaire : 30h de TP
Licence 3, Université Sorbonne Paris Nord, Département d'informatique, 2025
Responsable du cours : Christian Codognet Volume horaire : 19.5h de TD