Pierre Bourhis
where else to find them
no profile links on file
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 |
|---|---|---|
| Circuits for Querying Trees: A Little Survey | Logic and Algebra for Query Evaluation 2023 | 2023-11-13 |
Claims that MSO tree queries compile to Boolean circuits (a smooth d-DNNF or a zero-suppressed semantic d-DNNF) via tree automata construction in time linear… | ||
| nothing matches | ||