Community Detection in the Stochastic Block Model: Approximate Belief Propagation
The stochastic block model is one of the simplest models for a random graph with different types of vertices, known as communities. In this talk I will describe an efficient algorithm that distinguishes between vertices…
Open Solving Library for ODEs
C# library that implements algorithms for the numerical solution of ordinary differential equations. The library incorporates .NET desktop and Silverlight builds.
Outlaw distributions and locally decodable codes
Lipschitz Percolation
The systematic normal form of lattices, and their algorithmic applications. [joint work with Peter Shor; Lior Eldar]
The systematic normal form of lattices is a new echelon form of lattices in which the entries obey a certain co-primality condition. These lattices can be used to approximate efficiently any lattice, and hence are…
Verifiable Functional Encryption
Hardness of Approximation Between P and NP
The first question we computer scientists ask when facing a new algorithmic challenge is: is it NP-hard, or is it in P? Surprisingly, for many important problems, the answer is “neither!” I will discuss recent…