VLDB 2026 Research / reviewers in the wild / expert
Mark W. Hopkins
dblp:30/6231
· DBLP profile ↗
1ranked-venue papers
1as first author
0since 2021 · last 1999
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 1 · 1 first-author
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Theoretical computer science
1 paper |
Automata and formal languages · 56% Logic in computer science · 28% Mathematical optimization · 8% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Automata and formal languages
context-free languages |
0.0 | 1 | 1999 | Parikh's Theorem in Commutative Kleene Algebra · LICS 1999 |
Logic in computer science › algebraic logic
kleene algebra |
0.0 | 1 | 1999 | Parikh's Theorem in Commutative Kleene Algebra · LICS 1999 |
Automata and formal languages › semilinear sets
parikh's theorem |
0.0 | 1 | 1999 | Parikh's Theorem in Commutative Kleene Algebra · LICS 1999 |
Computational geometry › geometric modeling and processing › geometric constraint solving
minimal solution |
0.0 | 1 | 1999 | Parikh's Theorem in Commutative Kleene Algebra · LICS 1999 |
Mathematical optimization
polynomial inequality |
0.0 | 1 | 1999 | Parikh's Theorem in Commutative Kleene Algebra · LICS 1999 |
Methods — techniques the papers use, named apart from their topics
jacobian matrix · 0.0fixpoint · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1999 | Parikh's Theorem in Commutative Kleene AlgebraabstractParikh's theorem says that, the commutative image of every context free language is the commutative image of some regular set. Pilling has shown that this theorem is essentially a statement about least solutions of polynomial inequalities. We prove the following general theorem of commutative Kleene algebra, of which Parikh's and Pilling's theorems are special cases: Every finite system of polynomial inequalities f/sub i/(x/sub 1/,...,x/sub n/)/spl les/x/sub i/, 1/spl les/i/spl les/n, over a commutative Kleene algebra K has a unique least solution in K/sup n/; moreover, the components of the solution are given by polynomials in the coefficients of the f/sub i/. We also give a closed-form solution in terms of the Jacobian matrix of the system. Mark W. Hopkins, Dexter Kozen |
LICS | 1 |