EDBT 2026 Demo / reviewers in the wild / expert
Paul L. Richman
dblp:03/3179
· DBLP profile ↗
2ranked-venue papers
1as first author
0since 2021 · last 1974
—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 · 70% Automated reasoning and model checking · 15% Distributed computing theory · 15% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Mathematical optimization › numerical analysis
interval arithmetic |
0.0 | 2 | 1974 | Computing a Subinterval of the Image · J. ACM 1974 A Midpoint Phenomenon · J. ACM 1973 |
Mathematical optimization
numerical analysis |
0.0 | 2 | 1974 | Computing a Subinterval of the Image · J. ACM 1974 A Midpoint Phenomenon · J. ACM 1973 |
Distributed computing theory › distributed algorithms
function computation |
0.0 | 1 | 1974 | Computing a Subinterval of the Image · J. ACM 1974 |
Automated reasoning and model checking
image computation |
0.0 | 1 | 1974 | Computing a Subinterval of the Image · J. ACM 1974 |
Mathematical optimization
numerical computation |
0.0 | 1 | 1973 | A Midpoint Phenomenon · J. ACM 1973 |
Methods — techniques the papers use, named apart from their topics
interval analysis · 0.0error analysis · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1974 | Computing a Subinterval of the ImageabstractThe problem of computing a desired function value to within a prescribed tolerance can be formulated in the following two distinct ways: Formulation I: Given x and ∈ > 0, compute f (x) to within ∈. Formulation II: Given only that x is in a closed interval X, compute a subinterval of the image, f (X) = { f (x) : x ∈ X}. The first formulation is applicable when x is known to arbitrary accuracy. The second formulation is applicable when x is known only to a limited accuracy, in which case the tolerance is prescribed albeit indirectly by the interval X, and one must be satisfied with all or part of the set f (X) of possible function values. Elsewhere the author has presented an efficient solution to Formulation I for any rational f and many nonrational f . B. A. Chartres has presented an efficient solution to Formulation II for a very restricted class of rational f and for a few nonrational f . In this paper a solution to Formulation II for the arbitrary nonconstant rational f is presented. By bounding df/dx away from zero over some subset of X, it is shown how to reduce Formulation II to Formulation I, yielding the solution given here. In generalizing to vector-valued functions f, Chartres has solved Formulation II only for rational f which satisfy a linear system of equations, while this paper presents a solution for arbitrary non-degenerate rational vector-valued f. Paul L. Richman |
J. ACM | 1 |
| 1973 | A Midpoint PhenomenonabstractFinite-precision interval arithmetic evaluation of a function ƒ of n variables at an n -dimensional rectangle T which is the Cartesian product of intervals yields an interval which is denoted by F ( T ). Correspondingly, finite-precision real arithmetic evaluation of ƒ at the midpoint m ( T ) of T yields a number which is denoted by f ( m ( T )) Ε F ( T ). Often, f ( m ( T )) is surprisingly close to m ( F ( T )). The purpose of this note is to provide some insight into this phenomenon by examining the case of infinite precision and rational functions. It is shown that if the gradient of ƒ is nonzero at a fixed point t Ε T , then as the maximum edge length w ( T ) of T approaches zero, [ m ( F ( T )) - ƒ( m ( T ))]/ w ( F ( T )) = O ( w ( T )), where F ( T ) and ƒ( m ( T )) denote the infinite-precision results corresponding to F ( T ) and f ( m ( T )), respectively. More precise results are derived when ƒ is one of +, -, ×, or /. A. J. Goldstein, Paul L. Richman |
J. ACM | 2 |