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

Andrew L. Rukhin

dblp:00/6943 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 2005
0000-0002-1146-8595ORCID · corroborated

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

Artificial intelligence and machine learning · 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
1 paper
Information theory · 100%
Network and information security
1 paper
Cryptographic primitives and cryptanalysis · 100%

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

TopicWeightPapersLastEvidence papers
Information theory › information-theoretic security
equivocation		 0.011996
The error probability, entropy, and equivocation when the number of input messages increases · IEEE Trans. Inf. Theory 1996
Cryptographic primitives and cryptanalysis › information-theoretic security
perfect secrecy		 0.011996
The error probability, entropy, and equivocation when the number of input messages increases · IEEE Trans. Inf. Theory 1996
YearPublicationVenuePosition
2005 Fusion of biometric algorithms in the recognition problem
Andrew L. Rukhin, Igor Malioutov
 Pattern Recognit. Lett.1
1996 The error probability, entropy, and equivocation when the number of input messages increases
abstract
We derive an inequality for the minimum error probability which shows that in many situations this quantity converges to its supremum as the number of possible values of the input signal increases. The asymptotic behavior of this probability is related to the behavior of the equivocation. Implications for asymptotic rates of certain codes and for perfect secrecy of cryptosystems are mentioned.
Andrew L. Rukhin, Igor Vajda
 IEEE Trans. Inf. Theory1