Kunsoo Park

Juan Pablo Bonilla Ataides

Hyunjoon Kim

Proc. VLDB Endow., 2023

Time-Constrained Continuous Subgraph Matching Using Temporal Information for Filtering and Backtracking.

[BibT_eX]

[DOI]

CoRR, 2023

Cardinality Estimation of Subgraph Matching: A Filtering-Sampling Approach.

[BibT_eX]

[DOI]

CoRR, 2023

New Seeding Strategies for the Influence Maximization Problem.

[BibT_eX]

[DOI]

Seok-Hee Hong

Rowena Kok

Amyra Meidiana

Proceedings of the Complex Networks & Their Applications XII, 2023

2022

Index Key Compression and On-the-Fly Reconstruction of In-Memory Indexes.

[BibT_eX]

[DOI]

J. Database Manag., 2022

RDscan: A New Method for Improving Germline and Somatic Variant Calling Based on Read Depth Distribution.

[BibT_eX]

[DOI]

J. Comput. Biol., 2022

Efficient Graph Isomorphism Query Processing using Degree Sequences and Color-Label Distributions.

[BibT_eX]

[DOI]

Proceedings of the 38th IEEE International Conference on Data Engineering, 2022

dGG, dRNG, DSC: New Degree-based Shape-based Faithfulness Metrics for Large and Complex Graph Visualization.

[BibT_eX]

[DOI]

Proceedings of the 15th IEEE Pacific Visualization Symposium, 2022

2021

Fast algorithms for single and multiple pattern Cartesian tree matching.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

Symmetric Continuous Subgraph Matching with Bidirectional Dynamic Programming.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2021

Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching.

[BibT_eX]

[DOI]

Proceedings of the SIGMOD '21: International Conference on Management of Data, 2021

Scalable Graph Isomorphism: Combining Pairwise Color Refinement and Backtracking via Compressed Candidate Space.

[BibT_eX]

[DOI]

Proceedings of the 37th IEEE International Conference on Data Engineering, 2021

A Linear Time Algorithm for Constructing Hierarchical Overlap Graphs.

[BibT_eX]

[DOI]

Proceedings of the 32nd Annual Symposium on Combinatorial Pattern Matching, 2021

Louvain-based Multi-level Graph Drawing.

[BibT_eX]

[DOI]

Proceedings of the 14th IEEE Pacific Visualization Symposium, 2021

2020

Fast string matching for DNA sequences.

[BibT_eX]

[DOI]

Cheol Ryu

Thierry Lecroq

Theor. Comput. Sci., 2020

Finding patterns and periods in Cartesian tree matching.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

IDAR: Fast Supergraph Search Using DAG Integration.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2020

Compressed Key Sort and Fast Index Reconstruction.

[BibT_eX]

[DOI]

CoRR, 2020

Fast Multiple Pattern Cartesian Tree Matching.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation - 14th International Conference, 2020

Fast Practical Computation of the Longest Common Cartesian Substrings of Two Strings.

[BibT_eX]

[DOI]

Simone Faro

Thierry Lecroq

Proceedings of the Prague Stringology Conference 2020, Prague, Czech Republic, August 31, 2020

Efficient Construction of Hierarchical Overlap Graphs.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2020

Homomorphic Computation of Local Alignment.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Bioinformatics and Biomedicine, 2020

2019

Fast Cartesian Tree Matching.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2019

Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together.

[BibT_eX]

[DOI]

Proceedings of the 2019 International Conference on Management of Data, 2019

Finding Periods in Cartesian Tree Matching.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 30th International Workshop, 2019

Cartesian Tree Matching and Indexing.

[BibT_eX]

[DOI]

Proceedings of the 30th Annual Symposium on Combinatorial Pattern Matching, 2019

2018

FM-index of alignment with gaps.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2018

Improved pattern-scan-order algorithms for string matching.

[BibT_eX]

[DOI]

Cheol Ryu

J. Discrete Algorithms, 2018

Interval Disaggregation with Product Life Cycles and Constraints.

[BibT_eX]

[DOI]

J. Comput. Sci. Eng., 2018

