Demo Data from EDBT 2026 / reviewers in the wild / expert
Ernest R. Davidson
dblp:57/2198
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 1973
—ORCID · unresolved
Domains — the database's venue-derived domains; a paper can count in several
Theory 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 |
Mathematical optimization · 50% Computational geometry · 50% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Computational geometry › polytopes › polyhedra
polyhedral computation |
0.0 | 1 | 1973 | An Algorithm for the Extreme Rays of a Pointed Convex Polyhedral Cone · SIAM J. Comput. 1973 |
Mathematical optimization
polyhedral cone |
0.0 | 1 | 1973 | An Algorithm for the Extreme Rays of a Pointed Convex Polyhedral Cone · SIAM J. Comput. 1973 |
Methods — techniques the papers use, named apart from their topics
polar cone duality · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1973 | An Algorithm for the Extreme Rays of a Pointed Convex Polyhedral ConeabstractAn algorithm for exhibiting the extreme rays of a pointed convex polyhedral cone is described. The cone is assumed to be initially defined by a system of homogeneous linear inequalities. The method differs from prior procedures in two respects. First, faces of lower dimension than facets for the polar convex cone are used to serially determine the extreme rays; second, the method allows for the possibility of symmetry considerations involving the extreme rays to reduce storage requirements and computation effort. Walter B. McRae, Ernest R. Davidson |
SIAM J. Comput. | 2 |