Demo Data from EDBT 2026 / reviewers in the wild / expert
Shahar Mozes
dblp:88/2881
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2022
—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 · 56% Computational complexity · 44% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Coding theory › local testability
locally testable codes |
0.6 | 1 | 2022 | Locally testable codes with constant rate, distance, and locality · STOC 2022 |
Computational complexity
property testing |
0.6 | 1 | 2022 | Locally testable codes with constant rate, distance, and locality · STOC 2022 |
Coding theory
error-correcting codes |
0.2 | 1 | 2022 | Locally testable codes with constant rate, distance, and locality · STOC 2022 |
Methods — techniques the papers use, named apart from their topics
property testing · 0.6local testing · 0.6
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2022 | Locally testable codes with constant rate, distance, and localityabstractA locally testable code (LTC) is an error correcting code that has a property-tester. The tester reads q bits that are randomly chosen, and rejects words with probability proportional to their distance from the code. The parameter q is called the locality of the tester. Irit Dinur, Shai Evra, Ron Livne, Alexander Lubotzky, Shahar Mozes |
STOC | 5 |