Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page
Demo Data from SIGIR 2026 / reviewers in the wild / expert

Philip C. Curtis Jr.

dblp:91/3628 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 1961
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Applied, interdisciplinary, general and emerging computing · 2 · 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
2 papers
Mathematical optimization · 88% Algorithms and data structures · 12%

Topics — the 5 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Mathematical optimization
approximation theory		 0.021961
Asymptotic Behavior of the Best Polynomial Approximation · J. ACM 1961
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.021961
Asymptotic Behavior of the Best Polynomial Approximation · J. ACM 1961
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.011959
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
minimax approximation		 0.011959
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.011959
An Algorithm for the Determination of the Polynomial of Best Minimax Approximation to a Function Defined on a Finite Point Set · J. ACM 1959

Methods — techniques the papers use, named apart from their topics

minimax criterion · 0.0chebyshev criterion · 0.0
YearPublicationVenuePosition
1961 Asymptotic Behavior of the Best Polynomial Approximation
abstract
Let ƒ ( x ) be a real-valued function defined and continuous on [- 1, +1] and let T ( x ) = a 0 /2 + Σ ∞ k =1 a k T k ( x ) be the Fourier-Tschebycheff expansion for ƒ ( x ), that is, T k ( x ) = cos klθ , a k = 2/π ∫ π 0 ƒ (cos θ ) cos kθ dθ where x = cos θ . If P n is the class of real polynomials in x of degree less than or equal to n , we let M n = inf pϵPn sup -1≤ x ≤1 | ƒ ( x ) - p ( x ) |. M n is called the best Tschebycheff approximation to ƒ ( x ) by a polynomial of degree less than or equal to n .
Edward K. Blum, Philip C. Curtis Jr.
 J. ACM2
1959 An Algorithm for the Determination of the Polynomial of Best Minimax Approximation to a Function Defined on a Finite Point Set
abstract
Statement 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. ACM1