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 C201-4) in the DIG team of Télécom ParisTech, 46 rue Barrault, F-75634 Paris Cedex 13, France.

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
• github.com

Associations and Events

• SWERC'17 (director)
• DIG seminar (responsible)
• Club Inutile de l'École normale supérieure (president, founder)
• Dissem.in (board member)
• Association des anciens élèves, élèves et amis de l'École normale supérieure (member)
• La Quadrature du Net (monthly donor)
• April (member)
• Free Software Foundation (member)
• Software Freedom Conservancy (monthly supporter)
• Framasoft (monthly donor)

Teaching

See my teaching page.

More

Online presence

Main publications

Full list

• Antoine Amarilli, Charles Paperman.
  Topological Sorting under Regular Constraints.
  ICALP 2018.
• Antoine Amarilli, M. Lamine Ba, Daniel Deutch, Pierre Senellart.
  Computing Possible and Certain Answers over Order-Incomplete Data.
  Under review.
• Antoine Amarilli, Pierre Bourhis, Mikaël Monet, Pierre Senellart.
  Evaluating Datalog via Tree Automata and Cycluits.
  Under review.
• Antoine Amarilli, Michael Benedikt.
  When Can We Answer Queries Using Result-Bounded Data Interfaces?
  PODS 2018.
• Antoine Amarilli, Mikaël Monet, Pierre Senellart.
  Connecting Width and Structure in Knowledge Compilation.
  ICDT 2018. [slides by Mikaël Monet]
• Antoine Amarilli, Pierre Bourhis, Stefan Mengel.
  Enumeration on Trees under Relabelings.
  ICDT 2018. [slides, poster]
• Antoine Amarilli, Michael Benedikt, Pierre Bourhis, Michael Vanden Boom.
  Query Answering with Transitive and Linear-Ordered Data.
  Under review.
• 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, Mikaël Monet, Pierre Senellart.
  Combined Tractability of Query Evaluation via Tree Automata and Cycluits.
  ICDT 2017. [slides by Mikaël Monet, poster by Mikaël Monet]
• Antoine Amarilli, Yael Amsterdamer, Tova Milo, Pierre Senellart.
  Top-k Queries on Unknown Values under Order Constraints.
  ICDT 2017. [slides by Yael Amsterdamer, poster by Yael Amsterdamer]
• Antoine Amarilli, Michael Benedikt, Pierre Bourhis, Michael Vanden Boom.
  Query Answering with Transitive and Linear-Ordered Data.
  IJCAI 2016. [slides by Michael Vanden Boom, longer slides, poster by Michael Vanden Boom]
• Antoine Amarilli, Michael Benedikt.
  Finite Open-World Query Answering with Number Restrictions.
  Draft.
• Antoine Amarilli.
  Leveraging the Structure of Uncertain Data.
  PhD thesis. [slides]
• Antoine Amarilli, Pierre Bourhis, Pierre Senellart.
  Tractable Lineages on Treelike Instances: Limits and Extensions.
  PODS 2016. [slides, poster]
• Antoine Amarilli, Mehryar Mohri, Cyril Allauzen.
  Minimum Bayesian Risk Methods for Automatic Speech Recognition.
  US Patent 9123333. [not an endorsement of software patents]
• Antoine Amarilli, Michael Benedikt.
  Combining Existential Rules and Description Logics.
  IJCAI 2015. [slides, longer slides, poster]
• Antoine Amarilli, Michael Benedikt.
  Finite Open-World Query Answering with Number Restrictions.
  LICS 2015. [slides]
• Antoine Amarilli, Pierre Bourhis, Pierre Senellart.
  Provenance Circuits for Trees and Treelike Instances.
  ICALP 2015. [slides]

Latest and upcoming talks

Full list

• Topological Sorting under Regular Constraints.
  ICALP 2018, Prague, 2018-07-12.
• When Can We Answer Queries Using Result-Bounded Data Interfaces?
  PODS 2018, Houston (Texas, United States), 2018-06-12.
• Leveraging the Structure of Uncertain Data.
  CSCUBS 2018, Bonn, 2018-05-16.
• Enumeration on Trees under Relabelings.
  ICDT 2018, Vienna, 2018-03-27.
• Using Order Constraints in Crowd Data Sourcing.
  MoDaS final workshop, Eilat, 2018-02-12.

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.

nlsplit

A tool to split natural language text in chunks at reasonable language boundaries. The program takes as argument a maximal size for chunks, reads stdin and produces chunks smaller than the maximal size on stdout. Not NLP research but the obvious heuristics (paragraphs, then sentences, then words, with some refinements). Someone had to write this. See the README file. 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