61 citations · 177 across the 33 of their papers we have counts for
6 papers · 1 filter
Antichain Codes
Benjamin Gunby, Xiaoyu He, Bhargav Narayanan +1
A family of sets is said to be an antichain if for all distinct , and it is said to be a distance- code if every pair of distinct elements of …
Approximating binary longest common subsequence in almost-linear time
Xiaoyu He, Ray Li
The Longest Common Subsequence (LCS) is a fundamental string similarity measure, and computing the LCS of two strings is a classic algorithms question. A textbook dynamic programmi…
Hypergraph Ramsey numbers of cliques versus stars
David Conlon, Jacob Fox, Xiaoyu He +3
Let denote the complete -uniform hypergraph on vertices and the -uniform hypergraph on vertices consisting of all edges incid…
Logarithmically larger deletion codes of all distances
Noga Alon, Gabriela Bourla, Ben Graham +2
The deletion distance between two binary words is the smallest such that and share a common subsequence of length . A set of binary words o…
Set-coloring Ramsey numbers via codes
David Conlon, Jacob Fox, Xiaoyu He +3
For positive integers with , the set-coloring Ramsey number is the minimum such that if every edge of the complete graph receives a set of c…
Identifying the Deviator
Noga Alon, Benjamin Gunby, Xiaoyu He +2
A group of players are supposed to follow a prescribed profile of strategies. If they follow this profile, they will reach a given target. We show that if the target is not reached…