Antoine Amarilli

Name

Antoine Amarilli [ɑ̃.twan.a.ma.ʁi.li]. Handle: a3nm.

Identity

Born 1990-02-07. French national. Appearance as of 2017.

Auth

OpenPGP. OpenId. Bitcoin.

Contact

Email and XMPP a3nm<REMOVETHIS>@a3nm.net.

Affiliation

Associate professor of computer science (office 4C24) in the DIG team of Télécom Paris, 19 place Marguerite Perey, 91120 Palaiseau, France (directions).

Studies

PhD in computer science awarded by Télécom ParisTech on March 14, 2016. Former student of the École normale supérieure.

More

Résumé

Other sites

1. Blogging: a3nm.net/blog
2. Git: a3nm.net/git

Accounts

• en.wikipedia.org
• fr.wikipedia.org
• stackexchange.com
• news.ycombinator.com
• openstreetmap.org
• bugs.debian.org
• orcid.org
• mamot.fr
• github.com

Organizations

• SWERC (director)
• Master Parisien de Recherche en Informatique (member of the studies committee for Télécom Paris)
• DIG seminar (responsible)
• Data Science seminar (co-responsible)
• Dissem.in (board member)
• Ensemble vide (treasurer)
• Club Inutile de l'École normale supérieure (president, founder)
• Theoretical Computer Scientists for Future (signer)
• La Quadrature du Net (monthly donor)
• April (member)
• Free Software Foundation (member)
• Software Freedom Conservancy (monthly supporter)
• Framasoft (monthly donor)
• OpenStreetMap Foundation (normal member)

Teaching

See my teaching page.

More

Online presence

Main publications

Full list

• Antoine Amarilli, İsmail İlkan Ceylan.
  A Dichotomy for Homomorphism-Closed Queries on Probabilistic Graphs.
  ICDT 2020. [slides, video]. Best paper award of ICDT'20.
• Julien Romero, Nicoleta Preda, Antoine Amarilli, Fabian M. Suchanek.
  Computing and Illustrating Query Rewritings on Path Views with Binding Patterns.
  Under review. Demo paper.
• Julien Romero, Nicoleta Preda, Antoine Amarilli, Fabian M. Suchanek.
  Equivalent Rewritings on Path Views with Binding Patterns.
  ESWC 2020.
• Antoine Amarilli, Pierre Bourhis, Stefan Mengel, Matthias Niewerth.
  Constant-Delay Enumeration for Nondeterministic Document Spanners.
  Under review.
• Antoine Amarilli, Benny Kimelfeld.
  Uniform Reliability of Self-Join-Free Conjunctive Queries.
  Under review.
• Antoine Amarilli, Michael Benedikt.
  Finite Open-World Query Answering with Number Restrictions.
  ToCL, 2020.
• Andy Shih, Guy Van den Broeck, Paul Beame, Antoine Amarilli.
  Smoothing Structured Decomposable Circuits.
  NeurIPS 2019. [slides by Andy Shih, poster by Andy Shih]
• Antoine Amarilli, Florent Capelli, Mikaël Monet, Pierre Senellart.
  Connecting Knowledge Compilation Classes and Width Parameters.
  ToCS, 2019.
• Antoine Amarilli, Pierre Bourhis, Stefan Mengel, Matthias Niewerth.
  Enumeration on Trees with Tractable Combined Complexity and Efficient Updates.
  PODS 2019. [slides by Matthias Niewerth, poster by Matthias Niewerth]
• 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]
• Antoine Amarilli, Michael Benedikt.
  When Can We Answer Queries Using Result-Bounded Data Interfaces?
  Under review.
• Antoine Amarilli, Pierre Bourhis, Mikaël Monet, Pierre Senellart.
  Evaluating Datalog via Tree Automata and Cycluits.
  ToCS, 2019.
• Antoine Amarilli, Michael Benedikt, Pierre Bourhis, Michael Vanden Boom.
  Query Answering with Transitive and Linear-Ordered Data.
  JAIR, 2018.
• 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.
  PODS 2017. [slides by Mikaël Monet, poster by Mikaël Monet]
• Antoine Amarilli, Pierre Bourhis, Pierre Senellart.
  Tractable Lineages on Treelike Instances: Limits and Extensions.
  PODS 2016. [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 2020, Copenhagen, 2020-04-01. [online talk due to the COVID-19 pandemy]
• A Dichotomy for Homomorphism-Closed Queries on Probabilistic Graphs.
  ICDT 2020, Copenhagen, 2020-03-30. [online talk due to the COVID-19 pandemy, video in direct download]
• A Dichotomy for Homomorphism-Closed Queries on Probabilistic Graphs.
  DIG seminar, Télécom Paris, 2020-03-26. [talk canceled due to the COVID-19 pandemy]
• Provenance in Databases and Links to Knowledge Compilation.
  KOCOON Workshop, Maison de la Recherche, Arras, 2019-12-17.
• Query Lineages and Knowledge Compilation.
  DBAI Workshop, Santa Cruz (Chile), 2019-11-13.

Peer reviewing

PC member

IJCAI 2020, IJCAI 2019, ICDT 2019, ICDT 2018, BDA 2017, SUM 2016, BDA 2016 (demos)

Misc reviews

VLDB Journal, Journal of Logic and Computation, Review of Symbolic Logic, Distributed and Parallel Databases, STACS 2020, MFCS 2019, ICDT 2017, PODS 2016, ICDE 2015, LATIN 2014, SIGMOD 2013

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

• Armavica
• Cécile
• clarus
• fbenhamo
• ggauvain
• iXce
• JJ
• jjourdan
• louis
• Luis
• Machin
• Maxime
• maud
• Mc
• Mikaël
• Oana
• p4bl0
• pintoch
• Tastalian
• Ted
• Yannick
• Yap
• yo252yo