• 2026
• 2025
• 2024
• 2023
• 2022
• 2021
• 2020
• 2019
• 2018
• 2017
• 2016
• 2015
• 2014
• 2013
• 2012
• 2011
• 2010
• 2009
• 2008
• 2007
• 2006
• 2005
• 2004
• 2003
• 2002
• 2001

2026

• A. Gauquier, I. Manolescu, and P. Senellart, Structured Prediction for Scalable Spreadsheet Table Understanding: From Cell Types to Table Ranges. In Proc. CIKM, Rome, Italy, November 2026. (pdf | extended version | doi | code | data | bib)
• A. Saadeh and P. Senellart, Preserving LLM Output Distributions for Probabilistic Query Evaluation. In Proc. CIKM, Rome, Italy, November 2026. Demonstration. (pdf | doi | code | video | bib)
• A. Sen, P. Karmakar, S. Maniu, A. Saadeh, and P. Senellart, Provenance of HAVING Queries in Semirings with Monus. September 2026. arXiv abs/2609.31246. (pdf | arXiv | code | data | formal proofs | project page | bib)
• P. Senellart and A. Gnatenko, Descriptive Complexity in Lean: Completeness by First-Order Reductions. September 2026. arXiv abs/2609.18261. (pdf | arXiv | formal proofs | bib)
• A. Gauquier, I. Manolescu, and P. Senellart, Structured Prediction for Scalable Spreadsheet Table Understanding: From Cell Types to Table Ranges (Extended Version). August 2026. arXiv abs/2608.16050. (pdf | arXiv | code | data | bib)
• M. Sorić, C. Gracianne, I. Manolescu, and P. Senellart, Benchmarking Table Extraction from Heterogeneous Scientific PDF Documents. In Proc. KDD, Jeju Island, South Korea, August 2026. (pdf | poster | extended version | doi | code | data | data | project page | video | bib)
• M. Parrino, A. Ajenjo, E. Remy, P. Stephan, P. Senellart, and P. Boniol, In a Streaming World, Should You Stand Still? A Comprehensive Benchmark of Anomaly Detection in Streams. In Proc. KDD, Jeju Island, South Korea, August 2026. (pdf | doi | code | code | bib)
• M. Sorić, C. Gracianne, I. Manolescu, and P. Senellart, Benchmarking Table Extraction from Heterogeneous Scientific PDF Documents (Extended Version). July 2026. arXiv abs/2511.16134. (pdf | arXiv | data | bib)
• A. Gauquier, S. Ebel, H. Galhardas, T. Galizzi, I. Manolescu, A. Peden, and P. Senellart, Efficient and Scalable Search for Statistics. In Proc. ICDE, pp. 1113–1126, Montréal, Canada, May 2026. (pdf | slides | poster | doi | data | bib)
• A. Sen, S. Maniu, and P. Senellart, ProvSQL: A General System for Keeping Track of the Provenance and Probability of Data. In Proc. ICDE, pp. 1252–1265, Montréal, Canada, May 2026. (pdf | slides | poster | arXiv | doi | code | data | data | formal proofs | project page | bib)
• A. Gauquier, I. Manolescu, and P. Senellart, Efficient Crawling for Scalable Web Data Acquisition. In Proc. EDBT, pp. 372–385, Tampere, Finland, March 2026. (pdf | slides | extended version | doi | code | bib)
• A. Gauquier, I. Manolescu, and P. Senellart, Efficient Crawling for Scalable Web Data Acquisition (Extended Version). February 2026. arXiv abs/2602.11874. (pdf | arXiv | code | bib)
• S. Abiteboul and P. Senellart, Les réseaux informatiques. In C. Grall, editor, L'arbre et la toile : du vivant et des formes entre les disciplines, pp. 219–228. Academic Press, January 2026. (pdf (French) | bib)
• A. Gauquier, S. Ebel, H. Galhardas, T. Galizzi, I. Manolescu, A. Peden, and P. Senellart, STAR: Efficient, Scalable, and Modular Retrieval of Statistical Tables. Transactions on Large-Scale Data and Knowledge-Centered Systems, 61, 2026. (pdf | code | data | bib)

2025

• P. Senellart and N. Vieira, OnePSL30 : transformation numérique de l'Université PSL. Collection numérique de l’AMUE, Agence de mutualisation des universités et établissements d'enseignement supérieur, 39, December 2025. (html | publisher | bib)
• P. Karmakar, A. Gauquier, and P. Senellart, Expected Shapley Value is Shapley Value for Expected Utility Game. In Proc. ECSQARU, pp. 223–237, Hagen, Germany, September 2025. (pdf | slides | doi | bib)
• P. Karmakar, A. Saadeh, P. Senellart, and S. Bressan, Discovering Voting Power for Ensemble Methods. In Proc. DEXA (1), pp. 347–362, Bangkok, Thailand, August 2025. (pdf | slides | doi | code | bib)
• A. A. Widiaatmaja, B. Djeffal, A. Dandekar, and P. Senellart, Demonstration of ProvSQL Update Provenance through Temporal Databases. In Proc. PW, pp. 71–76, Berlin, Germany, June 2025. Demonstration. (pdf | poster | doi | code | data | bib)
• S. Mishra, N. Sharma, A. Gauquier, and P. Senellart, TheoremView: A Framework for Extracting Theorem-Like Environments from Raw PDFs. In Proc. ECIR (5), pp. 24–29, Lucca, Italy, April 2025. Demonstration. (pdf | doi | code | video | bib)
• S. Maniu and P. Senellart, Database Theory in Action: Making Provenance and Probabilistic Database Theory Work in Practice (Invited Talk). In Proc. ICDT, pp. 33:1–33:6, Barcelona, Spain, March 2025. (pdf | slides | doi | code | bib)
• F. Yunus, P. Karmakar, P. Senellart, T. Abdessalem, and S. Bressan, Using a Probabilistic Database in an Image Retrieval Application. In Proc. EDBT, pp. 1106–1109, Barcelona, Spain, March 2025. Demonstration. (pdf | doi | code | data | video | bib)
• S. Mishra, A. Gauquier, and P. Senellart, Apprentissage multimodal modulaire pour l’extraction de théorèmes et de preuves dans des documents scientifiques longs. In Proc. EGC, pp. 497–498, Strasbourg, France, January 2025. Poster. (pdf | poster | code | bib)
• N. Appel, J. Bourdon, N. Bousquet, J. Cohen, A. Genitrini, P. Georgeon, Y. Grandvalet, K. Jaffrès-Runser, A. Legrand, D. Markham, A. Muscholl, A. Paparrizou, L. Paulevé, M. Poss, M. Potop-Butucaru, J.-F. Raymond, R. Rouvoy, Y. Sallent, P. Senellart, T. Seiller, Y.-Q. Song, A. Tchana, and H. Waeselynck, Section 06 – Sciences de l’information : fondements de l’informatique, calculs, algorithmes, représentations, exploitations. Comité national de la recherche scientifique, Paris, France, 2025. Rapport de conjoncture 2024 (state-of-research report) of section 06. (pdf | HAL | bib)
• E. Sylligardos, J. Paparrizos, T. Palpanas, P. Senellart, and P. Boniol, MSAD: A Deep Dive into Model Selection for Time Series Anomaly Detection. VLDB Journal, 34(6), pp. 72, 2025. (pdf | arXiv | doi | code | bib)
• P. Senellart, Qualitative Evaluation of Academic Researchers in Computer Science: Practices and Reflections from CNRS. Computer Education, 12(372), pp. 36–41, 2025. (pdf | bib)

2024

• S. Mishra, A. Gauquier, and P. Senellart, Modular Multimodal Machine Learning for Extraction of Theorems and Proofs in Long Scientific Documents. In Proc. JCDL, pp. 14:1–14:5, Hong Kong, China, December 2024. Late-breaking paper. (pdf | slides | extended version | doi | code | bib)
• S. Mishra, A. Gauquier, and P. Senellart, Modular Multimodal Machine Learning for Extraction of Theorems and Proofs in Long Scientific Documents (Extended Version). October 2024. arXiv abs/2307.09047. (pdf | arXiv | code | bib)
• S. Mishra, Y. Brihmouche, T. Delemazure, A. Gauquier, and P. Senellart, First Steps in Building a Knowledge Base of Mathematical Results. In Proc. SDP, pp. 165–174, Bangkok, Thailand, August 2024. (pdf | poster | doi | code | code | bib)
• P. Karmakar, M. Monet, P. Senellart, and S. Bressan, Expected Shapley-Like Scores of Boolean Functions: Complexity and Applications to Probabilistic Databases. Proceedings of the ACM on Management of Data, 2(2), pp. 92, June 2024. Presented at the PODS 2024 conference in Santiago, Chile. (pdf | slides | poster | arXiv | doi | code | code | bib)
• P. Senellart, On the Impact of Provenance Semiring Theory on the Design of a Provenance-Aware Database System. In A. Amarilli and A. Deutsch, editors, The Provenance of Elegance in Computation — Essays dedicated to Val Tannen, pp. 9:1–9:10. Schloss Dagstuhl — Leibniz-Zentrum für Informatik, March 2024. (pdf | slides | doi | bib)

2023

• S. Jiang and P. Senellart, Extracting Definienda in Mathematical Scholarly Articles with Transformers. In Proc. WIESP, online, Indonesia, November 2023. (pdf | slides | arXiv | doi | code | data | bib)
• A. Saadeh, P. Senellart, and S. Bressan, Confidential Truth Finding with Multi-Party Computation. In Proc. DEXA, pp. 332–337, Penang, Malaysia, August 2023. (pdf | slides | extended version | doi | code | bib)
• A. Gauquier and P. Senellart, Automatically Inferring the Document Class of a Scientific Article. In Proc. DocEng, pp. 11:1–11:10, Limerick, Ireland, August 2023. (pdf | slides | doi | code | bib)
• A. Saadeh, P. Senellart, and S. Bressan, Confidential Truth Finding with Multi-Party Computation (Extended Version). May 2023. arXiv abs/2305.14727. (pdf | slides | arXiv | code | bib)
• A. Amarilli, P. Bourhis, and P. Senellart, Tractable Lineages on Treelike Instances: Limits and Extensions. April 2023. arXiv abs/1604.02761. (pdf | arXiv | bib)
  Update

  • Update October 27, 2026; Sect. 5.2, Thm. 5.5: The introduction and Section 5.2 present the hypothesis of Theorem 5.5 as the non-uniform exponential-time hypothesis. The hypothesis actually used in the statement, and all the proof needs, is weaker: that the polynomial hierarchy is not contained in DTIME(2^o(n))/SubEXP. The distinction now matters: a preprint released by OpenAI on October 25, 2026 claims a deterministic 2^o(n)-time algorithm for 3-SAT, which would refute ETH and its non-uniform version but leaves this weaker hypothesis open. The other intractability results of the paper (Theorems 4.2, 5.2, and 5.7) are unconditional. The same applies to the conference version.

2022

• Y. Ramusat, S. Maniu, and P. Senellart, Efficient Provenance-Aware Querying of Graph Databases with Datalog. In Proc. BDA, Clermont-Ferrand, France, October 2022. (pdf | slides | code | bib)
• Y. Ramusat, S. Maniu, and P. Senellart, Efficient Provenance-Aware Querying of Graph Databases with Datalog. In Proc. GRADES-NDA, pp. 4:1–4:9, Philadelphia, USA, June 2022. (pdf | slides | doi | code | bib)

2021

• Y. Ramusat, S. Maniu, and P. Senellart, A Practical Dynamic Programming Approach to Datalog Provenance Computation. December 2021. arXiv abs/2112.01132. (pdf | arXiv | code | bib)
• S. Mishra, L. Pluvinage, and P. Senellart, Towards Extraction of Theorems and Proofs in Scholarly Articles. In Proc. DocEng, pp. 25:1–25:4, Limerick, Ireland, August 2021. (pdf | video | doi | code | bib)
• Y. Ramusat, S. Maniu, and P. Senellart, Provenance-Based Algorithms for Rich Queries over Graph Databases. In Proc. EDBT, pp. 73–84, Nicosia, Cyprus, March 2021. (pdf | slides | doi | code | bib)
• H. Comon, S. Perdrix, P. Aboulker, P. Arrighi, S. Blazy, A. Braud, P. Clairambault, P. Dayre, R. Dernat, C. Dhaenens, L. Duchien, A. Gheerbrant, N. Aussenac-Gilles, J.-M. Larré, D. Lavenier, L. Liberti, P. Owezarski, C. Scornavacca, S. Sené, P. Senellart, P. Sens, G. Villard, I. Walukiewicz, and L. Weinhard, Section 06 – Sciences de l’information : fondements de l’informatique, calculs, algorithmes, représentations, exploitations. Comité national de la recherche scientifique, Paris, France, 2021. Rapport de conjoncture 2019 (state-of-research report) of section 06. (pdf | HAL | bib)

2020

• S. Amer-Yahia, S. Roy, L. Chen, A. Morishima, J. Monedero, P. Bourhis, F. Charoy, M. Danilevsky, G. Das, G. Demartini, S. Elbassuoni, D. Gross-Amblard, E. Hoareau, M. Inoguchi, J. Kenworthy, I. Kitahara, D. Lee, Y. Li, R. Borromeo, P. Papotti, R. Rao, S. Roy, P. Senellart, K. Tajima, S. Thirumuruganathan, M. Tommasi, K. Umemoto, A. Wiggins, and K. Yoshida, Making AI Machines Work for Humans in FoW. SIGMOD Record, 49(2), pp. 30–35, December 2020. (pdf | doi | bib)
• Y. Ramusat, S. Maniu, and P. Senellart, Algorithmes à base de provenance pour des requêtes enrichies sur les bases de données graphes. In Proc. BDA, online, France, October 2020. (pdf | slides | code | bib)
• A. Dandekar, D. Basu, P. Senellart, and S. Bressan, Confidentialité différentielle à risque : Relier les sources d'aléa et un budget de confidentialité. In Proc. BDA, online, France, October 2020. (pdf | slides | bib)
• J. Krämer, P. Senellart, and A. de Streel, Making Data Portability More Effective for the Digital Economy: Economic Implications and Regulatory Challenges. Centre on Regulation in Europe (CERRE), Brussels, Belgium, June 2020. (pdf | HAL | publisher | bib)
• A. Amarilli, F. Capelli, M. Monet, and P. Senellart, Connecting Knowledge Compilation Classes and Width Parameters. Theory of Computing Systems, 64(5), pp. 861–914, 2020. (pdf | arXiv | doi | bib)
• M. Benedikt, P. Bourhis, G. Gottlob, and P. Senellart, Monadic Datalog, Tree Validity, and Limited Access Containment. ACM Transactions on Computational Logic, 21(1), pp. 6:1–6:45, 2020. (pdf | doi | bib)

2019

• P. Senellart, Provenance in Databases: Principles and Applications. In Proc. RW, pp. 104–109, Bolzano, Italy, September 2019. (pdf | slides | doi | bib)
• D. Basu, P. Senellart, and S. Bressan, BelMan: An Information-Geometric Approach to Stochastic Bandits. In Proc. ECML/PKDD, pp. 167–183, Würzburg, Germany, September 2019. (pdf | arXiv | doi | code | bib)
• S. Maniu, P. Senellart, and S. Jog, An Experimental Study of the Treewidth of Real-World Graph Data. In Proc. ICDT, pp. 12:1–12:18, Lisbon, Portugal, March 2019. (pdf | extended version | doi | code | data | bib)
• S. Maniu, P. Senellart, and S. Jog, An Experimental Study of the Treewidth of Real-World Graph Data (Extended Version). January 2019. arXiv abs/1901.06862. (pdf | arXiv | code | data | bib)
• A. Amarilli, P. Bourhis, M. Monet, and P. Senellart, Evaluating Datalog via Tree Automata and Cycluits. Theory of Computing Systems, 63(7), pp. 1620–1678, 2019. (pdf | arXiv | doi | bib)
• A. Amarilli, M. L. Ba, D. Deutch, and P. Senellart, Computing Possible and Certain Answers over Order-Incomplete Data. Theoretical Computer Science, 797, pp. 42–76, 2019. (pdf | arXiv | doi | bib)

2018

• A. Amarilli, M. Monet, and P. Senellart, Liens entre largeur et structure en compilation de connaissances. In Proc. BDA, Bucharest, Romania, November 2018. Conference without formal proceedings. (pdf | bib)
• S. Maniu, P. Senellart, and S. Jog, Une étude expérimentale de la largeur d'arbre de données graphe du monde réel. In Proc. BDA, Bucharest, Romania, November 2018. Conference without formal proceedings. (pdf | slides (French) | code | data | bib)
• P. Senellart, L. Jachiet, S. Maniu, and Y. Ramusat, ProvSQL : Gestion de provenance et de probabilités dans PostgreSQL. In Proc. BDA, Bucharest, Romania, November 2018. Demonstration. Conference without formal proceedings. (pdf | code | project page | bib)
• P. Senellart, L. Jachiet, S. Maniu, and Y. Ramusat, ProvSQL: Provenance and Probability Management in PostgreSQL. In Proc. VLDB, pp. 2034–2037, Rio de Janeiro, Brazil, August 2018. Demonstration. (pdf | poster | doi | code | project page | video | bib)
• Y. Ramusat, S. Maniu, and P. Senellart, Semiring Provenance over Graph Databases. In Proc. TaPP, London, United Kingdom, July 2018. (pdf | slides | code | bib)
• M. Han, P.-H. Wuillemin, and P. Senellart, Focused Crawling through Reinforcement Learning. In Proc. ICWE, pp. 261–278, Cáceres, Spain, June 2018. (pdf | doi | code | bib)
• B. Spencer, M. Benedikt, and P. Senellart, Form Filling based on Constraint Solving. In Proc. ICWE, pp. 95–113, Cáceres, Spain, June 2018. (pdf | doi | code | data | bib)
• A. Amarilli, M. Monet, and P. Senellart, Connecting Width and Structure in Knowledge Compilation (Extended Version). May 2018. arXiv abs/1709.06188v3. (pdf | arXiv | bib)
• D. Montoya, T. Pellissier Tanon, S. Abiteboul, P. Senellart, and F. M. Suchanek, A Knowledge Base for Personal Information Management. In Proc. LDOW, Lyon, France, April 2018. (pdf | code | code | code | project page | bib)
• A. Amarilli, M. Monet, and P. Senellart, Connecting Width and Structure in Knowledge Compilation. In Proc. ICDT, pp. 6:1–6:17, Vienna, Austria, March 2018. (pdf | extended version | doi | bib)
• A. Amarilli, M. L. Ba, D. Deutch, and P. Senellart, Possible and Certain Answers for Queries over Order-Incomplete Data. January 2018. arXiv abs/1707.07222v2. (pdf | arXiv | bib)

2017

• P. Senellart, Provenance and Probabilities in Relational Databases. SIGMOD Record, 46(4), pp. 5–15, December 2017. (pdf | doi | code | bib)
• P. Senellart and A. Napoli, Actes de la conférence BDA 2017. HAL, Paris, France, November 2017. (HAL | bib)
• A. Amarilli, M. L. Ba, D. Deutch, and P. Senellart, Possible and Certain Answers for Queries over Order-Incomplete Data. In Proc. TIME, pp. 4:1–4:19, Mons, Belgium, October 2017. (pdf | extended version | doi | bib)
  Erratum

  • Erratum October 27, 2026; Thm. 19, 22, 30: Theorems 19, 22, and 30 (tractability of possibility for PosRA queries on unordered or bounded-ia-width po-databases, and of possibility and certainty for accumulation queries on bounded ia-width) are not established, and Theorems 19 and 22 are false unless P = NP: the proof of Proposition 66 of the first arXiv version fails for the product operators, and Theorem 92 of version 2 of the extended version (January 2018, hosted here) exhibits a PosRA query for which possibility is NP-complete on unordered po-relations. That version removes the affected results and discusses the error in its Appendix G; the journal version contains neither. See also Antoine Amarilli's errata.
• O. Savkovic, E. Kharlamov, W. Nutt, and P. Senellart, Towards Approximating Incomplete Queries over Partially Complete Databases. In Proc. AMW, Montevideo, Uruguay, June 2017. (pdf | bib)
• A. Meliou and P. Senellart, Proceedings of the 20th International Workshop on the Web and Databases, WebDB 2017. ACM, Chicago, USA, May 2017. (doi | publisher | bib)
• A. Amarilli, M. Monet, and P. Senellart, Conjunctive Queries on Probabilistic Graphs: Combined Complexity. In Proc. PODS, pp. 217–232, Chicago, USA, May 2017. (pdf | slides | poster | arXiv | doi | bib)
• S. Maniu, R. Cheng, and P. Senellart, An Indexing Framework for Queries on Probabilistic Graphs. ACM Transactions on Database Systems, 42(2), pp. 13:1–13:34, May 2017. (pdf | doi | bib)
• A. Amarilli, P. Bourhis, M. Monet, and P. Senellart, Combined Tractability of Query Evaluation via Tree Automata and Cycluits. In Proc. ICDT, pp. 6:1–6:19, Venice, Italy, March 2017. (pdf | slides | poster | extended version | doi | bib)
• A. Amarilli, Y. Amsterdamer, T. Milo, and P. Senellart, Top-k Querying of Unknown Values under Order Constraints. In Proc. ICDT, pp. 5:1–5:18, Venice, Italy, March 2017. (pdf | slides | poster | extended version | doi | bib)
• P. Senellart, Archivage du Web. In M. Bouzhegoub and R. Mosseri, editors, Les Big Data à découvert, pp. 200–201. CNRS Éditions, March 2017. (pdf | bib)
• A. Amarilli, P. Bourhis, M. Monet, and P. Senellart, Combined Tractability of Query Evaluation via Tree Automata and Cycluits (Extended Version). January 2017. arXiv abs/1612.04203. (pdf | arXiv | bib)
• A. Amarilli, Y. Amsterdamer, T. Milo, and P. Senellart, Top-k Querying of Unknown Values under Order Constraints (Extended Version). January 2017. arXiv abs/1701.02634. (pdf | arXiv | bib)

