Demo Data from EDBT 2026 / reviewers in the wild / expert
Clara Shikhelman
dblp:164/0019
· DBLP profile ↗
3ranked-venue papers
0as first author
1since 2021 · last 2022
0000-0002-0587-7181ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 2 · 1 since 2021Security and privacy · 1
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 protocols and secure computation · 100% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Cryptographic protocols and secure computation
interactive proofs |
0.4 | 1 | 2020 | Interactive Proofs for Social Graphs · CRYPTO (3) 2020 |
Cryptographic protocols and secure computation › proof systems
zero-knowledge proofs |
0.1 | 1 | 2020 | Interactive Proofs for Social Graphs · CRYPTO (3) 2020 |
Methods — techniques the papers use, named apart from their topics
zero-knowledge · 0.4graph isomorphism · 0.4
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2022 | Additive Approximation of Generalized Turán Questions
Noga Alon, Clara Shikhelman |
Algorithmica | 2 |
| 2020 | Greedy Maximal Independent Sets via Local Limits
Michael Krivelevich, Tamás Mészáros 0001, Peleg Michaeli, Clara Shikhelman |
AofA | 4 |
| 2020 | Interactive Proofs for Social Graphs
Liran Katzir 0001, Clara Shikhelman, Eylon Yogev |
CRYPTO (3) | 2 |