Prefix-Free Regular-Expression Matching. - Yo-Sub Han; Yajun Wang; Derick Wood (CPM, 2005)

A New Linearizing Restriction in the Pattern Matching Problem. - Yo-Sub Han; Derick Wood (FCT, 2005)

Shorter Regular Expressions from Finite-State Automata. - Yo-Sub Han; Derick Wood (CIAA, 2005)

The generalization of generalized automata: expression automata. - Yo-Sub Han; Derick Wood (Int. J. Found. Comput. Sci., 2005)

Overlap-Free Regular Languages. - Yo-Sub Han; Derick Wood (COCOON, 2006)

State Complexity of Prefix-Free Regular Languages. - Yo-Sub Han; Kai Salomaa; Derick Wood (DCFS, 2006)

Prime Decompositions of Regular Languages. - Yo-Sub Han; Kai Salomaa; Derick Wood (Developments in Language Theory, 2006)

Infix-free Regular Expressions and Languages. - Yo-Sub Han; Yajun Wang; Derick Wood (Int. J. Found. Comput. Sci., 2006)

Generalizations of One-Deterministic Regular Languages. - Yo-Sub Han; Derick Wood (LATA, 2007)

Decision Algorithms for Subfamilies of Regular Languages using State-Pair Graphs. - Yo-Sub Han (Bull. EATCS, 2007)

Intercode Regular Languages. - Yo-Sub Han; Kai Salomaa; Derick Wood (Fundam. Informaticae, 2007)

Outfix-Free Regular Languages and Prime Outfix-Free Decomposition. - Yo-Sub Han; Derick Wood (Fundam. Informaticae, 2007)

Simple-Regular Expressions and Languages. - Yo-Sub Han; Gerhard Trippen; Derick Wood (J. Autom. Lang. Comb., 2007)

On the existence of prime decompositions. - Yo-Sub Han; Arto Salomaa; Kai Salomaa; Derick Wood; Sheng Yu 001 (Theor. Comput. Sci., 2007)

Obtaining shorter regular expressions from finite-state automata. - Yo-Sub Han; Derick Wood (Theor. Comput. Sci., 2007)

Prefix-free regular languages and pattern matching. - Yo-Sub Han; Yajun Wang; Derick Wood (Theor. Comput. Sci., 2007)

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; Young Tae Sohn (ENASE, 2008)

On Resource Profiling and Matching in an Agent-Based Virtual Organization. - Grzegorz Frackowiak; Maria Ganzha; Maciej Gawinecki; Marcin Paprzycki; Michal Szymczak; Myon-Woong Park; Yo-Sub Han (ICAISC, 2008)

A ranking algorithm for user-generated video contents based on social activities. - Lisa Wiyartanti; Yo-Sub Han; Laehyun Kim (ICDIM, 2008)

Infrastructure for Ontological Resource Matching in a Virtual Organization. - Michal Szymczak; Grzegorz Frackowiak; Maria Ganzha; Marcin Paprzycki; Sang Keun Rhee; Myon-Woong Park; Yo-Sub Han; Young Tae Sohn; Jihye Lee; Jae Kwan Kim 002 (IDC, 2008)

Ontological matchmaking in a Duty Trip Support application in a virtual organization. - Michal Szymczak; Grzegorz Frackowiak; Maria Ganzha; Marcin Paprzycki; Sang Keun Rhee; Jihye Lee; Young Tae Sohn; Jae Kwan Kim 002; Yo-Sub Han; Myon-Woong Park (IMCSIT, 2008)

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; Young Tae Sohn (KES-AMSTA, 2008)

Adaptability in an Agent-Based Virtual Organization - Towards Implementation. - Grzegorz Frackowiak; Maria Ganzha; Marcin Paprzycki; Michal Szymczak; Yo-Sub Han; Myon-Woong Park (WEBIST (Selected Papers), 2008)

Generalizations of 1-deterministic regular languages. - Yo-Sub Han; Derick Wood (Inf. Comput., 2008)