2016

• D. Montoya, T. Pellissier Tanon, S. Abiteboul, P. Senellart, and F. M. Suchanek, Thymeflow, An Open-Source Personal Knowledge Base System. December 2016. (pdf | code | code | code | project page | bib)
• A. Amarilli, P. Bourhis, and P. Senellart, Lignages efficaces sur les instances quasi-arborescentes: Limites et extensions. In Proc. BDA, Poitiers, France, November 2016. (pdf | bib)
• M. Han, P. Senellart, S. Bressan, and H. Wu, Routing an Autonomous Taxi with Reinforcement Learning. In Proc. CIKM, pp. 2421–2424, Indianapolis, USA, October 2016. Industry track, short paper. (pdf | doi | code | bib)
• S. Schockaert and P. Senellart, Proceedings of the 10th International Conference on Scalable Uncertainty Management, SUM 2016. Springer-Verlag, Nice, France, September 2016. (doi | publisher | bib)
• A. Amarilli, P. Bourhis, and P. Senellart, Tractable Lineages on Treelike Instances: Limits and Extensions. In Proc. PODS, pp. 355–370, San Francisco, USA, June 2016. (pdf | extended version | doi | bib)
  Erratum Update

  • Erratum October 27, 2026; Thm. 5.5: The proof of Theorem 5.5, given in Antoine Amarilli's PhD thesis (Theorem 6.2.5) rather than in the paper, is incorrect: the advice string it defines depends on the instance and not only on its size. A corrected proof is given in the appendix of version 2 of the extended version on arXiv (April 2023), which is the one hosted here. See also Antoine Amarilli's errata.
  • Update October 27, 2026; Sect. 5.2, Thm. 5.5: The introduction and Section 5.2 present the hypothesis of Theorem 5.5 as the non-uniform exponential-time hypothesis. The hypothesis actually used in the statement, and all the proof needs, is weaker: that the polynomial hierarchy is not contained in DTIME(2^o(n))/SubEXP. The distinction now matters: a preprint released by OpenAI on October 25, 2026 claims a deterministic 2^o(n)-time algorithm for 3-SAT, which would refute ETH and its non-uniform version but leaves this weaker hypothesis open. The other intractability results of the paper (Theorems 4.2, 5.2, and 5.7) are unconditional. The same applies to the extended version.
• D. Basu, Q. Lin, W. Chen, H. T. Vo, Z. Yuan, P. Senellart, and S. Bressan, Regularized Cost-Model Oblivious Database Tuning with Reinforcement Learning. Transactions on Large-Scale Data and Knowledge-Centered Systems, 28, pp. 96–132, 2016. (pdf | doi | code | bib)
• R. Tang, A. Amarilli, P. Senellart, and S. Bressan, A Framework for Sampling-Based XML Data Pricing. Transactions on Large-Scale Data and Knowledge-Centered Systems, 24, pp. 116–138, 2016. (pdf | doi | bib)

2015

• M. Faheem and P. Senellart, Adaptive Web Crawling through Structure-Based Link Classification. In Proc. ICADL, pp. 39–51, Seoul, South Korea, December 2015. (pdf | slides | doi | code | bib)
• A. Amarilli, P. Bourhis, and P. Senellart, Provenance Circuits for Trees and Treelike Instances (Extended Version). November 2015. arXiv abs/1511.08723. (pdf | arXiv | bib)
• D. Montoya, S. Abiteboul, and P. Senellart, Hup-Me: Inferring and Reconciling a Timeline of User Activity from Rich Smartphone Data. In Proc. SIGSPATIAL, pp. 62:1–62:4, Bellevue, USA, November 2015. Short paper. This prototype evolved into the Thymeflow system. (pdf | slides | poster | doi | code | project page | bib)
• S. Abiteboul, Y. Amsterdamer, D. Deutch, T. Milo, and P. Senellart, Optimal Probabilistic Generation of XML Documents. Theory of Computing Systems, 57(4), pp. 806–842, November 2015. (pdf | doi | bib)
• A. Amarilli, M. L. Ba, D. Deutch, and P. Senellart, Requêtes sur des données à ordre incomplet. In Proc. BDA, Porquerolles, France, September 2015. Conference without formal proceedings. (pdf | slides | bib)
• A. Amarilli, P. Bourhis, and P. Senellart, Circuits de provenance pour les arbres et les instances quasi-arborescentes. In Proc. BDA, Porquerolles, France, September 2015. Conference without formal proceedings. (pdf | slides | bib)
• D. Basu, Q. Lin, Z. Yuan, P. Senellart, and S. Bressan, Apprentissage par renforcement pour optimiser les bases de donnéees indépendamment du modèle de coût. In Proc. BDA, Porquerolles, France, September 2015. Conference without formal proceedings. (pdf | slides | code | bib)
• D. Basu, Q. Lin, W. Chen, H. T. Vo, Z. Yuan, P. Senellart, and S. Bressan, Cost-Model Oblivious Database Tuning with Reinforcement Learning. In Proc. DEXA, pp. 253–268, Valencia, Spain, September 2015. (pdf | slides | doi | code | bib)
• S. Lei, S. Maniu, L. Mo, R. Cheng, and P. Senellart, Online Influence Maximization. In Proc. KDD, pp. 645–654, Sydney, Australia, August 2015. (pdf | slides | poster | extended version | doi | code | bib)
• A. Amarilli, S. Maniu, and P. Senellart, Intensional Data on the Web. SIGWEB Newsletter, 2015(Summer), pp. 4:1–4:12, August 2015. (pdf | doi | bib)
• A. Amarilli, P. Bourhis, and P. Senellart, Provenance Circuits for Trees and Treelike Instances. In Proc. ICALP, pp. 56–68, Kyoto, Japan, July 2015. (pdf | slides | extended version | doi | bib)
• S. Lei, S. Maniu, L. Mo, R. Cheng, and P. Senellart, Online Influence Maximization (Extended Version). June 2015. arXiv abs/1506.01188. (pdf | arXiv | code | bib)
• M. L. Ba, R. Horincar, P. Senellart, and H. Wu, Truth Finding with Attribute Partitioning. In Proc. WebDB, pp. 27–33, Melbourne, Australia, May 2015. (pdf | slides | doi | data | bib)
• M. Oita and P. Senellart, FOREST: Focused Object Retrieval by Exploiting Significant Tag Paths. In Proc. WebDB, pp. 55–61, Melbourne, Australia, May 2015. (pdf | slides | doi | code | data | bib)
• C. Meng, R. Cheng, S. Maniu, P. Senellart, and W. Zhang, Discovering Meta-Paths in Large Heterogeneous Information Networks. In Proc. WWW, pp. 754–764, Florence, Italy, May 2015. (pdf | slides, pdf | slides, pptx | doi | bib)
• R. Cheng, S. Maniu, and P. Senellart, Guest Editorial: Special Issue on Databases and Crowdsourcing. Distributed and Parallel Databases, 33(1), pp. 1–2, March 2015. (pdf | doi | bib)

2014

• R. Tang, D. Shao, M. L. Ba, P. Senellart, and S. Bressan, A Framework for Conditioning Probabilistic XML Data. November 2014. (pdf | bib)
• M. L. Ba, S. Montenez, T. Abdessalem, and P. Senellart, Monitoring moving objects using uncertain Web data. In Proc. SIGSPATIAL, pp. 565–568, Dallas, USA, November 2014. Demonstration. (pdf | video | poster | doi | bib)
• T. Risse, E. Demidova, S. Dietze, W. Peters, N. Papailiou, K. Doka, Y. Stavrakas, V. Plachouras, P. Senellart, F. Carpentier, A. Mantrach, B. Cautis, P. Siehndel, and D. Spiliotopoulos, The ARCOMEM Architecture for Social and Semantic Driven Web Archiving. Future Internet, 6(4), pp. 688–716, November 2014. (pdf | doi | code | bib)
• M. L. Ba, S. Montenez, T. Abdessalem, and P. Senellart, Collecte, intégration et visualisation de données Web incertaines sur des objets mobiles. In Proc. BDA, Autrans, France, October 2014. Demonstration. Conference without formal proceedings. (pdf | video | poster | bib)
• G. Gouriten, S. Maniu, and P. Senellart, Scalable, Generic, and Adaptive Systems for Focused Crawling. In Proc. Hypertext, pp. 35–45, Santiago, Chile, September 2014. Douglas Engelbart Best Paper Award. (pdf | slides | doi | bib)
• R. Tang, A. Amarilli, P. Senellart, and S. Bressan, Get a Sample for a Discount: Sampling-Based XML Data Pricing. In Proc. DEXA, pp. 20–34, Munich, Germany, September 2014. (pdf | slides | doi | bib)
• V. Plachouras, F. Carpentier, M. Faheem, J. Masanès, T. Risse, P. Senellart, P. Siehndel, and Y. Stavrakas, ARCOMEM Crawling Architecture. Future Internet, 6(3), pp. 518–541, August 2014. (pdf | doi | code | bib)
• S. Maniu, R. Cheng, and P. Senellart, ProbTree: A Query-Efficient Representation of Probabilistic Graphs. In Proc. BUDA, Snowbird, USA, June 2014. Workshop without formal proceedings. (pdf | slides | poster | bib)
• M. Faheem and P. Senellart, Crawl intelligent et adaptatif d’applications Web pour l’archivage du Web. Ingénierie des Systèmes d'Information, 19(4), pp. 61–86, 2014. (pdf (French) | doi | code | data | bib)
• M. L. Ba, T. Abdessalem, and P. Senellart, Gestion de versions incertaines de documents XML. Ingénierie des Systèmes d'Information, 19(4), pp. 9–34, 2014. (pdf (French) | doi | bib)

2013

• P. Senellart, Probabilistic Models for Uncertain Data. In Proc. SoICT, pp. 10, Da Nang, Vietnam, December 2013. (pdf | slides | doi | bib)
• P. Senellart, Disseminate your Research: Style Does Matter. In Proc. PIKM, pp. 1–2, San Francisco, USA, November 2013. (pdf | slides | doi | bib)
• T. Risse, W. Peters, P. Senellart, and D. Maynard, Documenting Contemporary Society by Preserving Relevant Information from Twitter. In K. Weller, A. Bruns, J. Burgess, M. Mahrt, and C. Puschmann, editors, Twitter and Society, pp. 207–219. Peter Lang International Academic Publishers, November 2013. (pdf | bib)
• S. Abiteboul and P. Senellart, Un déluge de données. Pour la science, 433, pp. 32–35, November 2013. (publisher | bib)
• M. Faheem and P. Senellart, Collecte intelligente et adaptative d'applications Web pour l'archivage du Web. In Proc. BDA, Nantes, France, October 2013. Conference without formal proceedings. (pdf | slides | code | data | bib)
• M. L. Ba, T. Abdessalem, and P. Senellart, Contrôle de version incertain dans l'édition collaborative ouverte de documents arborescents. In Proc. BDA, Nantes, France, October 2013. Conference without formal proceedings. (pdf | slides | bib)
• G. Gouriten, S. Maniu, and P. Senellart, Exploration adaptative de graphes sous contrainte de budget. In Proc. BDA, Nantes, France, October 2013. Conference without formal proceedings. (pdf | slides | bib)
• M. Faheem and P. Senellart, Une démonstration d’un crawler intelligent pour les applications Web. In Proc. BDA, Nantes, France, October 2013. Demonstration. Conference without formal proceedings. (pdf | video | poster | code | bib)
• M. Faheem and P. Senellart, Demonstrating Intelligent Crawling and Archiving of Web Applications. In Proc. CIKM, pp. 2481–2484, San Francisco, USA, October 2013. Demonstration. (pdf | video | poster | doi | code | bib)
• V. Plachouras, F. Carpentier, J. Masanès, T. Risse, P. Senellart, P. Siehndel, and Y. Stavrakas, An Architecture for Selective Web Harvesting: The Use Case of Heritrix. In Proc. ARCOMEM, Lisbon, Portugal, September 2013. Workshop without formal proceedings. (pdf | code | bib)
• M. L. Ba, T. Abdessalem, and P. Senellart, Merging Uncertain Multi-Version XML Documents. In Proc. DChanges, Florence, Italy, September 2013. (pdf | slides | bib)
• M. L. Ba, T. Abdessalem, and P. Senellart, Uncertain Version Control in Open Collaborative Editing of Tree-Structured Documents. In Proc. DocEng, pp. 27–36, Florence, Italy, September 2013. (pdf | slides | doi | bib)
• R. Cheng, A. Das Sarma, S. Maniu, and P. Senellart, Proceedings of the First VLDB Workshop on Databases and Crowdsourcing, DBCrowd 2013. CEUR Workshop Proceedings, Riva del Garda, Italy, August 2013. (publisher | bib)
• Y. Amsterdamer, Y. Grossman, T. Milo, and P. Senellart, Crowd Miner: Mining association rules from the crowd. In Proc. VLDB, pp. 1250–1253, Riva del Garda, Italy, August 2013. Demonstration. (pdf | poster | doi | bib)
• A. Amarilli and P. Senellart, On the Connections between Relational and XML Probabilistic Data Models. In Proc. BNCOD, pp. 121–134, Oxford, United Kingdom, July 2013. (pdf | slides | doi | bib)
• M. Faheem and P. Senellart, Intelligent and Adaptive Crawling of Web Applications for Web Archiving. In Proc. ICWE, pp. 306–322, Aalborg, Denmark, July 2013. (pdf | slides | doi | code | data | bib)
• Y. Amsterdamer, Y. Grossman, T. Milo, and P. Senellart, Crowd Mining. In Proc. SIGMOD, pp. 241–252, New York, USA, June 2013. (pdf | slides, pdf | slides, pptx | poster | doi | bib)
• T. Risse, W. Peters, and P. Senellart, Social and Semantic Driven Web Harvesting. In Proc. Building Web Observatories, Paris, France, May 2013. (pdf | code | bib)
• B. Kimelfeld and P. Senellart, Probabilistic XML: Models and Complexity. In Z. Ma and L. Yan, editors, Advances in Probabilistic Databases for Uncertain Information Management, pp. 39–66. Springer-Verlag, May 2013. (pdf | doi | bib)
• A. Souihli and P. Senellart, Optimizing Approximations of DNF Query Lineage in Probabilistic XML. In Proc. ICDE, pp. 721–732, Brisbane, Australia, April 2013. (pdf | doi | code | bib)

2012

• R. Nayak, P. Senellart, F. M. Suchanek, and A. Varde, Discovering Interesting Information with Advances in Web Technology. SIGKDD Explorations, 14(2), pp. 63–81, December 2012. (pdf | doi | bib)
• A. Souihli and P. Senellart, Optimisation des approximations de probabilité des requêtes en XML probabiliste. In Proc. BDA, Clermont-Ferrand, France, October 2012. Conference without formal proceedings. (pdf | slides | code | bib)
• A. Souihli and P. Senellart, Demonstrating ProApproX 2.0: A Predictive Query Engine for Probabilistic XML. In Proc. CIKM, pp. 2734–2736, Maui, Hawaii, USA, October 2012. Demonstration. (pdf | video | poster | doi | code | bib)
• T. Risse, S. Dietze, W. Peters, K. Doka, Y. Stavrakas, and P. Senellart, Exploiting the Social and Semantic Web for guided Web Archiving. In Proc. TPDL, pp. 426–432, Paphos, Cyprus, September 2012. Poster. (pdf | poster | doi | code | bib)
• M. Oita, A. Amarilli, and P. Senellart, Cross-Fertilizing Deep Web Analysis and Ontology Enrichment. In Proc. VLDS, pp. 5–8, Istanbul, Turkey, August 2012. Vision article. (pdf | slides | bib)
• M. Bienvenu, D. Deutch, D. Martinenghi, P. Senellart, and F. M. Suchanek, Dealing with the Deep Web and all its Quirks. In Proc. VLDS, pp. 21–24, Istanbul, Turkey, August 2012. Vision article. (pdf | slides | bib)
• M. Benedikt, P. Bourhis, and P. Senellart, Monadic Datalog Containment. In Proc. ICALP, pp. 79–91, Warwick, United Kingdom, July 2012. (pdf | slides | doi | bib)
• P. Senellart, Probabilistic XML: A Data Model for the Web. Habilitation to supervise research, Université Pierre et Marie Curie, Paris, France, June 2012. (pdf | slides (French) | video | bib)
• J. Lu, P. Senellart, C. Lin, X. Du, S. Wang, and X. Chen, Optimal Top-k Generation of Attribute Combinations based on Ranked Lists. In Proc. SIGMOD, pp. 409–420, Scottsdale, USA, May 2012. (pdf | slides | poster | doi | bib)
• S. Abiteboul, Y. Amsterdamer, T. Milo, and P. Senellart, Auto-Completion Learning for XML. In Proc. SIGMOD, pp. 669–672, Scottsdale, USA, May 2012. Demonstration. (pdf | poster | doi | bib)
• G. Gouriten and P. Senellart, API Blender: A Uniform Interface to Social Platform APIs. In Proc. WWW, Lyon, France, April 2012. Developer track. (pdf | slides | arXiv | code | bib)
• S. Abiteboul, P. Senellart, and V. Vianu, The ERC Webdam on Foundations of Web Data Management. In Proc. WWW, pp. 211–214, Lyon, France, April 2012. European project track. (pdf | slides | doi | bib)
• M. Benedikt, T. Furche, A. Savvides, and P. Senellart, ProFoUnd: Program-analysis–based Form Understanding. In Proc. WWW, pp. 313–316, Lyon, France, April 2012. Demonstration. (pdf | slides | poster | doi | bib)
• S. Abiteboul, Y. Amsterdamer, D. Deutch, T. Milo, and P. Senellart, Finding Optimal Probabilistic Generators for XML Collections. In Proc. ICDT, pp. 127–139, Berlin, Germany, March 2012. (pdf | slides | doi | bib)
• M. Benedikt and P. Senellart, Databases. In E. K. Blum and A. V. Aho, editors, Computer Science. The Hardware, Software and Heart of It, pp. 169–229. Springer-Verlag, January 2012. (pdf | doi | bib)
• S. Abiteboul, I. Manolescu, M.-C. Rousset, P. Rigaux, and P. Senellart, Web Data Management. Cambridge University Press, New York, USA, January 2012. (doi | project page | bib)

2011

• F. M. Suchanek, S. Abiteboul, and P. Senellart, PARIS: Probabilistic Alignment of Relations, Instances, and Schema. Proceedings of the VLDB Endowment, 5(3), pp. 157–168, December 2011. Presented at the VLDB 2012 conference, Istanbul, Turkey. (pdf | slides | arXiv | doi | code | bib)
• E. Kharlamov and P. Senellart, Modeling, Querying, and Mining Uncertain XML Data. In A. Tagarelli, editor, XML Data Mining: Models, Methods, and Applications, pp. 29–52. IGI Global, November 2011. (pdf | doi | bib)
• M. L. Ba, T. Abdessalem, and P. Senellart, Towards a Version Control Model with Uncertain Data. In Proc. PIKM, pp. 43–50, Glasgow, United Kingdom, October 2011. (pdf | slides | doi | bib)
• F. M. Suchanek, S. Abiteboul, and P. Senellart, Ontology Alignment at the Instance and Schema Level. In Proc. BDA, Rabat, Morocco, October 2011. Conference without formal proceedings. Also registered as Technical Report RT-0408 (2011), INRIA. (pdf | arXiv | code | bib)
• S. Abiteboul, Y. Amsterdamer, D. Deutch, T. Milo, and P. Senellart, Optimal Probabilistic Generators for XML Corpora. In Proc. BDA, Rabat, Morocco, October 2011. Conference without formal proceedings. (pdf | slides, pdf | slides, pptx | bib)
• B. Nguyen, A. Vion, F.-X. Dudouet, D. Colazzo, I. Manolescu, and P. Senellart, XML Content Warehousing: Improving Sociological Studies of Mailing Lists and Web Data. Bulletin of Sociological Methodology, 112(1), pp. 5–31, October 2011. (pdf | arXiv | doi | project page | bib)
• M. Bourreau, F. Moreau, and P. Senellart, La diversité culturelle dans l’industrie de la musique enregistrée en France (2003-2008). Publications du Département des études, de la prospective et des statistiques, 5, October 2011. (pdf (French) | doi | bib)
• M. Benedikt, G. Gottlob, and P. Senellart, Determining Relevance of Accesses at Runtime. In Proc. PODS, pp. 211–222, Athens, Greece, June 2011. (pdf | slides | extended version | doi | bib)
  Erratum

  • Erratum October 27, 2026; Thm. 5.2, 5.6: As explained in the related-work section of our 2020 paper on monadic Datalog, two results are incorrect. The proof of the co2NEXPTIME lower bound of Theorem 5.6, for containment of positive queries under access limitations (and hence of the 2NEXPTIME-hardness of long-term relevance for positive queries), is flawed, and the bound is at odds, under standard complexity-theoretic assumptions, with the 2EXPTIME upper bound later proven by Benedikt, Bourhis, and Ley (ACM TODS 2015). The proof of the coNEXPTIME upper bound of Theorem 5.2, for conjunctive query containment under access limitations, only works for schemas with a single access method per relation; the general case is open. The same applies to the extended version.
