default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSeungbum Jo
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j15]Sankardeep Chakraborty, Seungbum Jo
, Kunihiko Sadakane, Srinivasa Rao Satti:
Succinct data structures for bounded clique-width graphs. Discret. Appl. Math. 352: 55-68 (2024)- [j14]Sankardeep Chakraborty, Seungbum Jo, Kunihiko Sadakane, Srinivasa Rao Satti:
Succinct Data Structures for SP, Block-Cactus and 3-Leaf Power Graphs. Int. J. Found. Comput. Sci. 35(6): 705-722 (2024) - [j13]Varunkumar Jayapaul, Seungbum Jo, Krishna V. Palem, Srinivasa Rao Satti:
Energy efficient sorting, selection and searching. Theor. Comput. Sci. 1002: 114592 (2024) - [c22]Girish Balakrishnan, Sankardeep Chakraborty, Seungbum Jo, N. S. Narayanaswamy, Kunihiko Sadakane:
Succinct Data Structure for Graphs with d-Dimensional t-Representation. DCC 2024: 546 - [c21]Kou Hamada, Sankardeep Chakraborty, Seungbum Jo, Takuto Koriyama, Kunihiko Sadakane, Srinivasa Rao Satti:
A Simple Representation of Tree Covering Utilizing Balanced Parentheses and Efficient Implementation of Average-Case Optimal RMQs. ESA 2024: 64:1-64:18 - [i13]Kou Hamada, Sankardeep Chakraborty, Seungbum Jo, Takuto Koriyama, Kunihiko Sadakane, Srinivasa Rao Satti:
A Simple Representation of Tree Covering Utilizing Balanced Parentheses and Efficient Implementation of Average-Case Optimal RMQs. CoRR abs/2407.00573 (2024) - [i12]Sankardeep Chakraborty, Seungbum Jo, Geunho Kim, Kunihiko Sadakane:
Succinct Data Structures for Baxter Permutation and Related Families. CoRR abs/2409.16650 (2024) - 2023
- [j12]Wooyoung Park, Seungbum Jo, Srinivasa Rao Satti:
Practical Implementation of Encoding Range Top-2 Queries. Comput. J. 66(11): 2794-2809 (2023) - [j11]Sankardeep Chakraborty, Seungbum Jo:
Compact representation of interval graphs and circular-arc graphs of bounded degree and chromatic number. Theor. Comput. Sci. 941: 156-166 (2023) - [c20]Seungbum Jo, Wooyoung Park, Kunihiko Sadakane, Srinivasa Rao Satti:
Practical Implementations of Compressed RAM. DCC 2023: 168-177 - [c19]Varunkumar Jayapaul, Seungbum Jo, Krishna V. Palem, Srinivasa Rao Satti:
Energy Efficient Sorting, Selection and Searching. WALCOM 2023: 179-190 - [i11]Girish Balakrishnan, Sankardeep Chakraborty, Seungbum Jo, N. S. Narayanaswamy, Kunihiko Sadakane:
Succinct Data Structure for Graphs with d-Dimensional t-Representation. CoRR abs/2311.02427 (2023) - [i10]Sankardeep Chakraborty, Christian Engels, Seungbum Jo, Mingmou Liu:
Cell-Probe Lower Bound for Accessible Interval Graphs. CoRR abs/2311.02839 (2023) - 2022
- [j10]Hüseyin Acan, Sankardeep Chakraborty, Seungbum Jo, Kei Nakashima, Kunihiko Sadakane, Srinivasa Rao Satti:
Succinct navigational oracles for families of intersection graphs on a circle. Theor. Comput. Sci. 928: 151-166 (2022) - [c18]Sankardeep Chakraborty, Seungbum Jo:
Compact Representation of Interval Graphs of Bounded Degree and Chromatic Number. DCC 2022: 103-112 - [c17]Seungbum Jo, Geunho Kim:
Space-Efficient Data Structure for Next/Previous Larger/Smaller Value Queries. LATIN 2022: 71-87 - [i9]Seungbum Jo, Geunho Kim:
Space-efficient data structure for next/previous larger/smaller value queries. CoRR abs/2209.00158 (2022) - 2021
- [j9]Hüseyin Acan, Sankardeep Chakraborty, Seungbum Jo, Srinivasa Rao Satti:
Succinct Encodings for Families of Interval Graphs. Algorithmica 83(3): 776-794 (2021) - [j8]Seungbum Jo, Rahul Lingala, Srinivasa Rao Satti:
Encoding Two-Dimensional Range Top-k Queries. Algorithmica 83(11): 3379-3402 (2021) - [j7]Ran Ben Basat, Seungbum Jo, Srinivasa Rao Satti, Shubham Ugare:
Approximate query processing over static sets and sliding windows. Theor. Comput. Sci. 885: 1-14 (2021) - [c16]Sankardeep Chakraborty, Seungbum Jo, Kunihiko Sadakane, Srinivasa Rao Satti:
Succinct Data Structures for Series-Parallel, Block-Cactus and 3-Leaf Power Graphs. COCOA 2021: 416-430 - [c15]Hüseyin Acan, Sankardeep Chakraborty, Seungbum Jo, Kei Nakashima, Kunihiko Sadakane, Srinivasa Rao Satti:
Succinct representations of Intersection Graphs on a Circle. DCC 2021: 123-132 - [c14]Sankardeep Chakraborty, Seungbum Jo, Kunihiko Sadakane, Srinivasa Rao Satti:
Succinct Data Structures for Small Clique-Width Graphs. DCC 2021: 133-142 - [c13]Seungbum Jo, Wooyoung Park, Srinivasa Rao Satti:
Practical Implementation of Encoding Range Top-2 Queries. SEA 2021: 10:1-10:13 - [i8]Sankardeep Chakraborty, Seungbum Jo, Kunihiko Sadakane, Srinivasa Rao Satti:
Succinct Data Structures for Series-Parallel, Block-Cactus and 3-Leaf Power Graphs. CoRR abs/2108.10776 (2021) - 2020
- [j6]Simon Meckel, Markus Lohrey, Seungbum Jo, Roman Obermaisser, Simon Plasger:
Combined compression of multiple correlated data streams for online-diagnosis systems. Microprocess. Microsystems 77: 103184 (2020) - [j5]Pawel Gawrychowski, Seungbum Jo, Shay Mozes, Oren Weimann:
Compressed range minimum queries. Theor. Comput. Sci. 812: 39-48 (2020) - [i7]Hüseyin Acan, Sankardeep Chakraborty, Seungbum Jo, Kei Nakashima, Kunihiko Sadakane, Srinivasa Rao Satti:
Succinct Navigational Oracles for Families of Intersection Graphs on a Circle. CoRR abs/2010.04333 (2020)
2010 – 2019
- 2019
- [c12]Seungbum Jo, Markus Lohrey, Simon Meckel, Roman Obermaisser, Simon Plasger:
Combined Compression of Multiple Correlated Data Streams for Online-Diagnosis Systems. DSD 2019: 166-173 - [c11]Hüseyin Acan, Sankardeep Chakraborty, Seungbum Jo, Srinivasa Rao Satti:
Succinct Data Structures for Families of Interval Graphs. WADS 2019: 1-13 - [i6]Pawel Gawrychowski, Seungbum Jo, Shay Mozes, Oren Weimann:
Compressed Range Minimum Queries. CoRR abs/1902.04427 (2019) - [i5]Hüseyin Acan, Sankardeep Chakraborty, Seungbum Jo, Srinivasa Rao Satti:
Succinct Data Structures for Families of Interval Graphs. CoRR abs/1902.09228 (2019) - 2018
- [j4]Seungbum Jo, Markus Lohrey, Damian Ludwig, Simon Meckel, Roman Obermaisser, Simon Plasger:
An architecture for online-diagnosis systems supporting compressed communication. Microprocess. Microsystems 61: 242-256 (2018) - [c10]Ran Ben-Basat, Seungbum Jo, Srinivasa Rao Satti, Shubham Ugare:
Approximate Query Processing over Static Sets and Sliding Windows. ISAAC 2018: 54:1-54:12 - [c9]Seungbum Jo, Srinivasa Rao Satti:
Encoding Two-Dimensional Range Top-k Queries Revisited. ISAAC 2018: 69:1-69:13 - [c8]Seungbum Jo, Shay Mozes, Oren Weimann:
Compressed Range Minimum Queries. SPIRE 2018: 206-217 - [i4]Ran Ben-Basat, Seungbum Jo, Srinivasa Rao Satti, Shubham Ugare:
Approximate Query Processing over Static Sets and Sliding Windows. CoRR abs/1809.05419 (2018) - [i3]Seungbum Jo, Srinivasa Rao Satti:
Encoding two-dimensional range top-k queries revisited. CoRR abs/1809.07067 (2018) - 2017
- [j3]Seungbum Jo, Stelios Joannou, Daisuke Okanohara, Rajeev Raman, Srinivasa Rao Satti:
Compressed Bit vectors Based on Variable-to-Fixed Encodings. Comput. J. 60(5): 761-775 (2017) - [c7]Seungbum Jo, Markus Lohrey, Damian Ludwig, Simon Meckel, Roman Obermaisser, Simon Plasger:
An Architecture for Online-Diagnosis Systems Supporting Compressed Communication. DSD 2017: 62-69 - [i2]Sankardeep Chakraborty, Seungbum Jo, Srinivasa Rao Satti:
Improved Space-efficient Linear Time Algorithms for Some Classical Graph Problems. CoRR abs/1712.03349 (2017) - 2016
- [j2]Varunkumar Jayapaul, Seungbum Jo, Rajeev Raman, Venkatesh Raman, Srinivasa Rao Satti:
Space efficient data structures for nearest larger neighbor. J. Discrete Algorithms 36: 63-75 (2016) - [j1]Seungbum Jo, Srinivasa Rao Satti:
Simultaneous encodings for range and next/previous larger/smaller value queries. Theor. Comput. Sci. 654: 80-91 (2016) - [c6]Seungbum Jo, Rahul Lingala, Srinivasa Rao Satti:
Encoding Two-Dimensional Range Top-k Queries. CPM 2016: 3:1-3:11 - [i1]Seungbum Jo, Srinivasa Rao Satti:
Simultaneous encodings for range and next/previous larger/smaller value queries. CoRR abs/1612.07493 (2016) - 2015
- [c5]Seungbum Jo, Srinivasa Rao Satti:
Simultaneous Encodings for Range and Next/Previous Larger/Smaller Value Queries. COCOON 2015: 648-660 - [c4]Seungbum Jo, Rajeev Raman, Srinivasa Rao Satti:
Compact Encodings and Indexes for the Nearest Larger Neighbor Problem. WALCOM 2015: 53-64 - 2014
- [c3]Seungbum Jo, Stelios Joannou, Daisuke Okanohara, Rajeev Raman, Srinivasa Rao Satti:
Compressed Bit Vectors Based on Variable-to-Fixed Encodings. DCC 2014: 409 - [c2]Varunkumar Jayapaul, Seungbum Jo, Venkatesh Raman, Srinivasa Rao Satti:
Space Efficient Data Structures for Nearest Larger Neighbor. IWOCA 2014: 176-187 - 2013
- [c1]Jérémy Barbay, Ankur Gupta, Seungbum Jo, Srinivasa Rao Satti, Jonathan P. Sorenson:
Theory and Implementation of Online Multiselection Algorithms. ESA 2013: 109-120
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-23 20:32 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
