VLDB 2026 Research / reviewers in the wild / expert
P. G. Walsh
dblp:00/5076
· DBLP profile ↗
1ranked-venue papers
1as first author
0since 2021 · last 1998
—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 |
Computational complexity · 67% Coding theory · 33% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Computational complexity
algebraic complexity |
0.0 | 1 | 1998 | A Polynomial Time Complexity Bound for Computations on Curves · SIAM J. Comput. 1998 |
Coding theory
algebraic curves |
0.0 | 1 | 1998 | A Polynomial Time Complexity Bound for Computations on Curves · SIAM J. Comput. 1998 |
Computational complexity › complexity measures
bit complexity |
0.0 | 1 | 1998 | A Polynomial Time Complexity Bound for Computations on Curves · SIAM J. Comput. 1998 |
Methods — techniques the papers use, named apart from their topics
power series · 0.0eisenstein's theorem · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1998 | A Polynomial Time Complexity Bound for Computations on CurvesabstractIn this paper, we use a recent quantitative version of Eisenstein's theorem on power series expansions of algebraic functions to compute a polynomial-time bit complexity bound for the computation of the genus of an algebraic curve over the rationals. The result is extendable to any field of characteristic zero which is finitely generated over the rationals. P. G. Walsh |
SIAM J. Comput. | 1 |