**International Conference Papers**

- K. Park,

Compressed and searchable indexes for highly similar strings,

ISAAC 2016, December 2016

- K. Park,

Indexes for highly similar sequences,

SPIRE 2016, October 2016

- J.C. NA, H. Kim, H. Park, T. Lecroq, M. Leonard, L. Mouchard, and K. Park,

Compression and Search for Similar Strings,

WAAC 2016, August 2016

- Myoungji Han, Munseong Kang, Sukhyeun Cho, Geonmo Gu, JeongSeop Sim, and Kunsoo Park,

Fast Multiple Order-Preserving Matching Algorithms,

IWOCA 2015

- Myoungji Han, Munseong Kang, Sukhyeun Cho, Geonmo Gu, Jeong Seop Sim, and Kunsoo Park,

Wu-Manber and Karp-Rabin Algorithms for Extended Matching,

WAAC 2015, August 2015

- Jungjoo Seo, Myoungji Han, and Kunsoo Park,

Efficient Accessing and Searching in a Sequence of Numbers,

WAAC 2014, July 2014

- J. Kim, A. Amir, J.C. Na, K. Park and J.S. Sim,

On representations of ternary order relations in numeric strings,

ICABD 2014.

- S. Cho, J.C. Na, K. Park and J.S. Sim,

Fast order-preserving pattern matching,

COCOA 2013. December 2013.

- Joong Chae Na, Heejin Park, Sunho Lee, Minsung Hong, Thierry Lecroq, Laurent Mouchard, and Kunsoo Park,
- Suffix Array of Alignment: A Practical Index for Similar Data,
- SPIRE 2013, Oct 2013.

- Joong Chae Na, Heejin Park, Maxime Crochemore, Jan Holub, Costas S. Iliopoulos, Laurent Mouchard, Kunsoo Park,
- Suffix tree of an alignment: an efficient index for similar data,
- IWOCA 2013, Jul 2013.

- Jinil Kim, Peter Eades, Rudolf Fleischer, Seok-Hee Hong, Costas S. Iliopoulos, Kunsoo Park, Simon J. Puglisi, Takeshi Tokuyama,
- Order Preserving Matching,
- AAAC 2013, Apr 2013.

- Jung Woo Kim, Jungjoo Seo, Jin Hong, Kunsoo Park, and Sung-Ryul Kim,
- High-Speed Parallel Implementations of the Rainbow Method in a Heterogeneous System,
- INDOCRYPT 2012, Dec 2012.

- T. Flouri, C.S. Iliopoulos, K. Park, and S.P. Pissis,
- GapMis-OMP: pairwise short-read alignment on multi-core architectures,
- 8th Artificial Intelligence Applications and Innovations Conference (AIAI 2012), Sep 2012.

- J.W. Kim, S. Lee, K, Park, S. Na, E. Paek, H.S.Park, H. Park, K.J. Lee, J. Jeong, H.Y. Kim,
- Monoisotopic Mass Determination Algorithm for Selenocysteine-containing Polypeptides from Mass Spectrometric Data based on Theoretical Modeling of Isotopic Peak Intensity Ratio,
- WAAC 2012, July 2012.

- Jung Woo Kim, Jungjoo Seo, Jin Hong, and Kunsoo Park,
- A Faster Cryptographic Time-Memory Tradeoff,
- Information Security and Assurance, April 2012.

- J.W. Kim, S. Lee, K, Park, S. Na, E. Paek, H.S.Park, H. Park, K.J. Lee, J. Jeong, H.Y. Kim,
- Monoisotopic Mass Determination Algorithm for Selenocysteine-containing Polypeptides from Mass Spectrometric Data based on Theoretical Modeling of Isotopic Peak Intensity Ratio,
- RECOMB Satellite Conference on Computational Proteomics(RECOMB-CP), April 2012.

- T. Flouri, K. Frousios, C.S. Iliopoulos, K. Park, S.P. Pissis and G. Tischler,
- Approximate string matching with a single gap for sequence alignment,
- ACM Conference on Bioinformatics, Computational Biology & Biomedicine (ACM-BCB), August 2011.

- P. Davoodi, G. S. Brodal, S. Srinivasa Rao
- Path minima queries in dynamic weighted Trees.
- To appear in Proceedings of the Workshop on Algorithms and Data Structures (WADS),
- volume 6844 of Lecture Notes in Computer Science, August 2011.

