Skip to content

Commit 0b30888

Browse files
authored
Update publications
1 parent 2fb6b3e commit 0b30888

1 file changed

Lines changed: 4 additions & 2 deletions

File tree

docs/publications.md

Lines changed: 4 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -26,10 +26,12 @@ The article is also available on [HAL](https://hal.science/hal-03269121v4/docume
2626

2727
Mentions of pymwp in scientific literature.
2828

29-
* Seiller, Thomas. _"Mathematical informatics."_ HDR, Université Sorbonne Paris Nord, 2024. <https://theses.hal.science/tel-04616661/>
29+
* Rusch, Neea. _"Applied Implicit Computational Complexity."_ PhD Thesis, Augusta University, 2025. <https://doi.org/10.5281/zenodo.17148449>
30+
31+
* Seiller, Thomas. _"Mathematical informatics."_ HDR, Université Sorbonne Paris Nord, 2024. <https://theses.hal.science/tel-04616661>
3032

3133
* Aubert, Clément, Thomas Rubiano, Neea Rusch, and Thomas Seiller. _“Pymwp: A Static Analyzer Determining Polynomial Growth Bounds.”_ Automated Technology for Verification and Analysis, 2023, 263–75. <https://doi.org/10.1007/978-3-031-45332-8_14>.
3234

3335
* Rusch, Neea. _“Formally Verified Resource Bounds through Implicit Computational Complexity.”_ Companion Proceedings of the 2022 ACM SIGPLAN International Conference on Systems, Programming, Languages, and Applications: Software for Humanity, 2022, 17–20. <https://doi.org/10.1145/3563768.3565545>.
3436

35-
* Aubert, Clément, Thomas Rubiano, Neea Rusch, and Thomas Seiller. _“MWP-analysis improvement and implementation: realizing implicit computational complexity.“_ 7th International Conference on Formal Structures for Computation and Deduction (FSCD 2022). Leibniz International Proceedings in Informatics, vol. 228, pp. 26:1–26:23. Schloss Dagstuhl-Leibniz-Zentrum für Informatik (2022). <https://doi.org/10.4230/LIPIcs.FSCD.2022.26>.
37+
* Aubert, Clément, Thomas Rubiano, Neea Rusch, and Thomas Seiller. _“MWP-analysis improvement and implementation: realizing implicit computational complexity.“_ 7th International Conference on Formal Structures for Computation and Deduction (FSCD 2022). Leibniz International Proceedings in Informatics, vol. 228, pp. 26:1–26:23. Schloss Dagstuhl-Leibniz-Zentrum für Informatik (2022). <https://doi.org/10.4230/LIPIcs.FSCD.2022.26>.

0 commit comments

Comments
 (0)