Kunsoo Park

According to our database1, Kunsoo Park authored at least 126 papers between 1990 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2020
Fast Multiple Pattern Cartesian Tree Matching.
Proceedings of the WALCOM: Algorithms and Computation - 14th International Conference, 2020

2019
Fast Cartesian Tree Matching.
Proceedings of the String Processing and Information Retrieval, 2019

Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together.
Proceedings of the 2019 International Conference on Management of Data, 2019

Finding Periods in Cartesian Tree Matching.
Proceedings of the Combinatorial Algorithms - 30th International Workshop, 2019

Cartesian Tree Matching and Indexing.
Proceedings of the 30th Annual Symposium on Combinatorial Pattern Matching, 2019

2018
FM-index of alignment with gaps.
Theor. Comput. Sci., 2018

Improved pattern-scan-order algorithms for string matching.
J. Discrete Algorithms, 2018

Fast batch modular exponentiation with common-multiplicand multiplication.
Inf. Process. Lett., 2018

2017
A fast algorithm for the all-pairs suffix-prefix problem.
Theor. Comput. Sci., 2017

On Representations of Ternary Order Relations in Numeric Strings.
Mathematics in Computer Science, 2017

Algorithm Engineering for All-Pairs Suffix-Prefix Matching.
Proceedings of the 16th International Symposium on Experimental Algorithms, 2017

Optimizing Scalar User-Defined Functions in In-Memory Column-Store Database Systems.
Proceedings of the Database Systems for Advanced Applications, 2017

2016
Indexed Two-Dimensional String Matching.
Encyclopedia of Algorithms, 2016

Similarity Between Compressed Strings.
Encyclopedia of Algorithms, 2016

FM-index of alignment: A compressed index for similar strings.
Theor. Comput. Sci., 2016

Compressed and Searchable Indexes for Highly Similar Strings (Invited Talk).
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.
Softw., Pract. Exper., 2015

Efficient Accessing and Searching in a Sequence of Numbers.
JCSE, 2015

A fast algorithm for order-preserving pattern matching.
Inf. Process. Lett., 2015

Fast Multiple Order-Preserving Matching Algorithms.
Proceedings of the Combinatorial Algorithms - 26th International Workshop, 2015

2014
Order-preserving matching.
Theor. Comput. Sci., 2014

Extending alignments with k-mismatches and ℓ-gaps.
Theor. Comput. Sci., 2014

Interval Disaggregate: A New Operator for Business Planning.
PVLDB, 2014

2013
Finding consensus and optimal alignment of circular strings.
Theor. Comput. Sci., 2013

Efficient Implementation of NTRU Cryptosystem Using Sliding Window Methods.
IEICE Transactions, 2013

Analysis of the Rainbow Tradeoff Algorithm Used in Practice.
IACR Cryptology ePrint Archive, 2013

Suffix Array of Alignment: A Practical Index for Similar Data.
Proceedings of the String Processing and Information Retrieval, 2013

Suffix Tree of Alignment: An Efficient Index for Similar Data.
Proceedings of the Combinatorial Algorithms - 24th International Workshop, 2013

Fast Order-Preserving Pattern Matching.
Proceedings of the Combinatorial Optimization and Applications, 2013

2012
Guest Editorial: Special Issue on Algorithms and Computation.
Algorithmica, 2012

High-Speed Parallel Implementations of the Rainbow Method in a Heterogeneous System.
Proceedings of the Progress in Cryptology, 2012

GapMis-OMP: Pairwise Short-Read Alignment on Multi-core Architectures.
Proceedings of the Artificial Intelligence Applications and Innovations, 2012

2011
Efficient algorithms for consensus string problems minimizing both distance sum and radius.
Theor. Comput. Sci., 2011

On-line construction of parameterized suffix trees for large alphabets.
Inf. Process. Lett., 2011

Constant-Round Privacy Preserving Multiset Union.
IACR Cryptology ePrint Archive, 2011

High-throughput peptide quantification using mTRAQ reagent triplex.
BMC Bioinformatics, 2011

Linear-Time Construction of Two-Dimensional Suffix Trees.
Algorithmica, 2011

Approximate string-matching with a single gap for sequence alignment.
Proceedings of the ACM International Conference on Bioinformatics, 2011

2010
Fair threshold decryption with semi-trusted third parties.
IJACT, 2010

Finding Optimal Alignment and Consensus of Circular Strings.
Proceedings of the Combinatorial Pattern Matching, 21st Annual Symposium, 2010