State Complexity of Union and Intersection of Finite Languages. - Yo-Sub Han; Kai Salomaa (Int. J. Found. Comput. Sci., 2008)

Operational State Complexity of Prefix-Free Regular Languages. - Yo-Sub Han; Kai Salomaa; Derick Wood (Automata, Formal Languages, and Related Topics, 2009)

User Reputation Evaluation Using Co-occurrence Feature and Collective Intelligence. - Jeong-Won Cha; Hyunwoo Lee; Yo-Sub Han; Laehyun Kim (HCI (12), 2009)

Evaluation of User Reputation on YouTube. - Yo-Sub Han; Laehyun Kim; Jeong-Won Cha (HCI (12), 2009)

State Complexity of Combined Operations for Prefix-Free Regular Languages. - Yo-Sub Han; Kai Salomaa; Sheng Yu 001 (LATA, 2009)

Implementation of State Elimination Using Heuristics. - Jae-Hee Ahn; Yo-Sub Han (CIAA, 2009)

Nondeterministic State Complexity of Basic Operations for Prefix-Free Regular Languages. - Yo-Sub Han; Kai Salomaa; Derick Wood (Fundam. Informaticae, 2009)

Adaptability in an agent-based virtual organisation. - Grzegorz Frackowiak; Maria Ganzha; Maciej Gawinecki; Marcin Paprzycki; Michal Szymczak; Costin Badica; Yo-Sub Han; Myon-Woong Park (Int. J. Agent Oriented Softw. Eng., 2009)

State complexity of basic operations on suffix-free regular languages. - Yo-Sub Han; Kai Salomaa (Theor. Comput. Sci., 2009)

Nondeterministic state complexity of nested word automata. - Yo-Sub Han; Kai Salomaa (Theor. Comput. Sci., 2009)

Considering Resource Management in Agent-Based Virtual Organization. - Grzegorz Frackowiak; Maria Ganzha; Maciej Gawinecki; Marcin Paprzycki; Michal Szymczak; Myon-Woong Park; Yo-Sub Han (Intelligent Agents in the Evolution of Web and Applications, 2009)

Identifying Representative Reviewers in Internet Social Media. - Sang-Min Choi; Jeong-Won Cha; Yo-Sub Han (ICCCI (2), 2010)

Nondeterministic State Complexity for Suffix-Free Regular Languages - Yo-Sub Han; Kai Salomaa (DCFS, 2010)

On the Linear Number of Matching Substrings. - Yo-Sub Han (J. Univers. Comput. Sci., 2010)

Generalized One-Unambiguity. - Pascal Caron; Yo-Sub Han; Ludovic Mignot (Developments in Language Theory, 2011)

A Smart Movie Recommendation System. - Sang-Ki Ko; Sang-Min Choi; Hae-Sung Eom; Jeong-Won Cha; Hyunchul Cho; Laehyun Kim; Yo-Sub Han (HCI (11), 2011)

Analyzing category correlations for recommendation system. - Bernhard Scholz; Sang-Min Choi; Sang-Ki Ko; Hae-Sung Eom; Yo-Sub Han (ICUIMC, 2011)

A Cellular Automaton Model for Car Traffic with a Form-One-Lane Rule. - Yo-Sub Han; Sang-Ki Ko (CIAA, 2011)

Overlap-Free Languages and solid Codes. - Yo-Sub Han; Kai Salomaa (Int. J. Found. Comput. Sci., 2011)

Computing the Edit-Distance between a Regular Language and a Context-Free Language. - Yo-Sub Han; Sang-Ki Ko; Kai Salomaa (Developments in Language Theory, 2012)

A recommendation system based on a subset of raters. - Bernhard Scholz; Sang-Min Choi; Sang-Ki Ko; Hae-Sung Eom; Yo-Sub Han (ICUIMC, 2012)

Computing User Reputation in a Social Network of Web 2.0. - Yo-Sub Han; Laehyun Kim; Jeong-Won Cha (Comput. Informatics, 2012)

