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

Chapters in Books

  1. 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

  2. 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. On the Linear Number of Matching Substrings,
    Yo-Sub Han
    In Journal of Universal Computer Science, Vol. 16, 715--728, March 2010 [pdf]

  2. 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]

  3. 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]

  4. 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]

  5. 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]

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

  7. 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]

  8. 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]

  9. 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]

  10. 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]

  11. 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]

  12. 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]

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

  14. 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]

  15. 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. 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]

  2. 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]

  3. 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]

  4. 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]

  5. 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]

  6. 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]

  7. 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]

  8. 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]

  9. 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]

  10. 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]

  11. 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]

  12. 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

  13. 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]

  14. 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]

  15. 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]

  16. 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]

  17. 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

  18. 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]

  19. 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]

  20. 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]

  21. 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]

  22. 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 2009/07/09