Presentation 2018-03-05
[Invited Talk] Space-Efficient Algorithms for Longest Increasing Subsequence
Masashi Kiyomi, Hirotaka Ono, Yota Otachi, Pascal Schweitzer, Jun Tarui,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English)
Keyword(in Japanese) (See Japanese page)
Keyword(in English)
Paper # COMP2017-48
Date of Issue 2018-02-26 (COMP)

Conference Information
Committee COMP
Conference Date 2018/3/5(1days)
Place (in Japanese) (See Japanese page)
Place (in English) Osaka Prefecture Univ.
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair Hiro Ito(Univ. of Electro-Comm.)
Vice Chair Yushi Uno(Osaka Pref. Univ.)
Secretary Yushi Uno(Seikei Univ.)
Assistant

Paper Information
Registration To Technical Committee on Theoretical Foundations of Computing
Language ENG
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) [Invited Talk] Space-Efficient Algorithms for Longest Increasing Subsequence
Sub Title (in English)
Keyword(1)
1st Author's Name Masashi Kiyomi
1st Author's Affiliation Yokohama City University(Yokohama City Univ.)
2nd Author's Name Hirotaka Ono
2nd Author's Affiliation Nagoya University(Nagoya Univ.)
3rd Author's Name Yota Otachi
3rd Author's Affiliation Kumamoto University(Kumamoto Univ.)
4th Author's Name Pascal Schweitzer
4th Author's Affiliation Technical University Kaiserslautern(TU Kaiserslautern)
5th Author's Name Jun Tarui
5th Author's Affiliation The University of Electro-Communications(UEC)
Date 2018-03-05
Paper # COMP2017-48
Volume (vol) vol.117
Number (no) COMP-474
Page pp.pp.19-19(COMP),
#Pages 1
Date of Issue 2018-02-26 (COMP)