A movie recommendation algorithm based on genre correlations. - Sang-Min Choi; Sang-Ki Ko; Yo-Sub Han (Expert Syst. Appl., 2012)

Analysis of a cellular automaton model for car traffic with a junction. - Yo-Sub Han; Sang-Ki Ko (Theor. Comput. Sci., 2012)

State Complexity of Subtree-Free Regular Tree Languages. - Hae-Sung Eom; Yo-Sub Han; Sang-Ki Ko (DCFS, 2013)

State Complexity of k-Union and k-Intersection for Prefix-Free Regular Languages. - Hae-Sung Eom; Yo-Sub Han; Kai Salomaa (DCFS, 2013)

Identifying representative ratings for a new item in recommendation system. - Sang-Min Choi; Yo-Sub Han (ICUIMC, 2013)

Representative reviewers for Internet social media. - Sang-Min Choi; Yo-Sub Han (Expert Syst. Appl., 2013)

State Elimination Heuristics for Short Regular Expressions. - Yo-Sub Han (Fundam. Informaticae, 2013)

An Improved Prefix-Free Regular-Expression Matching. - Yo-Sub Han (Int. J. Found. Comput. Sci., 2013)

The Edit-Distance between a Regular Language and a Context-Free Language. - Yo-Sub Han; Sang-Ki Ko; Kai Salomaa (Int. J. Found. Comput. Sci., 2013)

State complexity of combined operations for suffix-free regular languages. - Hae-Sung Eom; Yo-Sub Han (Theor. Comput. Sci., 2013)

State Complexity of Combined Operations for Prefix-Free Regular Languages. - Hae-Sung Eom; Yo-Sub Han; Kai Salomaa; Sheng Yu 001 (Discrete Mathematics and Computer Science, 2014)

State Complexity of Regular Tree Languages for Tree Pattern Matching. - Sang-Ki Ko; Ha-Rim Lee; Yo-Sub Han (DCFS, 2014)

State Complexity of Deletion. - Yo-Sub Han; Sang-Ki Ko; Kai Salomaa (Developments in Language Theory, 2014)

Space-Efficient Approximate String Matching Allowing Inversions in Fast Average Time. - Hwee Kim; Yo-Sub Han (FAW, 2014)

Analyzing Item Features for Cold-Start Problems in Recommendation Systems. - Soryoung Kim; Sang-Min Choi; Yo-Sub Han; Ka Lok Man; Kaiyu Wan (IIH-MSP, 2014)

Top-Down Tree Edit-Distance of Regular Tree Languages. - Sang-Ki Ko; Yo-Sub Han; Kai Salomaa (LATA, 2014)

Parallel CYK Membership Test on GPUs. - Kyoung-Hwan Kim; Sang-Min Choi; Hyein Lee 004; Ka Lok Man; Yo-Sub Han (NPC, 2014)

Online Multiple Palindrome Pattern Matching. - Hwee Kim; Yo-Sub Han (SPIRE, 2014)

Pseudo-inversion on Formal Languages. - Da-Jung Cho; Yo-Sub Han; Shin-Dong Kang; Hwee Kim; Sang-Ki Ko; Kai Salomaa (UCNC, 2014)

Alignment with Non-overlapping Inversions on Two Strings. - Da-Jung Cho; Yo-Sub Han; Hwee Kim (WALCOM, 2014)

A Speculative Parallel DFA Membership Test for Multicore, SIMD and Cloud Computing Environments. - Yousun Ko 001; Minyoung Jung; Yo-Sub Han; Bernd Burgstaller (Int. J. Parallel Program., 2014)

Decidability of involution hypercodes. - Da-Jung Cho; Yo-Sub Han; Sang-Ki Ko (Theor. Comput. Sci., 2014)

The State Complexity of Permutations on Finite Languages over Binary Alphabets. - Alexandros Palioudakis; Da-Jung Cho; Daniel Goc; Yo-Sub Han; Sang-Ki Ko; Kai Salomaa (DCFS, 2015)

