User:a3nm
(Redirected from User:A3 nm)
| Wikipedia:Babel | ||||
|---|---|---|---|---|
| ||||
| Search user languages |
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]- Yannakakis algorithm, et acyclic conjunctive query (also GYO algorithm)
- graph sparsifier
- Weisfeiler-Leman algorithm, extending Colour refinement algorithm
- hypertree width
- Variety_of_finite_semigroups: fix issues
- Guarded logic: complexity of satisfiability, etc., cf [2]
- 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
- Karp-Luby sampling
- Feder-Vardi conjecture
- knowledge compilation
- instance-optimal algorithm
- query containment problem
- massively parallel computation model
- conflict-driven clause learning (clarify "cut", etc.)
- unambiguous tree automaton
- Arden's rule generalizing to semiring
- regular path query and C2RPQs etc.
- FPRAS: clarify that the notion of approximation is usually multiplicative not additive
Other ideas
[edit]- critical pair lemma
- interreduction
- Lambek grammar
- dragon algorithm, dragon4
- CEK machine
- optimal reduction
- randomized consensus
- Tactic (proof assistant)
- exact learning model
- AT-free graph
- C-trie
- c-table
- Dependency theory (database theory)
- Probabilistic XML
- DL-Lite
- Stoer-Wagner algorithm
- Global As View, Local As View
- fault injection attack
- BellCoRe attack
- quasi-bayesian theory
- edge ranking
- Lupanov representation
- ontology-based data access
- rank aggregation
- provenance (databases)
- monotone dualization and lattice dualization, transversal enumeration
- nested relational model
- database normalization, rescuing [3]
- fluted fragment (maybe not notable enough?)
- color refinement
- fix Talk:Database_normalization#Problem_with_3NF_in_the_step_by_step_example
- Bernoulli factory
- L* algorithm by Angluin; see induction of regular languages and language identification in the limit
- 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
- Propositional directed acyclic graph, clarifying the link to Boolean circuit
Translation
[edit]Articles on which I have significantly worked
[edit]Note that I mostly do small edits to fix problems in the articles I read. Also, this list is not exhaustive (see my contribution log for more).
Before 2020-06
[edit]- Maximum cardinality matching: restructured the discussion, homogenized the presentation
- Hopcroft–Karp algorithm: rewrite intro, copyediting
- Datalog: added discussion of fragments and expressiveness
- Database repair: created article
- Enumeration algorithm: created article
- Disjunctive normal form: added discussion about computational complexity
- Database normalization: fixed problematic examples, homogenization (more work needed)
- Robert McNaughton: created first version of the article
- Kleene's algorithm: add discussion of computational complexity
- First-order logic: add discussion of computational complexity
- Conjunctive query: add discussion of enumeration
- Monadic second-order logic: add discussion of computational complexity and enumeration
- 2–3 tree: clarifications