Christian Doczkal
where else to find them
what they talk about
where they keep going back
no series more than once — all 1 in the filters
on a stage with
never shared a talk
who talks about the same things
one talk is not yet a subject
| title | conference | date |
|---|---|---|
| Completeness of an Axiomatization of Graph Isomorphism via Graph Rewriting in Coq | CPP 2020 | 2020-01-20 |
Formal proof in Coq (MathComp) shows completeness: an 11‑axiom equational theory proves two terms equivalent iff their interpreted directed labeled graphs are… | ||
| nothing matches | ||