VLDB 2026 Research / reviewers in the wild / expert

Samuel Coskey

dblp:47/7226 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
1since 2021 · last 2023
0000-0002-7023-9725ORCID · corroborated

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

Theory of computation · 3 · 2 first-author · 1 since 2021
YearPublicationVenuePosition
2023 Computable Reducibility of Equivalence Relations and an Effective jump operator
abstract
Abstract We introduce the computable FS-jump, an analog of the classical Friedman–Stanley jump in the context of equivalence relations on the natural numbers. We prove that the computable FS-jump is proper with respect to computable reducibility. We then study the effect of the computable FS-jump on computably enumerable equivalence relations (ceers).
John D. Clemens, Samuel Coskey, Gianni Krakoff
 J. Symb. Log.2
2010 Borel reductions of profinite actions of SLn(Z)
Samuel Coskey
 Ann. Pure Appl. Log.1
2009 Infinite-Time Turing Machines and Borel Reducibility
Samuel Coskey
 CiE1