Seungbum Jo
Seungbum Jo
Afiliación desconocida
Dirección de correo verificada de uni-siegen.de
TítuloCitado porAño
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
Improved space-efficient linear time algorithms for some classical graph problems
S Chakraborty, S Jo, SR Satti
arXiv preprint arXiv:1712.03349, 2017
62017
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, 2016
42016
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
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
32018
Encoding two-dimensional range top-k queries
S Jo, R Lingala, SR Satti
27th Annual Symposium on Combinatorial Pattern Matching (CPM 2016), 2016
32016
Theory and implementation of online multiselection algorithms
J Barbay, A Gupta, S Jo, SS Rao, J Sorenson
European Symposium on Algorithms, 109-120, 2013
32013
Simultaneous encodings for range and next/previous larger/smaller value queries
S Jo, SR Satti
Theoretical Computer Science 654, 80-91, 2016
22016
Compressed Range Minimum Queries
P Gawrychowski, S Jo, S Mozes, O Weimann
arXiv preprint arXiv:1902.04427, 2019
12019
Compressed Range Minimum Queries
S Jo, S Mozes, O Weimann
International Symposium on String Processing and Information Retrieval, 206-217, 2018
12018
Succinct Data Structures for Families of Interval Graphs
H Acan, S Chakraborty, S Jo, SR Satti
arXiv preprint arXiv:1902.09228, 2019
2019
Encoding two-dimensional range top-k queries revisited
S Jo, SR Satti
arXiv preprint arXiv:1809.07067, 2018
2018
Approximate Query Processing over Static Sets and Sliding Windows
RB Basat, S Jo, SR Satti, S Ugare
arXiv preprint arXiv:1809.05419, 2018
2018
Approximate rank and select queries on bit-strings and multisets
S Jo, SR Satti, S Ugare
Indexing Structures for ash based Solid State Drives
SB Jo, V Pandey, SS Rao
Analysis of Tree Indexing Structures for Flash Memory
SB Jo, V Pandey, SS Rao
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–17