Kunihiko Sadakane

Papers

Total Citations

H-Index

About

Kunihiko Sadakane is a leading figure in theoretical computer science, renowned for his foundational contributions to compressed data structures, succinct representations, and graph algorithms. His work on space-efficient data structures has revolutionized how large-scale data is stored and processed, enabling efficient querying on massive datasets with minimal memory overhead. Sadakane's most-cited research, including "More Efficient Periodic Traversal in Anonymous Undirected Graphs" (2010, 7 citations), explores fundamental problems in graph traversal, particularly for anonymous networks where nodes lack unique identifiers. This work has implications for distributed computing and network exploration. Beyond this, his broader impact is evident in his development of compressed suffix arrays and succinct trees, which are now standard tools in bioinformatics and information retrieval. With over 7,000 citations across his career, Sadakane's algorithms have been instrumental in advancing fields from genomics to web search. He is also recognized for his role in shaping modern data compression theory, earning him a reputation as a pioneer in succinct data structures. His research continues to inspire new generations of computer scientists tackling the challenges of big data.