I am a lecturer of Computer Science at the University of Bristol. Prior to that, I was a senior researcher at the Max Planck Institute for Informatics, and led the reserach group on Combinatorics, Computing, and Randomness. I was affiliated with the Cluster of Excellence on "Multimodal Computing and Interaction" at the Saarland University from 2013 - 2015, and led the research group on Randomised Algorithms. I was awarded a Simons-Berkeley Research Fellowship, and worked at the Simons Institute for the Theory of Computing, UC Berkeley in 2014. I obtained a Bachelor Degree from Fudan University (2005), and a PhD from Fudan University (2010). I won the President Medal of Fudan University in 2004, awarded to 2 out of 45,000 students that year. My thesis won Shanghai Distinguished Dissertation Award. My main research areas range over the fields of spectral graph theory, applied probablity and statistics, combinatorial optimisation, matrix analysis, and machine learning.

News

  • Paper titled "Communication-Optimal Distributed Clustering" was accepted at NIPS '16.
  • Invited talk at Oxford University, December 2016

Research

some of my recent publications

Spectral Graph Theory

  • Communication-Optimal Distributed Clustering, with J. Chen, D. Woodruff, and Q. Zhang (NIPS'16)
            Conference version
  • Constructing Linear-Sized Spectral Sparsification in Almost-Linear Time, with Y. Lee (FOCS'15)
            Conference version | arXiv version
  • Partitioning Well-Clustered Graphs: Spectral Clustering Works! with R. Peng, and L. Zanetti (COLT'15)
            Conference version | arXiv version | Poster
  • Distributed Graph Clustering by Load Balancing with L. Zanetti
            arXiv version

Distributed Computing

  • Gossip vs. Markov Chains, and Randomness-Efficient Rumor Spreading. with Z. Guo (SODA'15)
            Conference version | arXiv version
  • Randomized Rumor Spreading: the Effect of the Network Topology. with X.Giménez, K.Panagiotou, and T.Sauerwald (CPC'15)
           
    Journal version
  • Tight Bounds For Randomized Load Balancing on Arbitrary Network Topologies. with T. Sauerwald (FOCS'12)
            Conference version | arXiv version
  • Low Randomness Rumor Spreading via Hashing. with G. Giakkoupis, T. Sauerwald, and P. Woelfel (STACS'12).
            Conference version

Applied Probability

Data Streaming Algorithms

  • Counting Hypergraphs in Data Streams.
            arXiv version
  • Counting Arbitrary Subgraphs in Data Streams. with D.Kane, K.Mehlhorn, and T.Sauerwald (ICALP'12)
            Conference version
  • Approximate Counting of Cycles in Streams. with M.Manjunath, K.Mehlhorn, and K.Panagiotou (ESA'11)
            Conference version  

Computational Geometry

Teaching

Courses


Advanced Algorithms

  • University of Bristol, Spring 2016

Data Structures and Algorithms

  • University of Bristol, Fall 2015

Advanced Algorithms

  • University of Bristol, Spring 2015

Great Ideas in Theoretical Computer Science

  • Saarland University, Spring 2014

Spectral Graph Theory

  • Saarland University, Spring 2014

Great Ideas in Theoretical Computer Science

  • Saarland University, Spring 2013

Spectral Graph Theory and Applications

  • Saarland University, Spring 2012

Expander Graphs in Computer Science

  • Saarland University, Spring 2011

Students

  • Luca Zanetti. PhD student, University of Bristol, Oct. 2012 - present
  • Pavel Kolev. master student, Max Planck Institute for Informatics, 2012 - 2013.

Talks

a selection of my conference and invited talks

Distributed Graph Clustering by Load Balancing

  • BIRS Workshop on Algebraic and Spectral Graph Theory, July 2016

Constructing Linear-Sized Spectral Sparsification in Almost-Linear Time

  • Probability and Statistics Seminar Series, University of Bristol, May 2016
  • The Technical University of Dortmund, March 2016
  • Dagstuhl Seminar on Data Structures and Advanced Models of Computation on Big Data, March 2016
  • The University of Birmingham, February 2016
  • The University of Warwick, November 2015
  • Max Planck Institute for Informatics, Saarbruecken, September 2015
  • EPFL, Lausanne, August 2015

Heat Kernel in Graphs: A Journey from Random Walks to Geometry, and Back

  • The University of Warwick, November 2015
  • The University of Middlesex, October 2015
  • EPFL, Lausanne, August 2015
  • Institute of Software, Chinese Academy of Sciences, Beijing, July 2015
  • The University of Cambridge, Cambridge, June 2015
  • Workshop on Random Walks on Random Graphs and Applications, Eindhoven, April 2015
  • Max Planck Institute for Informatics, January 2015

Partitioning Well-Clustered Graphs with k-Means and Heat Kernel

  • Workshop on Graph Limits and Statistics, Isaac Newtwon Institute, Cambridge, July 2016
  • Reunion Workshop at the Simons Institute for the Theory of Computing, UC Berkeley, December 2015
  • Workshop on Distributed Machine Learning and Optimization, Edinburgh, November 2015
  • Tsinghua University, Beijing, July 2015
  • The University of Bristol, Bristol, July 2015
  • Simons Institute for the Theory of Computing, UC Berkeley, December 2014

Gossip vs. Markov Chains, and Randomness-Efficient Rumor Spreading

  • The University of Bristol, Bristol, April 2015
  • Simons Institute for the Theory of Computing, UC Berkeley, October 2014

Efficient Algorithms in Massive Graphs

  • The University of California, Davis, November 2014
  • The University of Bristol, Bristol, July 2014
  • Eindhoven University of Technology, Eindhoven, May 2014
  • Joint MPI-INF/MPI-SWS/MMCI Lecture Series, Saarbrücken, December 2013

Randomness-Effiient Rumor Spreading

  • Max Planck Institute for Informatics, Saarbrücken, April 2013
  • Dagstuhl Seminar: Epidemic Algorithms and Processes, January 2013

From Kant To Turing: On the Philosophical Foundations of Computer Science

  • Max Planck Institute for Informatics, Saarbrücken, November 2012

Counting Arbitrary Subgraphs in Data Streams

  • Dagstuhl Seminar: Data Structures and Advanced Models of Computation on Big Data, February 2014
  • The University of Cambridge, October 2013
  • Dagstuhl Seminar: Computational Counting, January. 2013
  • Stanford University, Palo Alto, November 2012
  • California Institute of Technology, Pasadena, October 2012
  • Workshop on Algorithms for Data Streams, Dortmund, July 2012
  • 39th International Colloquium on Automata, Languages and Programming, Warwick, July 2012

Tight Bounds For Randomized Load Balancing on Arbitrary Network Topologies

  • Conference on Applications of Graph Spectra in Computer Science, Bellaterra, July 2012
  • 5th Annual Meeting of the Asian Association for Algorithms and Computation, Shanghai, April 2012

Low Randomness Rumor Spreading via Hashing

  • 29th International Symposium on Theoretical Aspects of Computer Science, Paris, March 2012
  • 12th Max Planck Advanced Course on the Foundations of Computer Science, Saarbrücken, August 2011

Approximate Counting of Cycles in Streams

  • 19th Annual European Symposium on Algorithms, Saarbrücken, September 2011
  • 15th International Conference on Random Structures and Algorithms, Atlanda, May 2011

Last updatd on August, 12, 2016