Frequent Pattern Mining with Non-overlapping Inversions. - Da-Jung Cho; Yo-Sub Han; Hwee Kim (LATA, 2015)

State Complexity of Kleene-Star Operations on Regular Tree Languages. - Yo-Sub Han; Sang-Ki Ko; Xiaoxue Piao; Kai Salomaa (Acta Cybern., 2015)

A Recommendation Model Using the Bandwagon Effect for E-Marketing Purposes in IoT. - Sang-Min Choi; Hyein Lee 004; Yo-Sub Han; Ka Lok Man; Woon Kian Chong (Int. J. Distributed Sens. Networks, 2015)

State Complexity of Boundary of Prefix-Free Regular Languages. - Hae-Sung Eom; Yo-Sub Han (Int. J. Found. Comput. Sci., 2015)

State Complexity of k-Union and k-Intersection for Prefix-Free Regular Languages. - Hae-Sung Eom; Yo-Sub Han; Kai Salomaa (Int. J. Found. Comput. Sci., 2015)

Alignment with non-overlapping inversions and translocations on two strings. - Da-Jung Cho; Yo-Sub Han; Hwee Kim (Theor. Comput. Sci., 2015)

Non-overlapping inversion on strings and languages. - Hwee Kim; Yo-Sub Han (Theor. Comput. Sci., 2015)

Outfix-Guided Insertion - (Extended Abstract). - Da-Jung Cho; Yo-Sub Han; Timothy Ng 001; Kai Salomaa (DLT, 2016)

Inferring a Relax NG Schema from XML Documents. - Guen-Hae Kim; Sang-Ki Ko; Yo-Sub Han (LATA, 2016)

State complexity of deletion and bipolar deletion. - Yo-Sub Han; Sang-Ki Ko; Kai Salomaa (Acta Informatica, 2016)

OMPPM: online multiple palindrome pattern matching. - Hwee Kim; Yo-Sub Han (Bioinform., 2016)

State Complexity of Basic Operations on Non-Returning Regular Languages. - Hae-Sung Eom; Yo-Sub Han; Galina Jirásková (Fundam. Informaticae, 2016)

Approximate matching between a context-free grammar and a finite-state automaton. - Sang-Ki Ko; Yo-Sub Han; Kai Salomaa (Inf. Comput., 2016)

State Complexity of Insertion. - Yo-Sub Han; Sang-Ki Ko; Timothy Ng 001; Kai Salomaa (Int. J. Found. Comput. Sci., 2016)

Operational State Complexity of Subtree-Free Regular Tree Languages. - Sang-Ki Ko; Hae-Sung Eom; Yo-Sub Han (Int. J. Found. Comput. Sci., 2016)

State Complexity of Regular Tree Languages for Tree Matching. - Sang-Ki Ko; Ha-Rim Lee; Yo-Sub Han (Int. J. Found. Comput. Sci., 2016)

Duplications and Pseudo-Duplications. - Da-Jung Cho; Yo-Sub Han; Hwee Kim; Alexandros Palioudakis; Kai Salomaa (Int. J. Unconv. Comput., 2016)

Pseudo-inversion: closure properties and decidability. - Da-Jung Cho; Yo-Sub Han; Shin-Dong Kang; Hwee Kim; Sang-Ki Ko; Kai Salomaa (Nat. Comput., 2016)

State complexity of inversion operations. - Da-Jung Cho; Yo-Sub Han; Sang-Ki Ko; Kai Salomaa (Theor. Comput. Sci., 2016)

Template-Based Pattern Matching in Two-Dimensional Arrays. - Yo-Sub Han; Daniel Prusa (IWCIA, 2017)

Edit-Distance Between Visibly Pushdown Languages. - Yo-Sub Han; Sang-Ki Ko (SOFSEM, 2017)

Deduplication on Finite Automata and Nested Duplication Systems. - Da-Jung Cho; Yo-Sub Han; Hwee Kim (UCNC, 2017)

