VLDB 2026 Research / reviewers in the wild / expert
Scott Sutherland
dblp:35/1443
· DBLP profile ↗
3ranked-venue papers
0as first author
0since 2021 · last 2019
0000-0001-9129-3344ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Applied, interdisciplinary, general and emerging computing · 2Theory of computation · 1
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 |
Algorithms and data structures · 46% Computational complexity · 46% Computational geometry · 7% |
Topics — the 4 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Computational complexity
algebraic complexity |
0.0 | 1 | 1994 | Polynomial Root-Finding Algorithms and Branched Covers · SIAM J. Comput. 1994 |
Computational complexity
lower bounds |
0.0 | 1 | 1994 | Polynomial Root-Finding Algorithms and Branched Covers · SIAM J. Comput. 1994 |
Algorithms and data structures
numerical algorithms |
0.0 | 1 | 1994 | Polynomial Root-Finding Algorithms and Branched Covers · SIAM J. Comput. 1994 |
Algorithms and data structures › symbolic computation › computational algebra › polynomial evaluation
polynomial root finding |
0.0 | 1 | 1994 | Polynomial Root-Finding Algorithms and Branched Covers · SIAM J. Comput. 1994 |
Methods — techniques the papers use, named apart from their topics
path-lifting · 0.0branched covering · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2019 | Quality Analysis of the All of Us Research Program Health Surveys
Robert M. Cronin, Sarah Feng, Brandy Mapes, Roxana Loperena-Cortes, Regina Andrade, David Schlundt, Ken Wallston, Mick P. Couper, Scott Sutherland, Cindy Chen, Joshua C. Denny |
AMIA | 9 |
| 2017 | The Data and Research Center of the All of Us Research Program: Framework for a National Cohort Program and Research Opportunities
Robert J. Carroll, Joshua C. Mandel, Karthik Natarajan, Scott Sutherland, Joshua C. Denny |
AMIA | 4 |
| 1994 | Polynomial Root-Finding Algorithms and Branched CoversabstractA family of root-finding algorithms is constructed that combines knowledge of the branched covering structure of a polynomial with a path-lifting algorithm for finding individual roots. In particular, the family includes an algorithm that computes an $ \epsilon $-factorization of a polynomial of degree d that has an arithmetic complexity of $\mathcal{O}(d(\log d)^2 |\log \epsilon | + d^2 (\log d)^2 )$. At the present time, this complexity is the best known in terms of the degree. Myong-Hi Kim, Scott Sutherland |
SIAM J. Comput. | 2 |