Author of the publication

Eigenvectors of Random Graphs: Nodal Domains.

, , and . APPROX-RANDOM, volume 4627 of Lecture Notes in Computer Science, page 436-448. Springer, (2007)

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.

 

Other publications of authors with the same name

Are Stable Instances Easy?, and . ICS, page 332-341. Tsinghua University Press, (2010)A Physical Interpretation of Graph Connectivity, and Its Algorithmic Applications, , and . FOCS, page 39-48. IEEE Computer Society, (1986)Bounds on Universal Sequences., , , , and . SIAM J. Comput., 18 (2): 268-277 (1989)Linear Codes and Character Sums., and . Combinatorica, 22 (4): 497-522 (2002)Random Lifts Of Graphs: Perfekt Matchings., and . Combinatorica, 25 (4): 407-424 (2005)The Equivalence of Two Problems on the Cube., and . J. Comb. Theory, Ser. A, 61 (1): 142-146 (1992)Random Lifts Of Graphs: Perfect Matchings, and . Combinatorica, 25 (4): 407-424 (2005)An upper bound on the number of high-dimensional permutations., and . Combinatorica, 34 (4): 471-486 (2014)Neighborhood Preserving Hashing and Approximate Queries., , , , and . SIAM J. Discret. Math., 15 (1): 73-85 (2001)An Extremal Problem on Degree Sequences of Graphs., and . Graphs Comb., 18 (3): 573-582 (2002)