What's new

April 16th – 19th, I’ll be at LATIN 2018 to present joint work with Daniel Štefankovič and Eric Vigoda concerning the problem of counting matchings in non-bipartite graphs.



I do research in machine learning, the theory of computing, and discrete math.

I am currently focused on provable guarantees for neural networks, defending against adversarial noise in classification tasks, and algorithmic problems in matching theory. Previous work included faster algorithms for bottleneck cases of the graph isomorphism problem. My most cited papers concern the abelian sandpile model.


Currently, I am a postdoc at the Algorithms and Randomness Center at Georgia Tech. Previously, I completed my Ph.D. at the University of Chicago under the supervision of László Babai.


My time spent on Argentine tango and Euro-style board games has in recent years yielded to the more toddler-friendly pursuits of hiking and biking.