| 2008 |
|---|
| 64 | EE | Maxime Crochemore,
Lucian Ilie,
Liviu Tinta:
Towards a Solution to the "Runs" Conjecture.
CPM 2008: 290-302 |
| 63 | EE | Maxime Crochemore,
Lucian Ilie,
W. F. Smyth:
A Simple Algorithm for Computing the Lempel Ziv Factorization.
DCC 2008: 482-488 |
| 62 | EE | Maxime Crochemore,
Lucian Ilie:
Understanding Maximal Repetitions in Strings.
STACS 2008: 11-16 |
| 61 | EE | Lucian Ilie:
Regular Expression Matching.
Encyclopedia of Algorithms 2008 |
| 60 | EE | Maxime Crochemore,
Lucian Ilie:
Understanding maximal repetitions in strings
CoRR abs/0802.2829: (2008) |
| 59 | EE | Maxime Crochemore,
Lucian Ilie:
Computing Longest Previous Factor in linear time and applications.
Inf. Process. Lett. 106(2): 75-80 (2008) |
| 58 | EE | Maxime Crochemore,
Lucian Ilie:
Maximal repetitions in strings.
J. Comput. Syst. Sci. 74(5): 796-807 (2008) |
| 2007 |
|---|
| 57 | | Lucian Ilie,
Silvana Ilie:
Long spaced seeds for finding similarities between biological sequences.
BIOCOMP 2007: 3-8 |
| 56 | EE | Maxime Crochemore,
Lucian Ilie:
Analysis of Maximal Repetitions in Strings.
MFCS 2007: 465-476 |
| 55 | EE | Lucian Ilie,
Silvana Ilie:
Fast Computation of Good Multiple Spaced Seeds.
WABI 2007: 346-358 |
| 54 | EE | Lucian Ilie,
Silvana Ilie:
Multiple spaced seeds for homology search.
Bioinformatics 23(22): 2969-2977 (2007) |
| 53 | EE | Maxime Crochemore,
Lucian Ilie,
Emine Seid-Hilmi:
The Structure of Factor Oracles.
Int. J. Found. Comput. Sci. 18(4): 781-797 (2007) |
| 52 | EE | Sorin Constantinescu,
Lucian Ilie:
The Lempel--Ziv Complexity of Fixed Points of Morphisms.
SIAM J. Discrete Math. 21(2): 466-481 (2007) |
| 51 | EE | Lucian Ilie:
A note on the number of squares in a word.
Theor. Comput. Sci. 380(3): 373-376 (2007) |
| 2006 |
|---|
| 50 | EE | Maxime Crochemore,
Lucian Ilie,
Emine Seid-Hilmi:
Factor Oracles.
CIAA 2006: 78-89 |
| 49 | EE | Lucian Ilie,
Liviu Tinta,
Cristian Popescu,
Kathleen A. Hill:
Viral Genome Compression.
DNA 2006: 111-126 |
| 48 | EE | Lucian Ilie,
Roberto Solis-Oba:
Gene Assembly Algorithms for Ciliates.
DNA 2006: 71-82 |
| 47 | EE | Sorin Constantinescu,
Lucian Ilie:
The Lempel-Ziv Complexity of Fixed Points of Morphisms.
MFCS 2006: 280-291 |
| 46 | EE | Lucian Ilie:
Combinatorial Complexity Measures for Strings.
Recent Advances in Formal Languages and Applications 2006: 149-170 |
| 45 | EE | Lucian Ilie,
Cristian Popescu:
The Shortest Common Superstring Problem and Viral Genome Compression.
Fundam. Inform. 73(1-2): 153-164 (2006) |
| 44 | EE | Lucian Ilie,
Solomon Marcus,
Ion Petre:
Periodic and Sturmian languages.
Inf. Process. Lett. 98(6): 242-246 (2006) |
| 2005 |
|---|
| 43 | EE | Lucian Ilie,
Roberto Solis-Oba,
Sheng Yu:
Reducing the Size of NFAs by Using Equivalences and Preorders.
CPM 2005: 310-321 |
| 42 | EE | Michael Davidson,
Lucian Ilie:
Fast Data Compression with Antidictionaries.
Fundam. Inform. 64(1-4): 119-134 (2005) |
| 41 | EE | 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) |
| 40 | EE | Sorin Constantinescu,
Lucian Ilie:
Generalised fine and Wilf's theorem for arbitrary number of periods.
Theor. Comput. Sci. 339(1): 49-60 (2005) |
| 39 | EE | Lucian Ilie,
Pascal Ochem,
Jeffrey Shallit:
A generalization of repetition threshold.
Theor. Comput. Sci. 345(2-3): 359-369 (2005) |
| 2004 |
|---|
| 38 | EE | Lucian Ilie,
Pascal Ochem,
Jeffrey Shallit:
A Generalization of Repetition Threshold.
MFCS 2004: 818-826 |
| 37 | EE | Lucian Ilie,
Gonzalo Navarro,
Sheng Yu:
On NFA Reductions.
Theory Is Forever 2004: 112-124 |
| 36 | EE | Lucian Ilie,
Sheng Yu,
Kaizhong Zhang:
Word Complexity And Repetitions In Words.
Int. J. Found. Comput. Sci. 15(1): 41-55 (2004) |
| 2003 |
|---|
| 35 | | Lucian Ilie,
Victor Mitrana:
Crossing-Over on Languages: A Formal Representation of Chromosomes Recombination.
Grammars and Automata for String Processing 2003: 391-402 |
| 34 | | Lucian Ilie,
Sheng Yu,
Qing Zhao:
Introduction to Process Traces.
PDPTA 2003: 1706-1712 |
| 33 | EE | Lucian Ilie,
Baozhen Shan,
Sheng Yu:
Fast Algorithms for Extended Regular Expression Matching and Searching.
STACS 2003: 179-190 |
| 32 | EE | Lucian Ilie,
Jeffrey Shallit:
A Generalization of Repetition Threshold
CoRR math.CO/0310144: (2003) |
| 31 | EE | Lucian Ilie,
Sheng Yu:
Follow automata.
Inf. Comput. 186(1): 140-162 (2003) |
| 30 | EE | Lucian Ilie,
Sheng Yu:
Reducing NFAs by invariant equivalences.
Theor. Comput. Sci. 306(1-3): 373-390 (2003) |
| 2002 |
|---|
| 29 | EE | Lucian Ilie,
Sheng Yu,
Kaizhong Zhang:
Repetition Complexity of Words.
COCOON 2002: 320-329 |
| 28 | EE | Lucian Ilie,
Sheng Yu:
Constructing NFA s by Optimal Use of Positions in Regular Expressions.
CPM 2002: 279-288 |
| 27 | EE | Lucian Ilie,
Sheng Yu:
Algorithms for Computing Small NFAs.
MFCS 2002: 328-340 |
| 2001 |
|---|
| 26 | | Lucian Ilie:
On Generalized Slenderness of Context-Free Languages.
Words, Semigroups, and Transductions 2001: 189-202 |
| 2000 |
|---|
| 25 | EE | Lucian Ilie,
Wojciech Plandowski:
Two-Variable Word Equations.
STACS 2000: 122-132 |
| 24 | EE | 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 | EE | Lucian Ilie,
Wojciech Plandowski:
Two-variable word equations.
ITA 34(6): 467-501 (2000) |
| 20 | EE | Vesa Halava,
Tero Harju,
Lucian Ilie:
Periods and Binary Words.
J. Comb. Theory, Ser. A 89(2): 298-303 (2000) |
| 19 | EE | 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 | EE | Tero Harju,
Lucian Ilie:
On Quasi Orders of Words and the Confluence Property.
Theor. Comput. Sci. 200(1-2): 205-224 (1998) |
| 14 | EE | 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 | EE | Vesa Halava,
Tero Harju,
Lucian Ilie:
On a Geometric Problem of Zigzags.
Inf. Process. Lett. 62(1): 1-4 (1997) |
| 7 | EE | 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 | EE | 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 | EE | 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) |
