The LRDE is a research laboratory under the tutelage of EPITA, Graduate School of Computer Science.
Building on its solid scientific production and academic collaborations, the laboratory has industrial contracts, conducts internal research projects and participates in collaborative academic research projects.
Latest news RSS
- Publication Introducing the Dahu Pseudo-Distance in Mathematical Morphology and Its Application to Signal and Image Processing -- Proceedings of the 13th International Symposium on Mathematical Morphology (ISMM) — 23 February 2017
- Publication Morphological Hierarchical Image Decomposition Based on Laplacian 0-Crossings in Mathematical Morphology and Its Application to Signal and Image Processing -- Proceedings of the 13th International Symposium on Mathematical Morphology (ISMM) — 23 February 2017
- Publication Periodic Area-of-Motion characterization for Bio-Medical applications in Proceedings of the IEEE International Symposium on Bio-Medical Imaging (ISBI) — 20 February 2017
- Alexandre Duret-Lutz defends his Habilitation thesis "Contributions to LTL and ω-automata for Model Checking" at EPITA at 2:15pm. — 10 February 2017
- LRDE Seminar on Automata - Vcsn : une visite guidée by Akim Demaille, LRDE, et Un outil en ligne de manipulation d'automates et de semi-groupes by Charles Paperman, Université Paris Diderot — 8 February 2017
- Publication Analysis of Algorithms Calculating the Maximal Disjoint Decomposition of a Set — 2 February 2017
- Publication Contributions to LTL and ω-Automata for Model Checking — 1 February 2017
- CSI Seminar : CSI 2017 students students present their work. — 31 January 2017
You can find the programme here.Seminars are free and open to anyone.
- Vcsn 2.5 released — 28 January 2017
The Vcsners are proud to announce the release of Vcsn 2.5, aka the k-lightest release!
- Spot 2.3 was released — 19 January 2017
This new release features some exciting news such as: faster emptiness checks for automata that are not explored on-the-fly, several improvements to the SAT-based minimization procedure, preliminary support for alternating automata, membership tests for all classes of the Manna and Pnueli hierarchy of temporal properties.