- P. Davoodi, S. Srinivasa Rao
- Succinct dynamic cardinal trees with constant time operations for small alphabet.
- In Proceedings of the Annual Conference on Theory and Applications of Models of Computation (TAMC),
- Lecture Notes in Computer Science, vol 6648, pages 195–205, May 2011.

- G. S. Brodal, M. Greve, V. Pandey, S. Srinivasa Rao
- Integer representation towards effcient counting in bit probe model.
- In Proceedings of the Annual Conference on Theory and Applications of Models of Computation (TAMC),
- Lecture Notes in Computer Science, vol 6648, pages 206–217, May 2011.

- P. Bille, G. Landau, R. Raman, S. Srinivasa Rao, K. Sadakane and O. Weimann.
- Random access to grammar-compressed strings.
- In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA), January 2011

- Jinil Kim, YooJin Kwon, Jin Wook Kim, Sung-Ryul Kim, Kunsoo Park,
- Effective web crawling orderings from graph search techniques,
- WAAC 2010.

- Taehyung Lee, Joong Chae Na, Heejin Park, Kunsoo Park, Jeong Seop Sim,
- Finding optimal alignment and consensus of circular strings,
- CPM 2010.

- Joo Young Yoon, Kyung Young Lim, Sunho Lee, Kunsoo Park, Eunok Paek, Un-Beom Kang, Jeonghun Yeom, Cheolju Lee,
- Improved quantitative analysis of mass spectrometry using quadratic equations,
- RECOMB-CP 2010.

- G. S. Brodal, P. Davoodi, S. Srinivasa Rao.
- On space efficient two dimensional range minimum data structures.
- In Proceedings of the European Symposium on Algorithms (ESA),
- Lecture Notes in Computer Science, vol 6347, pages 171–182, September 2010.

- Taehyung Lee, Joong Chae Na, Kunsoo Park,
- On-line construction of parameterized suffix trees,
- SPIRE 2009.

- A. Amir, G.M. Landau, J.C. Na, H. Park, K. Park, and J.S. Sim,
- Consensus optimizing both distance sum and radius,
- SPIRE 2009.

- Jinil Kim, Jeongdae Hong, Jihye Kim, Matthew K. Franklin, and Kunsoo Park,
- Optimistic protocols for fair threshold decryption,
- WAAC 2009.

- Taehyung Lee, Joong Chae Na, and Kunsoo Park,
- Construction of parameterized suffix trees revisited
- WAAC 2009.

- Jeongdae Hong, Jinil Kim, Jihye Kim, Matthew K. Franklin, Kunsoo Park,
- Fair threshold decryption with semi-trusted third parties,
- ACISP 2009.

- Kunsoo Park, Joo Young Yoon, Sunho Lee, Eunok Paek, Heejin Park, Sang-Won Lee, Hee-Jung Jung
- RAPID: Fast and accurate determination of monoisotopic masses of polypeptides,
- The 2nd Annual Meeting of Asian Association for Algorithms and Computation 2009

- Taehyung Lee, Jinil Kim, Jin Wook Kim, Sung-Ryul Kim, Kunsoo Park,
- Detecting soft errors by redirection classification,
- World Wide Web 2009.

- A. Farzan, R. Raman, S. Srinivasa Rao,
- Universal succinct representations of trees?
- In Proceedings of International Coloquium on Algo- rithms, Language and Programming (ICALP),
- Lecture Notes in Computer Science, vol 5555, pages 451–462, July 2009.

- S. Srinivasa Rao
- Secondary indexing in one dimension: beyond b-trees and bitmap indexes.
- In Proceedings of the ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS), pages 177–186, June-July 2009

- R. Grossi, A. Orlandi, R. Raman, S. Srinivasa Rao
- More haste, less waste: Lowering the redundancy in fully indexable dictionaries.
- In Proceedings of Symposium on Theoretical Aspects of Computer Science (STACS), pages 517–528, February 2009

- Taehyung Lee, Sung-Ryul Kim and Kunsoo Park,
- Approximate Word sequence matching on an inverted file index,
- 19th International Workshop on Combinatorial Algorithms, September 2008, pp.100-114.

