Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Antoine Genitrini
@inproceedings{DBLP:conf/mfcs/0001G23,
author = {Julien Cl{\'{e}}ment and
Antoine Genitrini},
editor = {J{\'{e}}r{\^{o}}me Leroux and
Sylvain Lombardy and
David Peleg},
title = {An Iterative Approach for Counting Reduced Ordered Binary Decision
Diagrams},
booktitle = {48th International Symposium on Mathematical Foundations of Computer
Science, {MFCS} 2023, August 28 to September 1, 2023, Bordeaux, France},
series = {LIPIcs},
volume = {272},
pages = {36:1--36:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2023.36},
doi = {10.4230/LIPICS.MFCS.2023.36},
timestamp = {Mon, 28 Aug 2023 15:00:20 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/0001G23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/aam/BodiniGMN22,
author = {Olivier Bodini and
Antoine Genitrini and
C{\'{e}}cile Mailler and
Mehdi Naima},
title = {Strict monotonic trees arising from evolutionary processes: Combinatorial
and probabilistic study},
journal = {Adv. Appl. Math.},
volume = {133},
pages = {102284},
year = {2022},
url = {https://doi.org/10.1016/j.aam.2021.102284},
doi = {10.1016/J.AAM.2021.102284},
timestamp = {Sat, 25 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/aam/BodiniGMN22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BodiniGGLN22,
author = {Olivier Bodini and
Antoine Genitrini and
Bernhard Gittenberger and
Isabella Larcher and
Mehdi Naima},
title = {Compaction for two models of logarithmic-depth trees: Analysis and
experiments},
journal = {Random Struct. Algorithms},
volume = {61},
number = {1},
pages = {31--61},
year = {2022},
url = {https://doi.org/10.1002/rsa.21056},
doi = {10.1002/RSA.21056},
timestamp = {Mon, 05 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BodiniGGLN22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GenitriniPP22,
author = {Antoine Genitrini and
Martin P{\'{e}}pin and
Fr{\'{e}}d{\'{e}}ric Peschanski},
title = {A quantitative study of fork-join processes with non-deterministic
choice: Application to the statistical exploration of the state-space},
journal = {Theor. Comput. Sci.},
volume = {912},
pages = {1--36},
year = {2022},
url = {https://doi.org/10.1016/j.tcs.2022.01.014},
doi = {10.1016/J.TCS.2022.01.014},
timestamp = {Wed, 27 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/GenitriniPP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ictac/DienGP22,
author = {Matthieu Dien and
Antoine Genitrini and
Fr{\'{e}}d{\'{e}}ric Peschanski},
editor = {Helmut Seidl and
Zhiming Liu and
Corina S. Pasareanu},
title = {A Combinatorial Study of Async/Await Processes},
booktitle = {Theoretical Aspects of Computing - {ICTAC} 2022 - 19th International
Colloquium, Tbilisi, Georgia, September 27-29, 2022, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13572},
pages = {170--187},
publisher = {Springer},
year = {2022},
url = {https://doi.org/10.1007/978-3-031-17715-6\_12},
doi = {10.1007/978-3-031-17715-6\_12},
timestamp = {Mon, 05 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ictac/DienGP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/BodiniGN22,
author = {Olivier Bodini and
Antoine Genitrini and
Mehdi Naima},
editor = {Armando Casta{\~{n}}eda and
Francisco Rodr{\'{\i}}guez{-}Henr{\'{\i}}quez},
title = {A Combinatorial Link Between Labelled Graphs and Increasingly Labelled
Schr{\"{o}}der Trees},
booktitle = {{LATIN} 2022: Theoretical Informatics - 15th Latin American Symposium,
Guanajuato, Mexico, November 7-11, 2022, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13568},
pages = {493--509},
publisher = {Springer},
year = {2022},
url = {https://doi.org/10.1007/978-3-031-20624-5\_30},
doi = {10.1007/978-3-031-20624-5\_30},
timestamp = {Sun, 13 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/latin/BodiniGN22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2211-04938,
author = {Julien Cl{\'{e}}ment and
Antoine Genitrini},
title = {Combinatorics of Reduced Ordered Binary Decision Diagrams: Application
to uniform random sampling},
journal = {CoRR},
volume = {abs/2211.04938},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2211.04938},
doi = {10.48550/ARXIV.2211.04938},
eprinttype = {arXiv},
eprint = {2211.04938},
timestamp = {Tue, 15 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2211-04938.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithms/GenitriniP21,
author = {Antoine Genitrini and
Martin P{\'{e}}pin},
title = {Lexicographic Unranking of Combinations Revisited},
journal = {Algorithms},
volume = {14},
number = {3},
pages = {97},
year = {2021},
url = {https://doi.org/10.3390/a14030097},
doi = {10.3390/A14030097},
timestamp = {Thu, 29 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithms/GenitriniP21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmtcs/BodiniDGP21,
author = {Olivier Bodini and
Matthieu Dien and
Antoine Genitrini and
Fr{\'{e}}d{\'{e}}ric Peschanski},
title = {Quantitative and Algorithmic aspects of Barrier Synchronization in
Concurrency},
journal = {Discret. Math. Theor. Comput. Sci.},
volume = {22},
number = {3},
year = {2021},
url = {https://doi.org/10.46298/dmtcs.5820},
doi = {10.46298/DMTCS.5820},
timestamp = {Tue, 24 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dmtcs/BodiniDGP21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lagos/GenitriniPV21,
author = {Antoine Genitrini and
Martin P{\'{e}}pin and
Alfredo Viola},
editor = {Carlos E. Ferreira and
Orlando Lee and
Fl{\'{a}}vio Keidi Miyazawa},
title = {Unlabelled ordered DAGs and labelled DAGs: constructive enumeration
and uniform random sampling},
booktitle = {Proceedings of the {XI} Latin and American Algorithms, Graphs and
Optimization Symposium, {LAGOS} 2021, Online Event / S{\~{a}}o Paulo,
Brazil, May 2021},
series = {Procedia Computer Science},
volume = {195},
pages = {468--477},
publisher = {Elsevier},
year = {2021},
url = {https://doi.org/10.1016/j.procs.2021.11.057},
doi = {10.1016/J.PROCS.2021.11.057},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/lagos/GenitriniPV21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BodiniGGW20,
author = {Olivier Bodini and
Antoine Genitrini and
Bernhard Gittenberger and
Stephan Wagner},
title = {On the number of increasing trees with label repetitions},
journal = {Discret. Math.},
volume = {343},
number = {8},
pages = {111722},
year = {2020},
url = {https://doi.org/10.1016/j.disc.2019.111722},
doi = {10.1016/J.DISC.2019.111722},
timestamp = {Wed, 12 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/BodiniGGW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcta/GenitriniGKW20,
author = {Antoine Genitrini and
Bernhard Gittenberger and
Manuel Kauers and
Michael Wallner},
title = {Asymptotic enumeration of compacted binary trees of bounded right
height},
journal = {J. Comb. Theory, Ser. {A}},
volume = {172},
pages = {105177},
year = {2020},
url = {https://doi.org/10.1016/j.jcta.2019.105177},
doi = {10.1016/J.JCTA.2019.105177},
timestamp = {Thu, 30 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcta/GenitriniGKW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csr/BodiniGNS20,
author = {Olivier Bodini and
Antoine Genitrini and
Mehdi Naima and
Alexandros Singh},
editor = {Henning Fernau},
title = {Families of Monotonic Trees: Combinatorial Enumeration and Asymptotics},
booktitle = {Computer Science - Theory and Applications - 15th International Computer
Science Symposium in Russia, {CSR} 2020, Yekaterinburg, Russia, June
29 - July 3, 2020, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12159},
pages = {155--168},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-50026-9\_11},
doi = {10.1007/978-3-030-50026-9\_11},
timestamp = {Mon, 22 Jun 2020 16:07:02 +0200},
biburl = {https://dblp.org/rec/conf/csr/BodiniGNS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ictac/GenitriniPP20,
author = {Antoine Genitrini and
Martin P{\'{e}}pin and
Fr{\'{e}}d{\'{e}}ric Peschanski},
editor = {Violet Ka I Pun and
Volker Stolz and
Adenilso Sim{\~{a}}o},
title = {Statistical Analysis of Non-deterministic Fork-Join Processes},
booktitle = {Theoretical Aspects of Computing - {ICTAC} 2020 - 17th International
Colloquium, Macau, China, November 30 - December 4, 2020, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12545},
pages = {83--102},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-64276-1\_5},
doi = {10.1007/978-3-030-64276-1\_5},
timestamp = {Mon, 20 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ictac/GenitriniPP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/0001G20,
author = {Julien Cl{\'{e}}ment and
Antoine Genitrini},
editor = {Yoshiharu Kohayakawa and
Fl{\'{a}}vio Keidi Miyazawa},
title = {Binary Decision Diagrams: From Tree Compaction to Sampling},
booktitle = {{LATIN} 2020: Theoretical Informatics - 14th Latin American Symposium,
S{\~{a}}o Paulo, Brazil, January 5-8, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12118},
pages = {571--583},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-61792-9\_45},
doi = {10.1007/978-3-030-61792-9\_45},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/latin/0001G20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2005-12997,
author = {Olivier Bodini and
Antoine Genitrini and
Bernhard Gittenberger and
Isabella Larcher and
Mehdi Naima},
title = {Compaction for two models of logarithmic-depth trees: Analysis and
Experiments},
journal = {CoRR},
volume = {abs/2005.12997},
year = {2020},
url = {https://arxiv.org/abs/2005.12997},
eprinttype = {arXiv},
eprint = {2005.12997},
timestamp = {Fri, 29 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2005-12997.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/BodiniGN19,
author = {Olivier Bodini and
Antoine Genitrini and
Mehdi Naima},
editor = {Marni Mishna and
J. Ian Munro},
title = {Ranked Schr{\"{o}}der Trees},
booktitle = {Proceedings of the Sixteenth Workshop on Analytic Algorithmics and
Combinatorics, {ANALCO} 2019, San Diego, CA, USA, January 6, 2019},
pages = {13--26},
publisher = {{SIAM}},
year = {2019},
url = {https://doi.org/10.1137/1.9781611975505.2},
doi = {10.1137/1.9781611975505.2},
timestamp = {Mon, 18 Feb 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/analco/BodiniGN19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/apn/BodiniDGP19,
author = {Olivier Bodini and
Matthieu Dien and
Antoine Genitrini and
Fr{\'{e}}d{\'{e}}ric Peschanski},
editor = {Susanna Donatelli and
Stefan Haar},
title = {The Combinatorics of Barrier Synchronization},
booktitle = {Application and Theory of Petri Nets and Concurrency - 40th International
Conference, {PETRI} {NETS} 2019, Aachen, Germany, June 23-28, 2019,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11522},
pages = {386--405},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-21571-2\_21},
doi = {10.1007/978-3-030-21571-2\_21},
timestamp = {Tue, 11 Jun 2019 11:30:44 +0200},
biburl = {https://dblp.org/rec/conf/apn/BodiniDGP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1907-04243,
author = {Olivier Bodini and
Matthieu Dien and
Antoine Genitrini and
Fr{\'{e}}d{\'{e}}ric Peschanski},
title = {The Combinatorics of Barrier Synchronization},
journal = {CoRR},
volume = {abs/1907.04243},
year = {2019},
url = {http://arxiv.org/abs/1907.04243},
eprinttype = {arXiv},
eprint = {1907.04243},
timestamp = {Wed, 17 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1907-04243.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1907-06743,
author = {Julien Cl{\'{e}}ment and
Antoine Genitrini},
title = {Binary Decision Diagrams: from Tree Compaction to Sampling},
journal = {CoRR},
volume = {abs/1907.06743},
year = {2019},
url = {http://arxiv.org/abs/1907.06743},
eprinttype = {arXiv},
eprint = {1907.06743},
timestamp = {Fri, 26 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1907-06743.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aofa/BodiniDGV18,
author = {Olivier Bodini and
Matthieu Dien and
Antoine Genitrini and
Alfredo Viola},
editor = {James Allen Fill and
Mark Daniel Ward},
title = {Beyond Series-Parallel Concurrent Systems: The Case of Arch Processes},
booktitle = {29th International Conference on Probabilistic, Combinatorial and
Asymptotic Methods for the Analysis of Algorithms, AofA 2018, June
25-29, 2018, Uppsala, Sweden},
series = {LIPIcs},
volume = {110},
pages = {14:1--14:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.AofA.2018.14},
doi = {10.4230/LIPICS.AOFA.2018.14},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/aofa/BodiniDGV18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1803-00843,
author = {Olivier Bodini and
Matthieu Dien and
Antoine Genitrini and
Alfredo Viola},
title = {Beyond series-parallel concurrent systems: the case of arch processes},
journal = {CoRR},
volume = {abs/1803.00843},
year = {2018},
url = {http://arxiv.org/abs/1803.00843},
eprinttype = {arXiv},
eprint = {1803.00843},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1803-00843.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1808-08376,
author = {Olivier Bodini and
Antoine Genitrini and
Mehdi Naima},
title = {Ranked Schr{\"{o}}der Trees},
journal = {CoRR},
volume = {abs/1808.08376},
year = {2018},
url = {http://arxiv.org/abs/1808.08376},
eprinttype = {arXiv},
eprint = {1808.08376},
timestamp = {Sun, 02 Sep 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1808-08376.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@book{DBLP:books/hal/Genitrini17,
author = {Antoine Genitrini},
title = {Combinatoire {\'{e}}num{\'{e}}rative et analytique en Logique
Propositionnelle et en Th{\'{e}}orie de la Concurrence : Vers
une quantification de l'expressivit{\'{e}} des mod{\`{e}}les.
(Enumerative and Analytic Combinatorics for Propositional Logic and
Concurrency Theory : Towards a quantification of the model expressiveness)},
year = {2017},
url = {https://tel.archives-ouvertes.fr/tel-02073648},
timestamp = {Fri, 12 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/books/hal/Genitrini17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/BodiniGR17,
author = {Olivier Bodini and
Antoine Genitrini and
Nicolas Rolin},
title = {Extended boxed product and application to synchronized trees},
journal = {Electron. Notes Discret. Math.},
volume = {59},
pages = {189--202},
year = {2017},
url = {https://doi.org/10.1016/j.endm.2017.05.014},
doi = {10.1016/J.ENDM.2017.05.014},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/BodiniGR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/BodiniDGP17,
author = {Olivier Bodini and
Matthieu Dien and
Antoine Genitrini and
Fr{\'{e}}d{\'{e}}ric Peschanski},
editor = {Conrado Mart{\'{\i}}nez and
Mark Daniel Ward},
title = {The Ordered and Colored Products in Analytic Combinatorics: Application
to the Quantitative Study of Synchronizations in Concurrent Processes},
booktitle = {Proceedings of the Fourteenth Workshop on Analytic Algorithmics and
Combinatorics, {ANALCO} 2017, Barcelona, Spain, Hotel Porta Fira,
January 16-17, 2017},
pages = {16--30},
publisher = {{SIAM}},
year = {2017},
url = {https://doi.org/10.1137/1.9781611974775.2},
doi = {10.1137/1.9781611974775.2},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/BodiniDGP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csr/BodiniDGP17,
author = {Olivier Bodini and
Matthieu Dien and
Antoine Genitrini and
Fr{\'{e}}d{\'{e}}ric Peschanski},
editor = {Pascal Weil},
title = {Entropic Uniform Sampling of Linear Extensions in Series-Parallel
Posets},
booktitle = {Computer Science - Theory and Applications - 12th International Computer
Science Symposium in Russia, {CSR} 2017, Kazan, Russia, June 8-12,
2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10304},
pages = {71--84},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-58747-9\_9},
doi = {10.1007/978-3-319-58747-9\_9},
timestamp = {Tue, 14 May 2019 10:00:51 +0200},
biburl = {https://dblp.org/rec/conf/csr/BodiniDGP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GenitriniGKW17,
author = {Antoine Genitrini and
Bernhard Gittenberger and
Manuel Kauers and
Michael Wallner},
title = {Asymptotic Enumeration of Compacted Binary Trees},
journal = {CoRR},
volume = {abs/1703.10031},
year = {2017},
url = {http://arxiv.org/abs/1703.10031},
eprinttype = {arXiv},
eprint = {1703.10031},
timestamp = {Thu, 30 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/GenitriniGKW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GenitriniM16,
author = {Antoine Genitrini and
C{\'{e}}cile Mailler},
title = {Generalised and Quotient Models for Random And/Or Trees and Application
to Satisfiability},
journal = {Algorithmica},
volume = {76},
number = {4},
pages = {1106--1138},
year = {2016},
url = {https://doi.org/10.1007/s00453-016-0113-3},
doi = {10.1007/S00453-016-0113-3},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/GenitriniM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/BodiniGP16,
author = {Olivier Bodini and
Antoine Genitrini and
Fr{\'{e}}d{\'{e}}ric Peschanski},
title = {A Quantitative Study of Pure Parallel Processes},
journal = {Electron. J. Comb.},
volume = {23},
number = {1},
pages = {1},
year = {2016},
url = {https://doi.org/10.37236/3977},
doi = {10.37236/3977},
timestamp = {Fri, 10 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/BodiniGP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/BodiniDFGH16,
author = {Olivier Bodini and
Matthieu Dien and
Xavier Fontaine and
Antoine Genitrini and
Hsien{-}Kuei Hwang},
editor = {Evangelos Kranakis and
Gonzalo Navarro and
Edgar Ch{\'{a}}vez},
title = {Increasing Diamonds},
booktitle = {{LATIN} 2016: Theoretical Informatics - 12th Latin American Symposium,
Ensenada, Mexico, April 11-15, 2016, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9644},
pages = {207--219},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-662-49529-2\_16},
doi = {10.1007/978-3-662-49529-2\_16},
timestamp = {Wed, 28 Feb 2024 00:16:41 +0100},
biburl = {https://dblp.org/rec/conf/latin/BodiniDFGH16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Genitrini16,
author = {Antoine Genitrini},
title = {Full asymptotic expansion for Polya structures},
journal = {CoRR},
volume = {abs/1605.00837},
year = {2016},
url = {http://arxiv.org/abs/1605.00837},
eprinttype = {arXiv},
eprint = {1605.00837},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Genitrini16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GenitriniGKM15,
author = {Antoine Genitrini and
Bernhard Gittenberger and
Veronika Kraus and
C{\'{e}}cile Mailler},
title = {Associative and commutative tree representations for Boolean functions},
journal = {Theor. Comput. Sci.},
volume = {570},
pages = {70--101},
year = {2015},
url = {https://doi.org/10.1016/j.tcs.2014.12.025},
doi = {10.1016/J.TCS.2014.12.025},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/GenitriniGKM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/BodiniG15,
author = {Olivier Bodini and
Antoine Genitrini},
editor = {Robert Sedgewick and
Mark Daniel Ward},
title = {Cuts in Increasing Trees},
booktitle = {Proceedings of the Twelfth Workshop on Analytic Algorithmics and Combinatorics,
{ANALCO} 2015, San Diego, CA, USA, January 4, 2015},
pages = {66--77},
publisher = {{SIAM}},
year = {2015},
url = {https://doi.org/10.1137/1.9781611973761.6},
doi = {10.1137/1.9781611973761.6},
timestamp = {Tue, 23 May 2017 01:10:30 +0200},
biburl = {https://dblp.org/rec/conf/analco/BodiniG15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/caldam/BodiniGPR15,
author = {Olivier Bodini and
Antoine Genitrini and
Fr{\'{e}}d{\'{e}}ric Peschanski and
Nicolas Rolin},
editor = {Sumit Ganguly and
Ramesh Krishnamurti},
title = {Associativity for Binary Parallel Processes: {A} Quantitative Study},
booktitle = {Algorithms and Discrete Applied Mathematics - First International
Conference, {CALDAM} 2015, Kanpur, India, February 8-10, 2015. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8959},
pages = {217--228},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-14974-5\_21},
doi = {10.1007/978-3-319-14974-5\_21},
timestamp = {Tue, 14 May 2019 10:00:47 +0200},
biburl = {https://dblp.org/rec/conf/caldam/BodiniGPR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/GenitriniM14,
author = {Antoine Genitrini and
C{\'{e}}cile Mailler},
editor = {Alberto Pardo and
Alfredo Viola},
title = {Equivalence Classes of Random Boolean Trees and Application to the
Catalan Satisfiability Problem},
booktitle = {{LATIN} 2014: Theoretical Informatics - 11th Latin American Symposium,
Montevideo, Uruguay, March 31 - April 4, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8392},
pages = {466--477},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-642-54423-1\_41},
doi = {10.1007/978-3-642-54423-1\_41},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/latin/GenitriniM14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BodiniGP14,
author = {Olivier Bodini and
Antoine Genitrini and
Fr{\'{e}}d{\'{e}}ric Peschanski},
title = {A Quantitative Study of Pure Parallel Processes},
journal = {CoRR},
volume = {abs/1407.1873},
year = {2014},
url = {http://arxiv.org/abs/1407.1873},
eprinttype = {arXiv},
eprint = {1407.1873},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BodiniGP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/BodiniGP13,
author = {Olivier Bodini and
Antoine Genitrini and
Fr{\'{e}}d{\'{e}}ric Peschanski},
editor = {Anil Seth and
Nisheeth K. Vishnoi},
title = {The Combinatorics of Non-determinism},
booktitle = {{IARCS} Annual Conference on Foundations of Software Technology and
Theoretical Computer Science, {FSTTCS} 2013, December 12-14, 2013,
Guwahati, India},
series = {LIPIcs},
volume = {24},
pages = {425--436},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2013},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2013.425},
doi = {10.4230/LIPICS.FSTTCS.2013.425},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/fsttcs/BodiniGP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/apal/GenitriniK12,
author = {Antoine Genitrini and
Jakub Kozik},
title = {In the full propositional logic, 5/8 of classical tautologies are
intuitionistically valid},
journal = {Ann. Pure Appl. Log.},
volume = {163},
number = {7},
pages = {875--887},
year = {2012},
url = {https://doi.org/10.1016/j.apal.2011.09.011},
doi = {10.1016/J.APAL.2011.09.011},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/apal/GenitriniK12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/GenitriniGKM12,
author = {Antoine Genitrini and
Bernhard Gittenberger and
Veronika Kraus and
C{\'{e}}cile Mailler},
title = {Probabilities of Boolean Functions given by Random Implicational Formulas},
journal = {Electron. J. Comb.},
volume = {19},
number = {2},
pages = {37},
year = {2012},
url = {https://doi.org/10.37236/2402},
doi = {10.37236/2402},
timestamp = {Fri, 10 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/GenitriniGKM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/FournierGGG12,
author = {Herv{\'{e}} Fournier and
Dani{\`{e}}le Gardy and
Antoine Genitrini and
Bernhard Gittenberger},
title = {The fraction of large random trees representing a given Boolean function
in implicational logic},
journal = {Random Struct. Algorithms},
volume = {40},
number = {3},
pages = {317--349},
year = {2012},
url = {https://doi.org/10.1002/rsa.20379},
doi = {10.1002/RSA.20379},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/FournierGGG12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mlq/FournierGGZ10,
author = {Herv{\'{e}} Fournier and
Dani{\`{e}}le Gardy and
Antoine Genitrini and
Marek Zaionc},
title = {Tautologies over implication with negative literals},
journal = {Math. Log. Q.},
volume = {56},
number = {4},
pages = {388--396},
year = {2010},
url = {https://doi.org/10.1002/malq.200810053},
doi = {10.1002/MALQ.200810053},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mlq/FournierGGZ10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/FournierGG09,
author = {Herv{\'{e}} Fournier and
Dani{\`{e}}le Gardy and
Antoine Genitrini},
editor = {Conrado Mart{\'{\i}}nez and
Robert Sedgewick},
title = {Balanced And/Or Trees and Linear Threshold Functions},
booktitle = {Proceedings of the Sixth Workshop on Analytic Algorithmics and Combinatorics,
{ANALCO} 2009, New York, New York, USA, January 03, 2009},
pages = {51--57},
publisher = {{SIAM}},
year = {2009},
url = {https://doi.org/10.1137/1.9781611972993.8},
doi = {10.1137/1.9781611972993.8},
timestamp = {Tue, 23 May 2017 01:10:31 +0200},
biburl = {https://dblp.org/rec/conf/analco/FournierGG09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lfcs/GenitriniK09,
author = {Antoine Genitrini and
Jakub Kozik},
editor = {Sergei N. Art{\"{e}}mov and
Anil Nerode},
title = {Quantitative Comparison of Intuitionistic and Classical Logics - Full
Propositional System},
booktitle = {Logical Foundations of Computer Science, International Symposium,
{LFCS} 2009, Deerfield Beach, FL, USA, January 3-6, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5407},
pages = {280--294},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-540-92687-0\_19},
doi = {10.1007/978-3-540-92687-0\_19},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/lfcs/GenitriniK09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/FournierGGG08,
author = {Herv{\'{e}} Fournier and
Dani{\`{e}}le Gardy and
Antoine Genitrini and
Bernhard Gittenberger},
editor = {Edward Ochmanski and
Jerzy Tyszkiewicz},
title = {Complexity and Limiting Ratio of Boolean Functions over Implication},
booktitle = {Mathematical Foundations of Computer Science 2008, 33rd International
Symposium, {MFCS} 2008, Torun, Poland, August 25-29, 2008, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5162},
pages = {347--362},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-85238-4\_28},
doi = {10.1007/978-3-540-85238-4\_28},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/FournierGGG08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csl/FournierGGZ07,
author = {Herv{\'{e}} Fournier and
Dani{\`{e}}le Gardy and
Antoine Genitrini and
Marek Zaionc},
editor = {Jacques Duparc and
Thomas A. Henzinger},
title = {Classical and Intuitionistic Logic Are Asymptotically Identical},
booktitle = {Computer Science Logic, 21st International Workshop, {CSL} 2007, 16th
Annual Conference of the EACSL, Lausanne, Switzerland, September 11-15,
2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4646},
pages = {177--193},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-74915-8\_16},
doi = {10.1007/978-3-540-74915-8\_16},
timestamp = {Tue, 14 May 2019 10:00:42 +0200},
biburl = {https://dblp.org/rec/conf/csl/FournierGGZ07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/types/GenitriniKZ07,
author = {Antoine Genitrini and
Jakub Kozik and
Marek Zaionc},
editor = {Marino Miculan and
Ivan Scagnetto and
Furio Honsell},
title = {Intuitionistic vs. Classical Tautologies, Quantitative Comparison},
booktitle = {Types for Proofs and Programs, International Conference, {TYPES} 2007,
Cividale del Friuli, Italy, May 2-5, 2007, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {4941},
pages = {100--109},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-68103-8\_7},
doi = {10.1007/978-3-540-68103-8\_7},
timestamp = {Tue, 14 May 2019 10:00:42 +0200},
biburl = {https://dblp.org/rec/conf/types/GenitriniKZ07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2023-12-01 21:15 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
