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

Amir Burin

dblp:198/0966 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 2018
—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 · 100%

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

TopicWeightPapersLastEvidence papers
Information theory
channel capacity
0.312018
Reducing Guesswork via an Unreliable Oracle · IEEE Trans. Inf. Theory 2018
Information theory › algorithmic information theory
guessing
0.312018
Reducing Guesswork via an Unreliable Oracle · IEEE Trans. Inf. Theory 2018

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

strategy optimization · 0.3probabilistic analysis · 0.3
YearPublicationVenuePosition
2018 Reducing Guesswork via an Unreliable Oracle
abstract
Alice holds a random variable X, and Bob is trying to guess its value by asking questions of the form “is X = x?”. Alice answers truthfully and the game terminates once Bob guesses correctly. Before the game begins, Bob is allowed to reach out to an oracle, Carole, and ask her any yes/no question, i.e., a question of the form “is X ∈ A?”. Carole is known to lie with a given probability p. What should Bob ask Carole if he would like to minimize his expected guessing time? When Carole is always truthful (p = 0), it is not difficult to check that Bob should order the symbol probabilities in descending order and ask Carole whether the index of X with respect to this order is even or odd. We show that this strategy is almost optimal for any lying probability p, up to a small additive constant upper bounded by 1/4. We discuss a connection to the cutoff rate of the BSC with feedback.
Amir Burin, Ofer Shayevitz
IEEE Trans. Inf. Theory1