- E. Kim and K. Park,
- Improving multikey quicksort for sorting strings,
- 19th International Workshop on Combinatorial Algorithms, September 2008, pp.89-99.

- Sunho Lee and Kunsoo Park,
- Dynamic compressed representation of texts with rank/select,
- The 11th Korea-Japan Joint Workshop on Algorithms and Computations, May 2008, pp.131-138.

- E. R. Hansen, S. Srinivasa Rao and P. Tiedemann.
- Compressing binary decision diagrams.
- In Proceedings of European Conference on Artificial Intelligence (ECAI), pages 799–800, July 2008

- A. Golynski R. Raman, S. Srinivasa Rao
- On the redundancy of succinct data structures.
- In Proceedings of Scandinavian Workshop on Algorithmic Theory (SWAT),
- Lecture Notes in Computer Science, vol 5124, pages 148–159, July 2008.

- Sunho Lee and Kunsoo Park,
- Rank/select functions for texts over a large alphabet,
- London Stringology Days, February 2008.

- Mun-Kyu Lee, Hyoung Jun Na, Kunsoo Park, Daesung Moon, Kiyoung Moon,
- Implementation and performance evaluation of stream ciphers for
- Secure Sensor Network, International Conference On Next-Generation Computing 2007.

- A. Golynski, R. Grossi, A. Gupta, R. Raman, S. Srinivasa Rao.
- On the size of succinct indices.
- In Proceedings of European Symposium on Algorithms (ESA),
- Lecture Notes in Computer Science, vol 4698, pages 371–382, October 2007.

- Mun-Kyu Lee, Jung Woo Kim, Jeong Eun Song, and Kunsoo Park,
- Sliding window method for NTRU,
- Korea-Japan Joint Workshop on Algorithms and Computation, August 2007.

- Jeongdae Hong, E-yong Kim, Jung Hee Cheon, and Kunsoo Park,
- Fair private matching with semi-trusted third party,
- Korea-Japan Joint Workshop on Algorithms and Computation (WAAC), August 2007.

- Dong Kyue Kim, Joong Chae Na, Jeong Seop Sim and Kunsoo Park.
- A simple construction of two-dimensional suffix trees in linear time,
- Combinatorial pattern Matching (CPM), Lecture Notes in Computer Science, vol.4580, July 2007.

- Sunho Lee and Kunsoo Park,
- Dynamic rank-select structures with applications to run-length encoded texts,
- Combinatorial pattern Matching (CPM), Lecture Notes in Computer Science, vol.4580, July 2007.

- M. He, J. I. Munro, S. Srinivasa Rao.
- Succinct ordinal trees based on tree covering.
- In Proceedings of International Coloquium on Al- gorithms, Language and Programming (ICALP),
- Lecture Notes in Computer Science, vol 4596, pages 509–520, July 2007.

- Kunsoo Park, Joo Young Yoon, Sunho Lee, Eunok Paek, Heejin Park, Sang-Won Lee,
- Fast and accurate determination of isotopic clusters and monoisotopic masses of polypeptides from fourier transform mass spectra
- ASMS Conference on Mass Spectrometry and Allied Topics, June 2007.

- Mun-Kyu Lee, Jung Woo Kim, Jeong Eun Song, and Kunsoo Park,
- Sliding window method for NTRU,
- International Conference on Applied Cryptography and Network Security,
- Lecture Notes in Computer Science, vol.4521, June 2007.

- L. Arge, G. S. Brodal, S. Srinivasa Rao.
- External memory planar point location with logarithmic updates.
- In Proceedings of the Annual ACM Symposium on Computational Geometry (SoCG), pages 139–147, June 2007.

- Jin Wook Kim, Eunsang Kim, and Kunsoo Park,
- Fast matching method for DNA sequences,
- International Symposium on Combinatorics, Algorithms, Probabilistic and
- Experimental Methodologies,
- Lecture Notes in Computer Science, vol.4614, April 2007.

- J. Barbay, M. He, J. I. Munro, S. Srinivasa Rao.
- Succinct indexes for strings, binary relations and multi-labeled trees.
- In Proceedings of the ACM- SIAM Symposium on Discrete Algorithms (SODA), pages 680–689, January 2007.

