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.

Sarangan Krishna Kumar

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

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

Applied, interdisciplinary, general and emerging computing · 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
Coding theory · 100%

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

TopicWeightPapersLastEvidence papers
Coding theory
boolean functions
0.011981
Probabilistic Aspects of Boolean Switching Functions via a New Transform · J. ACM 1981
Coding theory › boolean functions
walsh transform
0.011981
Probabilistic Aspects of Boolean Switching Functions via a New Transform · J. ACM 1981

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

reed-muller canonical form · 0.0probability expression · 0.0
YearPublicationVenuePosition
1981 Probabilistic Aspects of Boolean Switching Functions via a New Transform
abstract
A new algorithm Js mtroduced for computing the probability expression, F = Pr(fl 1), that a Boolean functionfequals 1 as a function of the probabihUes that its inputs equal 1.It is shown that this expression ts umquely characterized by a spectrum vector S. A new matrix P which has the property that S I AP, where A is the mmterm vector of the function f, is then introduced.Next, S is related to the Reed-Muller canomc (RMC) form of the function f, and it is shown that the RMC coefficient vector a can be obtained trivially from the vector S. The reverse transformation is computationally harder.It is also shown how S and P can be used to compute the Walsh ccoefficlents off ~x WORDS AND PmtAsEs: Boolean switching functions, probability expression, random testing, Reed-Muller canonic form, transform techniques, Walsh transform CR CATEGORIES: 5.25, 5.5, 6.1
Sarangan Krishna Kumar, Melvin A. Breuer
J. ACM1