Seungbum Jo
Seungbum Jo
소속을 알 수 없음
chungbuk.ac.kr의 이메일 확인됨
제목
인용
인용
연도
Succinct data structures for families of interval graphs
H Acan, S Chakraborty, S Jo, SR Satti
Workshop on Algorithms and Data Structures, 1-13, 2019
112019
Improved space-efficient linear time algorithms for some classical graph problems
S Chakraborty, S Jo, SR Satti
arXiv preprint arXiv:1712.03349, 2017
102017
Compressed range minimum queries
P Gawrychowski, S Jo, S Mozes, O Weimann
Theoretical Computer Science 812, 39-48, 2020
72020
Space efficient data structures for nearest larger neighbor
V Jayapaul, S Jo, V Raman, SR Satti
International Workshop on Combinatorial Algorithms, 176-187, 2014
72014
An architecture for online-diagnosis systems supporting compressed communication
S Jo, M Lohrey, D Ludwig, S Meckel, R Obermaisser, S Plasger
Microprocessors and Microsystems 61, 242-256, 2018
62018
Theory and implementation of online multiselection algorithms
J Barbay, A Gupta, S Jo, SS Rao, J Sorenson
European Symposium on Algorithms, 109-120, 2013
62013
Encoding two-dimensional range top-k queries
S Jo, R Lingala, SR Satti
Algorithmica, 1-24, 2021
52021
Compressed bit vectors based on variable-to-fixed encodings
S Jo, S Joannou, D Okanohara, R Raman, SR Satti
The Computer Journal 60 (5), 761-775, 2017
52017
Space efficient data structures for nearest larger neighbor
V Jayapaul, S Jo, R Raman, V Raman, SR Satti
Journal of Discrete Algorithms 36, 63-75, 2016
42016
Compact encodings and indexes for the nearest larger neighbor problem
S Jo, R Raman, SR Satti
International Workshop on Algorithms and Computation, 53-64, 2015
42015
Simultaneous encodings for range and next/previous larger/smaller value queries
S Jo, SR Satti
Theoretical Computer Science 654, 80-91, 2016
32016
Succinct Data Structures for Small Clique-Width Graphs
S Chakraborty, S Jo, K Sadakane, SR Satti
2021 Data Compression Conference (DCC), 133-142, 2021
22021
Succinct representations of Intersection Graphs on a Circle
H Acan, S Chakraborty, S Jo, K Nakashima, K Sadakane, SR Satti
2021 Data Compression Conference (DCC), 123-132, 2021
12021
Succinct encodings for families of interval graphs
H Acan, S Chakraborty, S Jo, SR Satti
Algorithmica 83 (3), 776-794, 2021
12021
Succinct Navigational Oracles for Families of Intersection Graphs on a Circle
H Acan, S Chakraborty, S Jo, K Nakashima, K Sadakane, SR Satti
arXiv preprint arXiv:2010.04333, 2020
12020
Combined compression of multiple correlated data streams for online-diagnosis systems
S Meckel, M Lohrey, S Jo, R Obermaisser, S Plasger
Microprocessors and Microsystems 77, 103184, 2020
12020
Compressed range minimum queries
S Jo, S Mozes, O Weimann
International Symposium on String Processing and Information Retrieval, 206-217, 2018
12018
Encoding two-dimensional range top-k queries revisited
S Jo, SR Satti
arXiv preprint arXiv:1809.07067, 2018
12018
Succinct Data Structures for Series-Parallel, Block-Cactus and 3-Leaf Power Graphs
S Chakraborty, S Jo, K Sadakane, SR Satti
arXiv preprint arXiv:2108.10776, 2021
2021
Approximate Query Processing over Static Sets and Sliding Windows
RB Basat, S Jo, SR Satti, S Ugare
Theoretical Computer Science, 2021
2021
현재 시스템이 작동되지 않습니다. 나중에 다시 시도해 주세요.
학술자료 1–20