- S.G. Choi, K. Park and M. Yung
- Short traceable signatures based on bilinear pairings,
- 1st International Workshop on Security,
- Lecture Notes in Computer Science, vol.4266, 2006.

- E. Kim and K. Park,
- Secure registry scheme with randomness reuse,
- Korea-Japan Joint Workshop on Algorithms and Computation, July 2006, 151-158.

- T. Lee, S.G. Park, K. Park, K.H. Cho and G. Jung,
- Computational analysis and modeling of NF-kB activation during hepatitis B virus infection,
- Korea-Japan Joint Workshop on Algorithms and Computation, July 2006, 103-110.

- E. Park and K. Park,
- A new boolean circuit for a maximum matching in a convex bipartite graph,
- 17th Australasian Workshop on Combinatorial Algorithms, July 2006.

- K. Roh, M. Crochemore, C.S. lliopoulos and K. Park,
- External memory algorithms for string problems,
- 17th Australasian Workshop on Combinatorial Algorithms, July 2006.

- J. Barbay, A. Golynski, J. I. Munro, S. Srinivasa Rao.
- Adaptive searching in succinctly encoded binary relations and tree-structured documents.
- In Proceedings of Combinatorial Pattern Matching (CPM),
- Lecture Notes in Computer Science, vol4009, pages 24–35, July 2006.

- E. Kim, L. Xiao, K. Nahrstedt and K. Park,
- Identity-based registry for secure interdomain routing,
- ACM Symposium on Information, Computer and Communications Security, March 2006, pp.321-331.

- A. Golynski, J. I. Munro, S. Srinivasa Rao.
- Rank/select operations on large alphabets: a tool for text indexing.
- In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 368–373, January 2006.

- S. Park, M.K. Lee, D.K. Kim, K. Park, Y. Kang, S. Lee, H Kim, and K. Chung,
- Design of an authentication protocol for secure electronic seals,
- International Conference on Information Security , December 2005.

- J.W. Kim, A. Amir, G.M. Landau, and K. Park,
- Computing similarity of run-length encoded strings with affine gap penalty,
- 12th Symposium on String Processing and Information Retrieval, November 2005,
- Lecture Notes in Computer Science, vol.3772, 2005, pp.316-327.

- J.W. Kim, I. Lee, J.C. Na, K. Roh, S. Lee, and K. Park,
- Developing a fragment assembly program,
- BIOINFO 2005 – the International Joint Conference of InCoB, AASBi and KSBI, September 2005.

- J.C. Na, R.Giancarlo, and K.Park.
- O(n^2 log n) time on-line construction of two-dimensional suffix trees,
- 11th International Computing and Combinatorics Conference (COCOON), August 2005,
- Lecture Notes in Computer Science, vol. 3595, pages 273–282, 2005.

- D.K. Kim, J.C. Na, J.E. Kim, and K. Park,
- New algorithm for rank and select functions,
- 2005 Korea-Japan Joint Workshop on Algorithms and Computation (WAAC), August 2005, pp.68-75.

- J.W. Kim, A. Amir, G.M. Landau, and K. Park,
- Extending comparison of run-length encoded strings to a more general scoring metric,
- 2005 Korea-Japan Joint Workshop on Algorithms and Computation (WAAC), August 2005, pp.59-67.

- D.K. Kim, J.C. Na, J.E. Kim and K. Park,
- Efficient implementation of rank and select functions for succinct representation,
- 4th International Workshop on Efficient and Experimental Algorithms (WEA), May 2005,
- Lecture Notes in Computer Science, vol.3503, 2005, pp.315-327.

- M. He, J. I. Munro, S. Srinivasa Rao.
- A categorization theorem on suffix arrays with applications to space-efficient text indexes.
- In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 23–32, January 2005.

- A. Pagh, R. Pagh, S. Srinivasa Rao.
- An optimal bloom filter replacement.
- In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 823–829, January 2005.

- J.C. Na and K. Park,
- Simple implementation of string B-trees,
- 11th Symposium on String Processing and Information Retrieval (SPIRE),
- Lecture Notes in Computer Science, vol.3246, October 2004, pp.214-215.

