2024 preprint A Simple Algorithm for Worst Case Optimal Join and Sampling Florent Capelli, Oliver Irwin, and Sylvain Salvati Sep 2024 arXiv Bib PDF Details @online{capelli204sawcojs, author = {Capelli, Florent and Irwin, Oliver and Salvati, Sylvain}, title = {A Simple Algorithm for Worst Case Optimal Join and Sampling}, year = {2024}, month = sep, details = {wcojs} } ICDT Direct Access for Conjunctive Queries with Negations Florent Capelli, and Oliver Irwin In 27th International Conference on Database Theory, ICDT 2024, March 24 to March 28, 2024, Paestum, Italy, Mar 2024 Awarded Bib PDF Details Best Newcomer Paper @inproceedings{capelli2024dacqn, title = {Direct {{Access}} for {{Conjunctive Queries}} with {{Negations}}}, author = {Capelli, Florent and Irwin, Oliver}, editor = {Cormode, Graham and Shekelyan, Michael}, year = {2024}, month = mar, pages = {13:1--13:20}, issn = {1868-8969}, booktitle = {27th International Conference on Database Theory, {ICDT} 2024, March 24 to March 28, 2024, Paestum, {Italy}}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, url = {https://doi.org/10.4230/LIPICS.ICDT.2024.13}, doi = {10.4230/LIPICS.ICDT.2024.13}, isbn = {9783959773126}, langid = {english}, keywords = {Conjunctive queries,direct access,factorized databases,hypertree decomposition,Information systems → Relational database model}, details = {dacqn} } 2023 preprint Direct Access for Conjunctive Queries with Negation Florent Capelli, and Oliver Irwin Sep 2023 arXiv Bib PDF @online{capelli2023dacqnlong, author = {Capelli, Florent and Irwin, Oliver}, title = {Direct Access for Conjunctive Queries with Negation}, year = {2023}, month = sep, } 2022 FIL Complexity and Algorithms for Counting Problems Florent Capelli, and Oliver Irwin Université de Lille, Sep 2022 Bib PDF @mastersthesis{irwin2022, author = {Capelli, Florent and Irwin, Oliver}, title = {Complexity and Algorithms for Counting Problems}, school = {Université de Lille}, year = {2022}, month = sep, }