VLDB 2026 Research / reviewers in the wild / expert
David A. Andrews
dblp:144/2711
· DBLP profile ↗
2ranked-venue papers
0as first author
2since 2021 · last 2024
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 2 · 2 since 2021
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Comer Schemes, Relation Algebras, and the Flexible Atom ConjectureabstractIn this paper, we consider relational structures arising from Comer's finite field construction, where the cosets need not be sum free. These Comer schemes generalize the notion of a Ramsey scheme and may be of independent interest. As an application, we give the first finite representation of $34_{65}$. This leaves $33_{65}$ as the only remaining relation algebra in the family $N_{65}$ with a flexible atom that is not known to be finitely representable. Motivated by this, we complement our upper bounds with some lower bounds. Using a SAT solver, we show that $33_{65}$ is not finitely representable on fewer than $24$ points, and that $33_{65}$ does not admit a cyclic group representation on fewer than $120$ points. We also employ a SAT solver to show that $34_{65}$ is not representable on fewer than $24$ points. Fundamenta Informaticae final journal version; previous conference version appeared in RAMiCS 2023 Jeremy F. Alm, David A. Andrews, Michael Levet |
Fundam. Informaticae | 2 |
| 2023 | Comer Schemes, Relation Algebras, and the Flexible Atom Conjecture
Jeremy F. Alm, David A. Andrews, Michael Levet |
RAMiCS | 2 |