- I. Lee, C. S. Iliopoulos, K. Park
- Linear time algorithm for the longest common repeat problem,
- 11th Symposium on String Processing and Information Retrieval,
- Lecture Notes in Computer Science, vol.3246, October 2004, pp.10-17.

- J.W. Kim and K. Park,
- An efficient local alignment algorithm for masked sequences,
- 10th International Computing and Combinatorics Conference,
- Lecture Notes in Computer Science, vol.3106, August 2004, pp.440-449.

- Y.W. Choi and K. Park,
- Time and space efficient search with suffix arrays,
- 15th Australasian Workshop on Combinatorial Algorithms (AWOCA), July 2004, pp.230-238.

- R. Clifford, C.S. Iliopoulos and K. Park,
- Extending the edit distance for musical applications
- 15th Australasian Workshop on Combinatorial Algorithms (AWOCA), July 2004, pp.97-102.

- S. Lee and K. Park
- Efficient implementations of suffix array construction algorithms
- 15th Australasian Workshop on Combinatorial Algorithms (AWOCA), July 2004, pp.64-72.

- K. Park, H. Park, W.C. Jeun and S. Ha,
- Boolean circuit programming: A new paradigm to design parallel algorithms
- 15th Australasian Workshop on Combinatorial Algorithms (AWOCA), July 2004, pp.28-39.

- J. I. Munro, S. Srinivasa Rao.
- Succinct representation of functions.
- In Proceedings of International Coloquium on Algorithms, Language and Programming (ICALP),
- Lecture Notes in Computer Science, vol 3142, pages 1006–1015, July 2004.

- T.J. Park, M.K. Lee and K. Park,
- Efficient scalar multiplication in hyperelliptic curves using a new Frobenius expansion,
- 6th International Conference on Information Security and Cryptology (ICISC),
- Lecture Notes in Computer Science, vol.2971, November 2003, pp.152-165.

- T.J. Park, M.K. Lee, E.Y. Kim and K. Park,
- A general expansion method using efficient endomorphisms,
- 6th International Conference on Information Security and Cryptology (ICISC),
- Lecture Notes in Computer Science, vol.2971, November 2003, pp.112-126.

- M. Christodoulakis, C.S. Iliopoulos, K. Park and J.S. Sim,
- Approximate seeds of strings,
- Prague Stringology Conference (PSC), September 2003, pp.25-36.
- (Czech Technical University)

- M. Christodoulakis, C.S. Iliopoulos, K. Park and J.S. Sim,
- Implementing approximate regularities,
- International Conference of Computational Methods in Sciences
- and Engineering (ICCMSE), September 2003. (ESCMCE)

- G. S. Brodal, R. Fagerberg, A. O ̈ stlin, C. N. S. Pedersen, S. Srinivasa Rao.
- Computing refined buneman trees in cubic time.
- In Proceedings of Workshop on Algorithms in Bioinformatics (WABI),
- Lecture Notes in Computer Science, vol 2812, pages 259–270, September 2003.

- J.S. Sim, D.K. Kim, H. Park and K. Park,
- Linear-time search in suffix arrays,
- 14th Australasian Workshop on Combinatorial Algorithms (AWOCA), July 2003, pp.139-146.

- M.K. Lee, J.W. Kim and K. Park,
- Security of using special integers in elliptic scalar multiplication,
- 14th Australasian Workshop on Combinatorial Algorithms (AWOCA), July 2003, pp.101-104.

- I. Lee, A. Apostolico, C.S. Iliopoulos and K. Park,
- Finding approximate occurrences of a pattern that contains gaps,
- 14th Australasian Workshop on Combinatorial Algorithms (AWOCA), July 2003, pp.89-100.

- S.R. Kim, I. Lee and K. Park,
- A fast algorithm for the generalized k-keyword proximity problem given keyword offsets,
- 14th Australasian Workshop on Combinatorial Algorithms (AWOCA), July 2003, pp.80-88.

- J. I. Munro, R. Raman, V. Raman, S. Srinivasa Rao.
- Succinct representations of permutations.
- In Proceedings of International Coloquium on Algo- rithms, Language and Programming (ICALP),
- volume 2719 of Lecture Notes in Computer Science, pages 345–356, July 2003.

- R. Raman, S. Srinivasa Rao.
- Succinct dynamic dictionaries and trees.
- In Proceedings of International Coloquium on Algorithms, Language and Programming (ICALP),
- Lecture Notes in Computer Science, vol 2719, pages 357–368, July 2003.

