P. S. Moharir

dblp:87/3448 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 1985
—ORCID · none

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

Systems, architecture and hardware · 1 · 1 first-authorTheory of computation · 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
2 papers
Algorithms and data structures · 64% Coding theory · 28% Combinatorics and discrete mathematics · 8%

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

TopicWeightPapersLastEvidence papers
Algorithms and data structures › linear algebra › linear algebra algorithms
fast transforms
0.011985
Extending the Scope of Golub's Method Beyond Complex Multiplication · IEEE Trans. Computers 1985
Coding theory › sequences
pseudorandom sequences
0.011977
Generalized PN sequences (Corresp.) · IEEE Trans. Inf. Theory 1977
Coding theory
sequences
0.011977
Generalized PN sequences (Corresp.) · IEEE Trans. Inf. Theory 1977
Coding theory › sequences
ternary sequences
0.011977
Generalized PN sequences (Corresp.) · IEEE Trans. Inf. Theory 1977
Combinatorics and discrete mathematics › combinatorial design
latin squares
0.011985
Extending the Scope of Golub's Method Beyond Complex Multiplication · IEEE Trans. Computers 1985
Algorithms and data structures › symbolic computation › computational algebra › algebraic algorithms
multiplication
0.011985
Extending the Scope of Golub's Method Beyond Complex Multiplication · IEEE Trans. Computers 1985

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

golub's method · 0.0periodic autocorrelation analysis · 0.0
YearPublicationVenuePosition
1985 Extending the Scope of Golub's Method Beyond Complex Multiplication
abstract
Golub's method of complex multiplication is extended to other contexts such as multiplication with some 2 x 2 matrices and Latin squares. Some applications in further speeding up the FFT or other fast transforms are discussed.
P. S. Moharir
IEEE Trans. Computers1
1977 Generalized PN sequences (Corresp.)
abstract
Multilevel sequences having strictly zero periodic autocorrelation for nonzero shifts are discussed, and combinational admissibility conditions for ternary sequences are formulated. A number of new ternary sequences are constructed.
P. S. Moharir
IEEE Trans. Inf. Theory1