S -> Journal ----> Conf ----> Misc -> F


Chapters in Books

  1. Computing the Edit-Distance between a Tree and a Regular Tree Language,
    Yo-Sub Han, Sang-Ki Ko and Kai Salomaa
    in Multidisciplinary Creativity. Homage to Gheorghe Paun on his 65th Birthday, Spandugino, 249--260, 2015

  2. State Complexity of Combined Operations for Prefix-Flee Regular Languages,
    Hae-Sung Eom, Yo-Sub Han, Kai Salomaa and Sheng Yu
    in Discrete Mathematics and Computer Science. In Memoriam Alexandru Mateescu (1952-2005), Editura Academiei, Bucuresti (The Publishing House of the Romanian Academy, Bucharest), 137--152, 2014

  3. Operational State Complexity of Prefix-Free Regular Languages,
    Yo-Sub Han, Kai Salomaa and Derick Wood
    in Automata, Formal Languages, and Related Topics-Dedicated to Ferenc Gécseg on the occasion of his 70th birthday, Institue of Informatics, University of Szeged, Hungary, 99--116, 2009

  4. Considering Resource Management in Agent-Based Virtual Organization,
    Grzegorz Frackowiak, Maria Ganzha, Maciej Gawinecki, Marcin Paprzycki, Michal Szymczak, Myon-Woong Park, Yo-Sub Han
    In Intelligent Agents in the Evolution of Web and Applications, Advances in Computational Intelligence Series, 161--190, 2009 [pdf]

