Profil

Mainz Isabelle

Main Referenced Co-authors
Boigelot, Bernard  (3)
Herbreteau, Frédéric (1)
Kleyntssens, Thomas  (1)
Marsault, Victor  (1)
Nicolay, Samuel  (1)
Main Referenced Keywords
acceleration (1); algorithme (1); Automata (1); Computational Geometry (1); Convex Polyhedra (1);
Main Referenced Unit & Research Centers
Montefiore Institute - Montefiore Institute of Electrical Engineering and Computer Science - ULiège [BE] (2)
Mathématiques (1)
Main Referenced Disciplines
Computer science (4)
Mathematics (2)

Publications (total 5)

The most downloaded
383 downloads
Boigelot, B., & Mainz, I. (2018). Efficient Symbolic Representation of Convex Polyhedra in High-Dimensional Spaces. Lecture Notes in Computer Science. doi:10.1007/978-3-030-01090-4_17 https://hdl.handle.net/2268/227564

The most cited

5 citations (Scopus®)

Boigelot, B., Mainz, I., Marsault, V., & Rigo, M. (August 2017). An efficient algorithm to decide periodicity of b-recognisable sets using MSDF convention. Leibniz International Proceedings in Informatics, 80. doi:10.4230/LIPIcs.ICALP.2017.118 https://hdl.handle.net/2268/212135

Mainz, I. (2020). Symbolic Representation of Convex Polyhedra in High-Dimensional Spaces [Doctoral thesis, ULiège - Université de Liège]. ORBi-University of Liège. https://orbi.uliege.be/handle/2268/244074

Boigelot, B., & Mainz, I. (2018). Efficient Symbolic Representation of Convex Polyhedra in High-Dimensional Spaces. Lecture Notes in Computer Science. doi:10.1007/978-3-030-01090-4_17
Peer reviewed

Boigelot, B., Mainz, I., Marsault, V., & Rigo, M. (August 2017). An efficient algorithm to decide periodicity of b-recognisable sets using MSDF convention. Leibniz International Proceedings in Informatics, 80. doi:10.4230/LIPIcs.ICALP.2017.118
Peer Reviewed verified by ORBi

Nicolay, S., Kleyntssens, T., & Mainz, I. (2015). Les algorithmes : entre quotidien et créativité [Paper presentation]. Soirée de clôture de saison Liège Créative, Liège, Belgium.

Boigelot, B., Herbreteau, F., & Mainz, I. (2014). Acceleration of Affine Hybrid Transformations. Lecture Notes in Computer Science, 8837, 31-46. doi:10.1007/978-3-319-11936-6_4
Peer reviewed

Contact ORBi