Presentation 2016-12-22
[Invited Talk] Theory and Practice of Succinct Data Structures
Kunihiko Sadakane,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) Succinct data structures are data structures that can compress data to the limit and perform search and other operations quickly without decompressing the data. In this talk, the basic theory and applications of succinct data structures are explained.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Succinct data structure / Data compression / string / tree / graph
Paper # ISEC2016-82,COMP2016-43
Date of Issue 2016-12-14 (ISEC, COMP)

Conference Information
Committee COMP / ISEC
Conference Date 2016/12/21(2days)
Place (in Japanese) (See Japanese page)
Place (in English) Hiroshima University
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair Hiroo Itoh(Univ. of Electro-Comm.) / Masahiro Mambo(Kanazawa Univ.)
Vice Chair Yuushi Uno(Osaka Pref. Univ.) / Kazuto Ogawa(NHK) / Atsushi Fujioka(Kanagawa Univ.)
Secretary Yuushi Uno(Seikei Univ.) / Kazuto Ogawa(Kobe Univ.) / Atsushi Fujioka(Toshiba)
Assistant / Toshihiro Ohigashi(Tokai Univ.) / Yuuji Suga(IIJ) / Atsuo Inomata(Tokyo Denki Univ.)

Paper Information
Registration To Technical Committee on Theoretical Foundations of Computing / Technical Committee on Information Security
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) [Invited Talk] Theory and Practice of Succinct Data Structures
Sub Title (in English)
Keyword(1) Succinct data structure
Keyword(2) Data compression
Keyword(3) string
Keyword(4) tree
Keyword(5) graph
1st Author's Name Kunihiko Sadakane
1st Author's Affiliation The University of Tokyo(Univ. of Tokyo)
Date 2016-12-22
Paper # ISEC2016-82,COMP2016-43
Volume (vol) vol.116
Number (no) ISEC-380,COMP-381
Page pp.pp.71-71(ISEC), pp.71-71(COMP),
#Pages 1
Date of Issue 2016-12-14 (ISEC, COMP)