E-LIB Suche - Ergebnisse für: Sadakane, Kunihiko

1

Succinct data structure for path graphs:

Balakrishnan, Girish ; Chakraborty, Sankardeep ; Narayanaswamy, N.S..
Information and Computation. 296 (2024) - p. 105124 , 2024

Link: https://doi.org/10.1016/..

2

Succinct data structures for bounded clique-width graphs:

Chakraborty, Sankardeep ; Jo, Seungbum ; Sadakane, Kunihiko.
Discrete Applied Mathematics. 352 (2024) - p. 55-68 , 2024

Link: https://doi.org/10.1016/..

3

Succinct Data Structure for Graphs with d-Dimensional t-Rep..:

, In: 2024 Data Compression Conference (DCC),

Balakrishnan, Girish ; Chakraborty, Sankardeep ; Jo, Seungbum.. - p. 546-546 , 2024

Link: https://doi.org/10.1109/..

4

τλ-Index: Locating Rare Patterns in Similar Strings:

, In: 2024 Data Compression Conference (DCC),

Chen, Long-Qi ; Tsao, Che-Wei ; Deng, Jin-Jie.. - p. 233-242 , 2024

Link: https://doi.org/10.1109/..

5

Succinct representation for (non)deterministic finite autom..:

Chakraborty, Sankardeep ; Grossi, Roberto ; Sadakane, Kunihiko.
Journal of Computer and System Sciences. 131 (2023) - p. 1-12 , 2023

Link: https://doi.org/10.1016/..

6

Practical Implementations of Compressed RAM:

, In: 2023 Data Compression Conference (DCC),

Jo, Seungbum ; Park, Wooyoung ; Sadakane, Kunihiko. - p. 168-177 , 2023

Link: https://doi.org/10.1109/..

7

Efficient Computation of Betweenness Centrality by Graph De..:

INOHA, Tatsuya ; SADAKANE, Kunihiko ; UNO, Yushi.
IEICE Transactions on Information and Systems. E105.D (2022) 3 - p. 451-458 , 2022

Link: https://doi.org/10.1587/..

8

Succinct navigational oracles for families of intersection ..:

Acan, Hüseyin ; Chakraborty, Sankardeep ; Jo, Seungbum...
Theoretical Computer Science. 928 (2022) - p. 151-166 , 2022

Link: https://doi.org/10.1016/..

9

FM-Indexing Grammars Induced by Suffix Sorting for Long Pat..:

, In: 2022 Data Compression Conference (DCC),

Deng, Jin-Jie ; Hon, Wing-Kai ; Koppl, Dominik. - p. 63-72 , 2022

Link: https://doi.org/10.1109/..

10

Succinct Data Structure for Path Graphs:

, In: 2022 Data Compression Conference (DCC),

Balakrishnan, Girish ; Narayanaswamy, N S ; Chakraborty, Sankardeep. - p. 262-271 , 2022

Link: https://doi.org/10.1109/..

11

A framework for designing space-efficient dictionaries for ..:

Ganguly, Arnab ; Hon, Wing-Kai ; Sadakane, Kunihiko...
Theoretical Computer Science. 854 (2021) - p. 52-62 , 2021

Link: https://doi.org/10.1016/..

12

Approximating the Canadian Traveller Problem with Online Ra..:

Demaine, Erik D. ; Huang, Yamming ; Liao, Chung-Shou.
Algorithmica. 83 (2021) 5 - p. 1524-1543 , 2021

Link: https://doi.org/10.1007/..

13

Orthogonal Range Search Data Structures:

, In: Sublinear Computation Paradigm,

Ishiyama, Kazuki ; Sadakane, Kunihiko - p. 121-147 , 2021

Link: https://doi.org/10.1007/..

14

Approximating Dynamic Weighted Vertex Cover with Soft Capac..:

Wei, Hao-Ting ; Hon, Wing-Kai ; Horn, Paul..
Algorithmica. 84 (2021) 1 - p. 124-149 , 2021

Link: https://doi.org/10.1007/..

15

Succinct Representations for (Non)Deterministic Finite Auto..:

, In: Language and Automata Theory and Applications; Lecture Notes in Computer Science,

Chakraborty, Sankardeep ; Grossi, Roberto ; Sadakane, Kunihiko. - p. 55-67 , 2021

Link: https://doi.org/10.1007/..