• P. Senellart and A. Souihli, ProApproX: A Lightweight Approximation Query Processor over Probabilistic Trees. In Proc. SIGMOD, pp. 1295–1298, Athens, Greece, June 2011. Demonstration. (pdf | video | poster | doi | code | bib)
• M. Benedikt, G. Gottlob, and P. Senellart, Determining Relevance of Accesses at Runtime (Extended Version). April 2011. arXiv abs/1104.0553. (pdf | arXiv | bib)
  Erratum

  • Erratum October 27, 2026; Thm. 5.2, 5.6: As explained in the related-work section of our 2020 paper on monadic Datalog, two results are incorrect. The proof of the co2NEXPTIME lower bound of Theorem 5.6, for containment of positive queries under access limitations (and hence of the 2NEXPTIME-hardness of long-term relevance for positive queries), is flawed, and the bound is at odds, under standard complexity-theoretic assumptions, with the 2EXPTIME upper bound later proven by Benedikt, Bourhis, and Ley (ACM TODS 2015). The proof of the coNEXPTIME upper bound of Theorem 5.2, for conjunctive query containment under access limitations, only works for schemas with a single access method per relation; the general case is open. The same applies to the conference version.
• M. Oita and P. Senellart, Deriving Dynamics of Web Pages: A Survey. In Proc. TWAW, pp. 25–32, Hyderabad, India, March 2011. (pdf | slides | bib)
• E. Kharlamov, W. Nutt, and P. Senellart, Value Joins are Expensive over (Probabilistic) XML. In Proc. LID, pp. 41–48, Uppsala, Sweden, March 2011. (pdf | slides | extended version | doi | bib)
• A. Souihli and P. Senellart, Efficient Query Evaluation over Probabilistic XML with Long-Distance Dependencies. In Proc. Joint EDBT/ICDT Ph.D. Workshop, pp. 32–37, Uppsala, Sweden, March 2011. (pdf | doi | code | bib)
• A. Ailamaki, S. Amer-Yahia, J. M. Patel, T. Risch, P. Senellart, and J. Stoyanovich, Proceedings of the 14th International Conference on Extending Database Technology, EDBT 2011. ACM, Uppsala, Sweden, March 2011. (doi | publisher | bib)
• F. M. Suchanek, A. Varde, R. Nayak, and P. Senellart, The Hidden Web, XML and the Semantic Web: Scientific Data Management Perspectives. In Proc. EDBT, pp. 534–537, Uppsala, Sweden, March 2011. Tutorial. (pdf | slides, pdf | slides, ppt | arXiv | doi | bib)
• T. Abdessalem, M. L. Ba, and P. Senellart, A Probabilistic XML Merging Tool. In Proc. EDBT, pp. 538–541, Uppsala, Sweden, March 2011. Demonstration. (pdf | poster | doi | bib)
• E. Kharlamov, W. Nutt, and P. Senellart, Value Joins are Expensive over (Probabilistic) XML. Extended Version. Technical report KRDB11-1, KRDB Research Centre, Free University of Bozen–Bolzano, Bolzano, Italy, February 2011. (pdf | bib)
• S. Abiteboul, T-H. H. Chan, E. Kharlamov, W. Nutt, and P. Senellart, Capturing Continuous Data and Answering Aggregate Queries in Probabilistic XML. ACM Transactions on Database Systems, 36(4), pp. 25:1–25:45, 2011. (pdf | doi | bib)

2010

• M. Oita and P. Senellart, Archivage du contenu éphémère du Web à l’aide des flux Web. In Proc. BDA, Toulouse, France, October 2010. Demonstration. Conference without formal proceedings. (pdf | poster | bib)
• P. Senellart and A. Souihli, Un Système de gestion de données XML probabilistes. In Proc. BDA, Toulouse, France, October 2010. Demonstration. Conference without formal proceedings. (pdf | poster | code | bib)
• M. Oita and P. Senellart, Archiving Data Objects Using Web Feeds. In Proc. IWAW, pp. 31–41, Vienna, Austria, September 2010. (pdf | slides | bib)
• M. Benedikt, E. Kharlamov, D. Olteanu, and P. Senellart, Probabilistic XML via Markov Chains. Proceedings of the VLDB Endowment, 3(1), pp. 770–781, September 2010. Presented at the VLDB 2010 conference, Singapore. (pdf | slides | doi | bib)
• C. Genzmer, V. Hudlet, H. Park, D. Schall, and P. Senellart, The SIGMOD 2010 Programming Contest: A Distributed Query Engine. SIGMOD Record, 39(2), pp. 61–64, June 2010. (pdf | doi | project page | bib)
• E. Kharlamov, W. Nutt, and P. Senellart, Updating Probabilistic XML. In Proc. Updates in XML, Lausanne, Switzerland, March 2010. (pdf | slides | doi | bib)
• S. Abiteboul, T-H. H. Chan, E. Kharlamov, W. Nutt, and P. Senellart, Aggregate Queries for Discrete and Continuous Probabilistic XML. In Proc. ICDT, pp. 50–61, Lausanne, Switzerland, March 2010. (pdf | slides | doi | bib)
• S. Abiteboul, S. Amer-Yahia, A. Marian, A. Galland, and P. Senellart, Birds of a tag flock together. In Proc. SSM, New York, USA, February 2010. Workshop without formal proceedings. (pdf | poster | bib)
• A. Galland, S. Abiteboul, A. Marian, and P. Senellart, Corroborating Information from Disagreeing Views. In Proc. WSDM, pp. 131–140, New York, USA, February 2010. (pdf | slides | doi | code | bib)
• G. Gottlob and P. Senellart, Schema Mapping Discovery from Data Instances. Journal of the ACM, 57(2), pp. 6:1–6:37, January 2010. (pdf | doi | bib)
  Erratum

  • Erratum October 27, 2026; Prop. 5.8, 5.9(5); Tables II, IV: The proof of Proposition 5.8 is flawed (see footnote 1 of ten Cate, Kolaitis, Qian, and Tan, AMW 2015), and the DP-hardness of Optimality claimed in Propositions 5.8 and 5.9(5) and in Tables II and IV is not established. What holds, as stated in the conference version, is that Optimality is NP-hard and coNP-hard, and that Existence-Cost is NP-hard.
• T. Abdessalem and P. Senellart, Gestion de données dans les réseaux sociaux. Telecom, 156, pp. 56–58, January 2010. (pdf (French) | bib)

2009

• S. Abiteboul, T-H. H. Chan, E. Kharlamov, W. Nutt, and P. Senellart, Agrégation de documents XML probabilistes. In Proc. BDA, Namur, Belgium, October 2009. Conference without formal proceedings. (pdf | slides | bib)
• A. Galland, S. Abiteboul, A. Marian, and P. Senellart, Corroboration de vues discordantes fondées sur la confiance. In Proc. BDA, Namur, Belgium, October 2009. Conference without formal proceedings. (pdf | slides | code | bib)
• S. Abiteboul, B. Kimelfeld, Y. Sagiv, and P. Senellart, On the Expressiveness of Probabilistic XML Models. VLDB Journal, 18(5), pp. 1041–1064, October 2009. (pdf | doi | bib)
• S. Manegold, I. Manolescu, L. Afanasiev, J. Feng, G. Gou, M. Hadjieleftheriou, S. Harizopoulos, P. Kalnis, K. Karanasos, D. Laurent, M. Lupu, N. Onose, C. Ré, V. Sans, P. Senellart, T. Wu, and D. Shasha, Repeatability & Workability Evaluation of SIGMOD 2009. SIGMOD Record, 38(3), pp. 40–43, September 2009. (pdf | doi | bib)
• P. Rigaux and P. Senellart, Proceedings of the VLDB 2009 PhD Workshop. VLDB Endowment, Lyon, France, August 2009. (website | bib)
• M. Spaniol, D. Denev, A. Mazeika, P. Senellart, and G. Weikum, Data Quality in Web Archiving. In Proc. WICOW, pp. 19–26, Madrid, Spain, April 2009. (pdf | doi | bib)
• A. Varde, F. M. Suchanek, R. Nayak, and P. Senellart, Knowledge Discovery over the Deep Web, Semantic Web and XML. In Proc. DASFAA, pp. 784–788, Brisbane, Australia, April 2009. Tutorial. (pdf | slides | doi | bib)
• B. Nguyen, A. Vion, F.-X. Dudouet, I. Manolescu, D. Colazzo, and P. Senellart, The WebStand Project. In Proc. WebSci, Athens, Greece, March 2009. Poster. (pdf | poster | arXiv | project page | bib)

2008

• P. Senellart, A. Mittal, D. Muschick, R. Gilleron, and M. Tommasi, Automatic Wrapper Induction from Hidden-Web Sources with Domain Knowledge. In Proc. WIDM, pp. 9–16, Napa, USA, October 2008. (pdf | slides | doi | code | data | bib)
• P. Senellart, Google est-il un moteur de recherche efficace ? August 2008. Unpublished. (html (French) | bib)
• P. Senellart and G. Gottlob, On the Complexity of Deriving Schema Mappings from Database Instances. In Proc. PODS, pp. 23–32, Vancouver, Canada, June 2008. (pdf | slides | doi | bib)
• M. Vazirgiannis, D. Drosos, P. Senellart, and A. Vlachou, Web Page Rank Prediction with Markov Models. In Proc. WWW, pp. 1075–1076, Beijing, China, April 2008. Poster. (pdf | html | doi | bib)
• P. Senellart, Explorer le « Web caché ». April 2008. Unpublished. (html (French) | bib)
• I. Manolescu, L. Afanasiev, A. Arion, J.-P. Dittrich, S. Manegold, N. Polyzotis, K. Schnaitter, P. Senellart, S. Zoupanos, and D. Shasha, The repeatability experiment of SIGMOD 2008. SIGMOD Record, 37(1), pp. 39–45, March 2008. (pdf | doi | bib)
• P. Senellart and V. D. Blondel, Automatic discovery of similar words. In M. W. Berry and M. Castellanos, editors, Survey of Text Mining II: Clustering, Classification and Retrieval, pp. 25–44. Springer-Verlag, January 2008. (pdf | doi | data | bib)
• P. Senellart, S. Abiteboul, and R. Gilleron, Understanding the Hidden Web. ERCIM News, 72, pp. 32–33, January 2008. (pdf | publisher | bib)

2007

• P. Senellart, Comprendre le Web caché. Understanding the Hidden Web. PhD thesis, Université Paris–Sud, Orsay, France, December 2007. (pdf | slides (French) | video (French) | code | bib)
• D. Colazzo, I. Manolescu, F.-X. Dudouet, B. Nguyen, P. Senellart, and A. Vion, Traiter des corpus d’information sur le Web. Vers de nouveaux usages informatiques de l’enquête. September 2007. Presented at Congrès de l’Association française de sciences politiques, Toulouse, France. (pdf | bib)
• Y. Ollivier and P. Senellart, Finding Related Pages Using Green Measures: An Illustration with Wikipedia. In Proc. AAAI, pp. 1427–1433, Vancouver, Canada, July 2007. (pdf | slides | code | data | bib)
• P. Senellart and S. Abiteboul, On the Complexity of Managing Probabilistic XML Data. In Proc. PODS, pp. 283–292, Beijing, China, June 2007. (pdf | slides | doi | bib)

2006

• S. Abiteboul and P. Senellart, Querying and Updating Probabilistic Information in XML. In Proc. EDBT, pp. 1059–1068, Munich, Germany, March 2006. Short paper. (pdf | slides | doi | code | bib)

2005

• S. Abiteboul and P. Senellart, Querying and Updating Probabilistic Information in XML. Technical report 435, Gemo, INRIA Futurs, Orsay, France, December 2005. (pdf | code | bib)
• P. Senellart and J. Senellart, SYSTRAN Translation Stylesheets: Machine Translation driven by XSLT. In Proc. XML Conference & Exposition, Atlanta, USA, November 2005. (pdf | xml | html | slides | bib)
• F.-X. Dudouet, I. Manolescu, B. Nguyen, and P. Senellart, XML Warehousing Meets Sociology. In Proc. IADIS ICWI, pp. 170–174, Lisbon, Portugal, October 2005. (doc | pdf | slides | extended version | bib)
• M. Attnäs, P. Senellart, and J. Senellart, Integration of SYSTRAN MT systems in an open workflow. In Proc. MT Summit, pp. 211–218, Phuket, Thailand, September 2005. (pdf | slides | bib)
• P. Senellart, Identifying Websites with Flow Simulation. In Proc. ICWE, pp. 124–129, Sydney, Australia, July 2005. (pdf | slides | doi | code | bib)
• F.-X. Dudouet, I. Manolescu, B. Nguyen, and P. Senellart, XML Warehousing meets Sociology... Introducing the W3C XQuery Working Group. Technical report 423, Gemo, INRIA Futurs, Orsay, France, April 2005. (doc | pdf | bib)
• P. Senellart, Identifying Websites with Flow Simulation. Technical report 387, Gemo, INRIA Futurs, Orsay, France, April 2005. (pdf | code | bib)
• P. Senellart, Activity Report. SYSTRAN S.A., Paris, France, 2005. (pdf | bib)

2004

• F.-X. Dudouet, I. Manolescu, B. Nguyen, and P. Senellart, Sociological Analysis of the W3C Standardization Process: XML Warehouse meets Sociology. Technical report 369, Gemo, INRIA Futurs, Orsay, France, November 2004. (pdf | bib)
• V. D. Blondel, A. Gajardo, M. Heymans, P. Senellart, and P. Van Dooren, A measure of similarity between graph vertices: applications to synonym extraction and Web searching. SIAM Review, 46(4), pp. 647–666, 2004. (pdf | arXiv | doi | data | bib)

2003

• P. Senellart, Website Identification. Masters thesis, Université Paris–Sud, Orsay, France, September 2003. (pdf | code | project page | bib)
• P. Senellart and V. D. Blondel, Automatic discovery of similar words. In M. W. Berry, editor, Survey of Text Mining: Clustering, Classification and Retrieval, pp. 25–43. Springer-Verlag, August 2003. (pdf | doi | data | bib)

2002

• V. D. Blondel and P. Senellart, Automatic extraction of synonyms in a dictionary. In Proc. TMW, pp. 7–13, Arlington, USA, April 2002. Also registered as Technical Report 89 (2001), Université catholique de Louvain, Louvain-la-neuve. (pdf | slides | data | bib)
• P. Senellart, Vérification automatique des multiplicateurs. Chalmers Institute of Technology, Gothenburg, Sweden, 2002. Long internship report. (pdf | slides | code | project page | bib)

2001

• P. Senellart, Extraction of information in large graphs. Automatic search for synonyms. Technical report 90, Université catholique de Louvain, Louvain-la-neuve, Belgium, 2001. Masters Internship Report. (pdf | slides | data | bib)

• Book
• Book chapters
• Journal articles
• Conference articles
• Workshop articles
• Demonstrations
• Posters
• Miscellaneous
• Conference proceedings

Book

• S. Abiteboul, I. Manolescu, M.-C. Rousset, P. Rigaux, and P. Senellart, Web Data Management. Cambridge University Press, New York, USA, January 2012. (doi | project page | bib)

Book chapters

Peer-reviewed

• T. Risse, W. Peters, P. Senellart, and D. Maynard, Documenting Contemporary Society by Preserving Relevant Information from Twitter. In K. Weller, A. Bruns, J. Burgess, M. Mahrt, and C. Puschmann, editors, Twitter and Society, pp. 207–219. Peter Lang International Academic Publishers, November 2013. (pdf | bib)
• E. Kharlamov and P. Senellart, Modeling, Querying, and Mining Uncertain XML Data. In A. Tagarelli, editor, XML Data Mining: Models, Methods, and Applications, pp. 29–52. IGI Global, November 2011. (pdf | doi | bib)

Without peer review

• S. Abiteboul and P. Senellart, Les réseaux informatiques. In C. Grall, editor, L'arbre et la toile : du vivant et des formes entre les disciplines, pp. 219–228. Academic Press, January 2026. (pdf (French) | bib)
• P. Senellart, On the Impact of Provenance Semiring Theory on the Design of a Provenance-Aware Database System. In A. Amarilli and A. Deutsch, editors, The Provenance of Elegance in Computation — Essays dedicated to Val Tannen, pp. 9:1–9:10. Schloss Dagstuhl — Leibniz-Zentrum für Informatik, March 2024. (pdf | slides | doi | bib)
• P. Senellart, Archivage du Web. In M. Bouzhegoub and R. Mosseri, editors, Les Big Data à découvert, pp. 200–201. CNRS Éditions, March 2017. (pdf | bib)
• B. Kimelfeld and P. Senellart, Probabilistic XML: Models and Complexity. In Z. Ma and L. Yan, editors, Advances in Probabilistic Databases for Uncertain Information Management, pp. 39–66. Springer-Verlag, May 2013. (pdf | doi | bib)
• M. Benedikt and P. Senellart, Databases. In E. K. Blum and A. V. Aho, editors, Computer Science. The Hardware, Software and Heart of It, pp. 169–229. Springer-Verlag, January 2012. (pdf | doi | bib)
• P. Senellart and V. D. Blondel, Automatic discovery of similar words. In M. W. Berry and M. Castellanos, editors, Survey of Text Mining II: Clustering, Classification and Retrieval, pp. 25–44. Springer-Verlag, January 2008. (pdf | doi | data | bib)
• P. Senellart and V. D. Blondel, Automatic discovery of similar words. In M. W. Berry, editor, Survey of Text Mining: Clustering, Classification and Retrieval, pp. 25–43. Springer-Verlag, August 2003. (pdf | doi | data | bib)

Journal articles

Peer-reviewed

• A. Gauquier, S. Ebel, H. Galhardas, T. Galizzi, I. Manolescu, A. Peden, and P. Senellart, STAR: Efficient, Scalable, and Modular Retrieval of Statistical Tables. Transactions on Large-Scale Data and Knowledge-Centered Systems, 61, 2026. (pdf | code | data | bib)
• E. Sylligardos, J. Paparrizos, T. Palpanas, P. Senellart, and P. Boniol, MSAD: A Deep Dive into Model Selection for Time Series Anomaly Detection. VLDB Journal, 34(6), pp. 72, 2025. (pdf | arXiv | doi | code | bib)
• P. Karmakar, M. Monet, P. Senellart, and S. Bressan, Expected Shapley-Like Scores of Boolean Functions: Complexity and Applications to Probabilistic Databases. Proceedings of the ACM on Management of Data, 2(2), pp. 92, June 2024. Presented at the PODS 2024 conference in Santiago, Chile. (pdf | slides | poster | arXiv | doi | code | code | bib)
• S. Amer-Yahia, S. Roy, L. Chen, A. Morishima, J. Monedero, P. Bourhis, F. Charoy, M. Danilevsky, G. Das, G. Demartini, S. Elbassuoni, D. Gross-Amblard, E. Hoareau, M. Inoguchi, J. Kenworthy, I. Kitahara, D. Lee, Y. Li, R. Borromeo, P. Papotti, R. Rao, S. Roy, P. Senellart, K. Tajima, S. Thirumuruganathan, M. Tommasi, K. Umemoto, A. Wiggins, and K. Yoshida, Making AI Machines Work for Humans in FoW. SIGMOD Record, 49(2), pp. 30–35, December 2020. (pdf | doi | bib)
• A. Amarilli, F. Capelli, M. Monet, and P. Senellart, Connecting Knowledge Compilation Classes and Width Parameters. Theory of Computing Systems, 64(5), pp. 861–914, 2020. (pdf | arXiv | doi | bib)
• M. Benedikt, P. Bourhis, G. Gottlob, and P. Senellart, Monadic Datalog, Tree Validity, and Limited Access Containment. ACM Transactions on Computational Logic, 21(1), pp. 6:1–6:45, 2020. (pdf | doi | bib)
• A. Amarilli, P. Bourhis, M. Monet, and P. Senellart, Evaluating Datalog via Tree Automata and Cycluits. Theory of Computing Systems, 63(7), pp. 1620–1678, 2019. (pdf | arXiv | doi | bib)
• A. Amarilli, M. L. Ba, D. Deutch, and P. Senellart, Computing Possible and Certain Answers over Order-Incomplete Data. Theoretical Computer Science, 797, pp. 42–76, 2019. (pdf | arXiv | doi | bib)
• S. Maniu, R. Cheng, and P. Senellart, An Indexing Framework for Queries on Probabilistic Graphs. ACM Transactions on Database Systems, 42(2), pp. 13:1–13:34, May 2017. (pdf | doi | bib)
• D. Basu, Q. Lin, W. Chen, H. T. Vo, Z. Yuan, P. Senellart, and S. Bressan, Regularized Cost-Model Oblivious Database Tuning with Reinforcement Learning. Transactions on Large-Scale Data and Knowledge-Centered Systems, 28, pp. 96–132, 2016. (pdf | doi | code | bib)
• R. Tang, A. Amarilli, P. Senellart, and S. Bressan, A Framework for Sampling-Based XML Data Pricing. Transactions on Large-Scale Data and Knowledge-Centered Systems, 24, pp. 116–138, 2016. (pdf | doi | bib)
• S. Abiteboul, Y. Amsterdamer, D. Deutch, T. Milo, and P. Senellart, Optimal Probabilistic Generation of XML Documents. Theory of Computing Systems, 57(4), pp. 806–842, November 2015. (pdf | doi | bib)
• T. Risse, E. Demidova, S. Dietze, W. Peters, N. Papailiou, K. Doka, Y. Stavrakas, V. Plachouras, P. Senellart, F. Carpentier, A. Mantrach, B. Cautis, P. Siehndel, and D. Spiliotopoulos, The ARCOMEM Architecture for Social and Semantic Driven Web Archiving. Future Internet, 6(4), pp. 688–716, November 2014. (pdf | doi | code | bib)
• V. Plachouras, F. Carpentier, M. Faheem, J. Masanès, T. Risse, P. Senellart, P. Siehndel, and Y. Stavrakas, ARCOMEM Crawling Architecture. Future Internet, 6(3), pp. 518–541, August 2014. (pdf | doi | code | bib)
• M. Faheem and P. Senellart, Crawl intelligent et adaptatif d’applications Web pour l’archivage du Web. Ingénierie des Systèmes d'Information, 19(4), pp. 61–86, 2014. (pdf (French) | doi | code | data | bib)
• M. L. Ba, T. Abdessalem, and P. Senellart, Gestion de versions incertaines de documents XML. Ingénierie des Systèmes d'Information, 19(4), pp. 9–34, 2014. (pdf (French) | doi | bib)
• F. M. Suchanek, S. Abiteboul, and P. Senellart, PARIS: Probabilistic Alignment of Relations, Instances, and Schema. Proceedings of the VLDB Endowment, 5(3), pp. 157–168, December 2011. Presented at the VLDB 2012 conference, Istanbul, Turkey. (pdf | slides | arXiv | doi | code | bib)
• B. Nguyen, A. Vion, F.-X. Dudouet, D. Colazzo, I. Manolescu, and P. Senellart, XML Content Warehousing: Improving Sociological Studies of Mailing Lists and Web Data. Bulletin of Sociological Methodology, 112(1), pp. 5–31, October 2011. (pdf | arXiv | doi | project page | bib)
• S. Abiteboul, T-H. H. Chan, E. Kharlamov, W. Nutt, and P. Senellart, Capturing Continuous Data and Answering Aggregate Queries in Probabilistic XML. ACM Transactions on Database Systems, 36(4), pp. 25:1–25:45, 2011. (pdf | doi | bib)
• M. Benedikt, E. Kharlamov, D. Olteanu, and P. Senellart, Probabilistic XML via Markov Chains. Proceedings of the VLDB Endowment, 3(1), pp. 770–781, September 2010. Presented at the VLDB 2010 conference, Singapore. (pdf | slides | doi | bib)
• G. Gottlob and P. Senellart, Schema Mapping Discovery from Data Instances. Journal of the ACM, 57(2), pp. 6:1–6:37, January 2010. (pdf | doi | bib)
  Erratum

  • Erratum October 27, 2026; Prop. 5.8, 5.9(5); Tables II, IV: The proof of Proposition 5.8 is flawed (see footnote 1 of ten Cate, Kolaitis, Qian, and Tan, AMW 2015), and the DP-hardness of Optimality claimed in Propositions 5.8 and 5.9(5) and in Tables II and IV is not established. What holds, as stated in the conference version, is that Optimality is NP-hard and coNP-hard, and that Existence-Cost is NP-hard.
