1. Cryptographic Hardness of Random Local Functions;computational complexity;2015-12-22
2. Community Detection in General Stochastic Block models: Fundamental Limits and Efficient Algorithms for Recovery;2015 IEEE 56th Annual Symposium on Foundations of Computer Science;2015-10
3. Colouring Non-sparse Random Intersection Graphs;Mathematical Foundations of Computer Science 2009;2009
4. List Set Colouring: Bounds and Algorithms;Combinatorics, Probability and Computing;2006-08-15
5. The Diameter of Randomly Perturbed Digraphs and Some Applications;Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques;2004