Demo Data from SIGIR 2026 / reviewers in the wild / expert
Werner L. Frank
dblp:15/2958
· DBLP profile ↗
3ranked-venue papers
2as first author
0since 2021 · last 1960
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Applied, interdisciplinary, general and emerging computing · 3 · 2 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
3 papers |
Mathematical optimization · 68% Algorithms and data structures · 32% |
Topics — the 9 heaviest of 10, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Mathematical optimization
approximation theory |
0.0 | 1 | 1959 | An Algorithm for the Determination of the Polynomial of Best Minimax Approximation to a Function Defined on a Finite Point Set · J. ACM 1959 |
Mathematical optimization › approximation theory
chebyshev approximation |
0.0 | 1 | 1959 | An Algorithm for the Determination of the Polynomial of Best Minimax Approximation to a Function Defined on a Finite Point Set · J. ACM 1959 |
Mathematical optimization
iterative methods |
0.0 | 1 | 1960 | Solution of Linear Systems by Richardson's Method · J. ACM 1960 |
Algorithms and data structures › numerical linear algebra
linear system solving |
0.0 | 1 | 1960 | Solution of Linear Systems by Richardson's Method · J. ACM 1960 |
Mathematical optimization › approximation theory
minimax approximation |
0.0 | 1 | 1959 | An Algorithm for the Determination of the Polynomial of Best Minimax Approximation to a Function Defined on a Finite Point Set · J. ACM 1959 |
Algorithms and data structures
numerical algorithms |
0.0 | 1 | 1959 | An Algorithm for the Determination of the Polynomial of Best Minimax Approximation to a Function Defined on a Finite Point Set · J. ACM 1959 |
Mathematical optimization › approximation theory
polynomial approximation |
0.0 | 1 | 1959 | An Algorithm for the Determination of the Polynomial of Best Minimax Approximation to a Function Defined on a Finite Point Set · J. ACM 1959 |
Mathematical optimization
root finding |
0.0 | 1 | 1958 | Finding Zeros of Arbitrary Functions · J. ACM 1958 |
Algorithms and data structures › numerical algorithms
zero finding |
0.0 | 1 | 1958 | Finding Zeros of Arbitrary Functions · J. ACM 1958 |
Methods — techniques the papers use, named apart from their topics
minimax criterion · 0.0chebyshev criterion · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1960 | Solution of Linear Systems by Richardson's Methodabstractarticle Free Access Share on Solution of Linear Systems by Richardson's Method Author: Werner L. Frank Ramo-Wooldridge, Los Angeles, California Ramo-Wooldridge, Los Angeles, CaliforniaView Profile Authors Info & Claims Journal of the ACMVolume 7Issue 3July 1960 pp 274–286https://doi.org/10.1145/321033.321041Online:01 July 1960Publication History 11citation855DownloadsMetricsTotal Citations11Total Downloads855Last 12 Months37Last 6 weeks1 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my Alerts New Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF Werner L. Frank |
J. ACM | 1 |
| 1959 | An Algorithm for the Determination of the Polynomial of Best Minimax Approximation to a Function Defined on a Finite Point SetabstractStatement of ProblemGiven a function f ( x ) defined on a finite point set S = {xl, . . ., XN}, it is desired to approximate this function by the unique polynomial p ( x ) , of degree less than or equal to n, which satisfies the minimax or Chebyshev criterionq(x) i ~l , ...,N i l l , . . ., N Philip C. Curtis Jr., Werner L. Frank |
J. ACM | 2 |
| 1958 | Finding Zeros of Arbitrary Functionsabstractarticle Free Access Share on Finding Zeros of Arbitrary Functions Author: Werner L. Frank The Ramo-Wooldridge Corporation, Los Angeles, California The Ramo-Wooldridge Corporation, Los Angeles, CaliforniaView Profile Authors Info & Claims Journal of the ACMVolume 5Issue 2April 1958 pp 154–160https://doi.org/10.1145/320924.320928Published:01 April 1958Publication History 33citation843DownloadsMetricsTotal Citations33Total Downloads843Last 12 Months56Last 6 weeks5 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my Alerts New Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF Werner L. Frank |
J. ACM | 1 |