• S. Abiteboul, B. Kimelfeld, Y. Sagiv, and P. Senellart, On the Expressiveness of Probabilistic XML Models. VLDB Journal, 18(5), pp. 1041–1064, October 2009. (pdf | doi | bib)
• V. D. Blondel, A. Gajardo, M. Heymans, P. Senellart, and P. Van Dooren, A measure of similarity between graph vertices: applications to synonym extraction and Web searching. SIAM Review, 46(4), pp. 647–666, 2004. (pdf | arXiv | doi | data | bib)

Without peer review

• P. Senellart and N. Vieira, OnePSL30 : transformation numérique de l'Université PSL. Collection numérique de l’AMUE, Agence de mutualisation des universités et établissements d'enseignement supérieur, 39, December 2025. (html | publisher | bib)
• P. Senellart, Qualitative Evaluation of Academic Researchers in Computer Science: Practices and Reflections from CNRS. Computer Education, 12(372), pp. 36–41, 2025. (pdf | bib)
• P. Senellart, Provenance and Probabilities in Relational Databases. SIGMOD Record, 46(4), pp. 5–15, December 2017. (pdf | doi | code | bib)
• A. Amarilli, S. Maniu, and P. Senellart, Intensional Data on the Web. SIGWEB Newsletter, 2015(Summer), pp. 4:1–4:12, August 2015. (pdf | doi | bib)
• R. Cheng, S. Maniu, and P. Senellart, Guest Editorial: Special Issue on Databases and Crowdsourcing. Distributed and Parallel Databases, 33(1), pp. 1–2, March 2015. (pdf | doi | bib)
• S. Abiteboul and P. Senellart, Un déluge de données. Pour la science, 433, pp. 32–35, November 2013. (publisher | bib)
• R. Nayak, P. Senellart, F. M. Suchanek, and A. Varde, Discovering Interesting Information with Advances in Web Technology. SIGKDD Explorations, 14(2), pp. 63–81, December 2012. (pdf | doi | bib)
• M. Bourreau, F. Moreau, and P. Senellart, La diversité culturelle dans l’industrie de la musique enregistrée en France (2003-2008). Publications du Département des études, de la prospective et des statistiques, 5, October 2011. (pdf (French) | doi | bib)
• C. Genzmer, V. Hudlet, H. Park, D. Schall, and P. Senellart, The SIGMOD 2010 Programming Contest: A Distributed Query Engine. SIGMOD Record, 39(2), pp. 61–64, June 2010. (pdf | doi | project page | bib)
• T. Abdessalem and P. Senellart, Gestion de données dans les réseaux sociaux. Telecom, 156, pp. 56–58, January 2010. (pdf (French) | bib)
• S. Manegold, I. Manolescu, L. Afanasiev, J. Feng, G. Gou, M. Hadjieleftheriou, S. Harizopoulos, P. Kalnis, K. Karanasos, D. Laurent, M. Lupu, N. Onose, C. Ré, V. Sans, P. Senellart, T. Wu, and D. Shasha, Repeatability & Workability Evaluation of SIGMOD 2009. SIGMOD Record, 38(3), pp. 40–43, September 2009. (pdf | doi | bib)
• I. Manolescu, L. Afanasiev, A. Arion, J.-P. Dittrich, S. Manegold, N. Polyzotis, K. Schnaitter, P. Senellart, S. Zoupanos, and D. Shasha, The repeatability experiment of SIGMOD 2008. SIGMOD Record, 37(1), pp. 39–45, March 2008. (pdf | doi | bib)
• P. Senellart, S. Abiteboul, and R. Gilleron, Understanding the Hidden Web. ERCIM News, 72, pp. 32–33, January 2008. (pdf | publisher | bib)

Conference articles

Peer-reviewed

• A. Gauquier, I. Manolescu, and P. Senellart, Structured Prediction for Scalable Spreadsheet Table Understanding: From Cell Types to Table Ranges. In Proc. CIKM, Rome, Italy, November 2026. (pdf | extended version | doi | code | data | bib)
• M. Sorić, C. Gracianne, I. Manolescu, and P. Senellart, Benchmarking Table Extraction from Heterogeneous Scientific PDF Documents. In Proc. KDD, Jeju Island, South Korea, August 2026. (pdf | poster | extended version | doi | code | data | data | project page | video | bib)
• M. Parrino, A. Ajenjo, E. Remy, P. Stephan, P. Senellart, and P. Boniol, In a Streaming World, Should You Stand Still? A Comprehensive Benchmark of Anomaly Detection in Streams. In Proc. KDD, Jeju Island, South Korea, August 2026. (pdf | doi | code | code | bib)
• A. Gauquier, S. Ebel, H. Galhardas, T. Galizzi, I. Manolescu, A. Peden, and P. Senellart, Efficient and Scalable Search for Statistics. In Proc. ICDE, pp. 1113–1126, Montréal, Canada, May 2026. (pdf | slides | poster | doi | data | bib)
• A. Sen, S. Maniu, and P. Senellart, ProvSQL: A General System for Keeping Track of the Provenance and Probability of Data. In Proc. ICDE, pp. 1252–1265, Montréal, Canada, May 2026. (pdf | slides | poster | arXiv | doi | code | data | data | formal proofs | project page | bib)
• A. Gauquier, I. Manolescu, and P. Senellart, Efficient Crawling for Scalable Web Data Acquisition. In Proc. EDBT, pp. 372–385, Tampere, Finland, March 2026. (pdf | slides | extended version | doi | code | bib)
• P. Karmakar, A. Gauquier, and P. Senellart, Expected Shapley Value is Shapley Value for Expected Utility Game. In Proc. ECSQARU, pp. 223–237, Hagen, Germany, September 2025. (pdf | slides | doi | bib)
• P. Karmakar, A. Saadeh, P. Senellart, and S. Bressan, Discovering Voting Power for Ensemble Methods. In Proc. DEXA (1), pp. 347–362, Bangkok, Thailand, August 2025. (pdf | slides | doi | code | bib)
• S. Mishra, A. Gauquier, and P. Senellart, Modular Multimodal Machine Learning for Extraction of Theorems and Proofs in Long Scientific Documents. In Proc. JCDL, pp. 14:1–14:5, Hong Kong, China, December 2024. Late-breaking paper. (pdf | slides | extended version | doi | code | bib)
• A. Saadeh, P. Senellart, and S. Bressan, Confidential Truth Finding with Multi-Party Computation. In Proc. DEXA, pp. 332–337, Penang, Malaysia, August 2023. (pdf | slides | extended version | doi | code | bib)
• A. Gauquier and P. Senellart, Automatically Inferring the Document Class of a Scientific Article. In Proc. DocEng, pp. 11:1–11:10, Limerick, Ireland, August 2023. (pdf | slides | doi | code | bib)
• Y. Ramusat, S. Maniu, and P. Senellart, Efficient Provenance-Aware Querying of Graph Databases with Datalog. In Proc. BDA, Clermont-Ferrand, France, October 2022. (pdf | slides | code | bib)
• S. Mishra, L. Pluvinage, and P. Senellart, Towards Extraction of Theorems and Proofs in Scholarly Articles. In Proc. DocEng, pp. 25:1–25:4, Limerick, Ireland, August 2021. (pdf | video | doi | code | bib)
• Y. Ramusat, S. Maniu, and P. Senellart, Provenance-Based Algorithms for Rich Queries over Graph Databases. In Proc. EDBT, pp. 73–84, Nicosia, Cyprus, March 2021. (pdf | slides | doi | code | bib)
• Y. Ramusat, S. Maniu, and P. Senellart, Algorithmes à base de provenance pour des requêtes enrichies sur les bases de données graphes. In Proc. BDA, online, France, October 2020. (pdf | slides | code | bib)
• A. Dandekar, D. Basu, P. Senellart, and S. Bressan, Confidentialité différentielle à risque : Relier les sources d'aléa et un budget de confidentialité. In Proc. BDA, online, France, October 2020. (pdf | slides | bib)
• P. Senellart, Provenance in Databases: Principles and Applications. In Proc. RW, pp. 104–109, Bolzano, Italy, September 2019. (pdf | slides | doi | bib)
• D. Basu, P. Senellart, and S. Bressan, BelMan: An Information-Geometric Approach to Stochastic Bandits. In Proc. ECML/PKDD, pp. 167–183, Würzburg, Germany, September 2019. (pdf | arXiv | doi | code | bib)
• S. Maniu, P. Senellart, and S. Jog, An Experimental Study of the Treewidth of Real-World Graph Data. In Proc. ICDT, pp. 12:1–12:18, Lisbon, Portugal, March 2019. (pdf | extended version | doi | code | data | bib)
• A. Amarilli, M. Monet, and P. Senellart, Liens entre largeur et structure en compilation de connaissances. In Proc. BDA, Bucharest, Romania, November 2018. Conference without formal proceedings. (pdf | bib)
• S. Maniu, P. Senellart, and S. Jog, Une étude expérimentale de la largeur d'arbre de données graphe du monde réel. In Proc. BDA, Bucharest, Romania, November 2018. Conference without formal proceedings. (pdf | slides (French) | code | data | bib)
• M. Han, P.-H. Wuillemin, and P. Senellart, Focused Crawling through Reinforcement Learning. In Proc. ICWE, pp. 261–278, Cáceres, Spain, June 2018. (pdf | doi | code | bib)
• B. Spencer, M. Benedikt, and P. Senellart, Form Filling based on Constraint Solving. In Proc. ICWE, pp. 95–113, Cáceres, Spain, June 2018. (pdf | doi | code | data | bib)
• A. Amarilli, M. Monet, and P. Senellart, Connecting Width and Structure in Knowledge Compilation. In Proc. ICDT, pp. 6:1–6:17, Vienna, Austria, March 2018. (pdf | extended version | doi | bib)
• A. Amarilli, M. L. Ba, D. Deutch, and P. Senellart, Possible and Certain Answers for Queries over Order-Incomplete Data. In Proc. TIME, pp. 4:1–4:19, Mons, Belgium, October 2017. (pdf | extended version | doi | bib)
  Erratum

  • Erratum October 27, 2026; Thm. 19, 22, 30: Theorems 19, 22, and 30 (tractability of possibility for PosRA queries on unordered or bounded-ia-width po-databases, and of possibility and certainty for accumulation queries on bounded ia-width) are not established, and Theorems 19 and 22 are false unless P = NP: the proof of Proposition 66 of the first arXiv version fails for the product operators, and Theorem 92 of version 2 of the extended version (January 2018, hosted here) exhibits a PosRA query for which possibility is NP-complete on unordered po-relations. That version removes the affected results and discusses the error in its Appendix G; the journal version contains neither. See also Antoine Amarilli's errata.
• A. Amarilli, M. Monet, and P. Senellart, Conjunctive Queries on Probabilistic Graphs: Combined Complexity. In Proc. PODS, pp. 217–232, Chicago, USA, May 2017. (pdf | slides | poster | arXiv | doi | bib)
• A. Amarilli, P. Bourhis, M. Monet, and P. Senellart, Combined Tractability of Query Evaluation via Tree Automata and Cycluits. In Proc. ICDT, pp. 6:1–6:19, Venice, Italy, March 2017. (pdf | slides | poster | extended version | doi | bib)
• A. Amarilli, Y. Amsterdamer, T. Milo, and P. Senellart, Top-k Querying of Unknown Values under Order Constraints. In Proc. ICDT, pp. 5:1–5:18, Venice, Italy, March 2017. (pdf | slides | poster | extended version | doi | bib)
• A. Amarilli, P. Bourhis, and P. Senellart, Lignages efficaces sur les instances quasi-arborescentes: Limites et extensions. In Proc. BDA, Poitiers, France, November 2016. (pdf | bib)
• M. Han, P. Senellart, S. Bressan, and H. Wu, Routing an Autonomous Taxi with Reinforcement Learning. In Proc. CIKM, pp. 2421–2424, Indianapolis, USA, October 2016. Industry track, short paper. (pdf | doi | code | bib)
• A. Amarilli, P. Bourhis, and P. Senellart, Tractable Lineages on Treelike Instances: Limits and Extensions. In Proc. PODS, pp. 355–370, San Francisco, USA, June 2016. (pdf | extended version | doi | bib)
  Erratum Update

  • Erratum October 27, 2026; Thm. 5.5: The proof of Theorem 5.5, given in Antoine Amarilli's PhD thesis (Theorem 6.2.5) rather than in the paper, is incorrect: the advice string it defines depends on the instance and not only on its size. A corrected proof is given in the appendix of version 2 of the extended version on arXiv (April 2023), which is the one hosted here. See also Antoine Amarilli's errata.
  • Update October 27, 2026; Sect. 5.2, Thm. 5.5: The introduction and Section 5.2 present the hypothesis of Theorem 5.5 as the non-uniform exponential-time hypothesis. The hypothesis actually used in the statement, and all the proof needs, is weaker: that the polynomial hierarchy is not contained in DTIME(2^o(n))/SubEXP. The distinction now matters: a preprint released by OpenAI on October 25, 2026 claims a deterministic 2^o(n)-time algorithm for 3-SAT, which would refute ETH and its non-uniform version but leaves this weaker hypothesis open. The other intractability results of the paper (Theorems 4.2, 5.2, and 5.7) are unconditional. The same applies to the extended version.
• M. Faheem and P. Senellart, Adaptive Web Crawling through Structure-Based Link Classification. In Proc. ICADL, pp. 39–51, Seoul, South Korea, December 2015. (pdf | slides | doi | code | bib)
• D. Montoya, S. Abiteboul, and P. Senellart, Hup-Me: Inferring and Reconciling a Timeline of User Activity from Rich Smartphone Data. In Proc. SIGSPATIAL, pp. 62:1–62:4, Bellevue, USA, November 2015. Short paper. This prototype evolved into the Thymeflow system. (pdf | slides | poster | doi | code | project page | bib)
• A. Amarilli, M. L. Ba, D. Deutch, and P. Senellart, Requêtes sur des données à ordre incomplet. In Proc. BDA, Porquerolles, France, September 2015. Conference without formal proceedings. (pdf | slides | bib)
• A. Amarilli, P. Bourhis, and P. Senellart, Circuits de provenance pour les arbres et les instances quasi-arborescentes. In Proc. BDA, Porquerolles, France, September 2015. Conference without formal proceedings. (pdf | slides | bib)
• D. Basu, Q. Lin, Z. Yuan, P. Senellart, and S. Bressan, Apprentissage par renforcement pour optimiser les bases de donnéees indépendamment du modèle de coût. In Proc. BDA, Porquerolles, France, September 2015. Conference without formal proceedings. (pdf | slides | code | bib)
• D. Basu, Q. Lin, W. Chen, H. T. Vo, Z. Yuan, P. Senellart, and S. Bressan, Cost-Model Oblivious Database Tuning with Reinforcement Learning. In Proc. DEXA, pp. 253–268, Valencia, Spain, September 2015. (pdf | slides | doi | code | bib)
• S. Lei, S. Maniu, L. Mo, R. Cheng, and P. Senellart, Online Influence Maximization. In Proc. KDD, pp. 645–654, Sydney, Australia, August 2015. (pdf | slides | poster | extended version | doi | code | bib)
• A. Amarilli, P. Bourhis, and P. Senellart, Provenance Circuits for Trees and Treelike Instances. In Proc. ICALP, pp. 56–68, Kyoto, Japan, July 2015. (pdf | slides | extended version | doi | bib)
• C. Meng, R. Cheng, S. Maniu, P. Senellart, and W. Zhang, Discovering Meta-Paths in Large Heterogeneous Information Networks. In Proc. WWW, pp. 754–764, Florence, Italy, May 2015. (pdf | slides, pdf | slides, pptx | doi | bib)
• G. Gouriten, S. Maniu, and P. Senellart, Scalable, Generic, and Adaptive Systems for Focused Crawling. In Proc. Hypertext, pp. 35–45, Santiago, Chile, September 2014. Douglas Engelbart Best Paper Award. (pdf | slides | doi | bib)
• R. Tang, A. Amarilli, P. Senellart, and S. Bressan, Get a Sample for a Discount: Sampling-Based XML Data Pricing. In Proc. DEXA, pp. 20–34, Munich, Germany, September 2014. (pdf | slides | doi | bib)
• M. Faheem and P. Senellart, Collecte intelligente et adaptative d'applications Web pour l'archivage du Web. In Proc. BDA, Nantes, France, October 2013. Conference without formal proceedings. (pdf | slides | code | data | bib)
• M. L. Ba, T. Abdessalem, and P. Senellart, Contrôle de version incertain dans l'édition collaborative ouverte de documents arborescents. In Proc. BDA, Nantes, France, October 2013. Conference without formal proceedings. (pdf | slides | bib)
• G. Gouriten, S. Maniu, and P. Senellart, Exploration adaptative de graphes sous contrainte de budget. In Proc. BDA, Nantes, France, October 2013. Conference without formal proceedings. (pdf | slides | bib)
• M. L. Ba, T. Abdessalem, and P. Senellart, Uncertain Version Control in Open Collaborative Editing of Tree-Structured Documents. In Proc. DocEng, pp. 27–36, Florence, Italy, September 2013. (pdf | slides | doi | bib)
• A. Amarilli and P. Senellart, On the Connections between Relational and XML Probabilistic Data Models. In Proc. BNCOD, pp. 121–134, Oxford, United Kingdom, July 2013. (pdf | slides | doi | bib)
• M. Faheem and P. Senellart, Intelligent and Adaptive Crawling of Web Applications for Web Archiving. In Proc. ICWE, pp. 306–322, Aalborg, Denmark, July 2013. (pdf | slides | doi | code | data | bib)
• Y. Amsterdamer, Y. Grossman, T. Milo, and P. Senellart, Crowd Mining. In Proc. SIGMOD, pp. 241–252, New York, USA, June 2013. (pdf | slides, pdf | slides, pptx | poster | doi | bib)
• A. Souihli and P. Senellart, Optimizing Approximations of DNF Query Lineage in Probabilistic XML. In Proc. ICDE, pp. 721–732, Brisbane, Australia, April 2013. (pdf | doi | code | bib)
• A. Souihli and P. Senellart, Optimisation des approximations de probabilité des requêtes en XML probabiliste. In Proc. BDA, Clermont-Ferrand, France, October 2012. Conference without formal proceedings. (pdf | slides | code | bib)
• M. Benedikt, P. Bourhis, and P. Senellart, Monadic Datalog Containment. In Proc. ICALP, pp. 79–91, Warwick, United Kingdom, July 2012. (pdf | slides | doi | bib)
• J. Lu, P. Senellart, C. Lin, X. Du, S. Wang, and X. Chen, Optimal Top-k Generation of Attribute Combinations based on Ranked Lists. In Proc. SIGMOD, pp. 409–420, Scottsdale, USA, May 2012. (pdf | slides | poster | doi | bib)
• G. Gouriten and P. Senellart, API Blender: A Uniform Interface to Social Platform APIs. In Proc. WWW, Lyon, France, April 2012. Developer track. (pdf | slides | arXiv | code | bib)
• S. Abiteboul, P. Senellart, and V. Vianu, The ERC Webdam on Foundations of Web Data Management. In Proc. WWW, pp. 211–214, Lyon, France, April 2012. European project track. (pdf | slides | doi | bib)
• S. Abiteboul, Y. Amsterdamer, D. Deutch, T. Milo, and P. Senellart, Finding Optimal Probabilistic Generators for XML Collections. In Proc. ICDT, pp. 127–139, Berlin, Germany, March 2012. (pdf | slides | doi | bib)
• F. M. Suchanek, S. Abiteboul, and P. Senellart, Ontology Alignment at the Instance and Schema Level. In Proc. BDA, Rabat, Morocco, October 2011. Conference without formal proceedings. Also registered as Technical Report RT-0408 (2011), INRIA. (pdf | arXiv | code | bib)
• S. Abiteboul, Y. Amsterdamer, D. Deutch, T. Milo, and P. Senellart, Optimal Probabilistic Generators for XML Corpora. In Proc. BDA, Rabat, Morocco, October 2011. Conference without formal proceedings. (pdf | slides, pdf | slides, pptx | bib)
• M. Benedikt, G. Gottlob, and P. Senellart, Determining Relevance of Accesses at Runtime. In Proc. PODS, pp. 211–222, Athens, Greece, June 2011. (pdf | slides | extended version | doi | bib)
  Erratum

  • Erratum October 27, 2026; Thm. 5.2, 5.6: As explained in the related-work section of our 2020 paper on monadic Datalog, two results are incorrect. The proof of the co2NEXPTIME lower bound of Theorem 5.6, for containment of positive queries under access limitations (and hence of the 2NEXPTIME-hardness of long-term relevance for positive queries), is flawed, and the bound is at odds, under standard complexity-theoretic assumptions, with the 2EXPTIME upper bound later proven by Benedikt, Bourhis, and Ley (ACM TODS 2015). The proof of the coNEXPTIME upper bound of Theorem 5.2, for conjunctive query containment under access limitations, only works for schemas with a single access method per relation; the general case is open. The same applies to the extended version.
