( en | de | ru )

 

Disambiguation of "Alon, Noga"

Author of the publication

copydeleteadd this publication to your clipboard
Approximating the Cut-Norm via Grothendieck's Inequality

, and . SIAM J. Comput., 35 (4): 787-803 (2006)
DOI: 10.1137/S0097539704441629

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Noga Alon

Alon Geller

Alon Tauber

Alon Padovicz

Oliver Noga

 

Other publications of authors with the same name

On (epsilon, k)-min-wise independent permutations., , and . Random Struct. Algorithms, 31 (3): 384-389 (2007)Random sampling and approximation of MAX-CSP problems., , , and . STOC, page 232-239. ACM, (2002)The String Chromatic Number of a Graph.. Random Struct. Algorithms, 3 (1): 1-8 (1992)A Separator Theorem for Graphs with an Excluded Minor and its Applications, , and . STOC, page 293-299. ACM, (1990)Color-coding, , and . J. ACM, 42 (4): 844--856 (July 1995)Better Algorithms and Bounds for Directed Maximum Leaf Problems., , , , and . FSTTCS, volume 4855 of Lecture Notes in Computer Science, page 316-327. Springer, (2007)The space complexity of approximating the frequency moments, , and . J. Comput.\~Syst.\~Sci., 58 (1): 137--147 (1999)The Probabilistic Method, and . Wiley, Hoboken, NJ, Third edition, (2008)Eigenvalues, Geometric Expanders, Sorting in Rounds, and Ramsey Theory. Combinatorica, 6 (3): 207--219 (1986)Approximating the Cut-Norm via Grothendieck's Inequality, and . SIAM J. Comput., 35 (4): 787-803 (2006)