2009
Dynamic rank/select structures with applications to run-length encoded texts.
Theor. Comput. Sci., 2009

Boolean circuit programming: A new paradigm to design parallel algorithms.
J. Discrete Algorithms, 2009

Dynamic Compressed Representation of Texts with Rank/Select.
JCSE, 2009

Improving multikey Quicksort for sorting strings with many equal elements.
Inf. Process. Lett., 2009

Alignment of biological sequences with quality scores.
IJBRA, 2009

Fast Computation of Rank and Select Functions for Succinct Representation.
IEICE Transactions, 2009

Detecting soft errors by redirection classification.
Proceedings of the 18th International Conference on World Wide Web, 2009

On-Line Construction of Parameterized Suffix Trees.
Proceedings of the String Processing and Information Retrieval, 2009

Consensus Optimizing Both Distance Sum and Radius.
Proceedings of the String Processing and Information Retrieval, 2009

2008
Two-Dimensional Pattern Indexing.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Similarity between Compressed Strings.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Secure Interdomain Routing Registry.
IEEE Trans. Information Forensics and Security, 2008

Computing similarity of run-length encoded strings with affine gap penalty.
Theor. Comput. Sci., 2008

External Memory Algorithms for String Problems.
Fundam. Inform., 2008

An Improved Boolean Circuit for Maximum Matching in a Convex Bipartite Graph.
Fundam. Inform., 2008

Approximate Word Sequence Matching on an Inverted File Index.
Proceedings of the 19th International Workshop on Combinatorial Algorithms, 2008

Improving Multikey Quicksort for Sorting Strings.
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.
Theor. Comput. Sci., 2007

An efficient alignment algorithm for masked sequences.
Theor. Comput. Sci., 2007

Combinatorial Pattern Matching.
J. Discrete Algorithms, 2007

Linear time algorithm for the longest common repeat problem.
J. Discrete Algorithms, 2007

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

Fast Matching Method for DNA Sequences.
Proceedings of the Combinatorics, 2007

A Simple Construction of Two-Dimensional Suffix Trees in Linear Time.
Proceedings of the Combinatorial Pattern Matching, 18th Annual Symposium, 2007

Sliding Window Method for NTRU.
Proceedings of the Applied Cryptography and Network Security, 5th International Conference, 2007

2006
Provisioning Protected Resource Sharing in Multi-Hop Wireless Networks.
IACR Cryptology ePrint Archive, 2006

Short Traceable Signatures Based on Bilinear Pairings.
Proceedings of the Advances in Information and Computer Security, 2006

Identity-based registry for secure interdomain routing.
Proceedings of the 2006 ACM Symposium on Information, Computer and Communications Security, 2006

2005
Implementing approximate regularities.
Mathematical and Computer Modelling, 2005

Constructing suffix arrays in linear time.
J. Discrete Algorithms, 2005

Approximate Seeds of Strings.
Journal of Automata, Languages and Combinatorics, 2005

Efficient parallel exponentiation in GF(qn) using normal basis representations.
J. Algorithms, 2005

Efficient Implementation of Rank and Select Functions for Succinct Representation.
Proceedings of the Experimental and Efficient Algorithms, 4th InternationalWorkshop, 2005

O(n2log n) Time On-Line Construction of Two-Dimensional Suffix Trees.
Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

2004
Three-Dimensional Periodicity and Its Application to Pattern Matching.
SIAM J. Discrete Math., 2004

Deleting keys of B-trees in parallel.
J. Parallel Distrib. Comput., 2004

A dynamic edit distance table.
J. Discrete Algorithms, 2004

A fast algorithm for the generalized k-keyword proximity problem given keyword offsets.
Inf. Process. Lett., 2004

Parallel two dimensional witness computation.
Inf. Comput., 2004

Simple Implementation of String B-Trees..
Proceedings of the String Processing and Information Retrieval, 2004

An Efficient Local Alignment Algorithm for Masked Sequences.
Proceedings of the Computing and Combinatorics, 10th Annual International Conference, 2004

2003
Truncated suffix trees and their application to data compression.
Theor. Comput. Sci., 2003

Generalizations of suffix arrays to multi-dimensional matrices.
Theor. Comput. Sci., 2003

The consensus string problem for a metric is NP-complete.
J. Discrete Algorithms, 2003

An efficient parallel algorithm for scheduling interval ordered tasks.
J. Complexity, 2003

A Simple and Scalable Algorithm for the IP Address Lookup Problem.
Fundam. Inform., 2003

