Shorter Research Writings
Peer reviewed workshop papers and extended abstracts.
Applied Implicit Computational ComplexityECOOP Doctoral Symposium 2025.
Neea Rusch
Certifying Complexity AnalysisCoqPL 2023.
Clรฉment Aubert, Thomas Rubiano, Neea Rusch, and Thomas Seiller
Formally Verified Resource Bounds through Implicit Computational ComplexitySPLASH Doctoral Symposium 2022, DOI: 10.1145/3563768.3565545.
Neea Rusch
Realizing Implicit Computational ComplexityTYPES 2022.
Clรฉment Aubert, Thomas Rubiano, Neea Rusch, and Thomas Seiller