# Search results for: Kunsoo Park

Information Processing Letters > 2018 > 129 > C > 5-10

Theoretical Computer Science > 2017 > 698 > C > 14-24

Mathematics in Computer Science > 2017 > 11 > 2 > 127-136

Lecture Notes in Computer Science > Information Security and Cryptology - ICISC 2003 > Fast Implementations > 112-126

*E*is isomorphic to

*Z*[

*ω*] = {

*a*+

*bω*|

*a*,

*bin*

*Z*}, where

*ω*is an algebraic integer with the smallest norm in...

Theoretical Computer Science > 2016 > 638 > C > 159-170

Lecture Notes in Computer Science > Automata, Languages and Programming > Contributed Papers > 463-472

*S*is a compacted trie that represents all suffixes of

*S*. Linear-time algorithms for constructing the suffix tree have been known for quite a while. In two dimensions, however, linear-time construction of two-dimensional suffix trees has been an open problem.We present the first linear-time algorithm for constructing two-dimensional suffix trees.

Lecture Notes in Computer Science > Combinatorial Pattern Matching > Session 3: Data Compression I > 95-106

*n*-length text over a

*σ*-size alphabet, we propose a dynamic rank-select structure that supports $O((1+\frac{\log\sigma}{\log\log n})\log n)$ time operations in

*n*log

*σ*+

*o*(

*n*log

*σ*) bits space. If

*σ*< log

*n*, then the operation time is

*O*(log

*n*). In addition, we consider both static and dynamic rank-select structures on the run-length encoding (RLE) of a text. For an

*n*′-length RLE of an

*n*-length...

Lecture Notes in Computer Science > String Processing and Information Retrieval > Algorithms on Trees > 31-38

Lecture Notes in Computer Science > Computing and Combinatorics > Parallel and Distributed Computing > 262-271

*O*(log*

*n*) time and a randomized one that runs in

*O*(1) expected time, both on a reconfigurable mesh of size

*n × n*. In this paper we show that the same deterministic and randomized time complexities can be achieved using only

*O*(

*n*...

Lecture Notes in Computer Science > Combinatorics, Algorithms, Probabilistic and Experimental Methodologies > 271-281

*two-dimensional suffix tree*of an

*n*×

*n*square matrix

*A*is a compacted trie that represents all

*square submatrices*of

*A*[9]. For the off-line case, i.e.,

*A*is given in advance to the algorithm, it is known how to build it in optimal time, for any type of alphabet size [9,15]. Motivated by applications in Image Compression [18], Giancarlo and Guaiana [12] considered the on-line version of the two-dimensional...

Lecture Notes in Computer Science > Information Security and Cryptology - ICISC 2003 > Fast Implementations > 152-165

*k*-differences problem considered the set of edit operations consisting of changes, deletions, and insertions. In this paper we include the

*swap*operation that interchanges two adjacent characters into the set of allowable edit operations, and we present an

*O(t*min(

*m,n*))-time algorithm for the extended edit distance problem, where

*t*is the edit distance...

Lecture Notes in Computer Science > Applied Cryptography and Network Security > Efficient Implementation > 432-442

Lecture Notes in Computer Science > Information Security and Privacy > Public Key Cryptography > 309-326

^{ + }-trees and Patricia tries. From a high-level point of view, the String B-tree of a string

*T*of length

*N*is a B

^{ + }-tree, where the keys are

*pointers*to the suffixes of string

*T*, and they...

Lecture Notes in Computer Science > Combinatorial Pattern Matching > Session 10: Suffix Arrays and Trees > 352-364

*A*is a compacted trie that represents all square submatrices of

*A*. There exists a linear-time construction of two-dimensional suffix trees using the

*odd-even*scheme. This algorithm has the drawback that the merging step is quite complicated. In this paper, we propose a new and simple algorithm to construct two-dimensional suffix trees in linear time by applying...