Journals

  1. Pseudoknot-Generating Operation,
    Da-Jung Cho, Yo-Sub Han, Timothy Ng and Kai Salomaa
    To appear in Theoretical Computer Science (TCS)

  2. Outfix-Guided Insertion,
    Da-Jung Cho, Yo-Sub Han, Timothy Ng and Kai Salomaa
    To appear in Theoretical Computer Science (TCS)

  3. State Complexity of k-Parallel Tree Concatenation,
    Yo-Sub Han, Sang-Ki Ko and Kai Salomaa
    In Fundamenta Informaticae (FI) Vol. 154, 185--199, Aug. 2017 [pdf]

  4. State Complexity of Permutation on Finite Languages over a Binary Alphabet,
    Da-Jung Cho, Daniel Goc, Yo-Sub Han, Sang-Ki Ko, Alexandros Palioudakis and Kai Salomaa
    In Theoretical Computer Science (TCS), Vol. 682, 67--78, June 2017 [pdf]

  5. Ambiguity, Nondeterminism and State Complexity of Finite Automata,
    Yo-Sub Han, Arto Salomaa and Kai Salomaa
    In Acta Cybernetica Vol. 23(2), 141--157, May 2017 [pdf]

  6. Complexity of Regular Tree Languages for Tree Matching,
    Sang-Ki Ko, Ha-Rim Lee and Yo-Sub Han
    In International Journal of Foundations of Computer Science (IJFCS) Vol. 27, No. 8 965--979, December 2016 [pdf]

  7. State Complexity of Insertion,
    Yo-Sub Han, Sang-Ki Ko, Timothy Ng and Kai Salomaa
    In International Journal of Foundations of Computer Science (IJFCS) Vol. 27, No. 7 863--878, November 2016 [pdf]

  8. Operational State Complexity of Subtree-Free Regular Tree Languages,
    Sang-Ki Ko, Hae-Sung Eom and Yo-Sub Han
    In International Journal of Foundations of Computer Science (IJFCS) Vol. 27, No. 6 705--724, September 2016 [pdf]

  9. Duplications and Pseudo-Duplications,
    Da-Jung Cho, Yo-Sub Han, Hwee Kim, Alexandros Palioudakis, Kai Salomaa
    In International Journal of Unconventional Computing (IJUC), Vol. 12(2-3), 145--167, May 2016

  10. OMPPM: Online Multiple Palindrome Pattern Matching,
    Hwee Kim and Yo-Sub Han
    In Bioinformatics, Vol. 32(8), 1151--1157, April 2016 [pdf]

  11. Approximate Matching between a Context-Free Grammar and a Finite-State Automaton,
    Sang-Ki Ko, Yo-Sub Han and Kai Salomaa
    In Information and Computation (I&C), Vol. 247, 278--289, April 2016 [pdf]

  12. State Complexity of Basic Operations on Non-Returning Regular Languages,
    Hae-Sung Eom, Yo-Sub Han and Galina Jirásková
    In Fundamenta Informaticae (FI) Vol. 144(2), 161--182, March 2016 [pdf]

  13. Pseudo-Inversion: Closure Properties and Decidability,
    Da-Jung Cho, Yo-Sub Han, Shin-Dong Kang, Hwee Kim, Sang-Ki Ko and Kai Salomaa
    In Natural Computing, Vol. 15, 31--39, March 2016 [pdf]

  14. State Complexity of Deletion and Bipolar Deletion,
    Yo-Sub Han, Sang-Ki Ko, Kai Salomaa
    In Acta Informatica, Vol. 53, 67--85, February 2016 [pdf]

  15. State Complexity of Inversion Operations,
    Da-Jung Cho, Yo-Sub Han, Sang-Ki Ko and Kai Salomaa
    In Theoretical Computer Science (TCS), Vol. 610, 2--12, January 2016 [pdf]

  16. State complexity of Kleene-star operations on regular tree languages,
    Yo-Sub Han, Sang-Ki Ko, Xiaoxue Piao and Kai Salomaa
    In Acta Cybernetica Vol. 22(2), 403--422, November 2015 [pdf]

  17. State Complexity of Boundary of Prefix-Free Regular Languages,
    Hae-Sung Eom and Yo-Sub Han
    In International Journal of Foundations of Computer Science (IJFCS) Vol. 26, No. 6 697--707, September 2015 [pdf]

  18. Non-overlapping Inversion on Strings and Languages,
    Hwee Kim and Yo-Sub Han
    In Theoretical Computer Science (TCS), Vol. 592, 9--22, August 2015 [pdf]

  19. A Recommendation Model Using the Bandwagon Effect for E-Marketing Purposes in IoT,
    Sang-Min Choi, Hyein Lee, Yo-Sub Han, Ka Lok Man and Woon Kian Chong
    In International Journal of Distributed Sensor Networks, Vol. 2015, July 2015 [pdf]

  20. Alignment with Non-Overlapping Inversions and Translocations on Two Strings,
    Da-Jung Cho, Yo-Sub Han and Hwee Kim
    In Theoretical Computer Science (TCS), Vol. 575, 90--101, April 2015 [pdf]

  21. State complexity of k-union and k-intersection for prefix-free regular languages,
    Hae-Sung Eom, Yo-Sub Han and Kai Salomaa
    In International Journal of Foundations of Computer Science (IJFCS) Vol. 26, No. 2 211--227, February 2015 [pdf]

  22. Decidability of Involution Hypercodes,
    Da-Jung Cho, Yo-Sub Han and Sang-Ki Ko
    In Theoretical Computer Science (TCS), Vol. 550, 90--99, September 2014 [pdf]

  23. A Speculative Parallel DFA Membership Test for Multicore, SIMD and Cloud Computing Environments,
    Yousun Ko, Minyoung Jung, Yo-Sub Han and Bernd Burgstaller
    In International Journal of Parallel Programming (IJPP), Vol. 42, 456---489, June 2014 [pdf]

  24. The Edit-Distance between a Regular Language and a Context-Free Language,
    Yo-Sub Han, Sang-Ki Ko and Kai Salomaa
    In International Journal of Foundations of Computer Science (IJFCS), Vol. 24, No. 7 1067--1082, November 2013 [pdf]

  25. State Elimination Heuristics for Short Regular Expressions,
    Yo-Sub Han
    In Fundamenta Informaticae (FI) Vol. 128(4), 445--462, November 2013 [pdf]

  26. State Complexity of Combined Operations for Suffix-Free Regular Languages,
    Hae-Sung Eom and Yo-Sub Han
    In Theoretical Computer Science (TCS), Vol. 510, 87--93, October 2013 [pdf]

  27. An Improved Prefix-Free Regular-Expression Matching,
    Yo-Sub Han
    In International Journal of Foundations of Computer Science (IJFCS), Vol. 24, No. 5, 679--685, August 2013 [pdf]

  28. Representative Reviewers for Internet Social Media,
    Sang-Min Choi and Yo-Sub Han
    In Expert Systems with Applications, Vol. 40, 1274--1282, March 2013 [pdf]

  29. Analysis of a cellular automaton model for car traffic with a junction,
    Yo-Sub Han and Sang-Ki Ko
    In Theoretical Computer Science (TCS), Vol. 450, 54--67, September 2012 [pdf]

  30. A Movie Recommendation Algorithm based on Genre Correlations,
    Sang-Min Choi, Sang-Ki Ko and Yo-Sub Han
    In Expert Systems with Applications, Vol. 39, 8079--8085, July 2012 [pdf]

  31. Computing User Reputation in a Social Network of Web 2.0,
    Yo-Sub Han, Laehyun Kim and Jeong-Won Cha
    In Computing and Informatics, Vol. 31, No. 2, 447--462, 2012 [pdf]

  32. Overlap-Free Languages and Solid Codes,
    Yo-Sub Han and Kai Salomaa
    In International Journal of Foundations of Computer Science (IJFCS), Vol. 22, No. 5, 1197--1209, August 2011 [pdf]

  33. Ranking Parameters based on Social Network for User-generated Video Contents,
    Laehyun Kim, Lisa Wiyartanti, Hyunchul Cho, Yo-Sub Han and Jeong-Won Cha
    In Information-An International Interdisciplinary Journal, Vol. 13, No. 5, 1667--1678, September 2010 [pdf]

  34. On the Linear Number of Matching Substrings,
    Yo-Sub Han
    In Journal of Universal Computer Science, Vol. 16, 715--728, March 2010 [pdf]

  35. Nondeterministic State Complexity of Nested Word Automata,
    Yo-Sub Han and Kai Salomaa
    In Theoretical Computer Science (TCS), Vol. 410, 2961--2971, August 2009 [pdf]

  36. State Complexity of Basic Operations on Suffix-Free Regular Languages,
    Yo-Sub Han and Kai Salomaa
    In Theoretical Computer Science (TCS), Vol. 410, 2537--2548, June 2009 [pdf]

  37. Nondeterministic State Complexity of Basic Operations for Prefix-free Regular Languages,
    Yo-Sub Han, Kai Salomaa and Derick Wood
    In Fundamenta Informaticae (FI) Vol. 90(1-2), 93--106, 2009 [pdf]

  38. Adaptability in an agent-based virtual organisation,
    Grzegorz Frackowiak, Maria Ganzha, Maciej Gawinecki, Marcin Paprzycki, Michal Szymczak, Costin Badica, Yo-Sub Han and Myon-Woong Park
    In International Journal of Agent-Oriented Software Engineering (IJAOSE), Vol. No. 2/3, 188--211, 2009 [pdf]

  39. Generalizations of One-Deterministic Regular Languages,
    Yo-Sub Han and Derick Wood
    In Information and Computation (I&C), Vol. 206, 1117--1125, 2008 [pdf]

  40. State Complexity of Union and Intersection of Finite Languages,
    Yo-Sub Han and Kai Salomaa
    In International Journal of Foundations of Computer Science (IJFCS) Vol. 19, No. 3, 581--595, 2008 [pdf]

  41. Simple-Regular Expressions and Languages,
    Yo-Sub Han, Gerhard Trippen and Derick Wood
    In Journal of Automata, Languages and Combinatorics (JALC), Vol. 12(1/2),181--194, 2007 [pdf]

  42. Outfix-free Regular Languages and Prime Outfix-free Decomposition,
    Yo-Sub Han and Derick Wood
    In Fundamenta Informaticae (FI) Vol. 81(4), 441--457, 2007 [pdf]

  43. Prefix-Free Regular Languages and Pattern Matching,
    Yo-Sub Han, Yajun Wang and Derick Wood
    In Theoretical Computer Science (TCS) Vol. 389, 307--317, 2007 [pdf]

  44. On the Existence of Prime Decompositions,
    Yo-Sub Han, Arto Salomaa, Kai Salomaa, Derick Wood and Sheng Yu
    In Theoretical Computer Science (TCS) Vol. 376, 60--69, 2007 [pdf]

  45. Obtaining Shorter Regular Expressions from Finite-State Automata,
    Yo-Sub Han and Derick Wood
    In Theoretical Computer Science (TCS) Vol. 370, 110--120, 2007 [pdf]

  46. Intercode Regular Languages,
    Yo-Sub Han, Kai Salomaa and Derick Wood
    In Fundamenta Informaticae (FI) Vol. 76, 113--128, 2007 [pdf]

  47. Infix-free Regular Expressions and Languages,
    Yo-Sub Han, Yajun Wang and Derick Wood
    In International Journal of Foundations of Computer Science (IJFCS) Vol. 17, No.2, 379--393, 2006 [pdf]

  48. The Generalization of Generalized Automata: Expression Automata,
    Yo-Sub Han and Derick Wood
    In International Journal of Foundations of Computer Science (IJFCS) Vol. 16, No. 3, 499--510, 2005 [pdf]

