Edward G. Thurber

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

dblp:62/5675 · DBLP profile ↗

← Back

1ranked-venue papers

1as first author

0since 2021 · last 1999

—ORCID · unresolved

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

Algorithms and data structures · 50% Mathematical optimization · 50%

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

Topic	Weight	Papers	Last	Evidence papers
Algorithms and data structures › computer arithmetic › exponentiation addition chains	0.0	1	1999	Efficient Generation of Minimal Length Addition Chains · SIAM J. Comput. 1999
Mathematical optimization discrete optimization	0.0	1	1999	Efficient Generation of Minimal Length Addition Chains · SIAM J. Comput. 1999

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

exhaustive search · 0.0

Year	Publication	Venue	Position
1999	Efficient Generation of Minimal Length Addition Chains abstract An addition chain for a positive integer n is a set 1 = a 0 < a 1 < . . . < a r =n of integers such that for each $i\ge 1$, $a_i=a_j+a_k$ for some $k\le j Edward G. Thurber	SIAM J. Comput.	1