Demo Data from VLDB 2026 / reviewers in the wild / expert
E. Pearse O'Grady
dblp:57/4733
· DBLP profile ↗
1ranked-venue papers
1as first author
0since 2021 · last 1991
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 1 · 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.
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Processor architecture and microarchitecture · 100% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Processor architecture and microarchitecture › computer arithmetic
floating-point arithmetic |
0.0 | 1 | 1991 | A Hardware-Oriented Algorithm for Floating-Point Function Generation · IEEE Trans. Computers 1991 |
Processor architecture and microarchitecture › computer arithmetic
function generation |
0.0 | 1 | 1991 | A Hardware-Oriented Algorithm for Floating-Point Function Generation · IEEE Trans. Computers 1991 |
Processor architecture and microarchitecture › computer arithmetic
elementary function evaluation |
0.0 | 1 | 1991 | A Hardware-Oriented Algorithm for Floating-Point Function Generation · IEEE Trans. Computers 1991 |
Processor architecture and microarchitecture › instruction set architecture
instruction set design |
0.0 | 1 | 1991 | A Hardware-Oriented Algorithm for Floating-Point Function Generation · IEEE Trans. Computers 1991 |
Methods — techniques the papers use, named apart from their topics
read/write memory lookup · 0.0breakpoint interval identification · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1991 | A Hardware-Oriented Algorithm for Floating-Point Function GenerationabstractAn algorithm is presented for performing accurate, high-speed, floating-point function generation for univariate functions defined at arbitrary breakpoints. Rapid identification of the breakdown interval, which includes the input argument, is shown to be the key operation in the algorithm. A hardware implementation which makes extensive use of read/write memories is used to illustrate the algorithm.> E. Pearse O'Grady, Beak-Kyu Young |
IEEE Trans. Computers | 1 |