54 citations · 69 across the 4 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2011★ 54 cited
Fast Local Computation Algorithms
Ronitt Rubinfeld, Gil Tamir, Shai Vardi +1
For input , let denote the set of outputs that are the "legal" answers for a computational problem . Suppose and members of are so large that there is not t…
cs.DS2010★ 5 cited
Property Testing via Set-Theoretic Operations
Victor Chen, Madhu Sudan, Ning Xie
Given two testable properties and , under what conditions are the union, intersection or set-difference of these two properties also testable? We…