From Wikipedia, the free encyclopedia
My website is [1] . My employer is Télécom Paris . My user page on the French Wikipedia might be more complete.
Paid editing disclosure (inspired by User:David Eppstein ): I consider that editing Wikipedia is part of my job (as an associate professor in Télécom Paris ), so to this extent my edits on Wikipedia pages thematically connected to my job there could be considered as paid edits . However, I do these edits in an entirely self-directed way, and there is no guidance or oversight from my employer on what I edit or how I edit it. In all cases, my edits on Wikipedia are not endorsed by my current or past employers.
Articles to create or improve [ edit ]
critical pair lemma
interreduction
Erdos-Gallai
Lambek grammar
graph sparsifier
dragon algorithm , dragon4
convergent encryption
CEK machine
graph unfolding
proof net
optimal reduction
Stoer-Wagner algorithm
failure detector
randomized consensus
pospace
Tactic (proof assistant)
exact learning model
AT-free graph
C-trie
Weisfeiler-Leman Algorithm
Haban
c-table
communicating finite-state machine
Dependency theory (database theory)
Probabilistic XML
DL-Lite
Stoer-Wagner algorithm
Global As View , Local As View
guarded fragment
fault injection attack
BellCoRe attack
quasi-bayesian theory
edge ranking
hypertree width
Lupanov representation
ontology-based data access
Feder-Vardi conjecture
rank-width
rank aggregation
provenance (databases)
monotone dualization and lattice dualization , transversal enumeration
nested relational model
database normalization , rescuing [2]
fluted fragment (maybe not notable enough?)
color refinement
enumeration algorithm (but cf polynomial delay )
knowledge compilation
fix Talk:Database_normalization#Problem_with_3NF_in_the_step_by_step_example
Bernoulli factory
Variety_of_finite_semigroups : fix issues
L* algorithm by Angluin; see induction of regular languages and language identification in the limit
Guarded logic : complexity of satisfiability, etc., cf [3]
OBDA /OMQA
K-means++#Example_of_a_sub-optimal_clustering add diagram
Scheduling problem : Create a root article linking to Notation_for_theoretic_scheduling_problems and all variants
Fine-grained complexity (but note that fine-grained reduction exists); OV-conjecture
algebraic complexity theory , to link from circuit (computer science) , circuit complexity , circuits over sets of natural numbers , and algebraic circuit complexity classes
Translation [ edit ]
Articles on which I have significantly worked [ edit ]
Before 2020-06 [ edit ]
From 2020-06 [ edit ]