EDBT 2026 Demo / reviewers in the wild / expert
Yahli Hecht
dblp:355/6149
· DBLP profile ↗
2ranked-venue papers
2as first author
2since 2021 · last 2026
0009-0000-0596-080XORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 2 · 2 first-author · 2 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.
| Network and information security
1 paper |
Cryptographic primitives and cryptanalysis · 100% | |
| Theoretical computer science
1 paper |
Computational complexity · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Cryptographic primitives and cryptanalysis › post-quantum cryptography
lattice-based cryptography |
1.0 | 1 | 2026 | Deterministic Hardness of Approximation of Unique-SVP and GapSVP in ℓp Norms for p>2 · STOC 2026 |
Cryptographic primitives and cryptanalysis › post-quantum cryptography › lattice-based cryptography
shortest vector problem |
1.0 | 1 | 2026 | Deterministic Hardness of Approximation of Unique-SVP and GapSVP in ℓp Norms for p>2 · STOC 2026 |
Computational complexity
hardness of approximation |
1.0 | 1 | 2026 | Deterministic Hardness of Approximation of Unique-SVP and GapSVP in ℓp Norms for p>2 · STOC 2026 |
Methods — techniques the papers use, named apart from their topics
reduction techniques · 2.0lattice reduction · 2.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Deterministic Hardness of Approximation of Unique-SVP and GapSVP in ℓp Norms for p>2abstractWe establish deterministic hardness of approximation results for the Shortest Vector Problem in ℓp norm (SVPp) and for Unique-SVP (uSVPp) for all p > 2. Previously, no deterministic hardness results were known, except for ℓ∞. Yahli Hecht, Shmuel Safra |
STOC | 1 |
| 2023 | NP-Hardness of Almost Coloring Almost 3-Colorable Graphs
Yahli Hecht, Dor Minzer, Shmuel Safra |
APPROX/RANDOM | 1 |