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.

Howard B. Demuth

dblp:82/5528 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
0since 2021 · last 1994
—ORCID · none

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

Systems, architecture and hardware · 3 · 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 · 87% Information theory · 13%

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

TopicWeightPapersLastEvidence papers
Algorithms and data structures › sequence algorithms › sorting
comparison sorting
0.011985
Electronic Data Sorting · IEEE Trans. Computers 1985
Algorithms and data structures › sequence algorithms
sorting
0.011985
Electronic Data Sorting · IEEE Trans. Computers 1985

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

shannon information measure · 0.0comparison bounds · 0.0
YearPublicationVenuePosition
1994 Measuring the Impulse Response of Linear Systems using an Analog Correlator
abstract
A crosscorrelation method of measuring the impulse response of linear systems is presented. The technique, implementation and limitations of this method are discussed. A simple system is designed and built using discrete components and the impulse response of a linear circuit is measured. Theoretical, software simulation, and experimental results are presented.>
Harry W. Li, Michael J. Dallabetta, Howard B. Demuth
ISCAS3
1985 Parallel Signal Processing Research on the HEP
Martin T. Hagan, Howard B. Demuth, Paul Hartono Singgih
ICPP2
1985 Electronic Data Sorting
abstract
This paper presents results of a study of the fundamentals of sorting. Emphasis is placed on understanding sorting and on minimizing the time required to sort with electronic equipment of reasonable cost. Sorting is viewed as a combination of information gathering and item moving activities. Shannon's communication theory measure of information is applied to assess the difficulty of various sorting problems. Bounds on the number of comparisons required to sort are developed, and optimal or near-optimal sorting schemes are described and investigated. Three abstract sorting models based on cyclic, linear, and randomaccess memories are defined. Optimal or near-optimal sorting methods are developed for the models and their parallel-register extensions. A brief review of the origin of the work and some of its hypotheses is also presented.
Howard B. Demuth
IEEE Trans. Computers1