| 2011 | ||
|---|---|---|
| 78 | Lucian Ilie, Silvana Ilie, Anahita Mansouri Bigvand: SpEED: fast computation of sensitive spaced seeds. Bioinformatics 27(17): 2433-2434 (2011) | |
| 77 | Lucian Ilie, Farideh Fazayeli, Silvana Ilie: HiTEC: accurate error correction in high-throughput sequencing data. Bioinformatics 27(3): 295-302 (2011) | |
| 76 | Matei David, Misko Dzamba, Dan Lister, Lucian Ilie, Michael Brudno: SHRiMP2: Sensitive yet Practical Short Read Mapping. Bioinformatics 27(7): 1011-1012 (2011) | |
| 75 | Lucian Ilie, William F. Smyth: Minimum Unique Substrings and Maximum Repeats. Fundam. Inform. 110(1-4): 183-195 (2011) | |
| 74 | Maxime Crochemore, Lucian Ilie, Liviu Tinta: The "runs" conjecture. Theor. Comput. Sci. 412(27): 2931-2941 (2011) | |
| 2010 | ||
| 73 | Lucian Ilie, Gonzalo Navarro, Liviu Tinta: The longest common extension problem revisited and applications to approximate string searching. J. Discrete Algorithms 8(4): 418-428 (2010) | |
| 2009 | ||
| 72 | Maxime Crochemore, Lucian Ilie, Costas S. Iliopoulos, Marcin Kubica, Wojciech Rytter, Tomasz Walen: LPF Computation Revisited. IWOCA 2009: 158-169 | |
| 71 | Lucian Ilie, Liviu Tinta: Practical Algorithms for the Longest Common Extension Problem. SPIRE 2009: 302-309 | |
| 70 | Lucian Ilie, Silvana Ilie: Fast computation of neighbor seeds. Bioinformatics 25(6): 822-823 (2009) | |
| 69 | Maxime Crochemore, Lucian Ilie, Wojciech Rytter: Repetitions in strings: Algorithms and combinatorics. Theor. Comput. Sci. 410(50): 5227-5235 (2009) | |
| 2008 | ||
| 68 | Maxime Crochemore, Lucian Ilie, Liviu Tinta: Towards a Solution to the "Runs" Conjecture. CPM 2008: 290-302 | |
| 67 | Maxime Crochemore, Lucian Ilie, William F. Smyth: A Simple Algorithm for Computing the Lempel Ziv Factorization. DCC 2008: 482-488 | |
| 66 | Maxime Crochemore, Lucian Ilie: Understanding Maximal Repetitions in Strings. STACS 2008: 11-16 | |
| 65 | Lucian Ilie: Regular Expression Matching. Encyclopedia of Algorithms 2008 | |
| 64 | Maxime Crochemore, Lucian Ilie: Understanding maximal repetitions in strings CoRR abs/0802.2829: (2008) | |
| 63 | Maxime Crochemore, Lucian Ilie: Computing Longest Previous Factor in linear time and applications. Inf. Process. Lett. 106(2): 75-80 (2008) | |
| 62 | Maxime Crochemore, Lucian Ilie: Maximal repetitions in strings. J. Comput. Syst. Sci. 74(5): 796-807 (2008) | |
| 2007 | ||
| 61 | Lucian Ilie, Silvana Ilie: Long spaced seeds for finding similarities between biological sequences. BIOCOMP 2007: 3-8 | |
| 60 | Maxime Crochemore, Lucian Ilie: Analysis of Maximal Repetitions in Strings. MFCS 2007: 465-476 | |
| 59 | Lucian Ilie, Silvana Ilie: Fast Computation of Good Multiple Spaced Seeds. WABI 2007: 346-358 | |
| 58 | Lucian Ilie, Silvana Ilie: Multiple spaced seeds for homology search. Bioinformatics 23(22): 2969-2977 (2007) | |
| 57 | Maxime Crochemore, Lucian Ilie, Emine Seid-Hilmi: The Structure of Factor Oracles. Int. J. Found. Comput. Sci. 18(4): 781-797 (2007) | |
| 56 | Sorin Constantinescu, Lucian Ilie: The Lempel--Ziv Complexity of Fixed Points of Morphisms. SIAM J. Discrete Math. 21(2): 466-481 (2007) | |
| 55 | Lucian Ilie: A note on the number of squares in a word. Theor. Comput. Sci. 380(3): 373-376 (2007) | |
| 2006 | ||
| 54 | Maxime Crochemore, Lucian Ilie, Emine Seid-Hilmi: Factor Oracles. CIAA 2006: 78-89 | |
| 53 | Lucian Ilie, Liviu Tinta, Cristian Popescu, Kathleen A. Hill: Viral Genome Compression. DNA 2006: 111-126 | |
| 52 | Lucian Ilie, Roberto Solis-Oba: Gene Assembly Algorithms for Ciliates. DNA 2006: 71-82 | |
| 51 | Sorin Constantinescu, Lucian Ilie: The Lempel-Ziv Complexity of Fixed Points of Morphisms. MFCS 2006: 280-291 | |
| 50 | Lucian Ilie: Combinatorial Complexity Measures for Strings. Recent Advances in Formal Languages and Applications 2006: 149-170 | |
| 49 | Sorin Constantinescu, Lucian Ilie: Fine and Wilf's Theorem for Abelian Periods. Bulletin of the EATCS 89: 167-170 (2006) | |
| 48 | Lucian Ilie, Cristian Popescu: The Shortest Common Superstring Problem and Viral Genome Compression. Fundam. Inform. 73(1-2): 153-164 (2006) | |
| 47 | Lucian Ilie, Solomon Marcus, Ion Petre: Periodic and Sturmian languages. Inf. Process. Lett. 98(6): 242-246 (2006) | |
| 2005 | ||
| 46 | Lucian Ilie, Roberto Solis-Oba, Sheng Yu: Reducing the Size of NFAs by Using Equivalences and Preorders. CPM 2005: 310-321 | |
| 45 | Michael Davidson, Lucian Ilie: Fast Data Compression with Antidictionaries. Fundam. Inform. 64(1-4): 119-134 (2005) | |
| 44 | Lucian Ilie: A simple proof that a word of length n has at most 2n distinct squares. J. Comb. Theory, Ser. A 112(1): 163-164 (2005) | |
| 43 | Sorin Constantinescu, Lucian Ilie: Generalised fine and Wilf's theorem for arbitrary number of periods. Theor. Comput. Sci. 339(1): 49-60 (2005) | |
| 42 | Lucian Ilie, Pascal Ochem, Jeffrey Shallit: A generalization of repetition threshold. Theor. Comput. Sci. 345(2-3): 359-369 (2005) | |
| 2004 | ||
| 41 | Lucian Ilie, Detlef Wotschke: 6th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2004, London, Ontario, Canada, July 26 - 28, 2004. Pre-proceedings Department of Computer Science, The University of Western Ontario, Canada 2004 | |
| 40 | Lucian Ilie, Pascal Ochem, Jeffrey Shallit: A Generalization of Repetition Threshold. MFCS 2004: 818-826 | |
| 39 | Lucian Ilie, Gonzalo Navarro, Sheng Yu: On NFA Reductions. Theory Is Forever 2004: 112-124 | |
| 38 | Lucian Ilie, Sheng Yu, Kaizhong Zhang: Word Complexity And Repetitions In Words. Int. J. Found. Comput. Sci. 15(1): 41-55 (2004) | |
| 2003 | ||
| 37 | Lucian Ilie, Victor Mitrana: Crossing-Over on Languages: A Formal Representation of Chromosomes Recombination. Grammars and Automata for String Processing 2003: 391-402 | |
| 36 | Lucian Ilie, Sheng Yu, Qing Zhao: Introduction to Process Traces. PDPTA 2003: 1706-1712 | |
| 35 | Lucian Ilie, Baozhen Shan, Sheng Yu: Fast Algorithms for Extended Regular Expression Matching and Searching. STACS 2003: 179-190 | |
| 34 | Lucian Ilie, Jeffrey Shallit: A Generalization of Repetition Threshold CoRR math.CO/0310144: (2003) | |
| 33 | Lucian Ilie, Sheng Yu: Follow automata. Inf. Comput. 186(1): 140-162 (2003) | |
| 32 | Lucian Ilie, Sheng Yu: Reducing NFAs by invariant equivalences. Theor. Comput. Sci. 306(1-3): 373-390 (2003) | |
| 2002 | ||
| 31 | Lucian Ilie, Sheng Yu, Kaizhong Zhang: Repetition Complexity of Words. COCOON 2002: 320-329 | |
| 30 | Lucian Ilie, Sheng Yu: Constructing NFA s by Optimal Use of Positions in Regular Expressions. CPM 2002: 279-288 | |
| 29 | Lucian Ilie, Sheng Yu, Kaizhong Zhang: Repetition Complexity of Words. DCFS 2002: 36 | |
| 28 | Lucian Ilie, Sheng Yu: Algorithms for Computing Small NFAs. MFCS 2002: 328-340 | |
| 2001 | ||
| 27 | Tero Harju, Lucian Ilie: Forbidden subsequences and permutations sortable on two parallel stacks. Where Mathematics, Computer Science, Linguistics and Biology Meet 2001: 267-275 | |
| 26 | Lucian Ilie: On Generalized Slenderness of Context-Free Languages. Words, Semigroups, and Transductions 2001: 189-202 | |
| 2000 | ||
| 25 | Lucian Ilie, Wojciech Plandowski: Two-Variable Word Equations. STACS 2000: 122-132 | |
| 24 | Lucian Ilie, Arto Salomaa: On the Expressiveness of Subset-Sum Representations. Acta Inf. 36(8): 665-672 (2000) | |
| 23 | Lucian Ilie, Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa: On strongly context-free languages. Discrete Applied Mathematics 103(1-3): 153-165 (2000) | |
| 22 | Lucian Ilie, Grzegorz Rozenberg, Arto Salomaa: A characterization of poly-slender context-free languages. ITA 34(1): 77-86 (2000) | |
| 21 | Lucian Ilie, Wojciech Plandowski: Two-variable word equations. ITA 34(6): 467-501 (2000) | |
| 20 | Vesa Halava, Tero Harju, Lucian Ilie: Periods and Binary Words. J. Comb. Theory, Ser. A 89(2): 298-303 (2000) | |
| 19 | Lucian Ilie: On lengths of words in context-free languages. Theor. Comput. Sci. 242(1-2): 327-359 (2000) | |
| 1999 | ||
| 18 | Lucian Ilie: Subwords and Power-Free Words are not Expressible by Word Equations. Fundam. Inform. 38(1-2): 109-118 (1999) | |
| 1998 | ||
| 17 | Lucian Ilie: Generalized Factors of Words. Fundam. Inform. 33(3): 239-247 (1998) | |
| 16 | Lucian Ilie, Arto Salomaa: 2-Testability and Relabelings Produce Everything. J. Comput. Syst. Sci. 56(3): 253-262 (1998) | |
| 15 | Tero Harju, Lucian Ilie: On Quasi Orders of Words and the Confluence Property. Theor. Comput. Sci. 200(1-2): 205-224 (1998) | |
| 14 | Lucian Ilie, Arto Salomaa: On Well Quasi Orders of Free Monoids. Theor. Comput. Sci. 204(1-2): 131-152 (1998) | |
| 1997 | ||
| 13 | Lucian Ilie: Remarks on Well Quasi Orders of Words. Developments in Language Theory 1997: 399-409 | |
| 12 | Lucian Ilie: The Decidability of the Generalized Confluence Problem for Context-Free Languages. New Trends in Formal Languages 1997: 454-464 | |
| 11 | Lucian Ilie: Some Recent Results on Contextual Languages. Bulletin of the EATCS 62: (1997) | |
| 10 | Lucian Ilie: On the Computational Complexity of Marcus Contextual Languages. Fundam. Inform. 30(2): 161-167 (1997) | |
| 9 | Tero Harju, Lucian Ilie: Languages Obtained from Infinite Words. ITA 31(5): 445-455 (1997) | |
| 8 | Vesa Halava, Tero Harju, Lucian Ilie: On a Geometric Problem of Zigzags. Inf. Process. Lett. 62(1): 1-4 (1997) | |
| 7 | Lucian Ilie: On Computational Complexity of Contextual Languages. Theor. Comput. Sci. 183(1): 33-44 (1997) | |
| 1996 | ||
| 6 | Lucian Ilie, Victor Mitrana: Crossing-over on Languages. A Formal Representation of the Chromosome Recombination. German Conference on Bioinformatics 1996: 231-233 | |
| 5 | Lucian Ilie, Arto Salomaa: On Regular Characterizations of Languages by Grammar Systems. Acta Cybern. 12(4): 411-426 (1996) | |
| 4 | Lucian Ilie: Collapsing Hierarchies in PCGSs with Communication by Commands. Computers and Artificial Intelligence 15(2-3): (1996) | |
| 1995 | ||
| 3 | Lucian Ilie: On Disjunctivity, Ultimate Periodicity and Ultimate Identity. Developments in Language Theory 1995: 44-53 | |
| 2 | Lucian Ilie: on Subwords of Infinite Words. Discrete Applied Mathematics 63(3): 277-279 (1995) | |
| 1994 | ||
| 1 | Lucian Ilie: On a Conjecture about Slender Context-Free Languages. Theor. Comput. Sci. 132(2): 427-434 (1994) | |
Colors in the list of coauthors
Last update Fri May 25 01:42:58 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page