In this paper, we address the problem of determining an envy-free alloca...
In this work, we develop new insights into the fundamental problem of
co...
We initiate the study of sublinear-time algorithms that access their inp...
Given a permutation π:[k] → [k], a function f:[n] →ℝ
contains a π-appear...
We investigate sublinear-time algorithms that take partially erased grap...
Estimating the length of the longest increasing subsequence (LIS) in an ...
In modern applications of graphs algorithms, where the graphs of interes...
We study a parameter of bipartite graphs called readability, introduced ...