S. Arora, C. Lund, R. Motwani, M. Sudan, M. Szegedy, Proof Verification, ...
traversal sequences, and the complexity of maze problems. In 20th FOCS, pages 218-223, 1979.
[2] N. Alon: Eigenvalues and expanders, Combinatorica 6(1986), 83–96. (2008)
N. Alon, S. Arora, C. Lund, R. Motwani, M. Sudan, ...
[3] N. Alon and V. D. Milman: λ1, isoperimetric inequalities for graphs and superconcentrators,
Approximating Minimum Feedback Sets and Multicuts in Directed Graphs (1998)
G. Even, J. (Seffi) Naor, B. Schieber, M. Sudan
This paper deals with approximating feedback sets in directed graphs. We consider two related problems: the weighted feedback vertex set (FVS) problem, and the weighted feedback edge set (FES)...
A Statistical Perspective on Data Mining (1997)
J. Hosking, E. Pednault, M. Sudan, Madhu Sudan
Data mining can be regarded as a collection of methods for drawing inferences from data. The aims of data mining, and some of its methods, overlap with those of classical statistics. However, there...
Linearity testing in characteristic two (1996)
The case we are interested in is when the underlying groups are G=GF(2)n and H=GF(2). In this case the collection of linear functions describe a Hadamard code of block length 2n and for an arbitrary...
Linearity Testing in Characteristic Two (1995)
M. Bellare, D. Coppersmith, J. Håstad, M. Kiwi, M. Sudan
Let Dist(f; g) = Pr u [ f(u)<F NaN> 6=g(u) ] denote the relative distance between functions f; g mapping from a group G to a group H , and let Dist(f) denote the minimum, over all linear...
Linearity testing in characteristic two (1995)
M. Bellare, J. Hastad, M. Kiwi, M. Sudan
Let Dist(f; g) =Pr u[f(u)6=g(u)] denote the relative distance between functions f; g map-ping from a group G to a group H, and let Dist(f) denote the minimum, over all linear functions...