Homepage
He Sun
Max-Planck-Institut für Informatik
Department 1: Algorithms and Complexity
Campus E1 4, Room 325
66123 Saarbrücken
Germany
Email: hsun@mpi-inf.mpg.de
Phone: +49 681 9325 1025
Fax: +49 681 9325 1099
- Expander Graphs
- Randomized Algorithms
- Data Streaming Algorithms
- Computational Geometry
Books
- He Sun
Combinatorics in Programming Design (in Chinese).
Series on ACM/ICPC, Tsinghua University Press, 2005.
Journal Papers
- Francis Y. L. Chin, Zeyu Guo, and He Sun.
Minimum
Manhattan Network is NP-Complete.
Discrete and Computational Geometry, 45(4):701-722, 2011.
- Zeyu Guo, He Sun, and Hong Zhu
Greedy Construction of 2-Approximate Minimum
Manhattan Networks.
International Journal of Computational Geometry and Applications. 21(3): 331-350, 2011.
- He
Sun and Hong Zhu.
On Construction of Almost-Ramanujan Graphs.
Discrete
Mathematics, Algorithms and Applications, 1(2):193-203, 2009.
- He
Sun and C. K. Poon.
Two Improved Range-Efficient Algorithms for F0
Estimation.
Theoretical Computer Science, 410(11):1073-1080, 2009.
Conference Papers
- Thomas Sauerwald, and He Sun.
Tight Bounds For Randomized Load Balancing on Arbitrary Network Topologies.
Submitted. arXiv 1201.2715,
2012.
[arXiv
version] [slides]
- Daniel M. Kane, Kurt Mehlhorn, Thomas Sauerwald, and He Sun.
Counting
Arbitrary Subgraphs in Data Streams.
To appear in the 39th International Colloquium on Automata, Languages and
Programming (ICALP), 2012.
[Draft]
- George Giakkoupis, Thomas Sauerwald, He Sun, and Philipp Woelfel.
Low Randomness Rumor Spreading via Hashing.
Proceedings of the
29th International Symposium on Theoretical Aspects of Computer Science (STACS),
pages 314-325,
2012.
[Proceeding
version] [slides]
- Madhusudan Manjunath, Kurt Mehlhorn, Konstantinos Panagiotou, and He Sun.
Approximate Counting of Cycles in Streams.
Proceedings of the 19th Annual European Symposium on Algorithms (ESA), pages 677-688, 2011.
[Proceeding
version] [slides]
- Ming-Yang Kao, Henry C. M. Leung, He Sun, and Yong Zhang
Deterministic Polynomial-Time Algorithms for Designing Short DNA Worlds.
Proceedings of the 7th Annual Conference on Theory and Applications of Models of Computation
(TAMC),
pages 308-319, 2010.
[Proceeding
version]
- Francis Y. L. Chin, Zeyu Guo, and He Sun.
Minimum
Manhattan Network is NP-Complete.
Proceedings of the 25th ACM
Annual Symposium on Computational Geometry (SoCG), pages 393-402, 2009.
[Proceedings
version]
- He Sun and Hong Zhu.
On Construction of Almost-Ramanujan
Graphs.
Proceedings of the 3rd International Conference on
Combinatorial Optimization and Applications (COCOA),
pages 197-207, 2009.
[Proceeding
version]
- Zeyu Guo, He Sun and Hong Zhu.
Greedy Construction of
2-Approximation Minimum Manhattan Network.
Proceedings of the 19th
International Symposium on Algorithms and Computation (ISAAC), pages 4-15, 2008.
[Proceeding
version] [slides]
- Zeyu Guo, He Sun and Hong Zhu.
A Fast 2-Approximation Algorithm
for the Minimum Manhattan Network Problem.
Proceedings of the 4th
International Conference on Algorithmic Aspects in Information
Management (AAIM), pages 213-223, 2008.
[Proceeding
version]
- He Sun and Hong Zhu.
Two Improved Range-Efficient Algorithms for
F0 Estimation.
Proceedings of the 4th International Conference on
Theory and Applications of Models of Computation (TAMC), pages 659-669, 2007.
[Proceeding
version]
- Assistant Professor, Institute of Modern Mathematics and Physics, Fudan
University, May 2010 - present.
- Research Assistant, The University of Hong Kong, Sep. 2008 - Mar. 2009.
- Research Assistant, City University of Hong Kong, June 2006 - Dec. 2006.
- September 2005 - Decemeber 2009:
Ph. D. student in
Computer School at Fudan University, China.
My thesis won Shanghai Excellent Doctoral Dissertation Prize, 2012.
- September 2002 - June 2005:
Studies in Computer Science at Fudan University.