Ambiguity, Nondeterminism and State Complexity of Finite Automata. - Yo-Sub Han; Arto Salomaa; Kai Salomaa (Acta Cybern., 2017)

State Complexity of k-Parallel Tree Concatenation. - Yo-Sub Han; Sang-Ki Ko; Kai Salomaa (Fundam. Informaticae, 2017)

Preface. - Yo-Sub Han; Kai Salomaa (Int. J. Found. Comput. Sci., 2017)

State complexity of permutation on finite languages over a binary alphabet. - Da-Jung Cho; Daniel Goc; Yo-Sub Han; Sang-Ki Ko; Alexandros Palioudakis; Kai Salomaa (Theor. Comput. Sci., 2017)

Pseudoknot-generating operation. - Da-Jung Cho; Yo-Sub Han; Timothy Ng 001; Kai Salomaa (Theor. Comput. Sci., 2017)

Outfix-guided insertion. - Da-Jung Cho; Yo-Sub Han; Timothy Ng 001; Kai Salomaa (Theor. Comput. Sci., 2017)

Site-Directed Insertion: Decision Problems, Maximality and Minimality. - Da-Jung Cho; Yo-Sub Han; Kai Salomaa; Taylor J. Smith (DCFS, 2018)

Site-Directed Deletion. - Da-Jung Cho; Yo-Sub Han; Hwee Kim; Kai Salomaa (DLT, 2018)

Construction of Geometric Structure by Oritatami System. - Yo-Sub Han; Hwee Kim (DNA, 2018)

Incremental Computation of Infix Probabilities for Probabilistic Finite Automata. - Marco Cognetta; Yo-Sub Han; Soon Chan Kwon (EMNLP, 2018)

Online Stochastic Pattern Matching. - Marco Cognetta; Yo-Sub Han (CIAA, 2018)

OPERA: Reasoning about continuous common knowledge in asynchronous distributed systems. - Sang-Min Choi; Jiho Park 002; Quan Hoang Nguyen 001; Andre Cronje; Ki-Young Jang; Hyunjoon Cheon; Yo-Sub Han; Byung-Ik Ahn (CoRR, 2018)

An abusive text detection system based on enhanced abusive and non-abusive word lists. - Ho-Suk Lee; Hong-Rae Lee; Jun-U. Park; Yo-Sub Han (Decis. Support Syst., 2018)

Growth Rate of Minimum Branching. - Alexandros Palioudakis; Yo-Sub Han; Kai Salomaa (J. Autom. Lang. Comb., 2018)

Nondeterministic seedless oritatami systems and hardness of testing their equivalence. - Yo-Sub Han; Hwee Kim; Makoto Ota; Shinnosuke Seki 001 (Nat. Comput., 2018)

Online Infix Probability Computation for Probabilistic Finite Automata. - Marco Cognetta; Yo-Sub Han; Soon Chan Kwon (ACL (1), 2019)

Limited Nondeterminism of Input-Driven Pushdown Automata: Decidability and Complexity. - Yo-Sub Han; Sang-Ki Ko; Kai Salomaa (DCFS, 2019)

The Relative Edit-Distance Between Two Input-Driven Languages. - Hyunjoon Cheon; Yo-Sub Han; Sang-Ki Ko; Kai Salomaa (DLT, 2019)

SoftRegex: Generating Regex from Natural Language Descriptions using Softened Regex Equivalence. - Jun-U. Park; Sang-Ki Ko; Marco Cognetta; Yo-Sub Han (EMNLP/IJCNLP (1), 2019)

Cyclic Oritatami Systems Cannot Fold Infinite Fractal Curves. - Yo-Sub Han; Hwee Kim (CoRR, 2019)

Self-Attraction Removal from Oritatami Systems. - Yo-Sub Han; Hwee Kim; Trent A. Rogers; Shinnosuke Seki 001 (Int. J. Found. Comput. Sci., 2019)

