VLDB 2026 Research / reviewers in the wild / expert

Bo-Jun Yuan

dblp:265/8676 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
3since 2021 · last 2026
—ORCID · none

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

Theory of computation · 2 · 1 first-author · 2 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 since 2021
YearPublicationVenuePosition
2026 On Zero Skip-Cost Generalized Fractional-Repetition Codes from Covering Designs
abstract
We study generalized fractional repetition codes that have zero skip cost, and which are based on covering designs. We show that a zero skip cost is always attainable, perhaps at a price of an expansion factor compared with the optimal size of fractional repetition codes based on Steiner systems. We provide three constructions, as well as show non-constructively, that no expansion is needed for all codes based on sufficiently large covering systems.
Bo-Jun Yuan, Moshe Schwartz 0001
 ISIT2
2026 On Zero Skip-Cost Generalized Fractional-Repetition Codes From Covering Designs
abstract
We study generalized fractional repetition codes that have zero skip cost, and which are based on covering designs. We show that a zero skip cost is always attainable, perhaps at a price of an expansion factor compared with the optimal size of fractional repetition codes based on Steiner systems. We provide three constructions, as well as show non-constructively, that no expansion is needed for all codes based on sufficiently large covering systems.
Bo-Jun Yuan, Moshe Schwartz 0001
 IEEE Trans. Inf. Theory2
2025 The number of dissociation sets in connected graphs
Bo-Jun Yuan, Hong-Yan Ge, Shi-Cai Gong
 Discret. Appl. Math.1