- D.K. Kim, J.S. Sim, H. Park and K. Park,
- Linear-time construction of suffix arrays,
- 14th Symposium on Combinatorial Pattern Matching (CPM), June 2003,
- Lecture Notes in Computer Science, vol.2676, 2003, pp.186-199.

- J.W. Kim, K.H Roh, K. Park, H. Park and J.S. Seo,
- MLP: mate-based layout with phrap,
- 7th International Conference on Research in Computational
- Molecular Biology (RECOMB), April 2003. (ACM)

- T.J. Park, M.K. Lee and K. Park,
- New frobenius expansions for elliptic curves with efficient endomorphisms,
- 5th International Conference on Information Security and Cryptology (ICISC),
- Lecture Note in Computer Science, vol.2587, November 2002, pp.264-282.

- I. Lee, K. Park, Y. Choi and S.K. Chung,
- A simple and scalable algorithm for the IP address lookup problem,
- 13th Australasian Workshop on Combinatorial Algorithms (AWOCA), July 2002, pp.209-220. (University of Queensland)

- S. Kim, J.S. Sim, H. Park, K. Park, H. Park and J.S. Seo,
- Finding all normalized local alignments above a threshold,
- 6th International Conference on Research in Computational
- Molecular Biology (RECOMB), April 2002.

- H. Park, K. Park and Y. Cho,
- Deleting keys of B-trees in parallel,
- International Parallel and Distributed Processing Symposium (IPDPS), April 2002.

- R. Raman and V. Raman, S. Srinivasa Rao.
- Succinct indexable dictionaries with applications to encoding k-ary trees and multisets.
- In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 233–242, January 2002.

- D.K. Kim and K. Park,
- Two-dimensional suffix links and their applications,
- 5th Korea-Japan Joint Workshop on Algorithms and Computation, June 2001.

- H. Yoon and K. Park,
- A fragile watermark for data embedding and image verification,
- 5th Korea-Japan Joint Workshop on Algorithms and Computation, June 2001.

- M.K. Lee, Y. Kim, K. Park and Y. Cho,
- Efficient parallel exponentiation in GF(2^n) using
- normal basis representations,
- 13th ACM Symposium on Parallel Algorithms and Architectures (SPAA), July 2001. (ACM)

- T. Kasai, G. Lee, H. Arimura, S. Arikawa and K. Park,
- Linear-time longest-common-prefix computation in suffix arrays
- and its applications,
- 12th Symposium on Combinatorial Pattern Matching (CPM), July 2001,
- Lecture Notes in Computer Science, vol.2089, 2001, pp.181-192.

- J. Radhakrishnan, V. Raman, S. Srinivasa Rao.
- Explicit deterministic constructions for membership in the bitprobe model.
- In Proceedings of the European Symposium on Algorithms (ESA),
- Lecture Notes in Computer Science, vol 2161, pages 290–299, August 2001.

- R. Raman, V. Raman, S. Srinivasa Rao.
- Succinct dynamic data structures.
- In Proceedings of the Workshop on Algorithms and Data Struc- tures (WADS),
- Lecture Notes in Computer Science, vol 2125, pages 426–437, August 2001.

- Y. Chung, K. Park and H.C. Kwon,
- An efficient parallel algorithm for scheduling interval ordered tasks,
- IFIP International Conference on Theoretical Computer Science,
- Sendai, Japan, August 2000.
- Lecture Notes in Computer Science, vol.1872, 2000, pp.100-111.

- M.K. Lee, D.K. Kim and K. Park,
- An authenticated encryption scheme with public verifiability,
- 4th Korea-Japan Joint Workshop on Algorithms and Computation,
- Tokyo, Japan, July 2000, pp.49-56. (IPSJ)

- S.R. Kim and K. Park,
- Efficient list ranking algorithms on reconfigurable mesh,
- 6th International Computing and Combinatorics Conference,
- July 2000, Lecture Notes in Computer Science, vol.1858

- S.R. Kim and K. Park,
- A dynamic edit distance table,
- 11th Symposium on Combinatorial Pattern Matching (CPM), June 2000,
- Lecture Notes in Computer Science, vol.1848, 2000, pp.60-68.

