From post

Induced Sorting Suffixes in External Memory with Better Design and Less Space.

, , , и . SPIRE, том 9309 из Lecture Notes in Computer Science, стр. 83-94. Springer, (2015)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

 

Другие публикации лиц с тем же именем

Characterization of 3-Regular Halin Graphs with Edge-face Total Chromatic Number Equal to Four., , и . Ars Comb., (2014)Computing Inverse ST in Linear Complexity., , и . CPM, том 5029 из Lecture Notes in Computer Science, стр. 178-190. Springer, (2008)Linear Suffix Array Construction by Almost Pure Induced-Sorting., , и . DCC, стр. 193-202. IEEE Computer Society, (2009)An Explicit Learner Profiling Model for Personalized Word Learning Recommendation., , , , , и . SETE@ICWL, том 10676 из Lecture Notes in Computer Science, стр. 495-499. Springer, (2017)Uniformly pair-bonded trees., , и . Ars Comb., (2010)Induced Sorting Suffixes in External Memory., , , и . ACM Trans. Inf. Syst., 33 (3): 12:1-12:15 (2015)Cyclic bandwidth with an edge added., , и . Discret. Appl. Math., 156 (1): 131-137 (2008)Characterization of graphs with equal bandwidth and cyclic bandwidth., , и . Discret. Math., 242 (1-3): 283-289 (2002)Scalable K-Order LCP Array Construction for Massive Data., , , и . PAAP, том 729 из Communications in Computer and Information Science, стр. 579-593. Springer, (2017)Induced Sorting Suffixes in External Memory with Better Design and Less Space., , , и . SPIRE, том 9309 из Lecture Notes in Computer Science, стр. 83-94. Springer, (2015)