Bound-decreasing duplication system. - Da-Jung Cho; Yo-Sub Han; Hwee Kim (Theor. Comput. Sci., 2019)

Site-directed insertion: Language equations and decision problems. - Da-Jung Cho; Yo-Sub Han; Kai Salomaa; Taylor J. Smith (Theor. Comput. Sci., 2019)

Ruleset optimization on isomorphic oritatami systems. - Yo-Sub Han; Hwee Kim (Theor. Comput. Sci., 2019)

Alignment distance of regular tree languages. - Yo-Sub Han; Sang-Ki Ko (Theor. Comput. Sci., 2019)

SW Runtime Estimation using Automata Theory and Deep Learning on HPC. - Hyunjoon Cheon; Jinseung Ryu; Chan Yeol Park; Yo-Sub Han (ACSOS Companion, 2020)

Computing the Shortest String and the Edit-Distance for Parsing Expression Languages. - Hyunjoon Cheon; Yo-Sub Han (DLT, 2020)

Transcript design problem of oritatami systems. - Yo-Sub Han; Hwee Kim; Shinnosuke Seki 001 (Nat. Comput., 2020)

SALNet: Semi-supervised Few-Shot Text Classification with Attention-based Lexicon Construction. - Ju Hyoung Lee; Sang-Ki Ko; Yo-Sub Han (AAAI, 2021)

Most Pseudo-copy Languages Are Not Context-Free. - Hyunjoon Cheon; Joonghyuk Hahn; Yo-Sub Han; Sang-Ki Ko (COCOON, 2021)

Do Bugs Propagate? An Empirical Analysis of Temporal Correlations Among Software Bugs. - Xiaodong Gu 002; Yo-Sub Han; Sunghun Kim 001; Hongyu Zhang 002 (ECOOP, 2021)

Self-Training using Rules of Grammar for Few-Shot NLU. - Joonghyuk Hahn; Hyunjoon Cheon; Kyuyeol Han; Cheongjae Lee; Junseok Kim; Yo-Sub Han (EMNLP (Findings), 2021)

MultiFix: Learning to Repair Multiple Errors by Optimal Alignment Learning. - HyeonTae Seo; Yo-Sub Han; Sang-Ki Ko (EMNLP (Findings), 2021)

Consensus string problem for multiple regular languages. - Yo-Sub Han; Sang-Ki Ko; Timothy Ng 001; Kai Salomaa (Inf. Comput., 2021)

Left is Better Than Right for Reducing Nondeterminism of NFAs. - Sang-Ki Ko; Yo-Sub Han (Int. J. Found. Comput. Sci., 2021)

Generalizations of Code Languages with Marginal Errors. - Sang-Ki Ko; Yo-Sub Han; Kai Salomaa (Int. J. Found. Comput. Sci., 2021)

Impossibility of strict assembly of infinite fractals by oritatami. - Yo-Sub Han; Hwee Kim (Nat. Comput., 2021)

A general architecture of oritatami systems for simulating arbitrary finite automata. - Yo-Sub Han; Hwee Kim; Yusei Masuda; Shinnosuke Seki 001 (Theor. Comput. Sci., 2021)

Closest substring problems for regular languages. - Yo-Sub Han; Sang-Ki Ko; Timothy Ng 001; Kai Salomaa (Theor. Comput. Sci., 2021)

ALP: Data Augmentation Using Lexicalized PCFGs for Few-Shot Text Classification. - Hazel H. Kim; Daecheol Woo; Seong Joon Oh; Jeong-Won Cha; Yo-Sub Han (AAAI, 2022)

Generalizable Implicit Hate Speech Detection Using Contrastive Learning. - Youngwook Kim; Shinwoo Park; Yo-Sub Han (COLING, 2022)

Boosting Code Summarization by Embedding Code Structures. - Jikyoeng Son; Joonghyuk Hahn; HyeonTae Seo; Yo-Sub Han (COLING, 2022)

How to Settle the ReDoS Problem: Back to the Classical Automata Theory. - Sicheol Sung; Hyunjoon Cheon; Yo-Sub Han (CIAA, 2022)

