default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYo-Sub Han
Person information
- affiliation: Yonsei University, Korea
Other persons with a similar name
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j70]Hyunjoon Cheon, Joonghyuk Hahn, Yo-Sub Han:
On the Decidability of Infix Inclusion Problem. Theory Comput. Syst. 68(3): 301-321 (2024)- [j69]Sungmin Kim, Sang-Ki Ko, Yo-Sub Han:
Simon's congruence pattern matching. Theor. Comput. Sci. 994: 114478 (2024) - [c107]Hyeseon Ahn, Youngwook Kim, Jungin Kim, Yo-Sub Han:
SharedCon: Implicit Hate Speech Detection using Shared Semantics. ACL (Findings) 2024: 10444-10455 - [c106]Ju Hyoung Lee, Joonghyuk Hahn, Hyeon-Tae Seo, Jiho Park, Yo-Sub Han:
SuperST: Superficial Self-Training for Few-Shot Text Classification. LREC/COLING 2024: 15436-15447 - [c105]Ingyu Baek, Joonghyuk Hahn, Yo-Sub Han, Kai Salomaa:
Universal Rewriting Rules for the Parikh Matrix Injectivity Problem. DLT 2024: 68-81 - [c104]Sungmin Kim, Yo-Sub Han:
Approximate Cartesian Tree Pattern Matching. DLT 2024: 189-202 - [c103]Alexander Roodt, Brendan Keith Mark Watling, Willem Bester, Brink van der Merwe, Sicheol Sung, Yo-Sub Han:
Benchmarking Regular Expression Matching. CIAA 2024: 316-331 - [i13]Seung-Yeop Baik, Mingi Jeon, Joonghyuk Hahn, Jungin Kim, Yo-Sub Han, Sang-Ki Ko:
CodeComplex: A Time-Complexity Dataset for Bilingual Source Codes. CoRR abs/2401.08719 (2024) - [i12]Seung-Yeop Baik, Sicheol Sung, Yo-Sub Han:
A Framework for Quantum Finite-State Languages with Density Mapping. CoRR abs/2407.02776 (2024) - [i11]Suhwan Ji, Sanghwa Lee, Changsup Lee, Hyeonseung Im, Yo-Sub Han:
Impact of Large Language Models of Code on Fault Localization. CoRR abs/2408.09657 (2024) - 2023
- [j68]Sungmin Choi
, Hyeon-Tae Seo, Yo-Sub Han:
An Empirical Study on Multimodal Activity Clustering of Android Applications. IEEE Access 11: 53598-53614 (2023) - [j67]Hyunjoon Cheon, Jinseung Ryu, Jaecheol Ryou, Chan Yeol Park, Yo-Sub Han:
ARED: automata-based runtime estimation for distributed systems using deep learning. Clust. Comput. 26(5): 2629-2641 (2023) - [j66]Yo-Sub Han, Sang-Ki Ko, Kai Salomaa:
Deciding path size of nondeterministic (and input-driven) pushdown automata. Theor. Comput. Sci. 939: 170-181 (2023) - [j65]Sungmin Kim, Yo-Sub Han, Sang-Ki Ko, Kai Salomaa:
On Simon's congruence closure of a string. Theor. Comput. Sci. 972: 114078 (2023) - [c102]Sungmin Choi, Hyeon-Tae Seo, Yo-Sub Han:
JIDECA: Jointly Improved Deep Embedded Clustering for Android activity. BigComp 2023: 105-112 - [c101]Yo-Sub Han, Sungmin Kim, Sang-Ki Ko, Kai Salomaa:
Existential and Universal Width of Alternating Finite Automata. DCFS 2023: 51-64 - [c100]Hyunjoon Cheon, Yo-Sub Han:
Weak Inverse Neighborhoods of Languages. DLT 2023: 61-73 - [c99]Sungmin Kim, Yo-Sub Han, Sang-Ki Ko, Kai Salomaa:
On the Simon's Congruence Neighborhood of Languages. DLT 2023: 168-181 - [c98]Shinwoo Park, Youngwook Kim, Yo-Sub Han:
Contrastive Learning with Keyword-based Data Augmentation for Code Search and Code Question Answering. EACL 2023: 3591-3601 - [c97]Joonghyuk Hahn, Hyunjoon Cheon, Elizabeth Orwig, Su-Hyeon Kim, Sang-Ki Ko, Yo-Sub Han:
GDA: Grammar-based Data Augmentation for Text Classification using Slot Information. EMNLP (Findings) 2023: 7291-7306 - [c96]Youngwook Kim, Shinwoo Park, Youngsoo Namgoong, Yo-Sub Han:
ConPrompt: Pre-training a Language Model with Machine-Generated Data for Implicit Hate Speech Detection. EMNLP (Findings) 2023: 10964-10980 - [c95]JB. Kim, Hazel Kim, Joonghyuk Hahn, Yo-Sub Han:
ATHENA: Mathematical Reasoning with Thought Expansion. EMNLP 2023: 16315-16327 - [c94]Su-Hyeon Kim, Youngwook Kim, Yo-Sub Han, Hyeonseung Im, Sang-Ki Ko:
Automated Grading of Regular Expressions. ESOP 2023: 90-112 - [c93]Joonghyuk Hahn, Hyunjoon Cheon, Yo-Sub Han:
M-equivalence of Parikh Matrix over a Ternary Alphabet. CIAA 2023: 141-152 - [c92]Sicheol Sung, Sang-Ki Ko, Yo-Sub Han:
Smaller Representation of Compiled Regular Expressions. CIAA 2023: 290-301 - [i10]JB. Kim, Hazel Kim, Joonghyuk Hahn, Yo-Sub Han:
ATHENA: Mathematical Reasoning with Thought Expansion. CoRR abs/2311.01036 (2023) - 2022
- [c91]Hazel H. Kim, Daecheol Woo, Seong Joon Oh, Jeong-Won Cha, Yo-Sub Han:
ALP: Data Augmentation Using Lexicalized PCFGs for Few-Shot Text Classification. AAAI 2022: 10894-10902 - [c90]Jikyoeng Son, Joonghyuk Hahn, HyeonTae Seo, Yo-Sub Han:
Boosting Code Summarization by Embedding Code Structures. COLING 2022: 5966-5977 - [c89]Youngwook Kim, Shinwoo Park, Yo-Sub Han:
Generalizable Implicit Hate Speech Detection Using Contrastive Learning. COLING 2022: 6667-6679 - [c88]Sungmin Kim, Yo-Sub Han, Sang-Ki Ko, Kai Salomaa:
On Simon's Congruence Closure of a String. DCFS 2022: 127-141 - [c87]Hyunjoon Cheon, Joonghyuk Hahn, Yo-Sub Han:
On the Decidability of Infix Inclusion Problem. DLT 2022: 115-126 - [c86]Sungmin Kim, Sang-Ki Ko, Yo-Sub Han:
Simon's Congruence Pattern Matching. ISAAC 2022: 60:1-60:17 - [c85]Sicheol Sung, Hyunjoon Cheon, Yo-Sub Han:
How to Settle the ReDoS Problem: Back to the Classical Automata Theory. CIAA 2022: 34-49 - [e3]Yo-Sub Han, György Vaszil:
Descriptional Complexity of Formal Systems - 24th IFIP WG 1.02 International Conference, DCFS 2022, Debrecen, Hungary, August 29-31, 2022, Proceedings. Lecture Notes in Computer Science 13439, Springer 2022, ISBN 978-3-031-13256-8 [contents] - [i9]Hazel Kim, Jaeman Son, Yo-Sub Han:
LST: Lexicon-Guided Self-Training for Few-Shot Text Classification. CoRR abs/2202.02566 (2022) - [i8]Su-Hyeon Kim, Hyunjoon Cheon, Yo-Sub Han, Sang-Ki Ko:
Neuro-Symbolic Regex Synthesis Framework via Neural Example Splitting. CoRR abs/2205.11258 (2022) - 2021
- [j64]Yo-Sub Han, Sang-Ki Ko, Timothy Ng, Kai Salomaa:
Consensus string problem for multiple regular languages. Inf. Comput. 279: 104615 (2021) - [j63]Sang-Ki Ko, Yo-Sub Han, Kai Salomaa:
Generalizations of Code Languages with Marginal Errors. Int. J. Found. Comput. Sci. 32(5): 509-529 (2021) - [j62]Sang-Ki Ko, Yo-Sub Han:
Left is Better Than Right for Reducing Nondeterminism of NFAs. Int. J. Found. Comput. Sci. 32(5): 531-550 (2021) - [j61]Yo-Sub Han, Hwee Kim:
Impossibility of strict assembly of infinite fractals by oritatami. Nat. Comput. 20(4): 691-701 (2021) - [j60]Yo-Sub Han, Sang-Ki Ko, Timothy Ng, Kai Salomaa:
Closest substring problems for regular languages. Theor. Comput. Sci. 862: 144-154 (2021) - [j59]Yo-Sub Han, Hwee Kim, Yusei Masuda, Shinnosuke Seki:
A general architecture of oritatami systems for simulating arbitrary finite automata. Theor. Comput. Sci. 870: 29-52 (2021) - [c84]Ju Hyoung Lee, Sang-Ki Ko, Yo-Sub Han:
SALNet: Semi-supervised Few-Shot Text Classification with Attention-based Lexicon Construction. AAAI 2021: 13189-13197 - [c83]Hyunjoon Cheon, Joonghyuk Hahn, Yo-Sub Han, Sang-Ki Ko:
Most Pseudo-copy Languages Are Not Context-Free. COCOON 2021: 189-200 - [c82]Xiaodong Gu, Yo-Sub Han, Sunghun Kim, Hongyu Zhang:
Do Bugs Propagate? An Empirical Analysis of Temporal Correlations Among Software Bugs. ECOOP 2021: 11:1-11:21 - [c81]Joonghyuk Hahn, Hyunjoon Cheon, Kyuyeol Han, Cheongjae Lee, Junseok Kim, Yo-Sub Han:
Self-Training using Rules of Grammar for Few-Shot NLU. EMNLP (Findings) 2021: 4576-4581 - [c80]HyeonTae Seo, Yo-Sub Han, Sang-Ki Ko:
MultiFix: Learning to Repair Multiple Errors by Optimal Alignment Learning. EMNLP (Findings) 2021: 4850-4855 - [e2]Yo-Sub Han, Sang-Ki Ko:
Descriptional Complexity of Formal Systems - 23rd IFIP WG 1.02 International Conference, DCFS 2021, Virtual Event, September 5, 2021, Proceedings. Lecture Notes in Computer Science 13037, Springer 2021, ISBN 978-3-030-93488-0 [contents] - [i7]Hazel Kim, Daecheol Woo, Seong Joon Oh, Jeong-Won Cha, Yo-Sub Han:
ALP: Data Augmentation using Lexicalized PCFGs for Few-Shot Text Classification. CoRR abs/2112.11916 (2021) - 2020
- [j58]Yo-Sub Han, Hwee Kim, Shinnosuke Seki:
Transcript design problem of oritatami systems. Nat. Comput. 19(2): 323-335 (2020) - [c79]Hyunjoon Cheon, Jinseung Ryu, Chan Yeol Park, Yo-Sub Han:
SW Runtime Estimation using Automata Theory and Deep Learning on HPC. ACSOS Companion 2020: 7-12 - [c78]Hyunjoon Cheon, Yo-Sub Han:
Computing the Shortest String and the Edit-Distance for Parsing Expression Languages. DLT 2020: 43-54
2010 – 2019
- 2019
- [j57]Yo-Sub Han, Hwee Kim, Trent A. Rogers, Shinnosuke Seki:
Self-Attraction Removal from Oritatami Systems. Int. J. Found. Comput. Sci. 30(6-7): 1047-1067 (2019) - [j56]Yo-Sub Han, Hwee Kim:
Ruleset optimization on isomorphic oritatami systems. Theor. Comput. Sci. 785: 128-139 (2019) - [j55]Yo-Sub Han, Sang-Ki Ko:
Alignment distance of regular tree languages. Theor. Comput. Sci. 787: 127-137 (2019) - [j54]Da-Jung Cho, Yo-Sub Han, Hwee Kim:
Bound-decreasing duplication system. Theor. Comput. Sci. 793: 152-168 (2019) - [j53]Da-Jung Cho, Yo-Sub Han, Kai Salomaa, Taylor J. Smith:
Site-directed insertion: Language equations and decision problems. Theor. Comput. Sci. 798: 40-51 (2019) - [c77]Marco Cognetta, Yo-Sub Han, Soon Chan Kwon:
Online Infix Probability Computation for Probabilistic Finite Automata. ACL (1) 2019: 5332-5337 - [c76]Yo-Sub Han, Sang-Ki Ko, Kai Salomaa:
Limited Nondeterminism of Input-Driven Pushdown Automata: Decidability and Complexity. DCFS 2019: 158-170 - [c75]Hyunjoon Cheon, Yo-Sub Han, Sang-Ki Ko, Kai Salomaa:
The Relative Edit-Distance Between Two Input-Driven Languages. DLT 2019: 127-139 - [c74]Jun-U. Park, Sang-Ki Ko, Marco Cognetta, Yo-Sub Han:
SoftRegex: Generating Regex from Natural Language Descriptions using Softened Regex Equivalence. EMNLP/IJCNLP (1) 2019: 6424-6430 - [c73]Yo-Sub Han, Hwee Kim, Yusei Masuda, Shinnosuke Seki:
A General Architecture of Oritatami Systems for Simulating Arbitrary Finite Automata. CIAA 2019: 146-157 - [i6]Yo-Sub Han, Hwee Kim, Yusei Masuda, Shinnosuke Seki:
A general architecture of oritatami systems for simulating arbitrary finite automata. CoRR abs/1904.10174 (2019) - [i5]Yo-Sub Han, Hwee Kim:
Cyclic Oritatami Systems Cannot Fold Infinite Fractal Curves. CoRR abs/1908.04409 (2019) - 2018
- [j52]Ho-Suk Lee, Hong-Rae Lee, Jun-U. Park, Yo-Sub Han:
An abusive text detection system based on enhanced abusive and non-abusive word lists. Decis. Support Syst. 113: 22-31 (2018) - [j51]Alexandros Palioudakis, Yo-Sub Han, Kai Salomaa:
Growth Rate of Minimum Branching. J. Autom. Lang. Comb. 23(1-3): 281-292 (2018) - [j50]Yo-Sub Han, Hwee Kim, Makoto Ota, Shinnosuke Seki:
Nondeterministic seedless oritatami systems and hardness of testing their equivalence. Nat. Comput. 17(1): 67-79 (2018) - [c72]Da-Jung Cho, Yo-Sub Han, Kai Salomaa, Taylor J. Smith:
Site-Directed Insertion: Decision Problems, Maximality and Minimality. DCFS 2018: 49-61 - [c71]Da-Jung Cho, Yo-Sub Han, Hwee Kim, Kai Salomaa:
Site-Directed Deletion. DLT 2018: 219-230 - [c70]Yo-Sub Han, Sang-Ki Ko, Timothy Ng, Kai Salomaa:
Closest Substring Problems for Regular Languages. DLT 2018: 392-403 - [c69]Yo-Sub Han, Hwee Kim, Shinnosuke Seki:
Transcript Design Problem of Oritatami Systems. DNA 2018: 139-154 - [c68]Yo-Sub Han, Hwee Kim:
Construction of Geometric Structure by Oritatami System. DNA 2018: 173-188 - [c67]Marco Cognetta, Yo-Sub Han, Soon Chan Kwon:
Incremental Computation of Infix Probabilities for Probabilistic Finite Automata. EMNLP 2018: 2732-2741 - [c66]Marco Cognetta, Yo-Sub Han:
Online Stochastic Pattern Matching. CIAA 2018: 121-132 - [i4]Da-Jung Cho, Yo-Sub Han, Kai Salomaa, Taylor J. Smith:
Site-Directed Insertion: Decision Problems, Maximality and Minimality. CoRR abs/1804.11017 (2018) - [i3]Sang-Min Choi, Jiho Park, Quan Hoang Nguyen, Andre Cronje, Ki-Young Jang, Hyunjoon Cheon, Yo-Sub Han, Byung-Ik Ahn:
OPERA: Reasoning about continuous common knowledge in asynchronous distributed systems. CoRR abs/1810.02186 (2018) - 2017
- [j49]Yo-Sub Han, Arto Salomaa, Kai Salomaa:
Ambiguity, Nondeterminism and State Complexity of Finite Automata. Acta Cybern. 23(1): 141-157 (2017) - [j48]Yo-Sub Han, Sang-Ki Ko, Kai Salomaa:
State Complexity of k-Parallel Tree Concatenation. Fundam. Informaticae 154(1-4): 185-199 (2017) - [j47]Yo-Sub Han, Kai Salomaa:
Preface. Int. J. Found. Comput. Sci. 28(5): 437-440 (2017) - [j46]Da-Jung Cho, Daniel Goc, Yo-Sub Han, Sang-Ki Ko, Alexandros Palioudakis, Kai Salomaa:
State complexity of permutation on finite languages over a binary alphabet. Theor. Comput. Sci. 682: 67-78 (2017) - [j45]Da-Jung Cho, Yo-Sub Han, Timothy Ng, Kai Salomaa:
Pseudoknot-generating operation. Theor. Comput. Sci. 696: 52-64 (2017) - [j44]Da-Jung Cho, Yo-Sub Han, Timothy Ng, Kai Salomaa:
Outfix-guided insertion. Theor. Comput. Sci. 701: 70-84 (2017) - [c65]Yo-Sub Han, Hwee Kim, Trent A. Rogers, Shinnosuke Seki:
Self-attraction Removal from Oritatami Systems. DCFS 2017: 164-176 - [c64]Yo-Sub Han, Hwee Kim:
Ruleset Optimization on Isomorphic Oritatami Systems. DNA 2017: 33-45 - [c63]Yo-Sub Han, Daniel Prusa:
Template-Based Pattern Matching in Two-Dimensional Arrays. IWCIA 2017: 79-92 - [c62]Yo-Sub Han, Sang-Ki Ko, Timothy Ng, Kai Salomaa:
Consensus String Problem for Multiple Regular Languages. LATA 2017: 196-207 - [c61]Yo-Sub Han, Sang-Ki Ko:
Edit-Distance Between Visibly Pushdown Languages. SOFSEM 2017: 387-401 - [c60]Da-Jung Cho, Yo-Sub Han, Hwee Kim:
Deduplication on Finite Automata and Nested Duplication Systems. UCNC 2017: 194-205 - [c59]Yo-Sub Han, Sang-Ki Ko:
Alignment Distance of Regular Tree Languages. CIAA 2017: 126-137 - [i2]Da-Jung Cho, Yo-Sub Han, Timothy Ng, Kai Salomaa:
Outfix-guided insertion. CoRR abs/1707.04651 (2017) - 2016
- [j43]Yo-Sub Han, Sang-Ki Ko, Kai Salomaa:
State complexity of deletion and bipolar deletion. Acta Informatica 53(1): 67-85 (2016) - [j42]Hwee Kim, Yo-Sub Han:
OMPPM: online multiple palindrome pattern matching. Bioinform. 32(8): 1151-1157 (2016) - [j41]Hae-Sung Eom, Yo-Sub Han, Galina Jirásková:
State Complexity of Basic Operations on Non-Returning Regular Languages. Fundam. Informaticae 144(2): 161-182 (2016) - [j40]Sang-Ki Ko, Yo-Sub Han, Kai Salomaa:
Approximate matching between a context-free grammar and a finite-state automaton. Inf. Comput. 247: 278-289 (2016) - [j39]Sang-Ki Ko, Hae-Sung Eom, Yo-Sub Han:
Operational State Complexity of Subtree-Free Regular Tree Languages. Int. J. Found. Comput. Sci. 27(6): 705-724 (2016) - [j38]Yo-Sub Han, Sang-Ki Ko, Timothy Ng, Kai Salomaa:
State Complexity of Insertion. Int. J. Found. Comput. Sci. 27(7): 863-878 (2016) - [j37]Sang-Ki Ko, Ha-Rim Lee, Yo-Sub Han:
State Complexity of Regular Tree Languages for Tree Matching. Int. J. Found. Comput. Sci. 27(8): 965-980 (2016) - [j36]Da-Jung Cho, Yo-Sub Han, Hwee Kim, Alexandros Palioudakis, Kai Salomaa:
Duplications and Pseudo-Duplications. Int. J. Unconv. Comput. 12(2-3): 145-167 (2016) - [j35]Da-Jung Cho, Yo-Sub Han, Shin-Dong Kang, Hwee Kim, Sang-Ki Ko, Kai Salomaa:
Pseudo-inversion: closure properties and decidability. Nat. Comput. 15(1): 31-39 (2016) - [j34]Da-Jung Cho, Yo-Sub Han, Sang-Ki Ko, Kai Salomaa:
State complexity of inversion operations. Theor. Comput. Sci. 610: 2-12 (2016) - [c58]Da-Jung Cho, Yo-Sub Han, Timothy Ng, Kai Salomaa:
Outfix-Guided Insertion - (Extended Abstract). DLT 2016: 102-113 - [c57]Yo-Sub Han, Hwee Kim, Makoto Ota, Shinnosuke Seki:
Nondeterministic Seedless Oritatami Systems and Hardness of Testing Their Equivalence. DNA 2016: 19-34 - [c56]Guen-Hae Kim, Sang-Ki Ko, Yo-Sub Han:
Inferring a Relax NG Schema from XML Documents. LATA 2016: 400-411 - [c55]Da-Jung Cho, Yo-Sub Han, Timothy Ng, Kai Salomaa:
Pseudoknot-Generating Operation. SOFSEM 2016: 241-252 - [e1]Yo-Sub Han, Kai Salomaa:
Implementation and Application of Automata - 21st International Conference, CIAA 2016, Seoul, South Korea, July 19-22, 2016, Proceedings. Lecture Notes in Computer Science 9705, Springer 2016, ISBN 978-3-319-40945-0 [contents] - 2015
- [j33]Yo-Sub Han, Sang-Ki Ko, Xiaoxue Piao, Kai Salomaa:
State Complexity of Kleene-Star Operations on Regular Tree Languages. Acta Cybern. 22(2): 403-422 (2015) - [j32]Sang-Min Choi, Hyein Lee, Yo-Sub Han, Ka Lok Man, Woon Kian Chong:
A Recommendation Model Using the Bandwagon Effect for E-Marketing Purposes in IoT. Int. J. Distributed Sens. Networks 11: 475163:1-475163:7 (2015) - [j31]Hae-Sung Eom, Yo-Sub Han, Kai Salomaa:
State Complexity of k-Union and k-Intersection for Prefix-Free Regular Languages. Int. J. Found. Comput. Sci. 26(2): 211-228 (2015) - [j30]Hae-Sung Eom, Yo-Sub Han:
State Complexity of Boundary of Prefix-Free Regular Languages. Int. J. Found. Comput. Sci. 26(6): 697-708 (2015) - [j29]Da-Jung Cho, Yo-Sub Han, Hwee Kim:
Alignment with non-overlapping inversions and translocations on two strings. Theor. Comput. Sci. 575: 90-101 (2015) - [j28]Hwee Kim, Yo-Sub Han:
Non-overlapping inversion on strings and languages. Theor. Comput. Sci. 592: 9-22 (2015) - [c54]Alexandros Palioudakis, Da-Jung Cho, Daniel Goc, Yo-Sub Han, Sang-Ki Ko, Kai Salomaa:
The State Complexity of Permutations on Finite Languages over Binary Alphabets. DCFS 2015: 220-230 - [c53]Yo-Sub Han, Sang-Ki Ko, Kai Salomaa:
Generalizations of Code Languages with Marginal Errors. DLT 2015: 264-275 - [c52]Da-Jung Cho, Yo-Sub Han, Hwee Kim:
Frequent Pattern Mining with Non-overlapping Inversions. LATA 2015: 121-132 - [c51]Da-Jung Cho, Yo-Sub Han, Hwee Kim, Alexandros Palioudakis, Kai Salomaa:
Duplications and Pseudo-Duplications. UCNC 2015: 157-168 - 2014
- [j27]Yousun Ko, Minyoung Jung, Yo-Sub Han, Bernd Burgstaller:
A Speculative Parallel DFA Membership Test for Multicore, SIMD and Cloud Computing Environments. Int. J. Parallel Program. 42(3): 456-489 (2014) - [j26]Da-Jung Cho, Yo-Sub Han, Sang-Ki Ko:
Decidability of involution hypercodes. Theor. Comput. Sci. 550: 90-99 (2014) - [c50]Hae-Sung Eom, Yo-Sub Han, Kai Salomaa, Sheng Yu:
State Complexity of Combined Operations for Prefix-Free Regular Languages. Discrete Mathematics and Computer Science 2014: 137-151 - [c49]Da-Jung Cho, Yo-Sub Han, Sang-Ki Ko, Kai Salomaa:
State Complexity of Inversion Operations. DCFS 2014: 102-113 - [c48]Sang-Ki Ko, Ha-Rim Lee, Yo-Sub Han:
State Complexity of Regular Tree Languages for Tree Pattern Matching. DCFS 2014: 246-257 - [c47]Yo-Sub Han, Sang-Ki Ko, Kai Salomaa:
State Complexity of Deletion. Developments in Language Theory 2014: 37-48 - [c46]Hwee Kim, Yo-Sub Han:
Space-Efficient Approximate String Matching Allowing Inversions in Fast Average Time. FAW 2014: 141-150 - [c45]Soryoung Kim, Sang-Min Choi, Yo-Sub Han, Ka Lok Man, Kaiyu Wan:
Analyzing Item Features for Cold-Start Problems in Recommendation Systems. IIH-MSP 2014: 167-170 - [c44]Sang-Ki Ko, Yo-Sub Han, Kai Salomaa:
Top-Down Tree Edit-Distance of Regular Tree Languages. LATA 2014: 466-477 - [c43]Kyoung-Hwan Kim, Sang-Min Choi, Hyein Lee, Ka Lok Man, Yo-Sub Han:
Parallel CYK Membership Test on GPUs. NPC 2014: 157-168 - [c42]Hwee Kim, Yo-Sub Han:
Online Multiple Palindrome Pattern Matching. SPIRE 2014: 173-178 - [c41]Da-Jung Cho, Yo-Sub Han, Shin-Dong Kang, Hwee Kim, Sang-Ki Ko, Kai Salomaa:
Pseudo-inversion on Formal Languages. UCNC 2014: 93-104 - [c40]Da-Jung Cho, Yo-Sub Han, Hwee Kim:
Alignment with Non-overlapping Inversions on Two Strings. WALCOM 2014: 261-272 - [c39]Sang-Ki Ko, Yo-Sub Han:
Left is Better than Right for Reducing Nondeterminism of NFAs. CIAA 2014: 238-251 - 2013
- [j25]Sang-Min Choi, Yo-Sub Han:
Representative reviewers for Internet social media. Expert Syst. Appl. 40(4): 1274-1282 (2013) - [j24]Yo-Sub Han:
State Elimination Heuristics for Short Regular Expressions. Fundam. Informaticae 128(4): 445-462 (2013) - [j23]Yo-Sub Han:
An Improved Prefix-Free Regular-Expression Matching. Int. J. Found. Comput. Sci. 24(5): 679- (2013) - [j22]Yo-Sub Han, Sang-Ki Ko, Kai Salomaa:
The Edit-Distance between a Regular Language and a Context-Free Language. Int. J. Found. Comput. Sci. 24(7): 1067-1082 (2013) - [j21]Hae-Sung Eom, Yo-Sub Han:
State complexity of combined operations for suffix-free regular languages. Theor. Comput. Sci. 510: 87-93 (2013) - [c38]Hae-Sung Eom, Yo-Sub Han, Galina Jirásková:
State Complexity of Basic Operations on Non-returning Regular Languages. DCFS 2013: 54-65 - [c37]Hae-Sung Eom, Yo-Sub Han, Sang-Ki Ko:
State Complexity of Subtree-Free Regular Tree Languages. DCFS 2013: 66-77 - [c36]Hae-Sung Eom, Yo-Sub Han, Kai Salomaa:
State Complexity of k-Union and k-Intersection for Prefix-Free Regular Languages. DCFS 2013: 78-89 - [c35]Sang-Min Choi, Yo-Sub Han:
Identifying representative ratings for a new item in recommendation system. ICUIMC 2013: 64 - [c34]Yo-Sub Han, Sang-Ki Ko, Kai Salomaa:
Approximate Matching between a Context-Free Grammar and a Finite-State Automaton. CIAA 2013: 146-157 - 2012
- [j20]Yo-Sub Han, Laehyun Kim, Jeong-Won Cha:
Computing User Reputation in a Social Network of Web 2.0. Comput. Informatics 31(2): 447-462 (2012) - [j19]Sang-Min Choi, Sang-Ki Ko, Yo-Sub Han:
A movie recommendation algorithm based on genre correlations. Expert Syst. Appl. 39(9): 8079-8085 (2012) - [j18]Yo-Sub Han, Sang-Ki Ko:
Analysis of a cellular automaton model for car traffic with a junction. Theor. Comput. Sci. 450: 54-67 (2012) - [c33]Yo-Sub Han, Sang-Ki Ko, Kai Salomaa:
Computing the Edit-Distance between a Regular Language and a Context-Free Language. Developments in Language Theory 2012: 85-96 - [c32]Bernhard Scholz, Sang-Min Choi, Sang-Ki Ko, Hae-Sung Eom, Yo-Sub Han:
A recommendation system based on a subset of raters. ICUIMC 2012: 99:1-99:9 - [i1]Yousun Ko, Minyoung Jung, Yo-Sub Han, Bernd Burgstaller:
A Speculative Parallel DFA Membership Test for Multicore, SIMD and Cloud Computing Environments. CoRR abs/1210.5093 (2012) - 2011
- [j17]Yo-Sub Han, Kai Salomaa:
Overlap-Free Languages and solid Codes. Int. J. Found. Comput. Sci. 22(5): 1197-1209 (2011) - [c31]Pascal Caron, Yo-Sub Han, Ludovic Mignot:
Generalized One-Unambiguity. Developments in Language Theory 2011: 129-140 - [c30]Sang-Ki Ko, Sang-Min Choi, Hae-Sung Eom, Jeong-Won Cha, Hyunchul Cho, Laehyun Kim, Yo-Sub Han:
A Smart Movie Recommendation System. HCI (11) 2011: 558-566 - [c29]Bernhard Scholz, Sang-Min Choi, Sang-Ki Ko, Hae-Sung Eom, Yo-Sub Han:
Analyzing category correlations for recommendation system. ICUIMC 2011: 1 - [c28]Yo-Sub Han, Sang-Ki Ko:
A Cellular Automaton Model for Car Traffic with a Form-One-Lane Rule. CIAA 2011: 154-165 - 2010
- [j16]Yo-Sub Han:
On the Linear Number of Matching Substrings. J. Univers. Comput. Sci. 16(5): 715-728 (2010) - [c27]Sang-Min Choi, Jeong-Won Cha, Yo-Sub Han:
Identifying Representative Reviewers in Internet Social Media. ICCCI (2) 2010: 22-30 - [c26]Yo-Sub Han, Kai Salomaa:
Nondeterministic State Complexity for Suffix-Free Regular Languages. DCFS 2010: 189-196
2000 – 2009
- 2009
- [j15]Yo-Sub Han, Kai Salomaa, Derick Wood:
Nondeterministic State Complexity of Basic Operations for Prefix-Free Regular Languages. Fundam. Informaticae 90(1-2): 93-106 (2009) - [j14]Grzegorz Frackowiak, Maria Ganzha, Maciej Gawinecki, Marcin Paprzycki, Michal Szymczak, Costin Badica, Yo-Sub Han, Myon-Woong Park:
Adaptability in an agent-based virtual organisation. Int. J. Agent Oriented Softw. Eng. 3(2/3): 188-211 (2009) - [j13]Yo-Sub Han, Kai Salomaa:
State complexity of basic operations on suffix-free regular languages. Theor. Comput. Sci. 410(27-29): 2537-2548 (2009) - [j12]Yo-Sub Han, Kai Salomaa:
Nondeterministic state complexity of nested word automata. Theor. Comput. Sci. 410(30-32): 2961-2971 (2009) - [c25]Yo-Sub Han, Kai Salomaa, Derick Wood:
Operational State Complexity of Prefix-Free Regular Languages. Automata, Formal Languages, and Related Topics 2009: 99-115 - [c24]Jeong-Won Cha, Hyun-woo Lee, Yo-Sub Han, Laehyun Kim:
User Reputation Evaluation Using Co-occurrence Feature and Collective Intelligence. HCI (12) 2009: 305-311 - [c23]Yo-Sub Han, Laehyun Kim, Jeong-Won Cha:
Evaluation of User Reputation on YouTube. HCI (12) 2009: 346-353 - [c22]Yo-Sub Han, Kai Salomaa, Sheng Yu:
State Complexity of Combined Operations for Prefix-Free Regular Languages. LATA 2009: 398-409 - [c21]Jae-Hee Ahn, Yo-Sub Han:
Implementation of State Elimination Using Heuristics. CIAA 2009: 178-187 - [p1]Grzegorz Frackowiak, Maria Ganzha, Maciej Gawinecki, Marcin Paprzycki, Michal Szymczak, Myon-Woong Park, Yo-Sub Han:
Considering Resource Management in Agent-Based Virtual Organization. Intelligent Agents in the Evolution of Web and Applications 2009: 161-190 - 2008
- [j11]Yo-Sub Han, Derick Wood:
Generalizations of 1-deterministic regular languages. Inf. Comput. 206(9-10): 1117-1125 (2008) - [j10]Yo-Sub Han, Kai Salomaa:
State Complexity of Union and Intersection of Finite Languages. Int. J. Found. Comput. Sci. 19(3): 581-595 (2008) - [c20]Maria Ganzha, Maciej Gawinecki, Michal Szymczak, Grzegorz Frackowiak, Marcin Paprzycki, Myon-Woong Park, Yo-Sub Han, Young Tae Sohn:
Generic Framework for Agent Adaptability and Utilization in a Virtual Organization - Preliminary Considerations. ENASE 2008: 17-25 - [c19]Grzegorz Frackowiak, Maria Ganzha, Maciej Gawinecki, Marcin Paprzycki, Michal Szymczak, Myon-Woong Park, Yo-Sub Han:
On Resource Profiling and Matching in an Agent-Based Virtual Organization. ICAISC 2008: 1210-1221 - [c18]Lisa Wiyartanti, Yo-Sub Han, Laehyun Kim:
A ranking algorithm for user-generated video contents based on social activities. ICDIM 2008: 260-265 - [c17]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:
Infrastructure for Ontological Resource Matching in a Virtual Organization. IDC 2008: 11-21 - [c16]Michal Szymczak, Grzegorz Frackowiak, Maria Ganzha, Marcin Paprzycki, Sang Keun Rhee, Jihye Lee, Young Tae Sohn, Jae Kwan Kim, Yo-Sub Han, Myon-Woong Park:
Ontological matchmaking in a Duty Trip Support application in a virtual organization. IMCSIT 2008: 243-250 - [c15]Michal Szymczak, Grzegorz Frackowiak, Maciej Gawinecki, Maria Ganzha, Marcin Paprzycki, Myon-Woong Park, Yo-Sub Han, Young Tae Sohn:
Adaptive Information Provisioning in an Agent-Based Virtual Organization-Ontologies in the System. KES-AMSTA 2008: 271-280 - [c14]Grzegorz Frackowiak, Maria Ganzha, Marcin Paprzycki, Michal Szymczak, Yo-Sub Han, Myon-Woong Park:
Adaptability in an Agent-Based Virtual Organization - Towards Implementation. WEBIST (Selected Papers) 2008: 27-39 - [c13]Maria Ganzha, Maciej Gawinecki, Michal Szymczak, Grzegorz Frackowiak, Marcin Paprzycki, Myon-Woong Park, Yo-Sub Han, Young Tae Sohn:
Generic Framework for Agent Adaptability and Utilization in a Virtual Organization - Preliminary Considerations. WEBIST (1) 2008 - 2007
- [j9]Yo-Sub Han:
Decision Algorithms for Subfamilies of Regular Languages using State-Pair Graphs. Bull. EATCS 93: 118-133 (2007) - [j8]Yo-Sub Han, Kai Salomaa, Derick Wood:
Intercode Regular Languages. Fundam. Informaticae 76(1-2): 113-128 (2007) - [j7]Yo-Sub Han, Derick Wood:
Outfix-Free Regular Languages and Prime Outfix-Free Decomposition. Fundam. Informaticae 81(4): 441-457 (2007) - [j6]Yo-Sub Han, Gerhard Trippen, Derick Wood:
Simple-Regular Expressions and Languages. J. Autom. Lang. Comb. 12(1-2): 181-194 (2007) - [j5]Yo-Sub Han, Derick Wood:
Obtaining shorter regular expressions from finite-state automata. Theor. Comput. Sci. 370(1-3): 110-120 (2007) - [j4]Yo-Sub Han, Arto Salomaa, Kai Salomaa, Derick Wood, Sheng Yu:
On the existence of prime decompositions. Theor. Comput. Sci. 376(1-2): 60-69 (2007) - [j3]Yo-Sub Han, Yajun Wang, Derick Wood:
Prefix-free regular languages and pattern matching. Theor. Comput. Sci. 389(1-2): 307-317 (2007) - [c12]Yo-Sub Han, Kai Salomaa:
State Complexity of Union and Intersection of Finite Languages. Developments in Language Theory 2007: 217-228 - [c11]Yo-Sub Han, Derick Wood:
Generalizations of One-Deterministic Regular Languages. LATA 2007: 273-284 - [c10]Yo-Sub Han, Kai Salomaa:
State Complexity of Basic Operations on Suffix-Free Regular Languages. MFCS 2007: 501-512 - 2006
- [j2]Yo-Sub Han, Yajun Wang, Derick Wood:
Infix-free Regular Expressions and Languages. Int. J. Found. Comput. Sci. 17(2): 379-394 (2006) - [c9]Yo-Sub Han, Derick Wood:
Overlap-Free Regular Languages. COCOON 2006: 469-478 - [c8]Yo-Sub Han, Kai Salomaa, Derick Wood:
State Complexity of Prefix-Free Regular Languages. DCFS 2006: 165-176 - [c7]Yo-Sub Han, Kai Salomaa, Derick Wood:
Prime Decompositions of Regular Languages. Developments in Language Theory 2006: 145-155 - 2005
- [j1]Yo-Sub Han, Derick Wood:
The generalization of generalized automata: expression automata. Int. J. Found. Comput. Sci. 16(3): 499-510 (2005) - [c6]Yo-Sub Han, Yajun Wang, Derick Wood:
Prefix-Free Regular-Expression Matching. CPM 2005: 298-309 - [c5]Yo-Sub Han, Gerhard Trippen, Derick Wood:
Simple-Regular Expressions and Languages. DCFS 2005: 146-157 - [c4]Yo-Sub Han, Derick Wood:
A New Linearizing Restriction in the Pattern Matching Problem. FCT 2005: 552-562 - [c3]Yo-Sub Han, Derick Wood:
Outfix-Free Regular Languages and Prime Outfix-Free Decomposition. ICTAC 2005: 96-109 - [c2]Yo-Sub Han, Derick Wood:
Shorter Regular Expressions from Finite-State Automata. CIAA 2005: 141-152 - 2004
- [c1]Yo-Sub Han, Derick Wood:
The Generalization of Generalized Automata: Expression Automata. CIAA 2004: 156-166
Coauthor Index
[j69] [i13] [j66] [j65] [c101] [c99] [c97] [c94] [c92] [c88] [c86] [i8] [j64] [j63] [j62] [j60] [c84] [c83] [c80] [e2] [j55] [c76] [c75] [c74] [c70] [j48] [j46] [c62] [c61] [c59] [j43] [j40] [j39] [j38] [j37] [j35] [j34] [c56] [j33] [c54] [c53] [j26] [c49] [c48] [c47] [c44] [c41] [c39] [j22] [c37] [c34] [j19] [j18] [c33] [c32] [c30] [c29] [c28]
[c105] [j66] [j65] [c101] [c99] [c88] [j64] [j63] [j60] [j53] [c76] [c75] [j51] [c72] [c71] [c70] [i4] [j49] [j48] [j47] [j46] [j45] [j44] [c62] [i2] [j43] [j40] [j38] [j36] [j35] [j34] [c58] [c55] [e1] [j33] [j31] [c54] [c53] [c51] [c50] [c49] [c47] [c44] [c41] [j22] [c36] [c34] [c33] [j17] [c26] [j15] [j13] [j12] [c25] [c22] [j10] [j8] [j4] [c12] [c10] [c8] [c7]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-26 01:51 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
