VLDB 2026 Research / reviewers in the wild / expert
Vincent Guingona
dblp:50/11327
· DBLP profile ↗
5ranked-venue papers
4as first author
1since 2021 · last 2023
0000-0003-2301-8716ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 5 · 4 first-author · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 first-author · 1 since 2021
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2023 | Comparing approximate and probabilistic differential privacy parameters
Vincent Guingona, Alexei Kolesnikov, Julianne Nierwinski, Avery Schweitzer |
Inf. Process. Lett. | 1 |
| 2017 | Characterizing model-theoretic dividing lines via collapse of generalized indiscernibles
Vincent Guingona, Cameron Donnay Hill, Lynn Scow |
Ann. Pure Appl. Log. | 1 |
| 2015 | On a common generalization of Shelah's 2-rank, dp-rank, and o-minimal dimension
Vincent Guingona, Cameron Donnay Hill |
Ann. Pure Appl. Log. | 1 |
| 2014 | Convexly orderable Groups and Valued FieldsabstractAbstract We consider the model theoretic notion of convex orderability, which fits strictly between the notions of VC-minimality and dp-minimality. In some classes of algebraic theories, however, we show that convex orderability and VC-minimality are equivalent, and use this to give a complete classification of VC-minimal theories of ordered groups and abelian groups. Consequences for fields are also considered, including a necessary condition for a theory of valued fields to be quasi-VC-minimal. For example, the p-adics are not quasi-VC-minimal. Joseph Flenner, Vincent Guingona |
J. Symb. Log. | 2 |
| 2012 | On uniform definability of types over finite setsabstractAbstract In this paper, using definability of types over indiscernible sequences as a template, we study a property of formulas and theories called “uniform definability of types over finite sets” (UDTFS). We explore UDTFS and show how it relates to well-known properties in model theory. We recall that stable theories and weakly o-minimal theories have UDTFS and UDTFS implies dependence. We then show that all dp-minimal theories have UDTFS. Vincent Guingona |
J. Symb. Log. | 1 |