LST: Lexicon-Guided Self-Training for Few-Shot Text Classification. - Hazel Kim; Jaeman Son; Yo-Sub Han (CoRR, 2022)

Neuro-Symbolic Regex Synthesis Framework via Neural Example Splitting. - Su-Hyeon Kim; Hyunjoon Cheon; Yo-Sub Han; Sang-Ki Ko (CoRR, 2022)

JIDECA: Jointly Improved Deep Embedded Clustering for Android activity. - Sungmin Choi; Hyeon-Tae Seo; Yo-Sub Han (BigComp, 2023)

Existential and Universal Width of Alternating Finite Automata. - Yo-Sub Han; Sungmin Kim; Sang-Ki Ko; Kai Salomaa (DCFS, 2023)

Weak Inverse Neighborhoods of Languages. - Hyunjoon Cheon; Yo-Sub Han (DLT, 2023)

On the Simon's Congruence Neighborhood of Languages. - Sungmin Kim; Yo-Sub Han; Sang-Ki Ko; Kai Salomaa (DLT, 2023)

Contrastive Learning with Keyword-based Data Augmentation for Code Search and Code Question Answering. - Shinwoo Park; Youngwook Kim; Yo-Sub Han (EACL, 2023)

GDA: Grammar-based Data Augmentation for Text Classification using Slot Information. - Joonghyuk Hahn; Hyunjoon Cheon; Elizabeth Orwig; Su-Hyeon Kim; Sang-Ki Ko; Yo-Sub Han (EMNLP (Findings), 2023)

ATHENA: Mathematical Reasoning with Thought Expansion. - JB. Kim; Hazel Kim; Joonghyuk Hahn; Yo-Sub Han (EMNLP, 2023)

ConPrompt: Pre-training a Language Model with Machine-Generated Data for Implicit Hate Speech Detection. - Youngwook Kim; Shinwoo Park; Youngsoo Namgoong; Yo-Sub Han (EMNLP (Findings), 2023)

Automated Grading of Regular Expressions. - Su-Hyeon Kim; Youngwook Kim; Yo-Sub Han; Hyeonseung Im; Sang-Ki Ko (ESOP, 2023)

M-equivalence of Parikh Matrix over a Ternary Alphabet. - Joonghyuk Hahn; Hyunjoon Cheon; Yo-Sub Han (CIAA, 2023)

Smaller Representation of Compiled Regular Expressions. - Sicheol Sung; Sang-Ki Ko; Yo-Sub Han (CIAA, 2023)

An Empirical Study on Multimodal Activity Clustering of Android Applications. - Sungmin Choi; Hyeon-Tae Seo; Yo-Sub Han (IEEE Access, 2023)

Deciding path size of nondeterministic (and input-driven) pushdown automata. - Yo-Sub Han; Sang-Ki Ko; Kai Salomaa (Theor. Comput. Sci., 2023)

On Simon's congruence closure of a string. - Sungmin Kim; Yo-Sub Han; Sang-Ki Ko; Kai Salomaa (Theor. Comput. Sci., 2023)

ARED: automata-based runtime estimation for distributed systems using deep learning. - Hyunjoon Cheon; Jinseung Ryu; Jaecheol Ryou 001; Chan Yeol Park; Yo-Sub Han (Clust. Comput., 2023)

SharedCon: Implicit Hate Speech Detection using Shared Semantics. - Hyeseon Ahn; Youngwook Kim; Jungin Kim; Yo-Sub Han (ACL (Findings), 2024)

SuperST: Superficial Self-Training for Few-Shot Text Classification. - Ju Hyoung Lee; Joonghyuk Hahn; Hyeon-Tae Seo; Jiho Park 002; Yo-Sub Han (LREC/COLING, 2024)

Universal Rewriting Rules for the Parikh Matrix Injectivity Problem. - Ingyu Baek; Joonghyuk Hahn; Yo-Sub Han; Kai Salomaa (DLT, 2024)

