Description
Location
Production
Main publications
Full list
-
Antoine Amarilli,
Louis Jachiet,
Charles Paperman.
Dynamic Membership for Regular Languages.
Under review.
-
Antoine Amarilli,
Charles Paperman.
Locality and Centrality: The Variety ZG.
Under review.
-
Antoine Amarilli,
İsmail İlkan Ceylan.
The Dichotomy of Evaluating Homomorphism-Closed Queries on Probabilistic Graphs.
Under review.
-
Osnat Drien,
Antoine Amarilli,
Yael Amsterdamer.
Managing Consent for Data Access in Shared Databases.
Published at a closed-access conference, 2021 [why?]. Short paper.
-
Antoine Amarilli,
Benny Kimelfeld.
Uniform Reliability of Self-Join-Free Conjunctive Queries.
ICDT 2021.
-
Antoine Amarilli,
Pierre Bourhis,
Stefan Mengel,
Matthias Niewerth.
Constant-Delay Enumeration for Nondeterministic Document Spanners.
Published at a closed-access journal [why?].
-
Antoine Amarilli,
İsmail İlkan Ceylan.
A Dichotomy for Homomorphism-Closed Queries on Probabilistic Graphs.
ICDT 2020.
[slides, poster, video on TIB AV-Portal or in direct download]. Best paper award of ICDT'20.
-
Julien Romero,
Nicoleta Preda,
Antoine Amarilli,
Fabian M. Suchanek.
Equivalent Rewritings on Path Views with Binding Patterns.
Published at a closed-access conference, 2020 [why?].
[slides, video by Julien Romero on Videolectures.net or on Youtube or in direct download]
-
Antoine Amarilli,
Michael Benedikt.
Finite Open-World Query Answering with Number Restrictions.
Published at a closed-access journal, 2020 [why?].
-
Andy Shih,
Guy Van den Broeck,
Paul Beame,
Antoine Amarilli.
Smoothing Structured Decomposable Circuits.
NeurIPS 2019. Spotlight presentation.
[slides by Andy Shih, poster by Andy Shih]
-
Antoine Amarilli,
Florent Capelli,
Mikaël Monet,
Pierre Senellart.
Connecting Knowledge Compilation Classes and Width Parameters.
Published at a closed-access journal, 2019 [why?].
-
Antoine Amarilli,
Pierre Bourhis,
Stefan Mengel,
Matthias Niewerth.
Enumeration on Trees with Tractable Combined Complexity and Efficient Updates.
Published at a closed-access conference, 2019 [why?].
[slides by Matthias Niewerth, poster by Matthias Niewerth, video by Matthias Niewerth on TIB AV-Portal or in direct download, errata]
-
Antoine Amarilli,
Pierre Bourhis,
Stefan Mengel,
Matthias Niewerth.
Constant-Delay Enumeration for Nondeterministic Document Spanners.
ICDT 2019.
[slides by Matthias Niewerth, code by Rémi Dupré and Matthias Niewerth]. Featured in ACM SIGMOD Research Highlights.
-
Antoine Amarilli,
Michael Benedikt.
When Can We Answer Queries Using Result-Bounded Data Interfaces?
Under review.
[errata]
-
Antoine Amarilli,
Pierre Bourhis,
Mikaël Monet,
Pierre Senellart.
Evaluating Datalog via Tree Automata and Cycluits.
Published at a closed-access journal, 2019 [why?].
-
Antoine Amarilli,
Michael Benedikt,
Pierre Bourhis,
Michael Vanden Boom.
Query Answering with Transitive and Linear-Ordered Data.
JAIR, 2018.
[errata]
-
Antoine Amarilli,
Charles Paperman.
Topological Sorting under Regular Constraints.
ICALP 2018.
[slides]
-
Antoine Amarilli,
Pierre Bourhis,
Louis Jachiet,
Stefan Mengel.
A Circuit-Based Approach to Efficient Enumeration.
ICALP 2017.
[slides]
-
Antoine Amarilli,
Mikaël Monet,
Pierre Senellart.
Conjunctive Queries on Probabilistic Graphs: Combined Complexity.
Published at a closed-access conference, 2017 [why?].
[slides by Mikaël Monet, poster by Mikaël Monet]
-
Antoine Amarilli,
Pierre Bourhis,
Pierre Senellart.
Tractable Lineages on Treelike Instances: Limits and Extensions.
Published at a closed-access conference, 2016 [why?].
[slides, poster]
-
Antoine Amarilli,
Pierre Bourhis,
Pierre Senellart.
Provenance Circuits for Trees and Treelike Instances.
ICALP 2015.
[slides]
Latest and upcoming talks
Full list
-
Climate Change Session Presentation.
ICDT 2021, Online, 2021-03-26.
-
Efficient enumeration of regex matches.
SEQBIM 2020, Online, 2020-11-23.
[online talk due to the COVID-19 pandemic]
-
Une dichotomie sur l’évaluation de requêtes closes sous homomorphismes sur les graphes probabilistes.
BDA 2020, Online, 2020-10-29.
[online talk due to the COVID-19 pandemic]
-
A Dichotomy for Homomorphism-Closed Queries on Probabilistic Graphs.
DIG seminar, Télécom Paris, 2020-10-29.
-
A Dichotomy for Homomorphism-Closed Queries on Probabilistic Graphs.
Highlights 2020, Online, 2020-09-16.
[online talk due to the COVID-19 pandemic]
Peer reviewing
As a signer of No free view? No review!, I only accept review requests from open access venues: see
my open access policy for details
and explanations.
- PC member
- AAAI 2021,
IJCAI 2021,
STACS 2021,
IJCAI 2020,
IJCAI 2019,
ICDT 2019,
ICDT 2018,
BDA 2017
- Misc reviews
- ICDT 2021,
STACS 2020,
MFCS 2020,
BDA 2016,
ICDT 2017
Other academic writings
- List of open questions
- Some research questions that I find interesting and to which no one
knows the answer.
- What's wrong with academia?
- A detailed list of challenges about the way academia works.
Code
Git repositories
- irctk
- Connect to an IRC server, write messages on stdout, say what is given
on stdin. Useful to write bots. C program, using libircclient. See the README
file or the blogpost.
GPLv3 licensed.
- plint
- A French poetry validator for metric, rhyme and rhyme gender. You can
also get the code. GPLv3
licensed.
- drime
- A French rhyme dictionary. You can also get the code and have a look at the README.
GPLv3 licensed.
- haspirater
- A system to find out whether the initial 'h' in a French word
is aspirated or
not. Can be used as a standalone program or an a Python module. No big
dictionary of exceptions, but rules learned from a corpus and stored as a
trie: compact, fast, and reasonable for unseen words. See the README
file or the blogpost. MIT
licensed.
- frhyme
- A system to infer the last few phonemes of a French word. Not very
clever.
Humor attempts
- The
Password Security Checker
- Check the strength of your passwords!
- Falso
- A new powerful axiomatic system.
- Brain
Transplant
- A new medical procedure.
- Door
Safety Instructions
- See the
club Inutile website for more information.
- Weird legalese
- A few weird things found in what we always accept and never
read.
Application notes
- Applications to research positions
- Some notes about my applications to public research positions in
computer science in France.
- Information about the theoretical computer
science oral exam for ENS
- Some documentation about this exam for the competitive examination for
ENS (in French).
- Resources for "classes préparatoires" students
- Some documentation about competitive exams to enter French engineering
schools, in particular the ENS INFO contest (in French).
In French
- Tipe
- Source code and report for a program to draw the OpenPGP trust
network.
- Notes on electrical
networks
- Useful for students in French "classes préparatoires".
- The beauty of disorder
- A five-hour "dissertation" for the "Concours
général de philosophie". Was awarded a "premier accessit".
- Poetry
- Various poems, not to be taken seriously.
- Futurs simples
- Old vaguely philosophical science-fiction short story collection.
- Competitive exam report report
- A report about competitive exam reports. "Classes préparatoires"
students may find it funny.
- French defective verbs
- Extended conjugation tables for French defective verbs.
- Tutorial session about
bipedalism
- The assignment for a somewhat straightforward tutorial session.
Browse
Misc
Relation
