Published in: LIPIcs, Volume 229, 49th International Colloquium on Automata, Languages, and Programming (ICALP 2022)
Djamel Eddine Amir and Mathieu Hoyrup. Computability of Finite Simplicial Complexes. In 49th International Colloquium on Automata, Languages, and Programming (ICALP 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 229, pp. 111:1-111:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{amir_et_al:LIPIcs.ICALP.2022.111, author = {Amir, Djamel Eddine and Hoyrup, Mathieu}, title = {{Computability of Finite Simplicial Complexes}}, booktitle = {49th International Colloquium on Automata, Languages, and Programming (ICALP 2022)}, pages = {111:1--111:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-235-8}, ISSN = {1868-8969}, year = {2022}, volume = {229}, editor = {Boja\'{n}czyk, Miko{\l}aj and Merelli, Emanuela and Woodruff, David P.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2022.111}, URN = {urn:nbn:de:0030-drops-164522}, doi = {10.4230/LIPIcs.ICALP.2022.111}, annote = {Keywords: Computable Type, Simplicial Complex, Surjection Property, Topological Cone, Absolute Neighborhood Retract, Dunce Hat, Bing’s House} }
Published in: LIPIcs, Volume 187, 38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021)
Guilhem Gamard, Pierre Guillon, Kevin Perrot, and Guillaume Theyssier. Rice-Like Theorems for Automata Networks. In 38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 187, pp. 32:1-32:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{gamard_et_al:LIPIcs.STACS.2021.32, author = {Gamard, Guilhem and Guillon, Pierre and Perrot, Kevin and Theyssier, Guillaume}, title = {{Rice-Like Theorems for Automata Networks}}, booktitle = {38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021)}, pages = {32:1--32:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-180-1}, ISSN = {1868-8969}, year = {2021}, volume = {187}, editor = {Bl\"{a}ser, Markus and Monmege, Benjamin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2021.32}, URN = {urn:nbn:de:0030-drops-136770}, doi = {10.4230/LIPIcs.STACS.2021.32}, annote = {Keywords: Automata networks, Rice theorem, complexity classes, polynomial hierarchy, hardness} }
Published in: LIPIcs, Volume 58, 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)
Guilhem Gamard and Gwenaël Richomme. Determining Sets of Quasiperiods of Infinite Words. In 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 58, pp. 40:1-40:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{gamard_et_al:LIPIcs.MFCS.2016.40, author = {Gamard, Guilhem and Richomme, Gwena\"{e}l}, title = {{Determining Sets of Quasiperiods of Infinite Words}}, booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)}, pages = {40:1--40:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-016-3}, ISSN = {1868-8969}, year = {2016}, volume = {58}, editor = {Faliszewski, Piotr and Muscholl, Anca and Niedermeier, Rolf}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2016.40}, URN = {urn:nbn:de:0030-drops-64540}, doi = {10.4230/LIPIcs.MFCS.2016.40}, annote = {Keywords: combinatorics on Words, quasiperiodicity, Sturmian words} }
Feedback for Dagstuhl Publishing