Approximate Cartesian Tree Pattern Matching. - Sungmin Kim; Yo-Sub Han (DLT, 2024)

Benchmarking Regular Expression Matching. - Alexander Roodt; Brendan Keith Mark Watling; Willem Bester; Brink van der Merwe; Sicheol Sung; Yo-Sub Han (CIAA, 2024)

CodeComplex: A Time-Complexity Dataset for Bilingual Source Codes. - Seung-Yeop Baik; Mingi Jeon; Joonghyuk Hahn; Jungin Kim; Yo-Sub Han; Sang-Ki Ko (CoRR, 2024)

A Framework for Quantum Finite-State Languages with Density Mapping. - Seung-Yeop Baik; Sicheol Sung; Yo-Sub Han (CoRR, 2024)

Simon's congruence pattern matching. - Sungmin Kim; Sang-Ki Ko; Yo-Sub Han (Theor. Comput. Sci., 2024)

On the Decidability of Infix Inclusion Problem. - Hyunjoon Cheon; Joonghyuk Hahn; Yo-Sub Han (Theory Comput. Syst., 2024)

KatFishNet: Detecting LLM-Generated Korean Text through Linguistic Feature Analysis. - Shinwoo Park; Shubin Kim; Do-Kyung Kim; Yo-Sub Han (ACL (1), 2025)

Analyzing Offensive Language Dataset Insights from Training Dynamics and Human Agreement Level. - Do Kyung Kim; Hyeseon Ahn; Youngwook Kim; Yo-Sub Han (COLING, 2025)

Impact of Large Language Models of Code on Fault Localization. - Suhwan Ji; Sanghwa Lee; Changsup Lee; Yo-Sub Han; Hyeonseung Im (ICST, 2025)

TCProF:Time-Complexity Prediction SSL Framework. - Joonghyuk Hahn; Hyeseon Ahn; Jungin Kim; Soohan Lim; Yo-Sub Han (NAACL (Long Papers), 2025)

Advanced code time complexity prediction approach using contrastive learning. - Shinwoo Park; Joonghyuk Hahn; Elizabeth Orwig; Sang-Ki Ko; Yo-Sub Han (Eng. Appl. Artif. Intell., 2025)

URECA: The Chain of Two Minimum Set Cover Problems exists behind Adaptation to Shifts in Semantic Code Search. - Seok-Ung Choi; Joonghyuk Hahn; Yo-Sub Han (CoRR, 2025)

Detection of LLM-Paraphrased Code and Identification of the Responsible LLM Using Coding Style Features. - Shinwoo Park; Hyundong Jin; Jeong-Won Cha; Yo-Sub Han (CoRR, 2025)

Marking Code Without Breaking It: Code Watermarking for Detecting LLM-Generated Code. - Jungin Kim; Shinwoo Park; Yo-Sub Han (CoRR, 2025)

Detecting LLM-Generated Korean Text through Linguistic Feature Analysis. - Shinwoo Park; Shubin Kim; Do-Kyung Kim; Yo-Sub Han (CoRR, 2025)

LogiCase: Effective Test Case Generation from Logical Description in Competitive Programming. - Sicheol Sung; Aditi; Dogyu kim; Yo-Sub Han; Sang-Ki Ko (CoRR, 2025)

AmpleHate: Amplifying the Attention for Versatile Implicit Hate Detection. - Yejin Lee; Joonghyuk Hahn; Hyeseon Ahn; Yo-Sub Han (CoRR, 2025)

TRAPDOC: Deceiving LLM Users by Injecting Imperceptible Phantom Tokens into Documents. - Hyundong Jin; Sicheol Sung; Shinwoo Park; Seung-Yeop Baik; Yo-Sub Han (CoRR, 2025)

SAGE:Specification-Aware Grammar Extraction for Automated Test Case Generation with LLMs. - Aditi; Hyunwoo Park; Sicheol Sung; Yo-Sub Han; Sang-Ki Ko (CoRR, 2025)