Demo Data from EDBT 2026 / reviewers in the wild / expert
Harry Andrews
dblp:178/9175
· DBLP profile ↗
1ranked-venue papers
1as first author
0since 2021 · last 1968
—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.
| Theoretical computer science
1 paper |
Algorithms and data structures · 50% Computational complexity · 50% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Computational complexity › reduction
computational complexity reduction |
0.0 | 1 | 1968 | A High-Speed Algorithm for the Computer Generation of Fourier Transforms · IEEE Trans. Computers 1968 |
Algorithms and data structures › fourier transform
fast fourier transform |
0.0 | 1 | 1968 | A High-Speed Algorithm for the Computer Generation of Fourier Transforms · IEEE Trans. Computers 1968 |
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1968 | A High-Speed Algorithm for the Computer Generation of Fourier TransformsabstractAbstract—An efficient algorithm is presented for performing the Fourier transformation operation on a digital computer. This algorithm completes the transform calculation with Nlog2N complex additions (complex additions include complex subtractions) and ½N [log2(N)-2]+1 complex multiplications. This is a considerable savings over a brute-force method of N2complex additions and multiplications, especially when considering the use of digital machines whose MULTIPLY time is much longer than ADD time. Harry Andrews |
IEEE Trans. Computers | 1 |