- J.C. Na and K. Park,
- Data compression with truncated suffix trees,
- Data Compression Conference, Utah, March 2000, p.565.

- V. Raman, S. Srinivasa Rao.
- Static dictionaries supporting rank.
- In Proceedings of the International Symposium on Algo- rithms and Computation (ISAAC),
- Lecture Notes in Computer Science, vol 1741, pages 18–26, December 1999.

- J.S. Sim and K. Park,
- The consensus string problem for a metric is NP-complete,
- 10th Australasian Workshop on Combinatorial Algorithms (AWOCA),
- Perth, Australia, August 1999, pp.107-113.
- (Curtin University)

- J.S. Sim, C.S. Iliopoulos, K. Park and W.F. Smyth,
- Approximate periods of strings,
- 10th Symposium on Combinatorial Pattern Matching (CPM), UK, July 1999,
- Lecture Notes in Computer Science, vol.1645, 1999, pp.123-133.

- D.K. Kim and K. Park,
- Linear-time construction of two-dimensional suffix trees,
- 26th International Colloquium on Automata, Languages and Programming (ICALP),
- Prague, Czech, July 1999, Lecture Notes in Computer Science, vol.1644, 1999, pp.463-472.

- D.K. Kim, J.S. Sim and K. Park,
- Suffix trees for integer alphabets revisited,
- 3rd Korea-Japan Joint Workshop on Algorithms and Computation,
- Seoul, Korea, July 1999, pp.171-178. (KISS)

- H. Park and K. Park,
- Parallel algorithms for dictionary operations on red-black trees,
- 3rd Korea-Japan Joint Workshop on Algorithms and Computation,
- Seoul, Korea, July 1999, pp.184-197. (KISS)

- S.R. Kim and K. Park
- Fully-scalable fault-tolerant simulations for BSP and CGM,
- 13th International Parallel Processing Symposium (IPPS) and
- 10th Symposium on Parallel and Distributed Processing (SPDP),
- San Juan, Puerto Rico, April 1999, pp.117-124. (IEEE)

- J. I. Munro, V. Raman, S. Srinivasa Rao.
- Space efficient suffix trees.
- In Proceedings of the 18th Conference on the Foundations of Software Technology and Theoretical Computer Science (FSTTCS),
- Lecture Notes in Computer Science, vol 1530, pages 186–196, December 1998.

- D.K. Kim, Y.A. Kim and K. Park,
- Constructing suffix arrays for multi-dimensional matrices,
- 9th Symposium on Combinatorial Pattern Matching (CPM),
- Piscataway, USA, July 1998,
- Lecture Notes in Computer Science, vol.1448, 1998, pp.126-139.

- Y. Chung, K. Park and Y. Cho,
- Parallel maximum matching algorithms in interval graphs,
- International Conference on Parallel and Distributed Systems,
- Seoul, Korea, December 1997, pp.602-609.

- S.R. Kim, K. Park and Y. Cho,
- A new public-key cryptosystem based on the chinese remainder theorem,
- Korea-Japan Joint Workshop on Information Security and Cryptology,
- Seoul, Korea, October 1997, pp.211-215.

- J.S. Lee, D.K. Kim, K. Park and Y. Cho,
- Simple construction of two-dimensional suffix arrays,
- 2nd Japan-Korea Joint Workshop on Algorithms and Computation,
- Fukuoka, Japan, July 1997, pp.48-55.

- Y. Chung, K. Park and Y. Cho,
- Notes on a parallel hamiltonian path algorithm in interval graphs,
- 5th Twente Workshop on Graphs and Combinatorial Optimization,
- Enschede, Netherlands, May 1997, pp.55-62. (University of Twente)

- J.S. Lee, D.K. Kim, K. Park and Y. Cho,
- Efficient algorithms for approximate string matching with swaps,
- 8th Symposium on Combinatorial Pattern Matching,
- Aarhus, Denmark, June 1997,
- Lecture Notes in Computer Science, vol.1264, 1997, pp.28-39.

- Z. Galil, J.G. Park and K. Park,
- Three-dimensional pattern matching,
- 9th ACM Symposium on Parallel Algorithms and Architectures (SPAA),
- Newport, USA, June 1997, pp.53-62.
- (ACM)