• S. Abiteboul, T-H. H. Chan, E. Kharlamov, W. Nutt, and P. Senellart, Aggregate Queries for Discrete and Continuous Probabilistic XML. In Proc. ICDT, pp. 50–61, Lausanne, Switzerland, March 2010. (pdf | slides | doi | bib)
• A. Galland, S. Abiteboul, A. Marian, and P. Senellart, Corroborating Information from Disagreeing Views. In Proc. WSDM, pp. 131–140, New York, USA, February 2010. (pdf | slides | doi | code | bib)
• S. Abiteboul, T-H. H. Chan, E. Kharlamov, W. Nutt, and P. Senellart, Agrégation de documents XML probabilistes. In Proc. BDA, Namur, Belgium, October 2009. Conference without formal proceedings. (pdf | slides | bib)
• A. Galland, S. Abiteboul, A. Marian, and P. Senellart, Corroboration de vues discordantes fondées sur la confiance. In Proc. BDA, Namur, Belgium, October 2009. Conference without formal proceedings. (pdf | slides | code | bib)
• P. Senellart and G. Gottlob, On the Complexity of Deriving Schema Mappings from Database Instances. In Proc. PODS, pp. 23–32, Vancouver, Canada, June 2008. (pdf | slides | doi | bib)
• Y. Ollivier and P. Senellart, Finding Related Pages Using Green Measures: An Illustration with Wikipedia. In Proc. AAAI, pp. 1427–1433, Vancouver, Canada, July 2007. (pdf | slides | code | data | bib)
• P. Senellart and S. Abiteboul, On the Complexity of Managing Probabilistic XML Data. In Proc. PODS, pp. 283–292, Beijing, China, June 2007. (pdf | slides | doi | bib)
• S. Abiteboul and P. Senellart, Querying and Updating Probabilistic Information in XML. In Proc. EDBT, pp. 1059–1068, Munich, Germany, March 2006. Short paper. (pdf | slides | doi | code | bib)
• F.-X. Dudouet, I. Manolescu, B. Nguyen, and P. Senellart, XML Warehousing Meets Sociology. In Proc. IADIS ICWI, pp. 170–174, Lisbon, Portugal, October 2005. (doc | pdf | slides | extended version | bib)
• M. Attnäs, P. Senellart, and J. Senellart, Integration of SYSTRAN MT systems in an open workflow. In Proc. MT Summit, pp. 211–218, Phuket, Thailand, September 2005. (pdf | slides | bib)
• P. Senellart, Identifying Websites with Flow Simulation. In Proc. ICWE, pp. 124–129, Sydney, Australia, July 2005. (pdf | slides | doi | code | bib)

Without peer review

• S. Maniu and P. Senellart, Database Theory in Action: Making Provenance and Probabilistic Database Theory Work in Practice (Invited Talk). In Proc. ICDT, pp. 33:1–33:6, Barcelona, Spain, March 2025. (pdf | slides | doi | code | bib)
• P. Senellart, Probabilistic Models for Uncertain Data. In Proc. SoICT, pp. 10, Da Nang, Vietnam, December 2013. (pdf | slides | doi | bib)
• F. M. Suchanek, A. Varde, R. Nayak, and P. Senellart, The Hidden Web, XML and the Semantic Web: Scientific Data Management Perspectives. In Proc. EDBT, pp. 534–537, Uppsala, Sweden, March 2011. Tutorial. (pdf | slides, pdf | slides, ppt | arXiv | doi | bib)
• A. Varde, F. M. Suchanek, R. Nayak, and P. Senellart, Knowledge Discovery over the Deep Web, Semantic Web and XML. In Proc. DASFAA, pp. 784–788, Brisbane, Australia, April 2009. Tutorial. (pdf | slides | doi | bib)
• P. Senellart and J. Senellart, SYSTRAN Translation Stylesheets: Machine Translation driven by XSLT. In Proc. XML Conference & Exposition, Atlanta, USA, November 2005. (pdf | xml | html | slides | bib)

Workshop articles

Peer-reviewed

• S. Mishra, Y. Brihmouche, T. Delemazure, A. Gauquier, and P. Senellart, First Steps in Building a Knowledge Base of Mathematical Results. In Proc. SDP, pp. 165–174, Bangkok, Thailand, August 2024. (pdf | poster | doi | code | code | bib)
• S. Jiang and P. Senellart, Extracting Definienda in Mathematical Scholarly Articles with Transformers. In Proc. WIESP, online, Indonesia, November 2023. (pdf | slides | arXiv | doi | code | data | bib)
• Y. Ramusat, S. Maniu, and P. Senellart, Efficient Provenance-Aware Querying of Graph Databases with Datalog. In Proc. GRADES-NDA, pp. 4:1–4:9, Philadelphia, USA, June 2022. (pdf | slides | doi | code | bib)
• Y. Ramusat, S. Maniu, and P. Senellart, Semiring Provenance over Graph Databases. In Proc. TaPP, London, United Kingdom, July 2018. (pdf | slides | code | bib)
• D. Montoya, T. Pellissier Tanon, S. Abiteboul, P. Senellart, and F. M. Suchanek, A Knowledge Base for Personal Information Management. In Proc. LDOW, Lyon, France, April 2018. (pdf | code | code | code | project page | bib)
• O. Savkovic, E. Kharlamov, W. Nutt, and P. Senellart, Towards Approximating Incomplete Queries over Partially Complete Databases. In Proc. AMW, Montevideo, Uruguay, June 2017. (pdf | bib)
• M. L. Ba, R. Horincar, P. Senellart, and H. Wu, Truth Finding with Attribute Partitioning. In Proc. WebDB, pp. 27–33, Melbourne, Australia, May 2015. (pdf | slides | doi | data | bib)
• M. Oita and P. Senellart, FOREST: Focused Object Retrieval by Exploiting Significant Tag Paths. In Proc. WebDB, pp. 55–61, Melbourne, Australia, May 2015. (pdf | slides | doi | code | data | bib)
• S. Maniu, R. Cheng, and P. Senellart, ProbTree: A Query-Efficient Representation of Probabilistic Graphs. In Proc. BUDA, Snowbird, USA, June 2014. Workshop without formal proceedings. (pdf | slides | poster | bib)
• M. L. Ba, T. Abdessalem, and P. Senellart, Merging Uncertain Multi-Version XML Documents. In Proc. DChanges, Florence, Italy, September 2013. (pdf | slides | bib)
• T. Risse, W. Peters, and P. Senellart, Social and Semantic Driven Web Harvesting. In Proc. Building Web Observatories, Paris, France, May 2013. (pdf | code | bib)
• M. Oita, A. Amarilli, and P. Senellart, Cross-Fertilizing Deep Web Analysis and Ontology Enrichment. In Proc. VLDS, pp. 5–8, Istanbul, Turkey, August 2012. Vision article. (pdf | slides | bib)
• M. Bienvenu, D. Deutch, D. Martinenghi, P. Senellart, and F. M. Suchanek, Dealing with the Deep Web and all its Quirks. In Proc. VLDS, pp. 21–24, Istanbul, Turkey, August 2012. Vision article. (pdf | slides | bib)
• M. L. Ba, T. Abdessalem, and P. Senellart, Towards a Version Control Model with Uncertain Data. In Proc. PIKM, pp. 43–50, Glasgow, United Kingdom, October 2011. (pdf | slides | doi | bib)
• M. Oita and P. Senellart, Deriving Dynamics of Web Pages: A Survey. In Proc. TWAW, pp. 25–32, Hyderabad, India, March 2011. (pdf | slides | bib)
• E. Kharlamov, W. Nutt, and P. Senellart, Value Joins are Expensive over (Probabilistic) XML. In Proc. LID, pp. 41–48, Uppsala, Sweden, March 2011. (pdf | slides | extended version | doi | bib)
• A. Souihli and P. Senellart, Efficient Query Evaluation over Probabilistic XML with Long-Distance Dependencies. In Proc. Joint EDBT/ICDT Ph.D. Workshop, pp. 32–37, Uppsala, Sweden, March 2011. (pdf | doi | code | bib)
• M. Oita and P. Senellart, Archiving Data Objects Using Web Feeds. In Proc. IWAW, pp. 31–41, Vienna, Austria, September 2010. (pdf | slides | bib)
• E. Kharlamov, W. Nutt, and P. Senellart, Updating Probabilistic XML. In Proc. Updates in XML, Lausanne, Switzerland, March 2010. (pdf | slides | doi | bib)
• S. Abiteboul, S. Amer-Yahia, A. Marian, A. Galland, and P. Senellart, Birds of a tag flock together. In Proc. SSM, New York, USA, February 2010. Workshop without formal proceedings. (pdf | poster | bib)
• M. Spaniol, D. Denev, A. Mazeika, P. Senellart, and G. Weikum, Data Quality in Web Archiving. In Proc. WICOW, pp. 19–26, Madrid, Spain, April 2009. (pdf | doi | bib)
• P. Senellart, A. Mittal, D. Muschick, R. Gilleron, and M. Tommasi, Automatic Wrapper Induction from Hidden-Web Sources with Domain Knowledge. In Proc. WIDM, pp. 9–16, Napa, USA, October 2008. (pdf | slides | doi | code | data | bib)
• V. D. Blondel and P. Senellart, Automatic extraction of synonyms in a dictionary. In Proc. TMW, pp. 7–13, Arlington, USA, April 2002. Also registered as Technical Report 89 (2001), Université catholique de Louvain, Louvain-la-neuve. (pdf | slides | data | bib)

Without peer review

• P. Senellart, Disseminate your Research: Style Does Matter. In Proc. PIKM, pp. 1–2, San Francisco, USA, November 2013. (pdf | slides | doi | bib)
• V. Plachouras, F. Carpentier, J. Masanès, T. Risse, P. Senellart, P. Siehndel, and Y. Stavrakas, An Architecture for Selective Web Harvesting: The Use Case of Heritrix. In Proc. ARCOMEM, Lisbon, Portugal, September 2013. Workshop without formal proceedings. (pdf | code | bib)

Demonstrations (peer-reviewed)

• A. Saadeh and P. Senellart, Preserving LLM Output Distributions for Probabilistic Query Evaluation. In Proc. CIKM, Rome, Italy, November 2026. Demonstration. (pdf | doi | code | video | bib)
• A. A. Widiaatmaja, B. Djeffal, A. Dandekar, and P. Senellart, Demonstration of ProvSQL Update Provenance through Temporal Databases. In Proc. PW, pp. 71–76, Berlin, Germany, June 2025. Demonstration. (pdf | poster | doi | code | data | bib)
• S. Mishra, N. Sharma, A. Gauquier, and P. Senellart, TheoremView: A Framework for Extracting Theorem-Like Environments from Raw PDFs. In Proc. ECIR (5), pp. 24–29, Lucca, Italy, April 2025. Demonstration. (pdf | doi | code | video | bib)
• F. Yunus, P. Karmakar, P. Senellart, T. Abdessalem, and S. Bressan, Using a Probabilistic Database in an Image Retrieval Application. In Proc. EDBT, pp. 1106–1109, Barcelona, Spain, March 2025. Demonstration. (pdf | doi | code | data | video | bib)
• P. Senellart, L. Jachiet, S. Maniu, and Y. Ramusat, ProvSQL : Gestion de provenance et de probabilités dans PostgreSQL. In Proc. BDA, Bucharest, Romania, November 2018. Demonstration. Conference without formal proceedings. (pdf | code | project page | bib)
• P. Senellart, L. Jachiet, S. Maniu, and Y. Ramusat, ProvSQL: Provenance and Probability Management in PostgreSQL. In Proc. VLDB, pp. 2034–2037, Rio de Janeiro, Brazil, August 2018. Demonstration. (pdf | poster | doi | code | project page | video | bib)
• M. L. Ba, S. Montenez, T. Abdessalem, and P. Senellart, Monitoring moving objects using uncertain Web data. In Proc. SIGSPATIAL, pp. 565–568, Dallas, USA, November 2014. Demonstration. (pdf | video | poster | doi | bib)
• M. L. Ba, S. Montenez, T. Abdessalem, and P. Senellart, Collecte, intégration et visualisation de données Web incertaines sur des objets mobiles. In Proc. BDA, Autrans, France, October 2014. Demonstration. Conference without formal proceedings. (pdf | video | poster | bib)
• M. Faheem and P. Senellart, Une démonstration d’un crawler intelligent pour les applications Web. In Proc. BDA, Nantes, France, October 2013. Demonstration. Conference without formal proceedings. (pdf | video | poster | code | bib)
• M. Faheem and P. Senellart, Demonstrating Intelligent Crawling and Archiving of Web Applications. In Proc. CIKM, pp. 2481–2484, San Francisco, USA, October 2013. Demonstration. (pdf | video | poster | doi | code | bib)
• Y. Amsterdamer, Y. Grossman, T. Milo, and P. Senellart, Crowd Miner: Mining association rules from the crowd. In Proc. VLDB, pp. 1250–1253, Riva del Garda, Italy, August 2013. Demonstration. (pdf | poster | doi | bib)
• A. Souihli and P. Senellart, Demonstrating ProApproX 2.0: A Predictive Query Engine for Probabilistic XML. In Proc. CIKM, pp. 2734–2736, Maui, Hawaii, USA, October 2012. Demonstration. (pdf | video | poster | doi | code | bib)
• S. Abiteboul, Y. Amsterdamer, T. Milo, and P. Senellart, Auto-Completion Learning for XML. In Proc. SIGMOD, pp. 669–672, Scottsdale, USA, May 2012. Demonstration. (pdf | poster | doi | bib)
• M. Benedikt, T. Furche, A. Savvides, and P. Senellart, ProFoUnd: Program-analysis–based Form Understanding. In Proc. WWW, pp. 313–316, Lyon, France, April 2012. Demonstration. (pdf | slides | poster | doi | bib)
• P. Senellart and A. Souihli, ProApproX: A Lightweight Approximation Query Processor over Probabilistic Trees. In Proc. SIGMOD, pp. 1295–1298, Athens, Greece, June 2011. Demonstration. (pdf | video | poster | doi | code | bib)
• T. Abdessalem, M. L. Ba, and P. Senellart, A Probabilistic XML Merging Tool. In Proc. EDBT, pp. 538–541, Uppsala, Sweden, March 2011. Demonstration. (pdf | poster | doi | bib)
• M. Oita and P. Senellart, Archivage du contenu éphémère du Web à l’aide des flux Web. In Proc. BDA, Toulouse, France, October 2010. Demonstration. Conference without formal proceedings. (pdf | poster | bib)
• P. Senellart and A. Souihli, Un Système de gestion de données XML probabilistes. In Proc. BDA, Toulouse, France, October 2010. Demonstration. Conference without formal proceedings. (pdf | poster | code | bib)

Posters (peer-reviewed)

• S. Mishra, A. Gauquier, and P. Senellart, Apprentissage multimodal modulaire pour l’extraction de théorèmes et de preuves dans des documents scientifiques longs. In Proc. EGC, pp. 497–498, Strasbourg, France, January 2025. Poster. (pdf | poster | code | bib)
• T. Risse, S. Dietze, W. Peters, K. Doka, Y. Stavrakas, and P. Senellart, Exploiting the Social and Semantic Web for guided Web Archiving. In Proc. TPDL, pp. 426–432, Paphos, Cyprus, September 2012. Poster. (pdf | poster | doi | code | bib)
• B. Nguyen, A. Vion, F.-X. Dudouet, I. Manolescu, D. Colazzo, and P. Senellart, The WebStand Project. In Proc. WebSci, Athens, Greece, March 2009. Poster. (pdf | poster | arXiv | project page | bib)
• M. Vazirgiannis, D. Drosos, P. Senellart, and A. Vlachou, Web Page Rank Prediction with Markov Models. In Proc. WWW, pp. 1075–1076, Beijing, China, April 2008. Poster. (pdf | html | doi | bib)

Miscellaneous

• A. Sen, P. Karmakar, S. Maniu, A. Saadeh, and P. Senellart, Provenance of HAVING Queries in Semirings with Monus. September 2026. arXiv abs/2609.31246. (pdf | arXiv | code | data | formal proofs | project page | bib)
• P. Senellart and A. Gnatenko, Descriptive Complexity in Lean: Completeness by First-Order Reductions. September 2026. arXiv abs/2609.18261. (pdf | arXiv | formal proofs | bib)
• A. Gauquier, I. Manolescu, and P. Senellart, Structured Prediction for Scalable Spreadsheet Table Understanding: From Cell Types to Table Ranges (Extended Version). August 2026. arXiv abs/2608.16050. (pdf | arXiv | code | data | bib)
• M. Sorić, C. Gracianne, I. Manolescu, and P. Senellart, Benchmarking Table Extraction from Heterogeneous Scientific PDF Documents (Extended Version). July 2026. arXiv abs/2511.16134. (pdf | arXiv | data | bib)
• A. Gauquier, I. Manolescu, and P. Senellart, Efficient Crawling for Scalable Web Data Acquisition (Extended Version). February 2026. arXiv abs/2602.11874. (pdf | arXiv | code | bib)
• N. Appel, J. Bourdon, N. Bousquet, J. Cohen, A. Genitrini, P. Georgeon, Y. Grandvalet, K. Jaffrès-Runser, A. Legrand, D. Markham, A. Muscholl, A. Paparrizou, L. Paulevé, M. Poss, M. Potop-Butucaru, J.-F. Raymond, R. Rouvoy, Y. Sallent, P. Senellart, T. Seiller, Y.-Q. Song, A. Tchana, and H. Waeselynck, Section 06 – Sciences de l’information : fondements de l’informatique, calculs, algorithmes, représentations, exploitations. Comité national de la recherche scientifique, Paris, France, 2025. Rapport de conjoncture 2024 (state-of-research report) of section 06. (pdf | HAL | bib)
• S. Mishra, A. Gauquier, and P. Senellart, Modular Multimodal Machine Learning for Extraction of Theorems and Proofs in Long Scientific Documents (Extended Version). October 2024. arXiv abs/2307.09047. (pdf | arXiv | code | bib)
• A. Saadeh, P. Senellart, and S. Bressan, Confidential Truth Finding with Multi-Party Computation (Extended Version). May 2023. arXiv abs/2305.14727. (pdf | slides | arXiv | code | bib)
• A. Amarilli, P. Bourhis, and P. Senellart, Tractable Lineages on Treelike Instances: Limits and Extensions. April 2023. arXiv abs/1604.02761. (pdf | arXiv | bib)
  Update

  • Update October 27, 2026; Sect. 5.2, Thm. 5.5: The introduction and Section 5.2 present the hypothesis of Theorem 5.5 as the non-uniform exponential-time hypothesis. The hypothesis actually used in the statement, and all the proof needs, is weaker: that the polynomial hierarchy is not contained in DTIME(2^o(n))/SubEXP. The distinction now matters: a preprint released by OpenAI on October 25, 2026 claims a deterministic 2^o(n)-time algorithm for 3-SAT, which would refute ETH and its non-uniform version but leaves this weaker hypothesis open. The other intractability results of the paper (Theorems 4.2, 5.2, and 5.7) are unconditional. The same applies to the conference version.
