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

L. Birge

dblp:63/268 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 2005
—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
Information theory · 50% Mathematical optimization · 50%

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

TopicWeightPapersLastEvidence papers
Information theory
hypothesis testing
0.112005
A new lower bound for multiple hypothesis testing · IEEE Trans. Inf. Theory 2005
Mathematical optimization
multiple hypothesis testing
0.112005
A new lower bound for multiple hypothesis testing · IEEE Trans. Inf. Theory 2005

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

minimax analysis · 0.1
YearPublicationVenuePosition
2005 A new lower bound for multiple hypothesis testing
abstract
The purpose of this correspondence is to give a new, easily tractable, and sharp lower bound for the maximal error in multiple hypothesis testing with an application to nonasymptotic lower bounds for the minimax risk of estimators.
L. Birge
IEEE Trans. Inf. Theory1