- S.R. Kim and K. Park,
- An efficient convex hull algorithm on reconfigurable mesh,
- Korea-Japan Joint Workshop on Algorithms and Computation,
- Korea, August 1996, pp.1-7. (KISS)

- K. Park,
- Analysis of two-dimensional approximate pattern matching algorithms,
- 7th Symposium on Combinatorial Pattern Matching (CPM), USA, June 1996,
- Lecture Notes in Computer Science, vol.1075, 1996, pp.335-347.

- Y. Kim, K. Park and Y. Cho,
- A Hangul encryption algorithm based on DES,
- 10th International Conference on Information Networking (ICOIN),
- Kyung-ju, Korea, January 1996, pp.390-397. (KISS)

- Y. Chung, K. Park and Y. Cho,
- Constant-time algorithms for interval graph problems on reconfigurable meshes,
- 46th SIGAL Workshop, Osaka, Japan, July 1995. (IPSJ)

- K. Park and D.K. Kim,
- String matching in hypertext,
- 6th Symposium on Combinatorial Pattern Matching (CPM),
- Helsinki, Finland, July 1995,
- Lecture Notes in Computer Science, vol.947, 1995, pp.318-329.

- A. Czumaj, Z. Galil, L. Gasieniec, K. Park and W. Plandowski,
- Work-time optimal parallel algorithms for string problems,
- 27th ACM Symposium on Theory of Computing (STOC),
- Las Vegas, USA, May 1995, pp.713-722. (ACM)

- S.R. Kim, K. Park and Y. Cho,
- An O(logN loglogN) time RMESH algorithm for
- the simple polygon visibility problem,
- International Symposium on Parallel Architectures (ISPAN),
- Algorithms, and Networks, Kanazawa, Japan, December 1994. (IEEE)

- S.S. Lim, Y.H. Bae, G.T. Jang, B.D. Rhee, S.L. Min, C.Y. Park,
- H. Shin, K. Park and C.S. Kim,
- An accurate worst case timing analysis technique for RISC processors,
- 15th Real-Time Systems Symposium (RTSS), Puerto Rico, 1994. (IEEE)

- L. Gasieniec and K. Park,
- Work-time optimal parallel prefix matching,
- 2nd European Symposium on Algorithms (ESA),
- Utrecht, The Netherlands, September 1994,
- Lecture Notes in Computer Science, 1994, pp.471–482.

- A.M. Ben-Amram, O. Berkman, C.S. Iliopoulos and K. Park,
- The subtree max gap problem with application to parallel string covering,
- 5th ACM-SIAM Symposium on Discrete Algorithms (SODA),
- Arlington, USA, January 1994, pp.501-510. (SIAM)

- R. Cole, M. Crochemore, Z. Galil, L. Gasieniec, R. Hariharan,
- S. Muthukrishnan, K. Park and W. Rytter,
- Optimally fast parallel algorithms for preprocessing and pattern matching
- in one and two dimensions,
- 34th IEEE Symposium on Foundations of Computer Science (FOCS),
- Palo Alto, USA, 1993, pp.248-258.

- C.S. Iliopoulos, D.W.G. Moore and K. Park,
- Covering a string,
- 4th Symposium on Combinatorial Pattern Matching,
- Padova, Italy, June 1993,
- Lecture Notes in Computer Science, vol.684, Berlin, 1993, pp.54-62.

- Z. Galil and K. Park,
- Truly alphabet-independent two-dimensional pattern matching,
- Proc. 33rd IEEE Symposium on Foundations of Computer Science,
- Pittsburgh, USA, October 1992, pp.247-256.

- K. Park,
- Fast string matching on the average,
- 8th British Colloquium for Theoretical Computer Science,
- Newcastle Upon Tyne, UK, March 1992.

- Z. Galil and K. Park,
- Dynamic programming with convexity, concavity and sparsity,
- 1st Symposium on Combinatorial Pattern Matching,
- Paris, France, July 1990.

- Z. Galil and K. Park,
- An improved algorithm for approximate string matching,
- 16th International Colloquium on Automata, Languages and Programming,
- Stresa, Italy, July 1989,
- Lecture Notes in Computer Science, vol.372.
- Berlin, 1989, pp.394-404.