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 EDBT 2026 / reviewers in the wild / expert

Richard V. Swartwood

dblp:177/1223 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1973
—ORCID · none

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

Systems, architecture and hardware · 1

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% Coding theory · 50%

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

TopicWeightPapersLastEvidence papers
Algorithms and data structures › linear algebra › linear algebra algorithms
fast transforms		 0.011973
A Hybrid Walsh Transform Computer · IEEE Trans. Computers 1973
Coding theory › boolean functions
walsh transform		 0.011973
A Hybrid Walsh Transform Computer · IEEE Trans. Computers 1973

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

recursive algorithm · 0.0
YearPublicationVenuePosition
1973 A Hybrid Walsh Transform Computer
abstract
A hybrid special-purpose computer based on a recursive algorithm for discrete Walsh transform computations is described. The device uses feedback in time to reduce the required number of summing junctions to N, the number of data points to be transformed. Computations are completed in 700 μs when N = 256.
Joseph W. Carl, Richard V. Swartwood
 IEEE Trans. Computers2