Jonathan Z. Sun

Jonathan Z. Sun
Associate 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

Teaching

Research

Recent Talks

[T5] Discrete Algorithms for Wireless Information Flow
[T4] Succinct Geometric Greedy Routing
[T3] Data Oblivious Algorithms
[T2] Checking Value-Sensitive Data Structures
[T1] Clustered Planarity of Clustered Graphs

Recent Papers

[R5] Jonathan Z. Sun. The Application of One-Way Hash Functions in Information Security Protocols. In Proceedings of The 2010 International Conference on Security and Management (SAM 2010), Las Vegas, July 2010.
[R4] Lei Cao, Andrew Strelzoff, and Jonathan Z. Sun. A Lower Bound on Greedy Embedding in Euclidean Plane. In Proceedings of The 5th International Conference on Grid and Pervasive Computing (GPC 2010), LNCS 6104, pages 214–223, Taiwan, R.O.C., May 2010.
[R3] Jonathan Z. Sun, Shaoen Wu, and Shouhuai Xu. Assigning Applications to Servers: A Simulation Study. In Proceedings of The 43rd Annual Simulation Symposium (ANSS 2010), Floriday, USA, Apr. 2010.
[R2] Lei Cao, AndrewStrelzoff, and Jonathan Z. Sun. On Succinctness of Geometric Greedy Routing in Euclidean Plane. In Proceedings of The 10th International Symposium on Pervasive Systems, Algorithms and Networks (I-SPAN’09), pages 326 – 331, Kaohsiung, Taiwan, R.O. China, Dec. 2009.
[R1] Michael T. Goodrich, Michael J. Nelson, Jonathan Z. Sun, Roberto Tamassia, and Nikos Triandopoulos. Reliable Resource Searching in P2P Networks. In Proceedings of 5th International ICST Conference on Security and Privacy in Communication Networks (SecureComm’09), Athens, Greece, Sept. 2009.

Selected Older Papers

[S5]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.
[S4] 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.
[S3] 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.
[S2] 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.
[S1] 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.