• Y. Ramusat, S. Maniu, and P. Senellart, A Practical Dynamic Programming Approach to Datalog Provenance Computation. December 2021. arXiv abs/2112.01132. (pdf | arXiv | code | bib)
• H. Comon, S. Perdrix, P. Aboulker, P. Arrighi, S. Blazy, A. Braud, P. Clairambault, P. Dayre, R. Dernat, C. Dhaenens, L. Duchien, A. Gheerbrant, N. Aussenac-Gilles, J.-M. Larré, D. Lavenier, L. Liberti, P. Owezarski, C. Scornavacca, S. Sené, P. Senellart, P. Sens, G. Villard, I. Walukiewicz, and L. Weinhard, Section 06 – Sciences de l’information : fondements de l’informatique, calculs, algorithmes, représentations, exploitations. Comité national de la recherche scientifique, Paris, France, 2021. Rapport de conjoncture 2019 (state-of-research report) of section 06. (pdf | HAL | bib)
• J. Krämer, P. Senellart, and A. de Streel, Making Data Portability More Effective for the Digital Economy: Economic Implications and Regulatory Challenges. Centre on Regulation in Europe (CERRE), Brussels, Belgium, June 2020. (pdf | HAL | publisher | bib)
• S. Maniu, P. Senellart, and S. Jog, An Experimental Study of the Treewidth of Real-World Graph Data (Extended Version). January 2019. arXiv abs/1901.06862. (pdf | arXiv | code | data | bib)
• A. Amarilli, M. Monet, and P. Senellart, Connecting Width and Structure in Knowledge Compilation (Extended Version). May 2018. arXiv abs/1709.06188v3. (pdf | arXiv | bib)
• A. Amarilli, M. L. Ba, D. Deutch, and P. Senellart, Possible and Certain Answers for Queries over Order-Incomplete Data. January 2018. arXiv abs/1707.07222v2. (pdf | arXiv | bib)
• A. Amarilli, P. Bourhis, M. Monet, and P. Senellart, Combined Tractability of Query Evaluation via Tree Automata and Cycluits (Extended Version). January 2017. arXiv abs/1612.04203. (pdf | arXiv | bib)
• A. Amarilli, Y. Amsterdamer, T. Milo, and P. Senellart, Top-k Querying of Unknown Values under Order Constraints (Extended Version). January 2017. arXiv abs/1701.02634. (pdf | arXiv | bib)
• D. Montoya, T. Pellissier Tanon, S. Abiteboul, P. Senellart, and F. M. Suchanek, Thymeflow, An Open-Source Personal Knowledge Base System. December 2016. (pdf | code | code | code | project page | bib)
• A. Amarilli, P. Bourhis, and P. Senellart, Provenance Circuits for Trees and Treelike Instances (Extended Version). November 2015. arXiv abs/1511.08723. (pdf | arXiv | bib)
• S. Lei, S. Maniu, L. Mo, R. Cheng, and P. Senellart, Online Influence Maximization (Extended Version). June 2015. arXiv abs/1506.01188. (pdf | arXiv | code | bib)
• R. Tang, D. Shao, M. L. Ba, P. Senellart, and S. Bressan, A Framework for Conditioning Probabilistic XML Data. November 2014. (pdf | bib)
• P. Senellart, Probabilistic XML: A Data Model for the Web. Habilitation to supervise research, Université Pierre et Marie Curie, Paris, France, June 2012. (pdf | slides (French) | video | bib)
• M. Benedikt, G. Gottlob, and P. Senellart, Determining Relevance of Accesses at Runtime (Extended Version). April 2011. arXiv abs/1104.0553. (pdf | arXiv | bib)
  Erratum

  • Erratum October 27, 2026; Thm. 5.2, 5.6: As explained in the related-work section of our 2020 paper on monadic Datalog, two results are incorrect. The proof of the co2NEXPTIME lower bound of Theorem 5.6, for containment of positive queries under access limitations (and hence of the 2NEXPTIME-hardness of long-term relevance for positive queries), is flawed, and the bound is at odds, under standard complexity-theoretic assumptions, with the 2EXPTIME upper bound later proven by Benedikt, Bourhis, and Ley (ACM TODS 2015). The proof of the coNEXPTIME upper bound of Theorem 5.2, for conjunctive query containment under access limitations, only works for schemas with a single access method per relation; the general case is open. The same applies to the conference version.
• E. Kharlamov, W. Nutt, and P. Senellart, Value Joins are Expensive over (Probabilistic) XML. Extended Version. Technical report KRDB11-1, KRDB Research Centre, Free University of Bozen–Bolzano, Bolzano, Italy, February 2011. (pdf | bib)
• P. Senellart, Google est-il un moteur de recherche efficace ? August 2008. Unpublished. (html (French) | bib)
• P. Senellart, Explorer le « Web caché ». April 2008. Unpublished. (html (French) | bib)
• P. Senellart, Comprendre le Web caché. Understanding the Hidden Web. PhD thesis, Université Paris–Sud, Orsay, France, December 2007. (pdf | slides (French) | video (French) | code | bib)
• D. Colazzo, I. Manolescu, F.-X. Dudouet, B. Nguyen, P. Senellart, and A. Vion, Traiter des corpus d’information sur le Web. Vers de nouveaux usages informatiques de l’enquête. September 2007. Presented at Congrès de l’Association française de sciences politiques, Toulouse, France. (pdf | bib)
• S. Abiteboul and P. Senellart, Querying and Updating Probabilistic Information in XML. Technical report 435, Gemo, INRIA Futurs, Orsay, France, December 2005. (pdf | code | bib)
• F.-X. Dudouet, I. Manolescu, B. Nguyen, and P. Senellart, XML Warehousing meets Sociology... Introducing the W3C XQuery Working Group. Technical report 423, Gemo, INRIA Futurs, Orsay, France, April 2005. (doc | pdf | bib)
• P. Senellart, Identifying Websites with Flow Simulation. Technical report 387, Gemo, INRIA Futurs, Orsay, France, April 2005. (pdf | code | bib)
• P. Senellart, Activity Report. SYSTRAN S.A., Paris, France, 2005. (pdf | bib)
• F.-X. Dudouet, I. Manolescu, B. Nguyen, and P. Senellart, Sociological Analysis of the W3C Standardization Process: XML Warehouse meets Sociology. Technical report 369, Gemo, INRIA Futurs, Orsay, France, November 2004. (pdf | bib)
• P. Senellart, Website Identification. Masters thesis, Université Paris–Sud, Orsay, France, September 2003. (pdf | code | project page | bib)
• P. Senellart, Vérification automatique des multiplicateurs. Chalmers Institute of Technology, Gothenburg, Sweden, 2002. Long internship report. (pdf | slides | code | project page | bib)
• P. Senellart, Extraction of information in large graphs. Automatic search for synonyms. Technical report 90, Université catholique de Louvain, Louvain-la-neuve, Belgium, 2001. Masters Internship Report. (pdf | slides | data | bib)

Conference proceedings

• P. Senellart and A. Napoli, Actes de la conférence BDA 2017. HAL, Paris, France, November 2017. (HAL | bib)
• A. Meliou and P. Senellart, Proceedings of the 20th International Workshop on the Web and Databases, WebDB 2017. ACM, Chicago, USA, May 2017. (doi | publisher | bib)
• S. Schockaert and P. Senellart, Proceedings of the 10th International Conference on Scalable Uncertainty Management, SUM 2016. Springer-Verlag, Nice, France, September 2016. (doi | publisher | bib)
• R. Cheng, A. Das Sarma, S. Maniu, and P. Senellart, Proceedings of the First VLDB Workshop on Databases and Crowdsourcing, DBCrowd 2013. CEUR Workshop Proceedings, Riva del Garda, Italy, August 2013. (publisher | bib)
• A. Ailamaki, S. Amer-Yahia, J. M. Patel, T. Risch, P. Senellart, and J. Stoyanovich, Proceedings of the 14th International Conference on Extending Database Technology, EDBT 2011. ACM, Uppsala, Sweden, March 2011. (doi | publisher | bib)
• P. Rigaux and P. Senellart, Proceedings of the VLDB 2009 PhD Workshop. VLDB Endowment, Lyon, France, August 2009. (website | bib)

• Acquiring and Archiving Web Data
• Data Provenance
• Structured Information Extraction from Documents
• Machine Learning for Data Management
• Formal Verification and Proof Assistants
• Tractability and Probabilistic Inference
• Truth Finding and Data Integration
• Crowdsourcing
• Personal Knowledge Bases
• Probabilistic Graphs
• Probabilistic XML
• Graph Algorithms and Link Analysis
• Computer Science for the Social Sciences
• Outreach, Opinion, and Science Policy
• Edited Volumes and Scientific Service
• Early Work and Machine Translation

Acquiring and Archiving Web Data

• A. Gauquier, I. Manolescu, and P. Senellart, Efficient Crawling for Scalable Web Data Acquisition. In Proc. EDBT, pp. 372–385, Tampere, Finland, March 2026. (pdf | slides | extended version | doi | code | bib)
• A. Gauquier, I. Manolescu, and P. Senellart, Efficient Crawling for Scalable Web Data Acquisition (Extended Version). February 2026. arXiv abs/2602.11874. (pdf | arXiv | code | bib)
• B. Spencer, M. Benedikt, and P. Senellart, Form Filling based on Constraint Solving. In Proc. ICWE, pp. 95–113, Cáceres, Spain, June 2018. (pdf | doi | code | data | bib)
• P. Senellart, Archivage du Web. In M. Bouzhegoub and R. Mosseri, editors, Les Big Data à découvert, pp. 200–201. CNRS Éditions, March 2017. (pdf | bib)
• M. Faheem and P. Senellart, Adaptive Web Crawling through Structure-Based Link Classification. In Proc. ICADL, pp. 39–51, Seoul, South Korea, December 2015. (pdf | slides | doi | code | bib)
• A. Amarilli, S. Maniu, and P. Senellart, Intensional Data on the Web. SIGWEB Newsletter, 2015(Summer), pp. 4:1–4:12, August 2015. (pdf | doi | bib)
• M. Oita and P. Senellart, FOREST: Focused Object Retrieval by Exploiting Significant Tag Paths. In Proc. WebDB, pp. 55–61, Melbourne, Australia, May 2015. (pdf | slides | doi | code | data | bib)
• M. L. Ba, S. Montenez, T. Abdessalem, and P. Senellart, Monitoring moving objects using uncertain Web data. In Proc. SIGSPATIAL, pp. 565–568, Dallas, USA, November 2014. Demonstration. (pdf | video | poster | doi | bib)
• T. Risse, E. Demidova, S. Dietze, W. Peters, N. Papailiou, K. Doka, Y. Stavrakas, V. Plachouras, P. Senellart, F. Carpentier, A. Mantrach, B. Cautis, P. Siehndel, and D. Spiliotopoulos, The ARCOMEM Architecture for Social and Semantic Driven Web Archiving. Future Internet, 6(4), pp. 688–716, November 2014. (pdf | doi | code | bib)
• M. L. Ba, S. Montenez, T. Abdessalem, and P. Senellart, Collecte, intégration et visualisation de données Web incertaines sur des objets mobiles. In Proc. BDA, Autrans, France, October 2014. Demonstration. Conference without formal proceedings. (pdf | video | poster | bib)
• G. Gouriten, S. Maniu, and P. Senellart, Scalable, Generic, and Adaptive Systems for Focused Crawling. In Proc. Hypertext, pp. 35–45, Santiago, Chile, September 2014. Douglas Engelbart Best Paper Award. (pdf | slides | doi | bib)
• V. Plachouras, F. Carpentier, M. Faheem, J. Masanès, T. Risse, P. Senellart, P. Siehndel, and Y. Stavrakas, ARCOMEM Crawling Architecture. Future Internet, 6(3), pp. 518–541, August 2014. (pdf | doi | code | bib)
• M. Faheem and P. Senellart, Crawl intelligent et adaptatif d’applications Web pour l’archivage du Web. Ingénierie des Systèmes d'Information, 19(4), pp. 61–86, 2014. (pdf (French) | doi | code | data | bib)
• T. Risse, W. Peters, P. Senellart, and D. Maynard, Documenting Contemporary Society by Preserving Relevant Information from Twitter. In K. Weller, A. Bruns, J. Burgess, M. Mahrt, and C. Puschmann, editors, Twitter and Society, pp. 207–219. Peter Lang International Academic Publishers, November 2013. (pdf | bib)
• M. Faheem and P. Senellart, Collecte intelligente et adaptative d'applications Web pour l'archivage du Web. In Proc. BDA, Nantes, France, October 2013. Conference without formal proceedings. (pdf | slides | code | data | bib)
• G. Gouriten, S. Maniu, and P. Senellart, Exploration adaptative de graphes sous contrainte de budget. In Proc. BDA, Nantes, France, October 2013. Conference without formal proceedings. (pdf | slides | bib)
• M. Faheem and P. Senellart, Une démonstration d’un crawler intelligent pour les applications Web. In Proc. BDA, Nantes, France, October 2013. Demonstration. Conference without formal proceedings. (pdf | video | poster | code | bib)
• M. Faheem and P. Senellart, Demonstrating Intelligent Crawling and Archiving of Web Applications. In Proc. CIKM, pp. 2481–2484, San Francisco, USA, October 2013. Demonstration. (pdf | video | poster | doi | code | bib)
• V. Plachouras, F. Carpentier, J. Masanès, T. Risse, P. Senellart, P. Siehndel, and Y. Stavrakas, An Architecture for Selective Web Harvesting: The Use Case of Heritrix. In Proc. ARCOMEM, Lisbon, Portugal, September 2013. Workshop without formal proceedings. (pdf | code | bib)
• M. Faheem and P. Senellart, Intelligent and Adaptive Crawling of Web Applications for Web Archiving. In Proc. ICWE, pp. 306–322, Aalborg, Denmark, July 2013. (pdf | slides | doi | code | data | bib)
• T. Risse, W. Peters, and P. Senellart, Social and Semantic Driven Web Harvesting. In Proc. Building Web Observatories, Paris, France, May 2013. (pdf | code | bib)
• R. Nayak, P. Senellart, F. M. Suchanek, and A. Varde, Discovering Interesting Information with Advances in Web Technology. SIGKDD Explorations, 14(2), pp. 63–81, December 2012. (pdf | doi | bib)
• T. Risse, S. Dietze, W. Peters, K. Doka, Y. Stavrakas, and P. Senellart, Exploiting the Social and Semantic Web for guided Web Archiving. In Proc. TPDL, pp. 426–432, Paphos, Cyprus, September 2012. Poster. (pdf | poster | doi | code | bib)
• M. Oita, A. Amarilli, and P. Senellart, Cross-Fertilizing Deep Web Analysis and Ontology Enrichment. In Proc. VLDS, pp. 5–8, Istanbul, Turkey, August 2012. Vision article. (pdf | slides | bib)
• M. Bienvenu, D. Deutch, D. Martinenghi, P. Senellart, and F. M. Suchanek, Dealing with the Deep Web and all its Quirks. In Proc. VLDS, pp. 21–24, Istanbul, Turkey, August 2012. Vision article. (pdf | slides | bib)
• G. Gouriten and P. Senellart, API Blender: A Uniform Interface to Social Platform APIs. In Proc. WWW, Lyon, France, April 2012. Developer track. (pdf | slides | arXiv | code | bib)
• M. Benedikt, T. Furche, A. Savvides, and P. Senellart, ProFoUnd: Program-analysis–based Form Understanding. In Proc. WWW, pp. 313–316, Lyon, France, April 2012. Demonstration. (pdf | slides | poster | doi | bib)
• M. Oita and P. Senellart, Deriving Dynamics of Web Pages: A Survey. In Proc. TWAW, pp. 25–32, Hyderabad, India, March 2011. (pdf | slides | bib)
• F. M. Suchanek, A. Varde, R. Nayak, and P. Senellart, The Hidden Web, XML and the Semantic Web: Scientific Data Management Perspectives. In Proc. EDBT, pp. 534–537, Uppsala, Sweden, March 2011. Tutorial. (pdf | slides, pdf | slides, ppt | arXiv | doi | bib)
• M. Oita and P. Senellart, Archivage du contenu éphémère du Web à l’aide des flux Web. In Proc. BDA, Toulouse, France, October 2010. Demonstration. Conference without formal proceedings. (pdf | poster | bib)
• M. Oita and P. Senellart, Archiving Data Objects Using Web Feeds. In Proc. IWAW, pp. 31–41, Vienna, Austria, September 2010. (pdf | slides | bib)
• T. Abdessalem and P. Senellart, Gestion de données dans les réseaux sociaux. Telecom, 156, pp. 56–58, January 2010. (pdf (French) | bib)
• M. Spaniol, D. Denev, A. Mazeika, P. Senellart, and G. Weikum, Data Quality in Web Archiving. In Proc. WICOW, pp. 19–26, Madrid, Spain, April 2009. (pdf | doi | bib)
• A. Varde, F. M. Suchanek, R. Nayak, and P. Senellart, Knowledge Discovery over the Deep Web, Semantic Web and XML. In Proc. DASFAA, pp. 784–788, Brisbane, Australia, April 2009. Tutorial. (pdf | slides | doi | bib)
• P. Senellart, A. Mittal, D. Muschick, R. Gilleron, and M. Tommasi, Automatic Wrapper Induction from Hidden-Web Sources with Domain Knowledge. In Proc. WIDM, pp. 9–16, Napa, USA, October 2008. (pdf | slides | doi | code | data | bib)
• P. Senellart, S. Abiteboul, and R. Gilleron, Understanding the Hidden Web. ERCIM News, 72, pp. 32–33, January 2008. (pdf | publisher | bib)
• P. Senellart, Comprendre le Web caché. Understanding the Hidden Web. PhD thesis, Université Paris–Sud, Orsay, France, December 2007. (pdf | slides (French) | video (French) | code | bib)

Data Provenance

• A. Saadeh and P. Senellart, Preserving LLM Output Distributions for Probabilistic Query Evaluation. In Proc. CIKM, Rome, Italy, November 2026. Demonstration. (pdf | doi | code | video | bib)
• A. Sen, P. Karmakar, S. Maniu, A. Saadeh, and P. Senellart, Provenance of HAVING Queries in Semirings with Monus. September 2026. arXiv abs/2609.31246. (pdf | arXiv | code | data | formal proofs | project page | bib)
• A. Sen, S. Maniu, and P. Senellart, ProvSQL: A General System for Keeping Track of the Provenance and Probability of Data. In Proc. ICDE, pp. 1252–1265, Montréal, Canada, May 2026. (pdf | slides | poster | arXiv | doi | code | data | data | formal proofs | project page | bib)
• A. A. Widiaatmaja, B. Djeffal, A. Dandekar, and P. Senellart, Demonstration of ProvSQL Update Provenance through Temporal Databases. In Proc. PW, pp. 71–76, Berlin, Germany, June 2025. Demonstration. (pdf | poster | doi | code | data | bib)
• S. Maniu and P. Senellart, Database Theory in Action: Making Provenance and Probabilistic Database Theory Work in Practice (Invited Talk). In Proc. ICDT, pp. 33:1–33:6, Barcelona, Spain, March 2025. (pdf | slides | doi | code | bib)
• F. Yunus, P. Karmakar, P. Senellart, T. Abdessalem, and S. Bressan, Using a Probabilistic Database in an Image Retrieval Application. In Proc. EDBT, pp. 1106–1109, Barcelona, Spain, March 2025. Demonstration. (pdf | doi | code | data | video | bib)
• P. Senellart, On the Impact of Provenance Semiring Theory on the Design of a Provenance-Aware Database System. In A. Amarilli and A. Deutsch, editors, The Provenance of Elegance in Computation — Essays dedicated to Val Tannen, pp. 9:1–9:10. Schloss Dagstuhl — Leibniz-Zentrum für Informatik, March 2024. (pdf | slides | doi | bib)
• Y. Ramusat, S. Maniu, and P. Senellart, Efficient Provenance-Aware Querying of Graph Databases with Datalog. In Proc. BDA, Clermont-Ferrand, France, October 2022. (pdf | slides | code | bib)
• Y. Ramusat, S. Maniu, and P. Senellart, Efficient Provenance-Aware Querying of Graph Databases with Datalog. In Proc. GRADES-NDA, pp. 4:1–4:9, Philadelphia, USA, June 2022. (pdf | slides | doi | code | bib)
• Y. Ramusat, S. Maniu, and P. Senellart, A Practical Dynamic Programming Approach to Datalog Provenance Computation. December 2021. arXiv abs/2112.01132. (pdf | arXiv | code | bib)
• Y. Ramusat, S. Maniu, and P. Senellart, Provenance-Based Algorithms for Rich Queries over Graph Databases. In Proc. EDBT, pp. 73–84, Nicosia, Cyprus, March 2021. (pdf | slides | doi | code | bib)
• Y. Ramusat, S. Maniu, and P. Senellart, Algorithmes à base de provenance pour des requêtes enrichies sur les bases de données graphes. In Proc. BDA, online, France, October 2020. (pdf | slides | code | bib)
• P. Senellart, Provenance in Databases: Principles and Applications. In Proc. RW, pp. 104–109, Bolzano, Italy, September 2019. (pdf | slides | doi | bib)
• P. Senellart, L. Jachiet, S. Maniu, and Y. Ramusat, ProvSQL : Gestion de provenance et de probabilités dans PostgreSQL. In Proc. BDA, Bucharest, Romania, November 2018. Demonstration. Conference without formal proceedings. (pdf | code | project page | bib)
• P. Senellart, L. Jachiet, S. Maniu, and Y. Ramusat, ProvSQL: Provenance and Probability Management in PostgreSQL. In Proc. VLDB, pp. 2034–2037, Rio de Janeiro, Brazil, August 2018. Demonstration. (pdf | poster | doi | code | project page | video | bib)
• Y. Ramusat, S. Maniu, and P. Senellart, Semiring Provenance over Graph Databases. In Proc. TaPP, London, United Kingdom, July 2018. (pdf | slides | code | bib)
• P. Senellart, Provenance and Probabilities in Relational Databases. SIGMOD Record, 46(4), pp. 5–15, December 2017. (pdf | doi | code | bib)

Structured Information Extraction from Documents

