Kunihiko Sadakane

The University of Tokyo — Japan

Computer Science · Physical Sciences

50h-index19.0kcitations359works0.22yr avg
OpenAlex↗ORCID↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Algorithms and Data Compression(128), DNA and Biological Computing(45), Stellar, planetary, and galactic studies(42), Astronomy and Astrophysical Research(38), Network Packet Processing and Optimization(34)

Publications359 total

Surpassing the Word Size Limitation of TFHE with Noise Calibration
2025Open Access
Succinct Representations of Graphs
2025Open Access
Oblivious Suffix Sorting: A Multi-Party Computation Scheme for Secure and Efficient Suffix Sorting
Lecture notes in computer science·2025
Succinct Data Structures for Baxter Permutation and Related
SSRN Electronic Journal·2025Open Access
Secure Parallel Computation with Oblivious State Transitions
2024Open Access
A Search for QPOs in the Blazar OJ287: Preliminary Results from the 2015/2016 Observing Campaign
Florida International University Digital Commons (Florida International University)·2024Open Access
Succinct data structures for bounded clique-width graphs
Discrete Applied Mathematics·2024· 2 cited
Succinct Data Structure for Graphs with d-Dimensional t-Representation
2024· 1 cited
τλ-Index: Locating Rare Patterns in Similar Strings
2024
A Simple Representation of Tree Covering Utilizing Balanced Parentheses and Efficient Implementation of Average-Case Optimal RMQs
arXiv (Cornell University)·2024Open Access
$\Tau\Lambda$-Index: A New R-Index Variant for Locating Rare Patterns in Repetitive Corpus
SSRN Electronic Journal·2024Open Access
Succinct Data Structure for Chordal Graphs with Bounded Vertex Leafage
arXiv (Cornell University)·2024Open Access
Succinct Data Structure for Graphs with $D$-Dimensional $T$-Representation
SSRN Electronic Journal·2024Open Access
Succinct Data Structures for Baxter Permutation and Related Families
arXiv (Cornell University)·2024Open Access
Succinct data structure for path graphs
Information and Computation·2023· 3 cited
Succinct Data Structure for Graphs with $d$-Dimensional $t$-Representation
arXiv (Cornell University)·2023Open Access
Succinct Data Structures for SP, Block-Cactus and 3-Leaf Power Graphs
International Journal of Foundations of Computer Science·2023· 1 cited
Practical Implementations of Compressed RAM
2023
Fully Dynamic No-Back-Edge-Traversal Forest via 2D-Range Queries
International Journal of Computational Geometry & Applications·2023
Shortest Beer Path Queries Based on Graph Decomposition
arXiv (Cornell University)·2023Open Access
page 1 of 18Next →

Frequent Co-authors

L. O. Takalo(11), K. Nilsson(9), M. Villata(9), C. M. Raiteri(9), O. M. Kurtanidze(9), V. M. Larionov(9), M. G. Nikolashvili(8), M. Ibrahimov(8), L. Lanteri(8), T. Pursimo(7), V. A. Hagen‐Thorn(7), M. Pasanen(7), M. F. Aller(7), J. Ohlert(7), S. Ciprini(6), A. Frasca(6), E. Marilli(6), H. D. Aller(6), A. Berdyugin(6), Y. Y. Kovalev(6)