Demo Data from EDBT 2026 / reviewers in the wild / expert
Meir Drubin
dblp:178/3981
· DBLP profile ↗
2ranked-venue papers
2as first author
0since 2021 · last 1971
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 2 · 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
2 papers |
Algorithms and data structures · 100% | |
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Memory systems · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Algorithms and data structures › fourier transform
fast fourier transform |
0.0 | 2 | 1971 | Computation of the Fast Fourier Transform from Data Stored in External Auxiliary Memory for Any General Radix r=2n, n ≥ 1 · IEEE Trans. Computers 1971 Kronecker Product Factorization of the FFT Matrix · IEEE Trans. Computers 1971 |
Algorithms and data structures › numerical linear algebra › matrix factorization
kronecker product factorization |
0.0 | 1 | 1971 | Kronecker Product Factorization of the FFT Matrix · IEEE Trans. Computers 1971 |
Memory systems › memory hierarchy
external memory |
0.0 | 1 | 1971 | Computation of the Fast Fourier Transform from Data Stored in External Auxiliary Memory for Any General Radix r=2n, n ≥ 1 · IEEE Trans. Computers 1971 |
Methods — techniques the papers use, named apart from their topics
kronecker product expansion · 0.0general radix FFT · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1971 | Kronecker Product Factorization of the FFT MatrixabstractA method is presented which utilizes the results of the Glassman paper [1] to factor the FFT matrix in terms of Kronecker product expansions [2], [3]. The method clarifies the Glassman results and presents them in an elegant and compact format. Meir Drubin |
IEEE Trans. Computers | 1 |
| 1971 | Computation of the Fast Fourier Transform from Data Stored in External Auxiliary Memory for Any General Radix r=2n, n ≥ 1abstractA general method is presented for the computation of the fast Fourier transform from data stored in external auxiliary memory, for any general radix r = 2nn ≥e external data storage is necessitated whenever the internal computer memory is limited. The general radix requirement arises in the tradeoff in serial FFT processor machines, between the number of passes required to address storage and the number of equivalent sparse matrix multiplicative operations required to compute the fast Fourier transform. Meir Drubin |
IEEE Trans. Computers | 1 |