• A. Gauquier, I. Manolescu, and P. Senellart, Structured Prediction for Scalable Spreadsheet Table Understanding: From Cell Types to Table Ranges. In Proc. CIKM, Rome, Italy, November 2026. (pdf | extended version | doi | code | data | bib)
• A. Gauquier, I. Manolescu, and P. Senellart, Structured Prediction for Scalable Spreadsheet Table Understanding: From Cell Types to Table Ranges (Extended Version). August 2026. arXiv abs/2608.16050. (pdf | arXiv | code | data | bib)
• M. Sorić, C. Gracianne, I. Manolescu, and P. Senellart, Benchmarking Table Extraction from Heterogeneous Scientific PDF Documents. In Proc. KDD, Jeju Island, South Korea, August 2026. (pdf | poster | extended version | doi | code | data | data | project page | video | bib)
• M. Sorić, C. Gracianne, I. Manolescu, and P. Senellart, Benchmarking Table Extraction from Heterogeneous Scientific PDF Documents (Extended Version). July 2026. arXiv abs/2511.16134. (pdf | arXiv | data | bib)
• A. Gauquier, S. Ebel, H. Galhardas, T. Galizzi, I. Manolescu, A. Peden, and P. Senellart, Efficient and Scalable Search for Statistics. In Proc. ICDE, pp. 1113–1126, Montréal, Canada, May 2026. (pdf | slides | poster | doi | data | bib)
• A. Gauquier, S. Ebel, H. Galhardas, T. Galizzi, I. Manolescu, A. Peden, and P. Senellart, STAR: Efficient, Scalable, and Modular Retrieval of Statistical Tables. Transactions on Large-Scale Data and Knowledge-Centered Systems, 61, 2026. (pdf | code | data | bib)
• S. Mishra, N. Sharma, A. Gauquier, and P. Senellart, TheoremView: A Framework for Extracting Theorem-Like Environments from Raw PDFs. In Proc. ECIR (5), pp. 24–29, Lucca, Italy, April 2025. Demonstration. (pdf | doi | code | video | bib)
• S. Mishra, A. Gauquier, and P. Senellart, Apprentissage multimodal modulaire pour l’extraction de théorèmes et de preuves dans des documents scientifiques longs. In Proc. EGC, pp. 497–498, Strasbourg, France, January 2025. Poster. (pdf | poster | code | bib)
• S. Mishra, A. Gauquier, and P. Senellart, Modular Multimodal Machine Learning for Extraction of Theorems and Proofs in Long Scientific Documents. In Proc. JCDL, pp. 14:1–14:5, Hong Kong, China, December 2024. Late-breaking paper. (pdf | slides | extended version | doi | code | bib)
• S. Mishra, A. Gauquier, and P. Senellart, Modular Multimodal Machine Learning for Extraction of Theorems and Proofs in Long Scientific Documents (Extended Version). October 2024. arXiv abs/2307.09047. (pdf | arXiv | code | bib)
• S. Mishra, Y. Brihmouche, T. Delemazure, A. Gauquier, and P. Senellart, First Steps in Building a Knowledge Base of Mathematical Results. In Proc. SDP, pp. 165–174, Bangkok, Thailand, August 2024. (pdf | poster | doi | code | code | bib)
• S. Jiang and P. Senellart, Extracting Definienda in Mathematical Scholarly Articles with Transformers. In Proc. WIESP, online, Indonesia, November 2023. (pdf | slides | arXiv | doi | code | data | bib)
• A. Gauquier and P. Senellart, Automatically Inferring the Document Class of a Scientific Article. In Proc. DocEng, pp. 11:1–11:10, Limerick, Ireland, August 2023. (pdf | slides | doi | code | bib)
• S. Mishra, L. Pluvinage, and P. Senellart, Towards Extraction of Theorems and Proofs in Scholarly Articles. In Proc. DocEng, pp. 25:1–25:4, Limerick, Ireland, August 2021. (pdf | video | doi | code | bib)

Machine Learning for Data Management

• M. Parrino, A. Ajenjo, E. Remy, P. Stephan, P. Senellart, and P. Boniol, In a Streaming World, Should You Stand Still? A Comprehensive Benchmark of Anomaly Detection in Streams. In Proc. KDD, Jeju Island, South Korea, August 2026. (pdf | doi | code | code | bib)
• P. Karmakar, A. Saadeh, P. Senellart, and S. Bressan, Discovering Voting Power for Ensemble Methods. In Proc. DEXA (1), pp. 347–362, Bangkok, Thailand, August 2025. (pdf | slides | doi | code | bib)
• E. Sylligardos, J. Paparrizos, T. Palpanas, P. Senellart, and P. Boniol, MSAD: A Deep Dive into Model Selection for Time Series Anomaly Detection. VLDB Journal, 34(6), pp. 72, 2025. (pdf | arXiv | doi | code | bib)
• A. Dandekar, D. Basu, P. Senellart, and S. Bressan, Confidentialité différentielle à risque : Relier les sources d'aléa et un budget de confidentialité. In Proc. BDA, online, France, October 2020. (pdf | slides | bib)
• D. Basu, P. Senellart, and S. Bressan, BelMan: An Information-Geometric Approach to Stochastic Bandits. In Proc. ECML/PKDD, pp. 167–183, Würzburg, Germany, September 2019. (pdf | arXiv | doi | code | bib)
• M. Han, P.-H. Wuillemin, and P. Senellart, Focused Crawling through Reinforcement Learning. In Proc. ICWE, pp. 261–278, Cáceres, Spain, June 2018. (pdf | doi | code | bib)
• M. Han, P. Senellart, S. Bressan, and H. Wu, Routing an Autonomous Taxi with Reinforcement Learning. In Proc. CIKM, pp. 2421–2424, Indianapolis, USA, October 2016. Industry track, short paper. (pdf | doi | code | bib)
• D. Basu, Q. Lin, W. Chen, H. T. Vo, Z. Yuan, P. Senellart, and S. Bressan, Regularized Cost-Model Oblivious Database Tuning with Reinforcement Learning. Transactions on Large-Scale Data and Knowledge-Centered Systems, 28, pp. 96–132, 2016. (pdf | doi | code | bib)
• D. Basu, Q. Lin, Z. Yuan, P. Senellart, and S. Bressan, Apprentissage par renforcement pour optimiser les bases de donnéees indépendamment du modèle de coût. In Proc. BDA, Porquerolles, France, September 2015. Conference without formal proceedings. (pdf | slides | code | bib)
• D. Basu, Q. Lin, W. Chen, H. T. Vo, Z. Yuan, P. Senellart, and S. Bressan, Cost-Model Oblivious Database Tuning with Reinforcement Learning. In Proc. DEXA, pp. 253–268, Valencia, Spain, September 2015. (pdf | slides | doi | code | bib)

Formal Verification and Proof Assistants

• P. Senellart and A. Gnatenko, Descriptive Complexity in Lean: Completeness by First-Order Reductions. September 2026. arXiv abs/2609.18261. (pdf | arXiv | formal proofs | bib)

Tractability and Probabilistic Inference

• P. Karmakar, A. Gauquier, and P. Senellart, Expected Shapley Value is Shapley Value for Expected Utility Game. In Proc. ECSQARU, pp. 223–237, Hagen, Germany, September 2025. (pdf | slides | doi | bib)
• P. Karmakar, M. Monet, P. Senellart, and S. Bressan, Expected Shapley-Like Scores of Boolean Functions: Complexity and Applications to Probabilistic Databases. Proceedings of the ACM on Management of Data, 2(2), pp. 92, June 2024. Presented at the PODS 2024 conference in Santiago, Chile. (pdf | slides | poster | arXiv | doi | code | code | bib)
• A. Amarilli, P. Bourhis, and P. Senellart, Tractable Lineages on Treelike Instances: Limits and Extensions. April 2023. arXiv abs/1604.02761. (pdf | arXiv | bib)
  Update

  • Update October 27, 2026; Sect. 5.2, Thm. 5.5: The introduction and Section 5.2 present the hypothesis of Theorem 5.5 as the non-uniform exponential-time hypothesis. The hypothesis actually used in the statement, and all the proof needs, is weaker: that the polynomial hierarchy is not contained in DTIME(2^o(n))/SubEXP. The distinction now matters: a preprint released by OpenAI on October 25, 2026 claims a deterministic 2^o(n)-time algorithm for 3-SAT, which would refute ETH and its non-uniform version but leaves this weaker hypothesis open. The other intractability results of the paper (Theorems 4.2, 5.2, and 5.7) are unconditional. The same applies to the conference version.
• A. Amarilli, F. Capelli, M. Monet, and P. Senellart, Connecting Knowledge Compilation Classes and Width Parameters. Theory of Computing Systems, 64(5), pp. 861–914, 2020. (pdf | arXiv | doi | bib)
• M. Benedikt, P. Bourhis, G. Gottlob, and P. Senellart, Monadic Datalog, Tree Validity, and Limited Access Containment. ACM Transactions on Computational Logic, 21(1), pp. 6:1–6:45, 2020. (pdf | doi | bib)
• S. Maniu, P. Senellart, and S. Jog, An Experimental Study of the Treewidth of Real-World Graph Data. In Proc. ICDT, pp. 12:1–12:18, Lisbon, Portugal, March 2019. (pdf | extended version | doi | code | data | bib)
• S. Maniu, P. Senellart, and S. Jog, An Experimental Study of the Treewidth of Real-World Graph Data (Extended Version). January 2019. arXiv abs/1901.06862. (pdf | arXiv | code | data | bib)
• A. Amarilli, P. Bourhis, M. Monet, and P. Senellart, Evaluating Datalog via Tree Automata and Cycluits. Theory of Computing Systems, 63(7), pp. 1620–1678, 2019. (pdf | arXiv | doi | bib)
• A. Amarilli, M. Monet, and P. Senellart, Liens entre largeur et structure en compilation de connaissances. In Proc. BDA, Bucharest, Romania, November 2018. Conference without formal proceedings. (pdf | bib)
• S. Maniu, P. Senellart, and S. Jog, Une étude expérimentale de la largeur d'arbre de données graphe du monde réel. In Proc. BDA, Bucharest, Romania, November 2018. Conference without formal proceedings. (pdf | slides (French) | code | data | bib)
• A. Amarilli, M. Monet, and P. Senellart, Connecting Width and Structure in Knowledge Compilation (Extended Version). May 2018. arXiv abs/1709.06188v3. (pdf | arXiv | bib)
• A. Amarilli, M. Monet, and P. Senellart, Connecting Width and Structure in Knowledge Compilation. In Proc. ICDT, pp. 6:1–6:17, Vienna, Austria, March 2018. (pdf | extended version | doi | bib)
• A. Amarilli, P. Bourhis, M. Monet, and P. Senellart, Combined Tractability of Query Evaluation via Tree Automata and Cycluits. In Proc. ICDT, pp. 6:1–6:19, Venice, Italy, March 2017. (pdf | slides | poster | extended version | doi | bib)
• A. Amarilli, P. Bourhis, M. Monet, and P. Senellart, Combined Tractability of Query Evaluation via Tree Automata and Cycluits (Extended Version). January 2017. arXiv abs/1612.04203. (pdf | arXiv | bib)
• A. Amarilli, P. Bourhis, and P. Senellart, Lignages efficaces sur les instances quasi-arborescentes: Limites et extensions. In Proc. BDA, Poitiers, France, November 2016. (pdf | bib)
• A. Amarilli, P. Bourhis, and P. Senellart, Tractable Lineages on Treelike Instances: Limits and Extensions. In Proc. PODS, pp. 355–370, San Francisco, USA, June 2016. (pdf | extended version | doi | bib)
  Erratum Update

  • Erratum October 27, 2026; Thm. 5.5: The proof of Theorem 5.5, given in Antoine Amarilli's PhD thesis (Theorem 6.2.5) rather than in the paper, is incorrect: the advice string it defines depends on the instance and not only on its size. A corrected proof is given in the appendix of version 2 of the extended version on arXiv (April 2023), which is the one hosted here. See also Antoine Amarilli's errata.
  • Update October 27, 2026; Sect. 5.2, Thm. 5.5: The introduction and Section 5.2 present the hypothesis of Theorem 5.5 as the non-uniform exponential-time hypothesis. The hypothesis actually used in the statement, and all the proof needs, is weaker: that the polynomial hierarchy is not contained in DTIME(2^o(n))/SubEXP. The distinction now matters: a preprint released by OpenAI on October 25, 2026 claims a deterministic 2^o(n)-time algorithm for 3-SAT, which would refute ETH and its non-uniform version but leaves this weaker hypothesis open. The other intractability results of the paper (Theorems 4.2, 5.2, and 5.7) are unconditional. The same applies to the extended version.
• A. Amarilli, P. Bourhis, and P. Senellart, Provenance Circuits for Trees and Treelike Instances (Extended Version). November 2015. arXiv abs/1511.08723. (pdf | arXiv | bib)
• A. Amarilli, P. Bourhis, and P. Senellart, Circuits de provenance pour les arbres et les instances quasi-arborescentes. In Proc. BDA, Porquerolles, France, September 2015. Conference without formal proceedings. (pdf | slides | bib)
• A. Amarilli, P. Bourhis, and P. Senellart, Provenance Circuits for Trees and Treelike Instances. In Proc. ICALP, pp. 56–68, Kyoto, Japan, July 2015. (pdf | slides | extended version | doi | bib)
• M. Benedikt, P. Bourhis, and P. Senellart, Monadic Datalog Containment. In Proc. ICALP, pp. 79–91, Warwick, United Kingdom, July 2012. (pdf | slides | doi | bib)

Truth Finding and Data Integration

• A. Saadeh, P. Senellart, and S. Bressan, Confidential Truth Finding with Multi-Party Computation. In Proc. DEXA, pp. 332–337, Penang, Malaysia, August 2023. (pdf | slides | extended version | doi | code | bib)
• A. Saadeh, P. Senellart, and S. Bressan, Confidential Truth Finding with Multi-Party Computation (Extended Version). May 2023. arXiv abs/2305.14727. (pdf | slides | arXiv | code | bib)
• A. Amarilli, M. L. Ba, D. Deutch, and P. Senellart, Computing Possible and Certain Answers over Order-Incomplete Data. Theoretical Computer Science, 797, pp. 42–76, 2019. (pdf | arXiv | doi | bib)
• A. Amarilli, M. L. Ba, D. Deutch, and P. Senellart, Possible and Certain Answers for Queries over Order-Incomplete Data. January 2018. arXiv abs/1707.07222v2. (pdf | arXiv | bib)
• A. Amarilli, M. L. Ba, D. Deutch, and P. Senellart, Possible and Certain Answers for Queries over Order-Incomplete Data. In Proc. TIME, pp. 4:1–4:19, Mons, Belgium, October 2017. (pdf | extended version | doi | bib)
  Erratum

  • Erratum October 27, 2026; Thm. 19, 22, 30: Theorems 19, 22, and 30 (tractability of possibility for PosRA queries on unordered or bounded-ia-width po-databases, and of possibility and certainty for accumulation queries on bounded ia-width) are not established, and Theorems 19 and 22 are false unless P = NP: the proof of Proposition 66 of the first arXiv version fails for the product operators, and Theorem 92 of version 2 of the extended version (January 2018, hosted here) exhibits a PosRA query for which possibility is NP-complete on unordered po-relations. That version removes the affected results and discusses the error in its Appendix G; the journal version contains neither. See also Antoine Amarilli's errata.
• O. Savkovic, E. Kharlamov, W. Nutt, and P. Senellart, Towards Approximating Incomplete Queries over Partially Complete Databases. In Proc. AMW, Montevideo, Uruguay, June 2017. (pdf | bib)
• A. Amarilli, M. L. Ba, D. Deutch, and P. Senellart, Requêtes sur des données à ordre incomplet. In Proc. BDA, Porquerolles, France, September 2015. Conference without formal proceedings. (pdf | slides | bib)
• M. L. Ba, R. Horincar, P. Senellart, and H. Wu, Truth Finding with Attribute Partitioning. In Proc. WebDB, pp. 27–33, Melbourne, Australia, May 2015. (pdf | slides | doi | data | bib)
• F. M. Suchanek, S. Abiteboul, and P. Senellart, PARIS: Probabilistic Alignment of Relations, Instances, and Schema. Proceedings of the VLDB Endowment, 5(3), pp. 157–168, December 2011. Presented at the VLDB 2012 conference, Istanbul, Turkey. (pdf | slides | arXiv | doi | code | bib)
• F. M. Suchanek, S. Abiteboul, and P. Senellart, Ontology Alignment at the Instance and Schema Level. In Proc. BDA, Rabat, Morocco, October 2011. Conference without formal proceedings. Also registered as Technical Report RT-0408 (2011), INRIA. (pdf | arXiv | code | bib)
• M. Benedikt, G. Gottlob, and P. Senellart, Determining Relevance of Accesses at Runtime. In Proc. PODS, pp. 211–222, Athens, Greece, June 2011. (pdf | slides | extended version | doi | bib)
  Erratum

  • Erratum October 27, 2026; Thm. 5.2, 5.6: As explained in the related-work section of our 2020 paper on monadic Datalog, two results are incorrect. The proof of the co2NEXPTIME lower bound of Theorem 5.6, for containment of positive queries under access limitations (and hence of the 2NEXPTIME-hardness of long-term relevance for positive queries), is flawed, and the bound is at odds, under standard complexity-theoretic assumptions, with the 2EXPTIME upper bound later proven by Benedikt, Bourhis, and Ley (ACM TODS 2015). The proof of the coNEXPTIME upper bound of Theorem 5.2, for conjunctive query containment under access limitations, only works for schemas with a single access method per relation; the general case is open. The same applies to the extended version.
• M. Benedikt, G. Gottlob, and P. Senellart, Determining Relevance of Accesses at Runtime (Extended Version). April 2011. arXiv abs/1104.0553. (pdf | arXiv | bib)
  Erratum

  • Erratum October 27, 2026; Thm. 5.2, 5.6: As explained in the related-work section of our 2020 paper on monadic Datalog, two results are incorrect. The proof of the co2NEXPTIME lower bound of Theorem 5.6, for containment of positive queries under access limitations (and hence of the 2NEXPTIME-hardness of long-term relevance for positive queries), is flawed, and the bound is at odds, under standard complexity-theoretic assumptions, with the 2EXPTIME upper bound later proven by Benedikt, Bourhis, and Ley (ACM TODS 2015). The proof of the coNEXPTIME upper bound of Theorem 5.2, for conjunctive query containment under access limitations, only works for schemas with a single access method per relation; the general case is open. The same applies to the conference version.
• A. Galland, S. Abiteboul, A. Marian, and P. Senellart, Corroborating Information from Disagreeing Views. In Proc. WSDM, pp. 131–140, New York, USA, February 2010. (pdf | slides | doi | code | bib)
• G. Gottlob and P. Senellart, Schema Mapping Discovery from Data Instances. Journal of the ACM, 57(2), pp. 6:1–6:37, January 2010. (pdf | doi | bib)
  Erratum

  • Erratum October 27, 2026; Prop. 5.8, 5.9(5); Tables II, IV: The proof of Proposition 5.8 is flawed (see footnote 1 of ten Cate, Kolaitis, Qian, and Tan, AMW 2015), and the DP-hardness of Optimality claimed in Propositions 5.8 and 5.9(5) and in Tables II and IV is not established. What holds, as stated in the conference version, is that Optimality is NP-hard and coNP-hard, and that Existence-Cost is NP-hard.
• A. Galland, S. Abiteboul, A. Marian, and P. Senellart, Corroboration de vues discordantes fondées sur la confiance. In Proc. BDA, Namur, Belgium, October 2009. Conference without formal proceedings. (pdf | slides | code | bib)
• P. Senellart and G. Gottlob, On the Complexity of Deriving Schema Mappings from Database Instances. In Proc. PODS, pp. 23–32, Vancouver, Canada, June 2008. (pdf | slides | doi | bib)

Crowdsourcing

• S. Amer-Yahia, S. Roy, L. Chen, A. Morishima, J. Monedero, P. Bourhis, F. Charoy, M. Danilevsky, G. Das, G. Demartini, S. Elbassuoni, D. Gross-Amblard, E. Hoareau, M. Inoguchi, J. Kenworthy, I. Kitahara, D. Lee, Y. Li, R. Borromeo, P. Papotti, R. Rao, S. Roy, P. Senellart, K. Tajima, S. Thirumuruganathan, M. Tommasi, K. Umemoto, A. Wiggins, and K. Yoshida, Making AI Machines Work for Humans in FoW. SIGMOD Record, 49(2), pp. 30–35, December 2020. (pdf | doi | bib)
• A. Amarilli, Y. Amsterdamer, T. Milo, and P. Senellart, Top-k Querying of Unknown Values under Order Constraints. In Proc. ICDT, pp. 5:1–5:18, Venice, Italy, March 2017. (pdf | slides | poster | extended version | doi | bib)
• A. Amarilli, Y. Amsterdamer, T. Milo, and P. Senellart, Top-k Querying of Unknown Values under Order Constraints (Extended Version). January 2017. arXiv abs/1701.02634. (pdf | arXiv | bib)
• R. Cheng, S. Maniu, and P. Senellart, Guest Editorial: Special Issue on Databases and Crowdsourcing. Distributed and Parallel Databases, 33(1), pp. 1–2, March 2015. (pdf | doi | bib)
• Y. Amsterdamer, Y. Grossman, T. Milo, and P. Senellart, Crowd Miner: Mining association rules from the crowd. In Proc. VLDB, pp. 1250–1253, Riva del Garda, Italy, August 2013. Demonstration. (pdf | poster | doi | bib)
• Y. Amsterdamer, Y. Grossman, T. Milo, and P. Senellart, Crowd Mining. In Proc. SIGMOD, pp. 241–252, New York, USA, June 2013. (pdf | slides, pdf | slides, pptx | poster | doi | bib)
• J. Lu, P. Senellart, C. Lin, X. Du, S. Wang, and X. Chen, Optimal Top-k Generation of Attribute Combinations based on Ranked Lists. In Proc. SIGMOD, pp. 409–420, Scottsdale, USA, May 2012. (pdf | slides | poster | doi | bib)

Personal Knowledge Bases