Efficient Scalar Multiplication in Hyperelliptic Curves Using A New Frobenius Expansion.
Proceedings of the Information Security and Cryptology, 2003

A General Expansion Method Using Efficient Endomorphisms.
Proceedings of the Information Security and Cryptology, 2003

Linear-Time Construction of Suffix Arrays.
Proceedings of the Combinatorial Pattern Matching, 14th Annual Symposium, 2003

2002
New Frobenius Expansions for Elliptic Curves with Efficient Endomorphisms.
Proceedings of the Information Security and Cryptology, 2002

2001
Approximate periods of strings.
Theor. Comput. Sci., 2001

Parallel algorithms for red-black trees.
Theor. Comput. Sci., 2001

Efficient parallel exponentiation in GF(2n) using normal basis representations.
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.
Proceedings of the Combinatorial Pattern Matching, 12th Annual Symposium, 2001

2000
Fully Scalable Fault-Tolerant Simulations for BSP and CGM.
J. Parallel Distrib. Comput., 2000

An Efficient Parallel Algorithm for Scheduling Interval Ordered Tasks.
Proceedings of the Theoretical Computer Science, 2000

Data Compression with Truncated Suffix Trees.
Proceedings of the Data Compression Conference, 2000

Efficient List Ranking Algorithms on Reconfigurable Mesh.
Proceedings of the Computing and Combinatorics, 6th Annual International Conference, 2000

1999
Efficient Algorithms for Approximate String Matching with Swaps.
J. Complexity, 1999

Linear-Time Construction of Two-Dimensional Suffix Trees.
Proceedings of the Automata, 1999

1998
Analysis of Two-Dimensional Approximate Pattern Matching Algorithms.
Theor. Comput. Sci., 1998

Constructing Suffix Arrays for Multi-dimensional Matrices.
Proceedings of the Combinatorial Pattern Matching, 9th Annual Symposium, 1998

1997
Constant-Time Randomized Parallel String Matching.
SIAM J. Comput., 1997

The Working Set Algorithm has Competitive Ratio Less Than Two.
Inf. Process. Lett., 1997

Three-Dimensional Pattern Matching.
Proceedings of the 9th Annual ACM Symposium on Parallel Algorithms and Architectures, 1997

Parallel Maximum Matching Algorithms in Interval Graphs.
Proceedings of the 1997 International Conference on Parallel and Distributed Systems (ICPADS '97), 1997

Efficient Algorithms for Approximate String Matching with Swaps (Extended Abstract).
Proceedings of the Combinatorial Pattern Matching, 8th Annual Symposium, 1997

1996
A Work-Time Optimal Algorithm for Computing All String Covers.
Theor. Comput. Sci., 1996

Alphabet-Independent Two-Dimensional Witness Computation.
SIAM J. Comput., 1996

Covering a String.
Algorithmica, 1996

1995
An Accurate Worst Case Timing Analysis for RISC Processors.
IEEE Trans. Software Eng., 1995

The Subtree Max Gap Problem with Application to Parallel String Covering.
Inf. Comput., 1995

Work-time-optimal parallel algorithms for string problems.
Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 1995

String Matching in Hypertext.
Proceedings of the Combinatorial Pattern Matching, 6th Annual Symposium, 1995

1994
Parallel Algorithms for Dynamic Programming Recurrences with More than O(1) Dependency.
J. Parallel Distrib. Comput., 1994

Dynamic Dictionary Matching.
J. Comput. Syst. Sci., 1994

The Subtree Max Gap Problem with Application to Parallel String Covering.
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.
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.
Proceedings of the International Symposium on Parallel Architectures, 1994

Work-Time Optimal Parallel Prefix Matching (Extended Abstract).
Proceedings of the Algorithms, 1994

1993
On the Set LCS and Set-Set LCS Problems.
J. Algorithms, 1993

Optimally fast parallel algorithms for preprocessing and pattern matching in one and two dimensions
Proceedings of the 34th Annual Symposium on Foundations of Computer Science, 1993

1992
Dynamic Programming with Convexity, Concavity, and Sparsity.
Theor. Comput. Sci., 1992

Truly Alphabet-Independent Two-Dimensional Pattern Matching
Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 1992

1990
An Improved Algorithm for Approximate String Matching.
SIAM J. Comput., 1990

A Linear-Time Algorithm for Concave One-Dimensional Dynamic Programming.
Inf. Process. Lett., 1990


  Loading...