@inproceedings{pst24b,
author = {K{\'{e}}vin Perrot and Sylvain Sen{\'{e}} and L{\'{e}}ah Tapin},
title = {{Complexity of Boolean automata networks under block-parallel update modes}},
booktitle = {Proceedings of SAND'2024},
year = {2024},
eprint = {2402.06294},
note = {To appear}
}
@inproceedings{pst24a,
author = {K{\'{e}}vin Perrot and Sylvain Sen{\'{e}} and L{\'{e}}ah Tapin},
title = {{Combinatorics of Block-Parallel Automata Networks}},
booktitle = {Proceedings of SOFSEM'2024},
series = {LNCS},
volume = {14519},
pages = {442--455},
publisher = {Springer},
year = {2024},
doi = {10.1007/978-3-031-52113-3\_31},
eprint = {2304.09664},
note = {}
}
@article{abgprt23,
title = {On the Dynamics of Bounded-Degree Automata Networks},
author = {Aracena, Julio and Bridoux, Florian and Guillon, Pierre and Perrot, K{\'e}vin and Richard, Adrien and Theyssier, Guillaume},
year = {2023},
journal = {Exploratory paper of AUTOMATA'2023},
doi = {10.5281/zenodo.8276266},
pdf = {https://zenodo.org/records/8276266/files/paper_5_version2.pdf},
hal = {https://hal.science/hal-04261253},
note = {}
}
@article{ggpt23,
author = {Gamard, Guilhem and Guillon, Pierre and Perrot, Kevin and Theyssier, Guillaume},
title = {{Hardness of monadic second-order formulae over succinct graphs}},
booktitle = {Preprint},
pages = {25},
year = {2023},
hal = {https://hal.science/hal-03978957},
eprint = {2302.04522},
note = {}
}
@article{bppmr23,
title = {{Interaction graphs of isomorphic automata networks I: Complete digraph and minimum in-degree}},
author = {Bridoux, Florian and Perrot, K{\'e}vin and Picard Marchetto, Aymeric and Richard, Adrien},
year = {2023},
volume = {138},
pages = {103458},
journal = {Journal of Computer and System Sciences},
eprint = {2301.01958},
doi = {10.1016/j.jcss.2023.05.003},
note = {}
}
@article{bdpr22,
title = {{Complexity of fixed point counting problems in Boolean Networks}},
author = {Bridoux, Florian and Durbec, Am{\'e}lia and Perrot, K{\'e}vin and Richard, Adrien},
year = {2022},
volume = {126},
pages = {138--164},
journal = {Journal of Computer and System Sciences},
eprint = {2012.02513},
doi = {10.1016/j.jcss.2022.01.004},
note = {}
}
@inproceedings{pps21b,
author = {Perrot, K{\'e}vin and Perrotin, Pac{\^o}me and Sen{\'e}, Sylvain},
title = {{Optimising attractor computation in Boolean automata networks}},
booktitle = {Proceedings of LATA'2021},
pages = {68--80},
year = {2021},
volume = {12638},
series = {LNCS},
eprint = {2005.14531},
note = {}
}
@article{pps21a,
author = {Perrot, K{\'e}vin and Perrotin, Pac{\^o}me and Sen{\'e}, Sylvain},
title = {{On Boolean automata networks (de)composition}},
journal = {Fundamenta Informaticae},
year = {2021},
volume = {181},
number = {2-3},
pages = {163--188},
eprint = {1802.10400},
doi = {10.3233/FI-2021-2055},
note = {}
}
@inproceedings{ggpt21,
author = {Gamard, Guilhem and Guillon, Pierre and Perrot, Kevin and Theyssier, Guillaume},
title = {{Rice-Like Theorems for Automata Networks}},
booktitle = {Proceedings of STACS'2021},
pages = {32:1--32:17},
series = {LIPIcs},
year = {2021},
volume = {187},
publisher = {Schloss Dagstuhl},
doi = {10.4230/LIPIcs.STACS.2021.32},
note = {}
}
@inproceedings{bgmps21,
author = {Bridoux, Florian and Gaze-Maillot, Caroline and Perrot, K{\'e}vin and Sen{\'e}, Sylvain},
title = {Complexity of Limit-Cycle Problems in Boolean Networks},
booktitle = {Proceedings of SOFSEM'2021},
year = {2021},
series = {LNCS},
volume = {12607},
pages = {135--146},
publisher = {Springer},
doi = {10.1007/978-3-030-67731-2_10},
eprint = {2001.07391},
note = {}
}
@inproceedings{pps20,
title = {{On the Complexity of Acyclic Modules in Automata Networks}},
author = {Perrot, K{\'e}vin and Perrotin, Pac\^{o}me and Sen\'{e}, Sylvain},
year = {2020},
booktitle = {Proceedings of TAMC'2020},
pages = {168--180},
doi = {10.1007/978-3-030-59267-7_15},
series = {LNCS},
volume = {12337},
publisher = {Springer},
eprint = {1910.07299},
note = {}
}
@inproceedings{npsv20,
title = {{#P-completeness of counting update digraphs, cacti, and series-parallel decomposition method}},
author = {No{\^u}s, Camille and Perrot, K{\'e}vin and Sen{\'e}, Sylvain and Venturini, Lucas},
year = {2020},
booktitle = {Proceedings of CiE'2020},
pages = {326--338},
doi = {10.1007/978-3-030-51466-2_30},
series = {LNCS},
volume = {12098},
publisher = {Springer},
eprint = {2004.02129},
note = {}
}
@inproceedings{bdpr19,
title = {{Complexity of Maximum Fixed Point Problem in Boolean Networks}},
author = {Bridoux, Florian and Durbec, Nicolas and Perrot, K{\'e}vin and Richard, Adrien},
year = {2019},
booktitle = {Proceedings of CiE'2019},
pages = {132--143},
doi = {10.1007/978-3-030-22996-2_12},
series = {LNCS},
volume = {11558},
publisher = {Springer},
hal = {https://hal.archives-ouvertes.fr/hal-02403974},
note = {}
}
@inproceedings{pps18,
title = {{A framework for (de)composing with Boolean automata networks}},
author = {Perrot, K{\'e}vin and Perrotin, Pac\^{o}me and Sen\'{e}, Sylvain},
year = {2018},
booktitle = {Proceedings of MCU'2018},
pages = {121--136},
doi = {10.1007/978-3-319-92402-1_7},
series = {LNCS},
volume = {10881},
publisher = {Springer},
eprint = {1802.10400},
hal = {https://hal.archives-ouvertes.fr/hal-01654221},
note = {}
}
@inproceedings{bgpst17,
author = {Florian Bridoux and Pierre Guillon and K{\'{e}}vin Perrot and Sylvain Sen{\'{e}} and Guillaume Theyssier},
title = {On the Cost of Simulating a Parallel Boolean Automata Network by a Block-Sequential One},
booktitle = {Proceedings of TAMC'2017},
pages = {112--128},
year = {2017},
doi = {10.1007/978-3-319-55911-7_9},
series = {LNCS},
volume = {10185},
publisher = {Springer},
eprint = {1702.03101},
hal = {https://hal.archives-ouvertes.fr/hal-01479439},
note = {}
}
@inproceedings{aps16,
author = {Alcolei, Aurore and Perrot, K{\'e}vin and Sen{\'e}, Sylvain},
title = {{On the flora of asynchronous locally non-monotonic Boolean automata networks}},
booktitle = {Proceedings of SASB'2015},
pages = {3--25},
year = {2016},
series = {ENTCS},
volume = {326},
eprint = {1510.05452},
doi = {10.1016/j.entcs.2016.09.016},
note = {}
}
This file was generated by bibtex2html 1.99.