Conference paper
(1 + ε)-approximate sparse recovery
Eric Price, David P. Woodruff
FOCS 2011
We provide a new definition for the concept of skew in parallel asynchronous communications introduced in [2]. The new definition extends and strengthens previously known results on skew. We give necessary and sufficient conditions for codes that can tolerate a certain amount of skew under the new definition. We also extend the results to codes that can tolerate a certain amount of skew and detect a larger amount of skew when the tolerating threshold is exceeded.
Eric Price, David P. Woodruff
FOCS 2011
Preeti Malakar, Thomas George, et al.
SC 2012
Elena Cabrio, Philipp Cimiano, et al.
CLEF 2013
Bowen Zhou, Bing Xiang, et al.
SSST 2008