Seungbum Jo

Orcid: 0000-0002-8644-3691

According to our database1, Seungbum Jo authored at least 32 papers between 2013 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Succinct Data Structures for SP, Block-Cactus and 3-Leaf Power Graphs.
Int. J. Found. Comput. Sci., September, 2024

Energy efficient sorting, selection and searching.
Theor. Comput. Sci., 2024

Succinct data structures for bounded clique-width graphs.
Discret. Appl. Math., 2024

Succinct Data Structures for Baxter Permutation and Related Families.
Proceedings of the 35th International Symposium on Algorithms and Computation, 2024

A Simple Representation of Tree Covering Utilizing Balanced Parentheses and Efficient Implementation of Average-Case Optimal RMQs.
Proceedings of the 32nd Annual European Symposium on Algorithms, 2024

Succinct Data Structure for Graphs with d-Dimensional t-Representation.
Proceedings of the Data Compression Conference, 2024

2023
Practical Implementation of Encoding Range Top-2 Queries.
Comput. J., November, 2023

Compact representation of interval graphs and circular-arc graphs of bounded degree and chromatic number.
Theor. Comput. Sci., 2023

Cell-Probe Lower Bound for Accessible Interval Graphs.
CoRR, 2023

Practical Implementations of Compressed RAM.
Proceedings of the Data Compression Conference, 2023

2022
Succinct navigational oracles for families of intersection graphs on a circle.
Theor. Comput. Sci., 2022

Space-Efficient Data Structure for Next/Previous Larger/Smaller Value Queries.
Proceedings of the LATIN 2022: Theoretical Informatics, 2022

Compact Representation of Interval Graphs of Bounded Degree and Chromatic Number.
Proceedings of the Data Compression Conference, 2022

2021
Approximate query processing over static sets and sliding windows.
Theor. Comput. Sci., 2021

Encoding Two-Dimensional Range Top-k Queries.
Algorithmica, 2021

Succinct Encodings for Families of Interval Graphs.
Algorithmica, 2021

Succinct Data Structures for Small Clique-Width Graphs.
Proceedings of the 31st Data Compression Conference, 2021

Succinct representations of Intersection Graphs on a Circle.
Proceedings of the 31st Data Compression Conference, 2021

Succinct Data Structures for Series-Parallel, Block-Cactus and 3-Leaf Power Graphs.
Proceedings of the Combinatorial Optimization and Applications, 2021

2020
Compressed range minimum queries.
Theor. Comput. Sci., 2020

Combined compression of multiple correlated data streams for online-diagnosis systems.
Microprocess. Microsystems, 2020

2019
Succinct Data Structures for Families of Interval Graphs.
Proceedings of the Algorithms and Data Structures - 16th International Symposium, 2019

2018
An architecture for online-diagnosis systems supporting compressed communication.
Microprocess. Microsystems, 2018

Compressed Range Minimum Queries.
Proceedings of the String Processing and Information Retrieval, 2018

Encoding Two-Dimensional Range Top-k Queries Revisited.
Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

2017
Improved Space-efficient Linear Time Algorithms for Some Classical Graph Problems.
CoRR, 2017

Compressed Bit vectors Based on Variable-to-Fixed Encodings.
Comput. J., 2017

2016
Simultaneous encodings for range and next/previous larger/smaller value queries.
Theor. Comput. Sci., 2016

Space efficient data structures for nearest larger neighbor.
J. Discrete Algorithms, 2016

2015
Compact Encodings and Indexes for the Nearest Larger Neighbor Problem.
Proceedings of the WALCOM: Algorithms and Computation - 9th International Workshop, 2015

2014
Space Efficient Data Structures for Nearest Larger Neighbor.
Proceedings of the Combinatorial Algorithms - 25th International Workshop, 2014

2013
Theory and Implementation of Online Multiselection Algorithms.
Proceedings of the Algorithms - ESA 2013, 2013


  Loading...