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

A. L. Wells Jr.

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

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

Theory 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
Coding theory · 44% Algorithms and data structures · 44% Computational complexity · 13%

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

TopicWeightPapersLastEvidence papers
Algorithms and data structures › number-theoretic algorithms
discrete logarithm		 0.011984
A polynomial form for logarithms modulo a prime · IEEE Trans. Inf. Theory 1984
Coding theory › finite fields
finite field arithmetic		 0.011984
A polynomial form for logarithms modulo a prime · IEEE Trans. Inf. Theory 1984
Computational complexity › boolean function analysis
polynomial representation		 0.011984
A polynomial form for logarithms modulo a prime · IEEE Trans. Inf. Theory 1984
YearPublicationVenuePosition
1984 A polynomial form for logarithms modulo a prime
abstract
An explicit polynomial form for logarithm functions modulo a prime p is given; the coefficients have a surprisingly simple form. It follows that any polynomial that represents a logarithm modulophas at leastp - 2nonzero coefficients and is therefore highly inefficient to use as a computational method.
A. L. Wells Jr.
 IEEE Trans. Inf. Theory1