Go to the corresponding LIPIcs Volume Portal 
Kiyomi, Masashi ; Ono, Hirotaka ; Otachi, Yota ; Schweitzer, Pascal ; Tarui, Jun
pdfformat: 

@InProceedings{kiyomi_et_al:LIPIcs:2018:8491, author = {Masashi Kiyomi and Hirotaka Ono and Yota Otachi and Pascal Schweitzer and Jun Tarui}, title = {{SpaceEfficient Algorithms for Longest Increasing Subsequence}}, booktitle = {35th Symposium on Theoretical Aspects of Computer Science (STACS 2018)}, pages = {44:144:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959770620}, ISSN = {18688969}, year = {2018}, volume = {96}, editor = {Rolf Niedermeier and Brigitte Vall{\'e}e}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2018/8491}, URN = {urn:nbn:de:0030drops84911}, doi = {10.4230/LIPIcs.STACS.2018.44}, annote = {Keywords: longest increasing subsequence, patience sorting, spaceefficient algorithm} }
Keywords:  longest increasing subsequence, patience sorting, spaceefficient algorithm  
Collection:  35th Symposium on Theoretical Aspects of Computer Science (STACS 2018)  
Issue Date:  2018  
Date of publication:  27.02.2018 