5 citations · 6 across the 2 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
cs.DS2018
Multitasking Capacity: Hardness Results and Improved Constructions
Noga Alon, Jonathan D. Cohen, Thomas L. Griffiths +5
We consider the problem of determining the maximal such that every matching of size (or at most ) in a bipartite graph contains an induced matching of s…
cs.CC2018
An Entropy Lower Bound for Non-Malleable Extractors
Tom Gur, Igor Shinkar
A -non-malleable extractor is a function that takes two inputs, a weak source of min-entr…