Wing‐Kin Sung

Papers

Total Citations

H-Index

About

Wing‐Kin Sung is a distinguished computer scientist whose research focuses on graph theory, distributed computing, and algorithm design. His work has significantly advanced the understanding of traversal and exploration in anonymous networks, particularly through his seminal paper "More Efficient Periodic Traversal in Anonymous Undirected Graphs" (2010), which has garnered 7 citations and remains a foundational reference in the field. Sung's contributions address fundamental challenges in how agents navigate unknown or unlabeled environments, offering efficient strategies for periodic traversal that minimize redundancy and resource usage. This work has implications for robotics, network routing, and distributed systems, where autonomous agents must operate without global knowledge. Beyond this, Sung's broader research portfolio spans computational complexity, graph algorithms, and the design of provably optimal protocols. His ability to distill complex problems into elegant algorithmic solutions has made him a respected figure in theoretical computer science. For students and researchers, Sung's work exemplifies how rigorous mathematical analysis can solve practical challenges in decentralized systems, inspiring further exploration into the limits and possibilities of anonymous network exploration.