Microsoft (United States)

output

20022013

most citedNon-Abelian Anyons and Topological Quantum Computation

7k citations

researchers with a paper here

C. Nayak20 · h 59
S. Trebst19 · h 43
A. Feiguin18 · h 31
Eric Horvitz14
M. Troyer13 · h 80
Christopher Meek4 profiles12 · h 55
Parsa Bonderson2 profiles11 · h 28
Y. Peres2 profiles11 · h 75
C. Borgs10 · h 56
J. Chayes10 · h 58
David Heckerman8
F. Heidrich-Meisner8 · h 38

collaborating institutions

University of California, Santa BarbaraUS73 papers
University of Maryland, College ParkUS21 papers
University of California, BerkeleyUS20 papers
ETH ZurichCH19 papers
California Institute of TechnologyUS17 papers
University of California, Los AngelesUS13 papers
Princeton UniversityUS12 papers
Board of the Swiss Federal Institutes of TechnologyCH11 papers
Microsoft Research (United Kingdom)GB11 papers
Stanford UniversityUS10 papers
Microsoft Research New England (United States)US8 papers
Oak Ridge National LaboratoryUS8 papers

Showing 2011 · math.COShow all

1 paper · 2 filters

math.CO2011

Longest cycles in sparse random digraphs

Michael Krivelevich, Eyal Lubetzky, Benny Sudakov

Long paths and cycles in sparse random graphs and digraphs were studied intensively in the 1980's. It was finally shown by Frieze in 1986 that the random graph $\cG(n,p)$ with $p=c…