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 EDBT 2026 / reviewers in the wild / expert

Tal Hershko

dblp:378/5670 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
2since 2021 · last 2025
0009-0008-9415-4698ORCID · reported

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

Theory of computation · 2 · 1 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.

Theoretical computer science
1 paper
Logic in computer science · 67% Graph algorithms and graph theory · 33%

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

TopicWeightPapersLastEvidence papers
Logic in computer science
finite model theory		 0.812024
First order distinguishability of sparse random graphs · LICS 2024
Graph algorithms and graph theory
random graphs		 0.812024
First order distinguishability of sparse random graphs · LICS 2024
Logic in computer science › finite model theory
zero-one laws		 0.812024
First order distinguishability of sparse random graphs · LICS 2024

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

quantifier depth · 0.8first-order logic · 0.8
YearPublicationVenuePosition
2025 First-Order Logic with Equicardinality in Random Graphs
Simi Haber, Tal Hershko, Mostafa Mirabi, Saharon Shelah
 CSL2
2024 First order distinguishability of sparse random graphs
abstract
We study the problem of distinguishing between two independent samples [EQUATION], [EQUATION] of a binomial random graph G(n, p) by first order (FO) sentences. Shelah and Spencer proved that, for a constant α ∈ (0, 1), G(n, n−-α) obeys FO zero-one law if and only if α is irrational. Therefore, for irrational α ∈ (0, 1), any fixed FO sentence does not distinguish between [EQUATION] with asymptotical probability 1 (w.h.p.) as n → ∞. We show that the minimum quantifier depth kα of a FO sentence [EQUATION] distinguishing between [EQUATION] depends on how closely α can be approximated by rationals:
Tal Hershko, Maksim Zhukovskii
 LICS1