Fast batch modular exponentiation with common-multiplicand multiplication.

[BibT_eX]

[DOI]

Jungjoo Seo

Inf. Process. Lett., 2018

2017

A fast algorithm for the all-pairs suffix-prefix problem.

[BibT_eX]

[DOI]

Jihyuk Lim

Theor. Comput. Sci., 2017

On Representations of Ternary Order Relations in Numeric Strings.

[BibT_eX]

[DOI]

Math. Comput. Sci., 2017

Algorithm Engineering for All-Pairs Suffix-Prefix Matching.

[BibT_eX]

[DOI]

Jihyuk Lim

Proceedings of the 16th International Symposium on Experimental Algorithms, 2017

Optimizing Scalar User-Defined Functions in In-Memory Column-Store Database Systems.

[BibT_eX]

[DOI]

Proceedings of the Database Systems for Advanced Applications, 2017

2016

Indexed Two-Dimensional String Matching.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Similarity Between Compressed Strings.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

FM-index of alignment: A compressed index for similar strings.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

Compressed and Searchable Indexes for Highly Similar Strings (Invited Talk).

[BibT_eX]

[DOI]

Proceedings of the 27th International Symposium on Algorithms and Computation, 2016

2015

High-speed parallel implementations of the rainbow method based on perfect tables in a heterogeneous system.

[BibT_eX]

[DOI]

Softw. Pract. Exp., 2015

Efficient Accessing and Searching in a Sequence of Numbers.

[BibT_eX]

[DOI]

Jungjoo Seo

Myoungji Han

J. Comput. Sci. Eng., 2015

A fast algorithm for order-preserving pattern matching.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2015

Fast Multiple Order-Preserving Matching Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 26th International Workshop, 2015

2014

Order-preserving matching.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

Extending alignments with k-mismatches and ℓ-gaps.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

Interval Disaggregate: A New Operator for Business Planning.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2014

2013

Finding consensus and optimal alignment of circular strings.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

Efficient Implementation of NTRU Cryptosystem Using Sliding Window Methods.

[BibT_eX]

[DOI]

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2013

Analysis of the Rainbow Tradeoff Algorithm Used in Practice.

[BibT_eX]

[DOI]

Jung Woo Kim

Jin Hong

IACR Cryptol. ePrint Arch., 2013

Suffix Array of Alignment: A Practical Index for Similar Data.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2013

Suffix Tree of Alignment: An Efficient Index for Similar Data.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 24th International Workshop, 2013

Fast Order-Preserving Pattern Matching.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2013

2012

Guest Editorial: Special Issue on Algorithms and Computation.

[BibT_eX]

[DOI]

Kyung-Yong Chwa

Algorithmica, 2012

High-Speed Parallel Implementations of the Rainbow Method in a Heterogeneous System.

[BibT_eX]

[DOI]

Proceedings of the Progress in Cryptology, 2012

GapMis-OMP: Pairwise Short-Read Alignment on Multi-core Architectures.

[BibT_eX]

[DOI]

Proceedings of the Artificial Intelligence Applications and Innovations, 2012

2011

Efficient algorithms for consensus string problems minimizing both distance sum and radius.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

On-line construction of parameterized suffix trees for large alphabets.

[BibT_eX]

[DOI]

Taehyung Lee

Inf. Process. Lett., 2011

Constant-Round Privacy Preserving Multiset Union.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2011

High-throughput peptide quantification using mTRAQ reagent triplex.

[BibT_eX]

[DOI]

BMC Bioinform., 2011

Linear-Time Construction of Two-Dimensional Suffix Trees.

[BibT_eX]

[DOI]

Algorithmica, 2011

Approximate string-matching with a single gap for sequence alignment.

[BibT_eX]

[DOI]

Proceedings of the ACM International Conference on Bioinformatics, 2011

2010

Fair threshold decryption with semi-trusted third parties.

[BibT_eX]

[DOI]

Int. J. Appl. Cryptogr., 2010

Finding Optimal Alignment and Consensus of Circular Strings.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, 21st Annual Symposium, 2010

2009

