Jonathan Z. Sun

Jonathan Zheng Sun
Assistant Professor, Computer Science

School of Computing
University of Southern Mississippi
118 College Drive #5106
Hattiesburg, MS 39406

Office: TEC 211
Phone: (601) 266-5902
Fax: (601) 266-6452
Email: jonathan.sun(at)usm.edu



About Me

Teaching

Publications

Timetable

Students

Resources

Journal Articles

[J1] David Eppstein, Michael T. Goodrich, and Jonathan Z. Sun. Skip quadtrees: Simple dynamic data structures for multidimensional point sets. International Journal of Computational Geometry and Applications, to appear. (A preliminary version appeared in SoCG'05.)
[J2] Lu Ruan, Ding-Zhu Du, Xiao-Dong Hu, Xiaohua Jia, Deying Li, and Zheng Sun. Converter placement supporting broadcast in WDM optical networks. IEEE Transactions on Computers, 50(7):750 - 758, 2001.
[J3] Guizhen Liu and Zheng Sun. (g,f)-factors in (mg+m-1,mf-m+1)-graphs. Advances in Mathematics (China), 28(4):323 - 330, 1999.
[J4] Zheng Sun and Guizhen Liu. (g,f)-factors with special properties in (mg,mf)-graphs. Acta Mathematicae Applicatae Sinica, 22(2):292 - 298, 1999. (An extended abstract appeared in Advances in Mathematics (China), 27(1):85 - 86, 1998 as a quick announcement.)

Refereed Conference Papers

[C1]Yunshu Gao, Guojun Li, Jonathan Z. Sun, and Jin Yan, Disjoint Cycles and Chorded Cycles in Graphs. In Proceedings of The 2008 International Conference on Foundations of Computer Science ((FCS 2008)), Las Vegas, July 2008.
[C2]Jonathan Z. Sun, Rui Xu, and Jianhua Yin, Group connectivity of graphs satisfying Ore-condition. In Proceedings of The 2008 International Conference on Foundations of Computer Science ((FCS 2008)), Las Vegas, July 2008.
[C3]Jonathan Z. Sun and Chaoyang Zhang, Advances on C-Planarity Testing of Extrovert C-Graphs. In Proceedings of The 2008 International Conference on Foundations of Computer Science ((FCS 2008)), Las Vegas, July 2008.
[C4]Michael T. Goodrich and Jonathan Z. Sun, Checking value-sensitive data structures in sublinear space. In Proceedings of The 18th International Symposium on Algorithms and Computation ((ISAAC 2007), LNCS 4835, pages 353 - 364, Sendai, Japan, December 2007.
[C5] Michael T. Goodrich, Michael J. Nelson, and Jonathan Z. Sun. The rainbow skip graph: A fault-tolerant constant-degree distributed data structure. In Proceedings of The 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2006), pages 384 - 393, Miami, Florida, January 2006.
[C6] Michael T. Goodrich, George S. Lueker, and Jonathan Z. Sun. C-planarity of extrovert clustered graphs. In Proceedings of The 13th International Symposium on Graph Drawing (GD 2005), LNCS 3843, pages 211 - 222, Limerick, Ireland, September 2005.
[C7] David Eppstein, Michael T. Goodrich, and Jonathan Z. Sun. The skip quadtree: A simple dynamic data structure for multidimensional data. In Proceedings of The 21st Annual ACM Symposium on Computational Geometry (SoCG 2005), pages 296 - 305, Pisa, Italy, June 2005.
[C8] Michael T. Goodrich, Jonathan Z. Sun, and Roberto Tamassia. Efficient tree-based revocation in groups of low-state devices. In Proceedings of The 24th Annual International Cryptology Conference (CRYPTO 2004), LNCS 3152, pages 511 - 527, Santa Babara, CA, August 2004.
* An unofficial ranking of some CS conferences
* CiteSeer estimated impact of CS publications (journals and conferences together)

Working Papers

[W1]Guojun Li, Bingqiang Liu, Dongsheng Che, Jonathan Z. Sun and Ying Xu. Motif length could be computational recognized. Submitted to Bioinformatics, Oxford Journals.
[W2]Guojun Li and Jonathan Z. Sun. Clustered planarity with fixed embedding and flat hierarchy. In submission.
[W3]Jianbo Qian, Jonathan Z. Sun, and Rui Xu. Bipartite toughness and k-factors in bipartite graphs. In submission.
[W4] Michael T. Goodrich, Michael J. Nelson, Jonathan Z. Sun, Roberto Tamassia, and Nikos Triandopoulos. High-assurance searching in distributed data structures. In submission.
[W5] Michael T. Goodrich, Michael J. Nelson, and Jonathan Z. Sun. Deterministic leaning-tower skip lists. Under working.