Published in: LIPIcs, Volume 272, 48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023)
Julien Clément and Antoine Genitrini. An Iterative Approach for Counting Reduced Ordered Binary Decision Diagrams. In 48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 272, pp. 36:1-36:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{clement_et_al:LIPIcs.MFCS.2023.36, author = {Cl\'{e}ment, Julien and Genitrini, Antoine}, title = {{An Iterative Approach for Counting Reduced Ordered Binary Decision Diagrams}}, booktitle = {48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023)}, pages = {36:1--36:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-292-1}, ISSN = {1868-8969}, year = {2023}, volume = {272}, editor = {Leroux, J\'{e}r\^{o}me and Lombardy, Sylvain and Peleg, David}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2023.36}, URN = {urn:nbn:de:0030-drops-185702}, doi = {10.4230/LIPIcs.MFCS.2023.36}, annote = {Keywords: Boolean Function, Reduced Ordered Binary Decision Diagram (\{robdd\}), Enumerative Combinatorics, Directed Acyclic Graph} }
Published in: DARTS, Volume 6, Issue 2, Special Issue of the 34th European Conference on Object-Oriented Programming (ECOOP 2020)
Keigo Imai, Rumyana Neykova, Nobuko Yoshida, and Shoji Yuen. Multiparty Session Programming with Global Protocol Combinators (Artifact). In Special Issue of the 34th European Conference on Object-Oriented Programming (ECOOP 2020). Dagstuhl Artifacts Series (DARTS), Volume 6, Issue 2, pp. 18:1-18:2, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@Article{imai_et_al:DARTS.6.2.18, author = {Imai, Keigo and Neykova, Rumyana and Yoshida, Nobuko and Yuen, Shoji}, title = {{Multiparty Session Programming with Global Protocol Combinators (Artifact)}}, pages = {18:1--18:2}, journal = {Dagstuhl Artifacts Series}, ISSN = {2509-8195}, year = {2020}, volume = {6}, number = {2}, editor = {Imai, Keigo and Neykova, Rumyana and Yoshida, Nobuko and Yuen, Shoji}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DARTS.6.2.18}, URN = {urn:nbn:de:0030-drops-132159}, doi = {10.4230/DARTS.6.2.18}, annote = {Keywords: Multiparty Session Types, Communication Protocol, Concurrent and Distributed Programming, OCaml} }
Published in: LIPIcs, Volume 164, 36th International Symposium on Computational Geometry (SoCG 2020)
David Cohen-Steiner, André Lieutier, and Julien Vuillamy. Lexicographic Optimal Homologous Chains and Applications to Point Cloud Triangulations. In 36th International Symposium on Computational Geometry (SoCG 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 164, pp. 32:1-32:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{cohensteiner_et_al:LIPIcs.SoCG.2020.32, author = {Cohen-Steiner, David and Lieutier, Andr\'{e} and Vuillamy, Julien}, title = {{Lexicographic Optimal Homologous Chains and Applications to Point Cloud Triangulations}}, booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)}, pages = {32:1--32:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-143-6}, ISSN = {1868-8969}, year = {2020}, volume = {164}, editor = {Cabello, Sergio and Chen, Danny Z.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.32}, URN = {urn:nbn:de:0030-drops-121908}, doi = {10.4230/LIPIcs.SoCG.2020.32}, annote = {Keywords: OHCP, simplicial homology, triangulation, Delaunay} }
Published in: LIPIcs, Volume 147, 26th International Symposium on Temporal Representation and Reasoning (TIME 2019)
Quentin Peyras, Julien Brunel, and David Chemouil. A Bounded Domain Property for an Expressive Fragment of First-Order Linear Temporal Logic. In 26th International Symposium on Temporal Representation and Reasoning (TIME 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 147, pp. 15:1-15:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{peyras_et_al:LIPIcs.TIME.2019.15, author = {Peyras, Quentin and Brunel, Julien and Chemouil, David}, title = {{A Bounded Domain Property for an Expressive Fragment of First-Order Linear Temporal Logic}}, booktitle = {26th International Symposium on Temporal Representation and Reasoning (TIME 2019)}, pages = {15:1--15:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-127-6}, ISSN = {1868-8969}, year = {2019}, volume = {147}, editor = {Gamper, Johann and Pinchinat, Sophie and Sciavicco, Guido}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.TIME.2019.15}, URN = {urn:nbn:de:0030-drops-113731}, doi = {10.4230/LIPIcs.TIME.2019.15}, annote = {Keywords: First-Order Linear Temporal Logic, Bounded Domain Property, Finite Domain Property, Decidability} }
Published in: LIPIcs, Volume 105, 29th Annual Symposium on Combinatorial Pattern Matching (CPM 2018)
Guillaume Fertin, Julien Fradin, and Christian Komusiewicz. On the Maximum Colorful Arborescence Problem and Color Hierarchy Graph Structure. In 29th Annual Symposium on Combinatorial Pattern Matching (CPM 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 105, pp. 17:1-17:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{fertin_et_al:LIPIcs.CPM.2018.17, author = {Fertin, Guillaume and Fradin, Julien and Komusiewicz, Christian}, title = {{On the Maximum Colorful Arborescence Problem and Color Hierarchy Graph Structure}}, booktitle = {29th Annual Symposium on Combinatorial Pattern Matching (CPM 2018)}, pages = {17:1--17:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-074-3}, ISSN = {1868-8969}, year = {2018}, volume = {105}, editor = {Navarro, Gonzalo and Sankoff, David and Zhu, Binhai}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2018.17}, URN = {urn:nbn:de:0030-drops-86939}, doi = {10.4230/LIPIcs.CPM.2018.17}, annote = {Keywords: Subgraph problem, computational complexity, algorithms, fixed-parameter tractability, kernelization} }
Published in: LIPIcs, Volume 42, 26th International Conference on Concurrency Theory (CONCUR 2015)
Laura Bocchi, Julien Lange, and Nobuko Yoshida. Meeting Deadlines Together. In 26th International Conference on Concurrency Theory (CONCUR 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 42, pp. 283-296, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{bocchi_et_al:LIPIcs.CONCUR.2015.283, author = {Bocchi, Laura and Lange, Julien and Yoshida, Nobuko}, title = {{Meeting Deadlines Together}}, booktitle = {26th International Conference on Concurrency Theory (CONCUR 2015)}, pages = {283--296}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-91-0}, ISSN = {1868-8969}, year = {2015}, volume = {42}, editor = {Aceto, Luca and de Frutos Escrig, David}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2015.283}, URN = {urn:nbn:de:0030-drops-53838}, doi = {10.4230/LIPIcs.CONCUR.2015.283}, annote = {Keywords: timed automata, multiparty session types, global specification} }
Published in: LIPIcs, Volume 14, 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)
Frédérique Bassino, Julien David, and Andrea Sportiello. Asymptotic enumeration of Minimal Automata. In 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012). Leibniz International Proceedings in Informatics (LIPIcs), Volume 14, pp. 88-99, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
@InProceedings{bassino_et_al:LIPIcs.STACS.2012.88, author = {Bassino, Fr\'{e}d\'{e}rique and David, Julien and Sportiello, Andrea}, title = {{Asymptotic enumeration of Minimal Automata}}, booktitle = {29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)}, pages = {88--99}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-35-4}, ISSN = {1868-8969}, year = {2012}, volume = {14}, editor = {D\"{u}rr, Christoph and Wilke, Thomas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2012.88}, URN = {urn:nbn:de:0030-drops-34328}, doi = {10.4230/LIPIcs.STACS.2012.88}, annote = {Keywords: minimal automata, regular languages, enumeration of random structures} }
Published in: LIPIcs, Volume 3, 26th International Symposium on Theoretical Aspects of Computer Science (2009)
Frederique Bassino, Julien David, and Cyril Nicaud. On the Average Complexity of Moore's State Minimization Algorithm. In 26th International Symposium on Theoretical Aspects of Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 3, pp. 123-134, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{bassino_et_al:LIPIcs.STACS.2009.1822, author = {Bassino, Frederique and David, Julien and Nicaud, Cyril}, title = {{On the Average Complexity of Moore's State Minimization Algorithm}}, booktitle = {26th International Symposium on Theoretical Aspects of Computer Science}, pages = {123--134}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-09-5}, ISSN = {1868-8969}, year = {2009}, volume = {3}, editor = {Albers, Susanne and Marion, Jean-Yves}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2009.1822}, URN = {urn:nbn:de:0030-drops-18222}, doi = {10.4230/LIPIcs.STACS.2009.1822}, annote = {Keywords: Finite automata, State minimization, Moore’s algorithm, Average complexity} }
Feedback for Dagstuhl Publishing