Dynamic rank/select structures with applications to run-length encoded texts.

[BibT_eX]

[DOI]

Sunho Lee

Theor. Comput. Sci., 2009

Boolean circuit programming: A new paradigm to design parallel algorithms.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2009

Dynamic Compressed Representation of Texts with Rank/Select.

[BibT_eX]

[DOI]

Sunho Lee

J. Comput. Sci. Eng., 2009

Improving multikey Quicksort for sorting strings with many equal elements.

[BibT_eX]

[DOI]

Eunsang Kim

Inf. Process. Lett., 2009

Alignment of biological sequences with quality scores.

[BibT_eX]

[DOI]

Int. J. Bioinform. Res. Appl., 2009

Fast Computation of Rank and Select Functions for Succinct Representation.

[BibT_eX]

[DOI]

IEICE Trans. Inf. Syst., 2009

Detecting soft errors by redirection classification.

[BibT_eX]

[DOI]

Proceedings of the 18th International Conference on World Wide Web, 2009

On-Line Construction of Parameterized Suffix Trees.

[BibT_eX]

[DOI]

Taehyung Lee

Proceedings of the String Processing and Information Retrieval, 2009

Consensus Optimizing Both Distance Sum and Radius.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2009

2008

Two-Dimensional Pattern Indexing.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Similarity between Compressed Strings.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Secure Interdomain Routing Registry.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Forensics Secur., 2008

Computing similarity of run-length encoded strings with affine gap penalty.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2008

External Memory Algorithms for String Problems.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2008

An Improved Boolean Circuit for Maximum Matching in a Convex Bipartite Graph.

[BibT_eX]

[DOI]

Eunhui Park

Fundam. Informaticae, 2008

Approximate Word Sequence Matching on an Inverted File Index.

[BibT_eX]

Taehyung Lee

Proceedings of the 19th International Workshop on Combinatorial Algorithms, 2008

Improving Multikey Quicksort for Sorting Strings.

[BibT_eX]

Eunsang Kim

Proceedings of the 19th International Workshop on Combinatorial Algorithms, 2008

2007

Alphabet-independent linear-time construction of compressed suffix arrays using o(nlogn)-bit working space.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2007

An efficient alignment algorithm for masked sequences.

[BibT_eX]

[DOI]

Jin Wook Kim

Theor. Comput. Sci., 2007

Combinatorial Pattern Matching.

[BibT_eX]

[DOI]

Laurent Mouchard

J. Discrete Algorithms, 2007

Linear time algorithm for the longest common repeat problem.

[BibT_eX]

[DOI]

Inbok Lee

J. Discrete Algorithms, 2007

On-Line Construction of Two-Dimensional Suffix Trees in O(n2 log n) Time.

[BibT_eX]

[DOI]

Raffaele Giancarlo

Algorithmica, 2007

Fast Matching Method for DNA Sequences.

[BibT_eX]

[DOI]

Jin Wook Kim

Eunsang Kim

Proceedings of the Combinatorics, 2007

A Simple Construction of Two-Dimensional Suffix Trees in Linear Time.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, 18th Annual Symposium, 2007

Sliding Window Method for NTRU.

[BibT_eX]

[DOI]

Proceedings of the Applied Cryptography and Network Security, 5th International Conference, 2007

2006

Provisioning Protected Resource Sharing in Multi-Hop Wireless Networks.

[BibT_eX]

[DOI]

E-yong Kim

Hwangnam Kim

IACR Cryptol. ePrint Arch., 2006

Short Traceable Signatures Based on Bilinear Pairings.

[BibT_eX]

[DOI]

Seung Geol Choi

Moti Yung

Proceedings of the Advances in Information and Computer Security, 2006

Identity-based registry for secure interdomain routing.

[BibT_eX]

[DOI]

Proceedings of the 2006 ACM Symposium on Information, Computer and Communications Security, 2006

2005

Implementing approximate regularities.

[BibT_eX]

[DOI]

Manolis Christodoulakis

Jeong Seop Sim

Math. Comput. Model., 2005

Constructing suffix arrays in linear time.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2005

