4 citations · 4 across the 1 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2026
Frontier Space-Time Algorithms Using Only Full Memory
Petr Chmel, Aditi Dudeja, Michal Koucký +2
We develop catalytic algorithms for fundamental problems in algorithm design that run in polynomial time, use only workspace, and use sublinear catalytic spa…
cs.DS2015
On learning k-parities with and without noise
Arnab Bhattacharyya, Ameet Gadekar, Ninad Rajgopal
We first consider the problem of learning -parities in the on-line mistake-bound model: given a hidden vector with and a sequence of "questions" $a_1,…