He is currently on faculty of the Computer Science Department at Worcester Polytechnic Institute, MA, United States and is also a senior research fellow at the Alfréd Rényi Institute of Mathematics of the Hungarian Academy of Sciences.
[1] He obtained a Diploma in Mathematics from Eötvös Loránd University and a PhD in Computer Science from Rutgers, under the advisement of Endre Szemerédi.
[2] Perhaps his best known result is the Blow-Up Lemma,[3][4] in which, together with János Komlós and Endre Szemerédi he proved that the regular pairs in Szemerédi regularity lemma behave like complete bipartite graphs under the correct conditions.
A hypergraph variant was developed later by Peter Keevash.
He is member of the editorial board of the European Journal of Combinatorics.