94 citations · 108 across the 6 of their papers we have counts for
7 papers
On active and passive testing
Noga Alon, Rani Hod, Amit Weinstein
Given a property of Boolean functions, what is the minimum number of queries required to determine with high probability if an input function satisfies this property or is "far" fr…
Local Correction with Constant Error Rate
Noga Alon, Amit Weinstein
A Boolean function f of n variables is said to be q-locally correctable if, given a black-box access to a function g which is "close" to an isomorphism f_sigma(x)=f_sigma(x_1, ...,…
Semi-Strong Coloring of Intersecting Hypergraphs
Eric Blais, Amit Weinstein, Yuichi Yoshida
For any c >= 2, a c-strong coloring of the hypergraph G is an assignment of colors to the vertices of G such that for every edge e of G, the vertices of e are colored by at least m…
Partially Symmetric Functions are Efficiently Isomorphism-Testable
Eric Blais, Amit Weinstein, Yuichi Yoshida
Given a function f: {0,1}^n \to {0,1}, the f-isomorphism testing problem requires a randomized algorithm to distinguish functions that are identical to f up to relabeling of the in…
Local Correction of Juntas
Noga Alon, Amit Weinstein
A Boolean function f over n variables is said to be q-locally correctable if, given a black-box access to a function g which is "close" to an isomorphism f_sigma of f, we can compu…
Simultaneous communication in noisy channels
Amit Weinstein
A sender wishes to broadcast a message of length over an alphabet to users, where each user , should be able to receive one of possible messages.…