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

Kedem Yakirevitch

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

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

Theory of computation · 1 · 1 since 2021

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 · 100%

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

TopicWeightPapersLastEvidence papers
Coding theory › error-correcting codes
algebraic geometry code		 1.012026
Trace Hermitian Codes Have Vanishing Bias · CCC 2026
Coding theory › error-correcting codes › block codes › linear code › code parameters
code distance		 1.012026
Trace Hermitian Codes Have Vanishing Bias · CCC 2026
Coding theory › error-correcting codes › algebraic geometry code
hermitian codes		 1.012026
Trace Hermitian Codes Have Vanishing Bias · CCC 2026

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

trace codes · 1.0bias · 1.0
YearPublicationVenuePosition
2026 Trace Hermitian Codes Have Vanishing Bias
abstract
In this work we give the first proof that Trace Hermitian codes have vanishing bias. This brings to the front the question of understanding the distance of Trace AG codes, and the fascinating possibility that in some variation they might give asymptotically good codes.
Swastik Kopparty, Amnon Ta-Shma, Kedem Yakirevitch
 CCC3