1 citations · 1 across the 3 of their papers we have counts for
7 papers · 1 filter
Coded trace reconstruction in a constant number of traces
Joshua Brakensiek, Ray Li, Bruce Spang
The coded trace reconstruction problem asks to construct a code such that any is recoverable from independent outputs ("traces") of from a binary…
Enumeration of Preferred Extensions in Almost Oriented Digraphs
Serge Gaspers, Ray Li
In this paper, we present enumeration algorithms to list all preferred extensions of an argumentation framework. This task is equivalent to enumerating all maximal semikernels of a…
A Tight Analysis of Greedy Yields Subexponential Time Approximation for Uniform Decision Tree
Ray Li, Percy Liang, Stephen Mussmann
Decision Tree is a classic formulation of active learning: given hypotheses with nonnegative weights summing to 1 and a set of tests that each partition the hypotheses, output…
On edge-ordered Ramsey numbers
Jacob Fox, Ray Li
An edge-ordered graph is a graph with a linear ordering of its edges. Two edge-ordered graphs are equivalent if their is an isomorphism between them preserving the ordering of the…
Max-Cut in Degenerate -Free Graphs
Ray Li, Nitya Mani
We obtain several lower bounds on the of -degenerate -free graphs. Let denote the smallest of an -free -degenerate grap…
Lifted multiplicity codes and the disjoint repair group property
Ray Li, Mary Wootters
Lifted Reed Solomon Codes (Guo, Kopparty, Sudan 2013) were introduced in the context of locally correctable and testable codes. They are multivariate polynomials whose restriction…