VLDB 2026 Research / reviewers in the wild / expert
Sapir Ben-Shahar
dblp:399/2530
· DBLP profile ↗
2ranked-venue papers
2as first author
2since 2021 · last 2026
0009-0005-1331-0141ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 2 · 2 first-author · 2 since 2021
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | On quasi-reducibility for c.e. sets Part I. The structure of the Q -degrees and the sQ -degreesabstractAbstract We study the structure of the c.e. $Q$- and $sQ$-degrees. For both structures, we show that there are join irreducible degrees but no Ahmad pairs. We show that the structures are not distributive, and that the lattice $N_{5}$ embeds in both structures. On the other hand the lattice $M_{5}$ cannot be embedded in the c.e. $sQ$-degrees, but a critical triple can be embedded. Finally, we show that no initial segment of the c.e. $sQ$-degrees or the c.e. $Q$-degrees is a lattice. Sapir Ben-Shahar, Rodney G. Downey, Mariya Ivanova Soskova |
J. Log. Comput. | 1 |
| 2025 | Comparing notions of presentability in Polish spaces and Polish groupsabstractA recent area of interest in computable topology compares different notions of effective presentability for topological spaces. In this paper, we show that up to isometry, there is a compact connected Polish space that has both left-c.e. and right-c.e. Polish presentations, but has no computable Polish presentation. We also construct a Polish group that has both left-c.e. and right-c.e. Polish group presentations, but lacks a computable Polish presentation, up to topological isomorphism. Sapir Ben-Shahar, Heer Tern Koh |
Ann. Pure Appl. Log. | 1 |