Approximate Seeds of Strings.

[BibT_eX]

[DOI]

Manolis Christodoulakis

Jeong Seop Sim

J. Autom. Lang. Comb., 2005

Efficient parallel exponentiation in GF(qn) using normal basis representations.

[BibT_eX]

[DOI]

J. Algorithms, 2005

Efficient Implementation of Rank and Select Functions for Succinct Representation.

[BibT_eX]

[DOI]

Proceedings of the Experimental and Efficient Algorithms, 4th InternationalWorkshop, 2005

O(n2log n) Time On-Line Construction of Two-Dimensional Suffix Trees.

[BibT_eX]

[DOI]

Raffaele Giancarlo

Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

2004

Three-Dimensional Periodicity and Its Application to Pattern Matching.

[BibT_eX]

[DOI]

Jong Geun Park

SIAM J. Discret. Math., 2004

Deleting keys of B-trees in parallel.

[BibT_eX]

[DOI]

Heejin Park

J. Parallel Distributed Comput., 2004

A dynamic edit distance table.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2004

A fast algorithm for the generalized k-keyword proximity problem given keyword offsets.

[BibT_eX]

[DOI]

Inbok Lee

Inf. Process. Lett., 2004

Parallel two dimensional witness computation.

[BibT_eX]

[DOI]

Inf. Comput., 2004

Simple Implementation of String B-Trees..

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2004

An Efficient Local Alignment Algorithm for Masked Sequences.

[BibT_eX]

[DOI]

Jin Wook Kim

Proceedings of the Computing and Combinatorics, 10th Annual International Conference, 2004

2003

Truncated suffix trees and their application to data compression.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

Generalizations of suffix arrays to multi-dimensional matrices.

[BibT_eX]

[DOI]

Yoo Ah Kim

Theor. Comput. Sci., 2003

The consensus string problem for a metric is NP-complete.

[BibT_eX]

[DOI]

Jeong Seop Sim

J. Discrete Algorithms, 2003

An efficient parallel algorithm for scheduling interval ordered tasks.

[BibT_eX]

[DOI]

Yoojin Chung

J. Complex., 2003

Efficient Arithmetic in Optimal Extension Fields Using Simultaneous Multiplication.

[BibT_eX]

[DOI]

Mun-Kyu Lee

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2003

A Simple and Scalable Algorithm for the IP Address Lookup Problem.

[BibT_eX]

[DOI]

Inbok Lee

Yanghee Choi

Fundam. Informaticae, 2003

Efficient Scalar Multiplication in Hyperelliptic Curves Using A New Frobenius Expansion.

[BibT_eX]

[DOI]

Tae-Jun Park

Mun-Kyu Lee

Proceedings of the Information Security and Cryptology, 2003

A General Expansion Method Using Efficient Endomorphisms.

[BibT_eX]

[DOI]

Proceedings of the Information Security and Cryptology, 2003

Linear-Time Construction of Suffix Arrays.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, 14th Annual Symposium, 2003

2002

New Frobenius Expansions for Elliptic Curves with Efficient Endomorphisms.

[BibT_eX]

[DOI]

Tae-Jun Park

Mun-Kyu Lee

Proceedings of the Information Security and Cryptology, 2002

2001

Approximate periods of strings.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2001

Parallel algorithms for red-black trees.

[BibT_eX]

[DOI]

Heejin Park

Theor. Comput. Sci., 2001

Efficient parallel exponentiation in GF(2n) using normal basis representations.

[BibT_eX]

[DOI]

Proceedings of the Thirteenth Annual ACM Symposium on Parallel Algorithms and Architectures, 2001

Linear-Time Longest-Common-Prefix Computation in Suffix Arrays and Its Applications.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, 12th Annual Symposium, 2001

2000

Fully Scalable Fault-Tolerant Simulations for BSP and CGM.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 2000

An Efficient Parallel Algorithm for Scheduling Interval Ordered Tasks.

[BibT_eX]

[DOI]

Yoojin Chung

Hyuk-Chul Kwon

Proceedings of the Theoretical Computer Science, 2000