Conferences

  1. Ruleset Optimization on Isomorphic Oritatami Systems,
    Yo-Sub Han and Hwee Kim
    To appear in Proceedings of the 23th International Conference on DNA Computing and Molecular Programming (DNA23), 2017

  2. Self-attraction Removal from Oritatami Systems,
    Yo-Sub Han, Hwee Kim, Trent Rogers and Shinnosuke Seki
    In Proceedings of the 19th International Workshop on Descriptional Complexity of Formal Systems (DCFS'17), LNCS 10316, 164--176, 2017

  3. Alignment Distance of Regular Tree Languages,
    Yo-Sub Han and Sang-Ki Ko
    In Proceedings of the 22nd International Conference on Implementation and Application of Automata (CIAA'17), LNCS 10329, 126--137, 2017

  4. Template-based Pattern Matching in Two-dimensional Arrays,
    Yo-Sub Han and Daniel Prusa
    In Proceedings of the 18th International Workshop on Combinatorial Image Analysis (IWCIA'17), LNCS 10256, 79--92, 2017

  5. Deduplication on Finite Automata and Nested Duplication Systems,
    Da-Jung Cho, Yo-Sub Han and Hwee Kim
    In Proceedings of Unconventional Computation & Natural Computation 2017 (UCNC'17), LNCS 10240, 196--207, 2017

  6. Consensus String Problem for Multiple Regular Languages,
    Yo-Sub Han, Sang-Ki Ko, Timothy Ng and Kai Salomaa
    In Proceedings of the 11th International Conference on Language and Automata Theory and Applications (LATA'17), LNCS 10168, 196--207, 2017

  7. Edit-Distance between Visibly Pushdown Languages,
    Yo-Sub Han and Sang-Ki Ko
    In Proceedings of the 43rd International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM'17), LNCS 10139, 387--401, 2017

  8. Nondeterministic seedless oritatami systems and hardness of testing their equivalence,
    Yo-Sub Han, Hwee Kim, Makoto Ota and Shinnosuke Seki
    In Proceedings of the 22nd International Conference on DNA Computing and Molecular Programming (DNA22), LNCS 9818, 19--34, 2016 [pdf]

  9. Outfix-Guided Insertion,
    Da-Jung Cho, Yo-Sub Han, Timothy Ng and Kai Salomaa
    In Proceedings of the 20th International Conference on Developments in Language Theory (DLT'16), LNCS 9840, 102--113, 2016 [pdf]

  10. Inferring a Relax NG Schema from XML Documents,
    Guen-Hae Kim, Sang-Ki Ko and Yo-Sub Han
    In Proceedings of the 10th International Conference on Language and Automata Theory and Applications (LATA'16), LNCS 9618, 400--411, 2016 [pdf]

  11. Pseudoknot-Generating Operation,
    Da-Jung Cho, Yo-Sub Han, Timothy Ng and Kai Salomaa
    In Proceedings of the 42nd International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM'16), LNCS 9587, 241--252, 2016 [pdf]

  12. Duplications and Pseudo-Duplications,
    Da-Jung Cho, Yo-Sub Han, Hwee Kim, Alexandros Palioudakis and Kai Salomaa
    In Proceedings of Unconventional Computation & Natural Computation 2015 (UCNC'15), LNCS 9252, 157--168, 2015 [pdf]

  13. Generalizations of Code Languages with Marginal Errors,
    Yo-Sub Han, Sang-Ki Ko and Kai Salomaa
    In Proceedings of the 19th International Conference on Developments in Language Theory (DLT'15), LNCS 9168, 264--275, 2015 [pdf]

  14. The State Complexity of Permutations on Finite Languages over Binary Alphabets,
    Alexandros Palioudakis, Da-Jung Cho, Daniel Goc, Yo-Sub Han, Sang-Ki Ko and Kai Salomaa
    In Proceedings of the 17th International Workshop on Descriptional Complexity of Formal Systems (DCFS'15), LNCS 9118, 220--230, 2015 [pdf]

  15. Frequent Pattern Mining with Non-overlapping Inversions,
    Da-Jung Cho, Yo-Sub Han and Hwee Kim
    In Proceedings of the 9th International Conference on Language and Automata Theory and Applications (LATA'15), LNCS 8977, 121--132, 2015 [pdf]

  16. Online Multiple Palindrome Pattern Matching,
    Hwee Kim and Yo-Sub Han
    In Proceedings of the 21st edition of the International Symposium on String Processing and Information Retrieval (SPIRE'14), LNCS 8799, 173--178, 2014 [pdf]

  17. Parallel CYK Membership Test on GPUs,
    Kyoung-Hwan Kim, Sang-Min Choi, Hyein Lee, Ka Lok Man and Yo-Sub Han
    In Proceedings of the 11th IFIP International Conference on Network and Parallel Computing (NPC'14), LNCS 8707, 157--168, 2014 [pdf]

  18. Analyzing Item Features for Cold-Start Problems in Recommendation Systems,
    Soryoung Kim, Sang-Min Choi, Yo-Sub Han, Ka Lok Man and Kaiyu Wan
    In Proceedings of the 2014 Tenth International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP'14), 167--170, 2014 [pdf]

  19. State Complexity of Deletion,
    Yo-Sub Han, Sang-Ki Ko and Kai Salomaa
    In Proceedings of the 18th International Conference on Developments in Language Theory (DLT'14), LNCS 8633, 37--48, 2014 [pdf]

  20. State Complexity of Inversion Operations,
    Da-Jung Cho, Yo-Sub Han, Sang-Ki Ko and Kai Salomaa
    In Proceedings of the 16th International Workshop on Descriptional Complexity of Formal Systems (DCFS'14), LNCS 8614, 102--113, 2014 [pdf]

  21. State Complexity of Regular Tree Languages for Tree Pattern Matching,
    Sang-Ki Ko, Ha-Rim Lee and Yo-Sub Han
    In Proceedings of the 16th International Workshop on Descriptional Complexity of Formal Systems (DCFS'14), LNCS 8614, 246--257, 2014 [pdf]

  22. Left is Better Than Right for Reducing Nondeterminism of NFAs,
    Sang-Ki Ko and Yo-Sub Han
    In Proceedings of the 19th International Conference on Implementation and Application of Automata (CIAA'14), LNCS 8587, 238--251, 2014 [pdf]

  23. Pseudo-Inversion on Formal Languages,
    Da-Jung Cho, Yo-Sub Han, Shin-Dong Kang, Hwee Kim, Sang-Ki Ko and Kai Salomaa
    In Proceedings of Unconventional Computation & Natural Computation 2014 (UCNC'14), LNCS 8553, 93--104, 2014 [BEST PAPER] [pdf]

  24. Space-efficient Approximate String Matching Allowing Inversions in Fast Average Time,
    Hwee Kim and Yo-Sub Han
    In Proceedings of the 8th International Frontiers of Algorithmics Workshop (FAW'14), LNCS 8497, 261--272, 2014 [pdf]

  25. Top-Down Tree Edit-Distance of Regular Tree Languages,
    Sang-Ki Ko, Yo-Sub Han and Kai Salomaa
    In Proceedings of the 8th International Conference on Language and Automata Theory and Applications (LATA'14), LNCS 8370, 466--477, 2014 [pdf]

  26. Alignment with Non-Overlapping Inversions on Two Strings,
    Da-Jung Cho, Yo-Sub Han and Hwee Kim
    In Proceedings of the 8th International Workshop on Algorithms and Computation (WALCOM'14), LNCS 8344 261--272, 2014 [pdf]

  27. A CA Model for Target Tracking in Distributed Mobile Wireless Sensor Network,
    Sang-Ki Ko, Hwee Kim and Yo-Sub Han
    In Proceedings of the 13th International Conference on Control, Automation and Systems (ICCAS'13), 1356--1361, 2013 [pdf]

  28. State Complexity of k-Union and k-Intersection for Prefix-Free Regular Languages,
    Hae-Sung Eom, Yo-Sub Han and Kai Salomaa
    In Proceedings of the 15th International Workshop on Descriptional Complexity of Formal Systems (DCFS'13), LNCS 8031, 78--89, 2013 [pdf]

  29. State Complexity of Subtree-Free Regular Tree Languages,
    Hae-Sung Eom, Yo-Sub Han and Sang-Ki Ko
    In Proceedings of the 15th International Workshop on Descriptional Complexity of Formal Systems (DCFS'13), LNCS 8031, 66--77, 2013 [pdf]

  30. State Complexity of Basic Operations on Non-Returning Regular Languages,
    Hae-Sung Eom, Yo-Sub Han and Galina Jiraskova
    In Proceedings of the 15th International Workshop on Descriptional Complexity of Formal Systems (DCFS'13), LNCS 8031, 54--65, 2013 [pdf]

  31. Approximate Matching between a Context-Free Grammar and a Finite-State Automaton,
    Yo-Sub Han, Sang-Ki Ko and Kai Salomaa
    In Proceedings of the 18th International Conference on Implementation and Application of Automata (CIAA'13), LNCS 7982, 146--157, 2013 [pdf]

  32. Identifying representative ratings for a new item in recommendation system,
    Sang-Min Choi and Yo-Sub Han
    In Proceedings of the 7th International Conference on Ubiquitous Information Management and Communication (ICUIMC 2013) [pdf]

  33. Computing the edit-distance between a regular language and a context-free language,
    Yo-Sub Han, Sang-Ki Ko and Kai Salomaa
    In Proceedings of the 16th International Conference on Developments in Language Theory (DLT'12), LNCS 7410, 85--96, 2012 [pdf]

  34. A recommendation system based on a subset of raters,
    Bernhard Scholz, Sang-Min Choi, Sang-Ki Ko, Hae-Sung Eom and Yo-Sub Han
    In Proceedings of the 6th International Conference on Ubiquitous Information Management and Communication (ICUIMC 2012) [pdf]

  35. Generalized One-Unambiguity,
    Pascal Caron, Yo-Sub Han and Ludovic Mignot
    In Proceedings of the 15th International Conference on Developments in Language Theory (DLT'11), LNCS 6795, 129--140, 2011 [pdf]

  36. A Cellular Automaton Model for Car Traffic with a Form-One-Lane Rule,
    Yo-Sub Han and Sang-Ki Ko
    In Proceedings of the 16th International Conference on Implementation and Application of Automata (CIAA'11), LNCS 6807, 154--165, 2011 [pdf]

  37. A Smart Movie Recommendation System,
    Sang-Ki Ko, Sang-Min Choi, Hae-Sung Eom, Jeong-Won Cha, Hyunchul Cho, Laehyun Kim and Yo-Sub Han
    In Proceedings of the HCI International 2011 (HCII'11), LNCS 6771, 558--566, 2011 [pdf]

  38. Reliability of Representative Reviewers on the Web,
    Sang-Min Choi, Jeong-Won Cha, Lae-Hyun Kim and Yo-Sub Han
    In Proceedings of the 2011 International Conference on Information Science and Applications (ICISA 2011)

  39. Predicting Phrase-Level Tags Using Entropy Inspired Discriminative Models,
    Jin Young Oh, Yo-Sub Han, Jeongyeul Park and Jeong-Won Cha
    In Proceedings of the 2011 International Conference on Information Science and Applications (ICISA 2011)

  40. Analyzing Category Correlations for Recommendation System,
    Bernhard Scholz, Sang-Min Choi, Sang-Ki Ko, Hae-Sung Eom and Yo-Sub Han
    In Proceedings of the 5th International Conference on Ubiquitous Information Management and Communication (ICUIMC 2011) [pdf]

  41. Nondeterministic State Complexity for Suffix-Free Regular Languages,
    Yo-Sub Han and Kai Salomaa
    In Proceedings of the 12th International Workshop on Descriptional Complexity of Formal Systems (DCFS'10), 189--196, 2010 [pdf]

  42. Identifying Representative Reviewers in Internet Social Media,
    Sang-Min Choi, Jeong-Won Cha and Yo-Sub Han
    In Computational Collective Intelligence Technologies and Applications - Second International Conference (ICCCI'10), LNCS 6422, 22--30, 2010 [pdf]

  43. A Content Recommendation System Based on Category Correlations,
    Sang-Min Choi and Yo-Sub Han
    In Proceedings of the 5th International Multi-conference on Computing in the Global Information Technology (ICCGI'10), 66--70, 2010 [pdf]

  44. Implementation of State Elimination using Heuristics,
    Jae-Hee Ahn and Yo-Sub Han
    In Proceedings of the 14th International Conference on Implementation and Application of Automata (CIAA'09), LNCS 5642, 178--187, 2009 [pdf]

  45. State Complexity of Combined Operations for Prefix-Free Regular Languages,
    Yo-Sub Han Kai Salomaa and Sheng Yu
    In Proceedings of the 3rd International Conference on Language and Automata Theory and Applications (LATA'09), LNCS 5457, 398--409, 2009 [pdf]

  46. Evaluation of User Reputation on YouTube,
    Yo-Sub Han, Laehyun Kim and Jeong-Won Cha
    In Proceedings of the HCI International 2009 (HCII'09), LNCS 5621, 346--353, 2009 [pdf]

  47. User Reputation Evaluation Using Co-occurrence Feature and Collective Intelligence,
    Jeong-Won Cha, Hyun-woo Lee, Yo-Sub Han and Laehyun Kim
    In Proceedings of the HCI International 2009 (HCII'09), LNCS 5621, 305--311, 2009 [pdf]

  48. A Ranking Algorithm for User-generated Video Contents based on Social Activities,
    Lisa Wiyartanti, Yo-Sub Han and Laehyun Kim
    In Proceedings of the 3rd International Conference on Digital Information Management (ICDIM'08), 260--265, 2008 [pdf]

  49. Infrastructure for Ontological Resource Matching in a Virtual Organization,
    Michal Szymczak, Grzegorz Frackowiak, Maciej Gawinecki, Maria Ganzha, Marcin Paprzycki, Sang Keun Rhee, Myon-Woong Park, Yo-Sub Han, Young Tae Sohn, Jihye Lee, Jae Kawn Kim
    In Proceedings of the 2nd International Symposium on Intelligent Distributed Computing (IDC'08), 11--22, 2008 [pdf]

  50. On Resource Profiling and Matching in an Agent-Based Virtual Organization,
    Grzegorz Frackowiak, Maciej Gawinecki, Maria Ganzha, Marcin Paprzycki, Michal Szymczak, Myon-Woong Park, Yo-Sub Han
    In Proceedings of the 9th International Conference on Artificial Intelligence and Soft Computing (ICAISC'08), LNCS 5097, 1210--1221, 2008 [pdf]

  51. Generic Framework for Agent Adaptability and Utilization in a Virtual Organization - Preliminary Considerations,
    Maria Ganzha, Maciej Gawinecki, Michal Szymczak, Grzegorz Frackowiak, Marcin Paprzycki, Myon-Woong Park, Yo-Sub Han, Y.T. Sohn
    In Proceedings of the 2008 WEBIST Conference 2008 [pdf]

  52. Adaptive Information Provisioning in an Agent-Based Virtual Organization - Ontologies in the System,
    Michal Szymczak, Grzegorz Frackowiak, Maciej Gawinecki, Maria Ganzha, Marcin Paprzycki, Myon-Woong Park, Yo-Sub Han, Y.T. Sohn
    In Proceedings of the 2nd KES International Symposium on Agent and Multi-Agent Systems: Technologies and Applications (KES AMSTA), LNCS 4953, 271--280, 2008 [pdf]

  53. State Complexity of Basic Operations on Suffix-Free Regular Languages,
    Yo-Sub Han and Kai Salomaa
    In Proceedings of the 32nd International Symposium on Mathematical Foundations of Computer Science (MFCS'07), LNCS 4708, 501--512, 2007 [pdf]

  54. State Complexity of Union and Intersection of Finite Languages,
    Yo-Sub Han and Kai Salomaa
    In Proceedings of the 11th International Conference on Developments in Language Theory (DLT'07), LNCS 4588, 217--228, 2007 [pdf]

  55. Generalizations of One-Deterministic Regular Languages,
    Yo-Sub Han and Derick Wood
    In Proceedings of the 1st International Conference on Language and Automata Theory and Applications (LATA'07), 273--285, 2007

  56. Overlap-Free Regular Languages,
    Yo-Sub Han and Derick Wood
    In Proceedings of the 12th Annual International Computing and Combinatorics Conference (COCOON'06), LNCS 4112, 469--478, 2006 [pdf]

  57. State Complexity of Prefix-Free Regular Languages,
    Yo-Sub Han, Kai Salomaa and Derick Wood
    in Proceedings of the 8th International Workshop on Descriptional Complexity of Formal Systems (DCFS'06), 165--176, 2006 [pdf]

  58. Prime Decompositions of Regular Languages,
    Yo-Sub Han, Kai Salomaa and Derick Wood
    In Proceedings of the Tenth International Conference on Developments in Language Theory (DLT'06), LNCS 4036, 145--155, 2006 [pdf]

  59. Outfix-free Regular Languages and Prime Outfix-free Decomposition,
    Yo-Sub Han and Derick Wood
    In Proceedings of the Second International Colloquium on Theoretical Aspects of Computing (ICTAC'05), LNCS 3722, 96--109, 2005 [pdf]

  60. When Western Devil and Chinese Knight Play Go,
    Yo-Sub Han and Gerhard Trippen
    in Proceedings of the 16th Australasian Workshop on Combinatorial Algorithms (AWOCA'05), 399--408, 2005

  61. A New Linearizing Restriction in the Pattern Matching Problem,
    Yo-Sub Han and Derick Wood
    in Proceedings of the 15th International Symposium on Fundamentals of Computation Theory (FCT'05), LNCS 3623, 552--562, 2005 [pdf]

  62. Shorter Regular Expressions from Finite-state Automata,
    Yo-Sub Han and Derick Wood
    in Proceedings of the 10th International Conference on Implementation and Application of Automata (CIAA'05), LNCS 3845, 141--152, 2005 [pdf]

  63. Simple-Regular Expressions and Languages,
    Yo-Sub Han, Gerhard Trippen and Derick Wood
    in Proceedings of the 7th International Workshop on Descriptional Complexity of Formal Systems (DCFS'05), 146--157, 2005 [pdf]

  64. Prefix-Free Regular-Expression Matching,
    Yo-Sub Han, Yajun Wang and Derick Wood
    in Proceedings of the 16th Annual Symposium on Combinatorial Pattern Matching (CPM'05), LNCS 3537, 298--309, 2005 [pdf]

  65. The Generalization of Generalized Automata: Expression Automata,
    Yo-Sub Han and Derick Wood
    in Proceedings of the 9th International Conference on Implementation and Application of Automata (CIAA'04), LNCS 3317, 156--166, 2004 [pdf]

Misc.

  1. Ranking Algorithm for User-Created Video Contents based on User Reputation,
    Hyunchul Cho, Lisa Wiyartanti, Yo-Sub Han and Laehyun Kim
    Accepted in Proceedings of Korean Information Science Society , 2008

  2. Text Categorization using Topic Signature and Co-occurrence Features,
    Won-Sik Bae, Yo-Sub Han and Jeong-Won Cha
    In Proceedings of Korean Information Science Society , Vol. 35, 2008

  3. Decision Algorithms for Subfamilies of Regular Languages using State-Pair Graphs,
    Yo-Sub Han
    In Bulletin of the EATCS, No. 93, 118--133, October 2007 [pdf]

  4. Generalizations of One-Deterministic Regular Languages,
    Yo-Sub Han and Derick Wood
    Presented at the 10th Korea-Japan Joint Workshop on Algorithms and Computation (WAAC'07), 2007

  5. Multi-Source Broadcasting and Multicasting in Wireless Ad Hoc Networks,(extended abstract)
    Yo-Sub Han, Sheung-Hung Poon and Yajun Wang
    Presented at Japan Conference on Discrete and Computational Geometry (JCDCG'04), 2004 [pdf]

  6. Approximating the Minimum-Diameter Spanning Tree with Bounded Degree, (extended abstract)
    Hee-Kap Ahn, Yo-Sub Han and Chan-Su Shin
    Presented at Japan Conference on Discrete and Computational Geometry (JCDCG'04), 2004 [pdf]

*Copyright Notice: all papers are presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.

HOME
Last updated 2014/11/28