• D. Montoya, T. Pellissier Tanon, S. Abiteboul, P. Senellart, and F. M. Suchanek, A Knowledge Base for Personal Information Management. In Proc. LDOW, Lyon, France, April 2018. (pdf | code | code | code | project page | bib)
• D. Montoya, T. Pellissier Tanon, S. Abiteboul, P. Senellart, and F. M. Suchanek, Thymeflow, An Open-Source Personal Knowledge Base System. December 2016. (pdf | code | code | code | project page | bib)
• D. Montoya, S. Abiteboul, and P. Senellart, Hup-Me: Inferring and Reconciling a Timeline of User Activity from Rich Smartphone Data. In Proc. SIGSPATIAL, pp. 62:1–62:4, Bellevue, USA, November 2015. Short paper. This prototype evolved into the Thymeflow system. (pdf | slides | poster | doi | code | project page | bib)

Probabilistic Graphs

• A. Amarilli, M. Monet, and P. Senellart, Conjunctive Queries on Probabilistic Graphs: Combined Complexity. In Proc. PODS, pp. 217–232, Chicago, USA, May 2017. (pdf | slides | poster | arXiv | doi | bib)
• S. Maniu, R. Cheng, and P. Senellart, An Indexing Framework for Queries on Probabilistic Graphs. ACM Transactions on Database Systems, 42(2), pp. 13:1–13:34, May 2017. (pdf | doi | bib)
• S. Lei, S. Maniu, L. Mo, R. Cheng, and P. Senellart, Online Influence Maximization. In Proc. KDD, pp. 645–654, Sydney, Australia, August 2015. (pdf | slides | poster | extended version | doi | code | bib)
• S. Lei, S. Maniu, L. Mo, R. Cheng, and P. Senellart, Online Influence Maximization (Extended Version). June 2015. arXiv abs/1506.01188. (pdf | arXiv | code | bib)
• S. Maniu, R. Cheng, and P. Senellart, ProbTree: A Query-Efficient Representation of Probabilistic Graphs. In Proc. BUDA, Snowbird, USA, June 2014. Workshop without formal proceedings. (pdf | slides | poster | bib)

Probabilistic XML

• R. Tang, A. Amarilli, P. Senellart, and S. Bressan, A Framework for Sampling-Based XML Data Pricing. Transactions on Large-Scale Data and Knowledge-Centered Systems, 24, pp. 116–138, 2016. (pdf | doi | bib)
• S. Abiteboul, Y. Amsterdamer, D. Deutch, T. Milo, and P. Senellart, Optimal Probabilistic Generation of XML Documents. Theory of Computing Systems, 57(4), pp. 806–842, November 2015. (pdf | doi | bib)
• R. Tang, D. Shao, M. L. Ba, P. Senellart, and S. Bressan, A Framework for Conditioning Probabilistic XML Data. November 2014. (pdf | bib)
• R. Tang, A. Amarilli, P. Senellart, and S. Bressan, Get a Sample for a Discount: Sampling-Based XML Data Pricing. In Proc. DEXA, pp. 20–34, Munich, Germany, September 2014. (pdf | slides | doi | bib)
• M. L. Ba, T. Abdessalem, and P. Senellart, Gestion de versions incertaines de documents XML. Ingénierie des Systèmes d'Information, 19(4), pp. 9–34, 2014. (pdf (French) | doi | bib)
• P. Senellart, Probabilistic Models for Uncertain Data. In Proc. SoICT, pp. 10, Da Nang, Vietnam, December 2013. (pdf | slides | doi | bib)
• M. L. Ba, T. Abdessalem, and P. Senellart, Contrôle de version incertain dans l'édition collaborative ouverte de documents arborescents. In Proc. BDA, Nantes, France, October 2013. Conference without formal proceedings. (pdf | slides | bib)
• M. L. Ba, T. Abdessalem, and P. Senellart, Merging Uncertain Multi-Version XML Documents. In Proc. DChanges, Florence, Italy, September 2013. (pdf | slides | bib)
• M. L. Ba, T. Abdessalem, and P. Senellart, Uncertain Version Control in Open Collaborative Editing of Tree-Structured Documents. In Proc. DocEng, pp. 27–36, Florence, Italy, September 2013. (pdf | slides | doi | bib)
• A. Amarilli and P. Senellart, On the Connections between Relational and XML Probabilistic Data Models. In Proc. BNCOD, pp. 121–134, Oxford, United Kingdom, July 2013. (pdf | slides | doi | bib)
• B. Kimelfeld and P. Senellart, Probabilistic XML: Models and Complexity. In Z. Ma and L. Yan, editors, Advances in Probabilistic Databases for Uncertain Information Management, pp. 39–66. Springer-Verlag, May 2013. (pdf | doi | bib)
• A. Souihli and P. Senellart, Optimizing Approximations of DNF Query Lineage in Probabilistic XML. In Proc. ICDE, pp. 721–732, Brisbane, Australia, April 2013. (pdf | doi | code | bib)
• A. Souihli and P. Senellart, Optimisation des approximations de probabilité des requêtes en XML probabiliste. In Proc. BDA, Clermont-Ferrand, France, October 2012. Conference without formal proceedings. (pdf | slides | code | bib)
• A. Souihli and P. Senellart, Demonstrating ProApproX 2.0: A Predictive Query Engine for Probabilistic XML. In Proc. CIKM, pp. 2734–2736, Maui, Hawaii, USA, October 2012. Demonstration. (pdf | video | poster | doi | code | bib)
• P. Senellart, Probabilistic XML: A Data Model for the Web. Habilitation to supervise research, Université Pierre et Marie Curie, Paris, France, June 2012. (pdf | slides (French) | video | bib)
• S. Abiteboul, Y. Amsterdamer, T. Milo, and P. Senellart, Auto-Completion Learning for XML. In Proc. SIGMOD, pp. 669–672, Scottsdale, USA, May 2012. Demonstration. (pdf | poster | doi | bib)
• S. Abiteboul, Y. Amsterdamer, D. Deutch, T. Milo, and P. Senellart, Finding Optimal Probabilistic Generators for XML Collections. In Proc. ICDT, pp. 127–139, Berlin, Germany, March 2012. (pdf | slides | doi | bib)
• E. Kharlamov and P. Senellart, Modeling, Querying, and Mining Uncertain XML Data. In A. Tagarelli, editor, XML Data Mining: Models, Methods, and Applications, pp. 29–52. IGI Global, November 2011. (pdf | doi | bib)
• M. L. Ba, T. Abdessalem, and P. Senellart, Towards a Version Control Model with Uncertain Data. In Proc. PIKM, pp. 43–50, Glasgow, United Kingdom, October 2011. (pdf | slides | doi | bib)
• S. Abiteboul, Y. Amsterdamer, D. Deutch, T. Milo, and P. Senellart, Optimal Probabilistic Generators for XML Corpora. In Proc. BDA, Rabat, Morocco, October 2011. Conference without formal proceedings. (pdf | slides, pdf | slides, pptx | bib)
• P. Senellart and A. Souihli, ProApproX: A Lightweight Approximation Query Processor over Probabilistic Trees. In Proc. SIGMOD, pp. 1295–1298, Athens, Greece, June 2011. Demonstration. (pdf | video | poster | doi | code | bib)
• E. Kharlamov, W. Nutt, and P. Senellart, Value Joins are Expensive over (Probabilistic) XML. In Proc. LID, pp. 41–48, Uppsala, Sweden, March 2011. (pdf | slides | extended version | doi | bib)
• A. Souihli and P. Senellart, Efficient Query Evaluation over Probabilistic XML with Long-Distance Dependencies. In Proc. Joint EDBT/ICDT Ph.D. Workshop, pp. 32–37, Uppsala, Sweden, March 2011. (pdf | doi | code | bib)
• T. Abdessalem, M. L. Ba, and P. Senellart, A Probabilistic XML Merging Tool. In Proc. EDBT, pp. 538–541, Uppsala, Sweden, March 2011. Demonstration. (pdf | poster | doi | bib)
• E. Kharlamov, W. Nutt, and P. Senellart, Value Joins are Expensive over (Probabilistic) XML. Extended Version. Technical report KRDB11-1, KRDB Research Centre, Free University of Bozen–Bolzano, Bolzano, Italy, February 2011. (pdf | bib)
• S. Abiteboul, T-H. H. Chan, E. Kharlamov, W. Nutt, and P. Senellart, Capturing Continuous Data and Answering Aggregate Queries in Probabilistic XML. ACM Transactions on Database Systems, 36(4), pp. 25:1–25:45, 2011. (pdf | doi | bib)
• P. Senellart and A. Souihli, Un Système de gestion de données XML probabilistes. In Proc. BDA, Toulouse, France, October 2010. Demonstration. Conference without formal proceedings. (pdf | poster | code | bib)
• M. Benedikt, E. Kharlamov, D. Olteanu, and P. Senellart, Probabilistic XML via Markov Chains. Proceedings of the VLDB Endowment, 3(1), pp. 770–781, September 2010. Presented at the VLDB 2010 conference, Singapore. (pdf | slides | doi | bib)
• E. Kharlamov, W. Nutt, and P. Senellart, Updating Probabilistic XML. In Proc. Updates in XML, Lausanne, Switzerland, March 2010. (pdf | slides | doi | bib)
• S. Abiteboul, T-H. H. Chan, E. Kharlamov, W. Nutt, and P. Senellart, Aggregate Queries for Discrete and Continuous Probabilistic XML. In Proc. ICDT, pp. 50–61, Lausanne, Switzerland, March 2010. (pdf | slides | doi | bib)
• S. Abiteboul, T-H. H. Chan, E. Kharlamov, W. Nutt, and P. Senellart, Agrégation de documents XML probabilistes. In Proc. BDA, Namur, Belgium, October 2009. Conference without formal proceedings. (pdf | slides | bib)
• S. Abiteboul, B. Kimelfeld, Y. Sagiv, and P. Senellart, On the Expressiveness of Probabilistic XML Models. VLDB Journal, 18(5), pp. 1041–1064, October 2009. (pdf | doi | bib)
• P. Senellart and S. Abiteboul, On the Complexity of Managing Probabilistic XML Data. In Proc. PODS, pp. 283–292, Beijing, China, June 2007. (pdf | slides | doi | bib)
• S. Abiteboul and P. Senellart, Querying and Updating Probabilistic Information in XML. In Proc. EDBT, pp. 1059–1068, Munich, Germany, March 2006. Short paper. (pdf | slides | doi | code | bib)
• S. Abiteboul and P. Senellart, Querying and Updating Probabilistic Information in XML. Technical report 435, Gemo, INRIA Futurs, Orsay, France, December 2005. (pdf | code | bib)

Graph Algorithms and Link Analysis

• C. Meng, R. Cheng, S. Maniu, P. Senellart, and W. Zhang, Discovering Meta-Paths in Large Heterogeneous Information Networks. In Proc. WWW, pp. 754–764, Florence, Italy, May 2015. (pdf | slides, pdf | slides, pptx | doi | bib)
• S. Abiteboul, S. Amer-Yahia, A. Marian, A. Galland, and P. Senellart, Birds of a tag flock together. In Proc. SSM, New York, USA, February 2010. Workshop without formal proceedings. (pdf | poster | bib)
• M. Vazirgiannis, D. Drosos, P. Senellart, and A. Vlachou, Web Page Rank Prediction with Markov Models. In Proc. WWW, pp. 1075–1076, Beijing, China, April 2008. Poster. (pdf | html | doi | bib)
• P. Senellart and V. D. Blondel, Automatic discovery of similar words. In M. W. Berry and M. Castellanos, editors, Survey of Text Mining II: Clustering, Classification and Retrieval, pp. 25–44. Springer-Verlag, January 2008. (pdf | doi | data | bib)
• Y. Ollivier and P. Senellart, Finding Related Pages Using Green Measures: An Illustration with Wikipedia. In Proc. AAAI, pp. 1427–1433, Vancouver, Canada, July 2007. (pdf | slides | code | data | bib)
• P. Senellart, Identifying Websites with Flow Simulation. In Proc. ICWE, pp. 124–129, Sydney, Australia, July 2005. (pdf | slides | doi | code | bib)
• P. Senellart, Identifying Websites with Flow Simulation. Technical report 387, Gemo, INRIA Futurs, Orsay, France, April 2005. (pdf | code | bib)
• V. D. Blondel, A. Gajardo, M. Heymans, P. Senellart, and P. Van Dooren, A measure of similarity between graph vertices: applications to synonym extraction and Web searching. SIAM Review, 46(4), pp. 647–666, 2004. (pdf | arXiv | doi | data | bib)
• P. Senellart, Website Identification. Masters thesis, Université Paris–Sud, Orsay, France, September 2003. (pdf | code | project page | bib)
• P. Senellart and V. D. Blondel, Automatic discovery of similar words. In M. W. Berry, editor, Survey of Text Mining: Clustering, Classification and Retrieval, pp. 25–43. Springer-Verlag, August 2003. (pdf | doi | data | bib)
• V. D. Blondel and P. Senellart, Automatic extraction of synonyms in a dictionary. In Proc. TMW, pp. 7–13, Arlington, USA, April 2002. Also registered as Technical Report 89 (2001), Université catholique de Louvain, Louvain-la-neuve. (pdf | slides | data | bib)
• P. Senellart, Extraction of information in large graphs. Automatic search for synonyms. Technical report 90, Université catholique de Louvain, Louvain-la-neuve, Belgium, 2001. Masters Internship Report. (pdf | slides | data | bib)

Computer Science for the Social Sciences

• B. Nguyen, A. Vion, F.-X. Dudouet, D. Colazzo, I. Manolescu, and P. Senellart, XML Content Warehousing: Improving Sociological Studies of Mailing Lists and Web Data. Bulletin of Sociological Methodology, 112(1), pp. 5–31, October 2011. (pdf | arXiv | doi | project page | bib)
• M. Bourreau, F. Moreau, and P. Senellart, La diversité culturelle dans l’industrie de la musique enregistrée en France (2003-2008). Publications du Département des études, de la prospective et des statistiques, 5, October 2011. (pdf (French) | doi | bib)
• B. Nguyen, A. Vion, F.-X. Dudouet, I. Manolescu, D. Colazzo, and P. Senellart, The WebStand Project. In Proc. WebSci, Athens, Greece, March 2009. Poster. (pdf | poster | arXiv | project page | bib)
• D. Colazzo, I. Manolescu, F.-X. Dudouet, B. Nguyen, P. Senellart, and A. Vion, Traiter des corpus d’information sur le Web. Vers de nouveaux usages informatiques de l’enquête. September 2007. Presented at Congrès de l’Association française de sciences politiques, Toulouse, France. (pdf | bib)
• F.-X. Dudouet, I. Manolescu, B. Nguyen, and P. Senellart, XML Warehousing Meets Sociology. In Proc. IADIS ICWI, pp. 170–174, Lisbon, Portugal, October 2005. (doc | pdf | slides | extended version | bib)
• F.-X. Dudouet, I. Manolescu, B. Nguyen, and P. Senellart, XML Warehousing meets Sociology... Introducing the W3C XQuery Working Group. Technical report 423, Gemo, INRIA Futurs, Orsay, France, April 2005. (doc | pdf | bib)
• F.-X. Dudouet, I. Manolescu, B. Nguyen, and P. Senellart, Sociological Analysis of the W3C Standardization Process: XML Warehouse meets Sociology. Technical report 369, Gemo, INRIA Futurs, Orsay, France, November 2004. (pdf | bib)

Outreach, Opinion, and Science Policy

• S. Abiteboul and P. Senellart, Les réseaux informatiques. In C. Grall, editor, L'arbre et la toile : du vivant et des formes entre les disciplines, pp. 219–228. Academic Press, January 2026. (pdf (French) | bib)
• P. Senellart and N. Vieira, OnePSL30 : transformation numérique de l'Université PSL. Collection numérique de l’AMUE, Agence de mutualisation des universités et établissements d'enseignement supérieur, 39, December 2025. (html | publisher | bib)
• N. Appel, J. Bourdon, N. Bousquet, J. Cohen, A. Genitrini, P. Georgeon, Y. Grandvalet, K. Jaffrès-Runser, A. Legrand, D. Markham, A. Muscholl, A. Paparrizou, L. Paulevé, M. Poss, M. Potop-Butucaru, J.-F. Raymond, R. Rouvoy, Y. Sallent, P. Senellart, T. Seiller, Y.-Q. Song, A. Tchana, and H. Waeselynck, Section 06 – Sciences de l’information : fondements de l’informatique, calculs, algorithmes, représentations, exploitations. Comité national de la recherche scientifique, Paris, France, 2025. Rapport de conjoncture 2024 (state-of-research report) of section 06. (pdf | HAL | bib)
• P. Senellart, Qualitative Evaluation of Academic Researchers in Computer Science: Practices and Reflections from CNRS. Computer Education, 12(372), pp. 36–41, 2025. (pdf | bib)
• H. Comon, S. Perdrix, P. Aboulker, P. Arrighi, S. Blazy, A. Braud, P. Clairambault, P. Dayre, R. Dernat, C. Dhaenens, L. Duchien, A. Gheerbrant, N. Aussenac-Gilles, J.-M. Larré, D. Lavenier, L. Liberti, P. Owezarski, C. Scornavacca, S. Sené, P. Senellart, P. Sens, G. Villard, I. Walukiewicz, and L. Weinhard, Section 06 – Sciences de l’information : fondements de l’informatique, calculs, algorithmes, représentations, exploitations. Comité national de la recherche scientifique, Paris, France, 2021. Rapport de conjoncture 2019 (state-of-research report) of section 06. (pdf | HAL | bib)
• J. Krämer, P. Senellart, and A. de Streel, Making Data Portability More Effective for the Digital Economy: Economic Implications and Regulatory Challenges. Centre on Regulation in Europe (CERRE), Brussels, Belgium, June 2020. (pdf | HAL | publisher | bib)
• P. Senellart, Disseminate your Research: Style Does Matter. In Proc. PIKM, pp. 1–2, San Francisco, USA, November 2013. (pdf | slides | doi | bib)
• S. Abiteboul and P. Senellart, Un déluge de données. Pour la science, 433, pp. 32–35, November 2013. (publisher | bib)
• M. Benedikt and P. Senellart, Databases. In E. K. Blum and A. V. Aho, editors, Computer Science. The Hardware, Software and Heart of It, pp. 169–229. Springer-Verlag, January 2012. (pdf | doi | bib)
• S. Abiteboul, I. Manolescu, M.-C. Rousset, P. Rigaux, and P. Senellart, Web Data Management. Cambridge University Press, New York, USA, January 2012. (doi | project page | bib)
• P. Senellart, Google est-il un moteur de recherche efficace ? August 2008. Unpublished. (html (French) | bib)
• P. Senellart, Explorer le « Web caché ». April 2008. Unpublished. (html (French) | bib)

Edited Volumes and Scientific Service

• P. Senellart and A. Napoli, Actes de la conférence BDA 2017. HAL, Paris, France, November 2017. (HAL | bib)
• A. Meliou and P. Senellart, Proceedings of the 20th International Workshop on the Web and Databases, WebDB 2017. ACM, Chicago, USA, May 2017. (doi | publisher | bib)
• S. Schockaert and P. Senellart, Proceedings of the 10th International Conference on Scalable Uncertainty Management, SUM 2016. Springer-Verlag, Nice, France, September 2016. (doi | publisher | bib)
• R. Cheng, A. Das Sarma, S. Maniu, and P. Senellart, Proceedings of the First VLDB Workshop on Databases and Crowdsourcing, DBCrowd 2013. CEUR Workshop Proceedings, Riva del Garda, Italy, August 2013. (publisher | bib)
• S. Abiteboul, P. Senellart, and V. Vianu, The ERC Webdam on Foundations of Web Data Management. In Proc. WWW, pp. 211–214, Lyon, France, April 2012. European project track. (pdf | slides | doi | bib)
• A. Ailamaki, S. Amer-Yahia, J. M. Patel, T. Risch, P. Senellart, and J. Stoyanovich, Proceedings of the 14th International Conference on Extending Database Technology, EDBT 2011. ACM, Uppsala, Sweden, March 2011. (doi | publisher | bib)
• C. Genzmer, V. Hudlet, H. Park, D. Schall, and P. Senellart, The SIGMOD 2010 Programming Contest: A Distributed Query Engine. SIGMOD Record, 39(2), pp. 61–64, June 2010. (pdf | doi | project page | bib)
• S. Manegold, I. Manolescu, L. Afanasiev, J. Feng, G. Gou, M. Hadjieleftheriou, S. Harizopoulos, P. Kalnis, K. Karanasos, D. Laurent, M. Lupu, N. Onose, C. Ré, V. Sans, P. Senellart, T. Wu, and D. Shasha, Repeatability & Workability Evaluation of SIGMOD 2009. SIGMOD Record, 38(3), pp. 40–43, September 2009. (pdf | doi | bib)
• P. Rigaux and P. Senellart, Proceedings of the VLDB 2009 PhD Workshop. VLDB Endowment, Lyon, France, August 2009. (website | bib)
• I. Manolescu, L. Afanasiev, A. Arion, J.-P. Dittrich, S. Manegold, N. Polyzotis, K. Schnaitter, P. Senellart, S. Zoupanos, and D. Shasha, The repeatability experiment of SIGMOD 2008. SIGMOD Record, 37(1), pp. 39–45, March 2008. (pdf | doi | bib)

Early Work and Machine Translation

• P. Senellart and J. Senellart, SYSTRAN Translation Stylesheets: Machine Translation driven by XSLT. In Proc. XML Conference & Exposition, Atlanta, USA, November 2005. (pdf | xml | html | slides | bib)
• M. Attnäs, P. Senellart, and J. Senellart, Integration of SYSTRAN MT systems in an open workflow. In Proc. MT Summit, pp. 211–218, Phuket, Thailand, September 2005. (pdf | slides | bib)
• P. Senellart, Activity Report. SYSTRAN S.A., Paris, France, 2005. (pdf | bib)
• P. Senellart, Vérification automatique des multiplicateurs. Chalmers Institute of Technology, Gothenburg, Sweden, 2002. Long internship report. (pdf | slides | code | project page | bib)