Data Compression with Truncated Suffix Trees.

[BibT_eX]

[DOI]

Proceedings of the Data Compression Conference, 2000

Efficient List Ranking Algorithms on Reconfigurable Mesh.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 6th Annual International Conference, 2000

1999

Efficient Algorithms for Approximate String Matching with Swaps.

[BibT_eX]

[DOI]

J. Complex., 1999

Linear-Time Construction of Two-Dimensional Suffix Trees.

[BibT_eX]

[DOI]

Proceedings of the Automata, 1999

1998

Analysis of Two-Dimensional Approximate Pattern Matching Algorithms.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1998

Constructing Suffix Arrays for Multi-dimensional Matrices.

[BibT_eX]

[DOI]

Yoo Ah Kim

Proceedings of the Combinatorial Pattern Matching, 9th Annual Symposium, 1998

1997

Constant-Time Randomized Parallel String Matching.

[BibT_eX]

[DOI]

SIAM J. Comput., 1997

The Working Set Algorithm has Competitive Ratio Less Than Two.

[BibT_eX]

[DOI]

Sang Lyul Min

Inf. Process. Lett., 1997

Three-Dimensional Pattern Matching.

[BibT_eX]

[DOI]

Jong Geun Park

Proceedings of the 9th Annual ACM Symposium on Parallel Algorithms and Architectures, 1997

Parallel Maximum Matching Algorithms in Interval Graphs.

[BibT_eX]

[DOI]

Yoojin Chung

Proceedings of the 1997 International Conference on Parallel and Distributed Systems (ICPADS '97), 1997

Efficient Algorithms for Approximate String Matching with Swaps (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, 8th Annual Symposium, 1997

1996

A Work-Time Optimal Algorithm for Computing All String Covers.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1996

Alphabet-Independent Two-Dimensional Witness Computation.

[BibT_eX]

[DOI]

SIAM J. Comput., 1996

Covering a String.

[BibT_eX]

[DOI]

Dennis W. G. Moore

Algorithmica, 1996

1995

An Accurate Worst Case Timing Analysis for RISC Processors.

[BibT_eX]

[DOI]

IEEE Trans. Software Eng., 1995

The Subtree Max Gap Problem with Application to Parallel String Covering.

[BibT_eX]

[DOI]

Omer Berkman

Inf. Comput., 1995

Work-time-optimal parallel algorithms for string problems.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 1995

String Matching in Hypertext.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, 6th Annual Symposium, 1995

1994

Parallel Algorithms for Dynamic Programming Recurrences with More than O(1) Dependency.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 1994

Dynamic Dictionary Matching.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1994

The Subtree Max Gap Problem with Application to Parallel String Covering.

[BibT_eX]

[DOI]

Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 23-25 January 1994, 1994

An Accurate Worst Case Timing Analysis Technique for RISC Processors.

[BibT_eX]

[DOI]

Proceedings of the 15th IEEE Real-Time Systems Symposium (RTSS '94), 1994

An O(log N log log N) time RMESH algorithm for the simple polygon visibility problem.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Parallel Architectures, 1994

Work-Time Optimal Parallel Prefix Matching (Extended Abstract).

[BibT_eX]

[DOI]

Leszek Gasieniec

Proceedings of the Algorithms, 1994

1993

On the Set LCS and Set-Set LCS Problems.

[BibT_eX]

[DOI]

Biing-Feng Wang

Gen-Huey Chen

J. Algorithms, 1993

Optimally fast parallel algorithms for preprocessing and pattern matching in one and two dimensions

[BibT_eX]

[DOI]

Proceedings of the 34th Annual Symposium on Foundations of Computer Science, 1993

1992

Dynamic Programming with Convexity, Concavity, and Sparsity.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1992

Truly Alphabet-Independent Two-Dimensional Pattern Matching

[BibT_eX]

[DOI]

Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 1992

1990

An Improved Algorithm for Approximate String Matching.

[BibT_eX]

[DOI]

SIAM J. Comput., 1990

A Linear-Time Algorithm for Concave One-Dimensional Dynamic Programming.

[BibT_eX]

[DOI]