The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Lucian Ilie: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Lucian Ilie
    On Generalized Slenderness of Context-Free Languages. [Citation Graph (0, 0)][DBLP]
    Words, Semigroups, and Transductions, 2001, pp:189-202 [Conf]
  2. Lucian Ilie
    The Decidability of the Generalized Confluence Problem for Context-Free Languages. [Citation Graph (0, 0)][DBLP]
    New Trends in Formal Languages, 1997, pp:454-464 [Conf]
  3. Lucian Ilie, Victor Mitrana
    Crossing-Over on Languages: A Formal Representation of Chromosomes Recombination. [Citation Graph (0, 0)][DBLP]
    Grammars and Automata for String Processing, 2003, pp:391-402 [Conf]
  4. Lucian Ilie, Gonzalo Navarro, Sheng Yu
    On NFA Reductions. [Citation Graph (0, 0)][DBLP]
    Theory Is Forever, 2004, pp:112-124 [Conf]
  5. Lucian Ilie, Sheng Yu, Kaizhong Zhang
    Repetition Complexity of Words. [Citation Graph (0, 0)][DBLP]
    COCOON, 2002, pp:320-329 [Conf]
  6. Lucian Ilie, Roberto Solis-Oba, Sheng Yu
    Reducing the Size of NFAs by Using Equivalences and Preorders. [Citation Graph (0, 0)][DBLP]
    CPM, 2005, pp:310-321 [Conf]
  7. Lucian Ilie, Sheng Yu
    Constructing NFA s by Optimal Use of Positions in Regular Expressions. [Citation Graph (0, 0)][DBLP]
    CPM, 2002, pp:279-288 [Conf]
  8. Lucian Ilie
    On Disjunctivity, Ultimate Periodicity and Ultimate Identity. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 1995, pp:44-53 [Conf]
  9. Lucian Ilie, Roberto Solis-Oba
    Gene Assembly Algorithms for Ciliates. [Citation Graph (0, 0)][DBLP]
    DNA, 2006, pp:71-82 [Conf]
  10. Lucian Ilie, Liviu Tinta, Cristian Popescu, Kathleen A. Hill
    Viral Genome Compression. [Citation Graph (0, 0)][DBLP]
    DNA, 2006, pp:111-126 [Conf]
  11. Lucian Ilie, Victor Mitrana
    Crossing-over on Languages. A Formal Representation of the Chromosome Recombination. [Citation Graph (0, 0)][DBLP]
    German Conference on Bioinformatics, 1996, pp:231-233 [Conf]
  12. Sorin Constantinescu, Lucian Ilie
    The Lempel-Ziv Complexity of Fixed Points of Morphisms. [Citation Graph (0, 0)][DBLP]
    MFCS, 2006, pp:280-291 [Conf]
  13. Lucian Ilie, Pascal Ochem, Jeffrey Shallit
    A Generalization of Repetition Threshold. [Citation Graph (0, 0)][DBLP]
    MFCS, 2004, pp:818-826 [Conf]
  14. Lucian Ilie, Sheng Yu
    Algorithms for Computing Small NFAs. [Citation Graph (0, 0)][DBLP]
    MFCS, 2002, pp:328-340 [Conf]
  15. Lucian Ilie, Sheng Yu, Qing Zhao
    Introduction to Process Traces. [Citation Graph (0, 0)][DBLP]
    PDPTA, 2003, pp:1706-1712 [Conf]
  16. Lucian Ilie, Wojciech Plandowski
    Two-Variable Word Equations. [Citation Graph (0, 0)][DBLP]
    STACS, 2000, pp:122-132 [Conf]
  17. Lucian Ilie, Baozhen Shan, Sheng Yu
    Fast Algorithms for Extended Regular Expression Matching and Searching. [Citation Graph (0, 0)][DBLP]
    STACS, 2003, pp:179-190 [Conf]
  18. Maxime Crochemore, Lucian Ilie, Emine Seid-Hilmi
    Factor Oracles. [Citation Graph (0, 0)][DBLP]
    CIAA, 2006, pp:78-89 [Conf]
  19. Lucian Ilie, Arto Salomaa
    On the Expressiveness of Subset-Sum Representations. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 2000, v:36, n:8, pp:665-672 [Journal]
  20. Lucian Ilie, Arto Salomaa
    On Regular Characterizations of Languages by Grammar Systems. [Citation Graph (0, 0)][DBLP]
    Acta Cybern., 1996, v:12, n:4, pp:411-426 [Journal]
  21. Lucian Ilie
    Collapsing Hierarchies in PCGSs with Communication by Commands. [Citation Graph (0, 0)][DBLP]
    Computers and Artificial Intelligence, 1996, v:15, n:2-3, pp:- [Journal]
  22. Lucian Ilie, Jeffrey Shallit
    A Generalization of Repetition Threshold [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  23. Lucian Ilie
    on Subwords of Infinite Words. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1995, v:63, n:3, pp:277-279 [Journal]
  24. Lucian Ilie, Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa
    On strongly context-free languages. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2000, v:103, n:1-3, pp:153-165 [Journal]
  25. Lucian Ilie
    Some Recent Results on Contextual Languages. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1997, v:62, n:, pp:- [Journal]
  26. Michael Davidson, Lucian Ilie
    Fast Data Compression with Antidictionaries. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2005, v:64, n:1-4, pp:119-134 [Journal]
  27. Lucian Ilie
    On the Computational Complexity of Marcus Contextual Languages. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1997, v:30, n:2, pp:161-167 [Journal]
  28. Lucian Ilie
    Generalized Factors of Words. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1998, v:33, n:3, pp:239-247 [Journal]
  29. Lucian Ilie
    Subwords and Power-Free Words are not Expressible by Word Equations. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1999, v:38, n:1-2, pp:109-118 [Journal]
  30. Lucian Ilie, Cristian Popescu
    The Shortest Common Superstring Problem and Viral Genome Compression. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2006, v:73, n:1-2, pp:153-164 [Journal]
  31. Lucian Ilie, Sheng Yu
    Follow automata. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2003, v:186, n:1, pp:140-162 [Journal]
  32. Lucian Ilie, Sheng Yu, Kaizhong Zhang
    Word Complexity And Repetitions In Words. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2004, v:15, n:1, pp:41-55 [Journal]
  33. Vesa Halava, Tero Harju, Lucian Ilie
    On a Geometric Problem of Zigzags. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1997, v:62, n:1, pp:1-4 [Journal]
  34. Lucian Ilie, Solomon Marcus, Ion Petre
    Periodic and Sturmian languages. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2006, v:98, n:6, pp:242-246 [Journal]
  35. Tero Harju, Lucian Ilie
    Languages Obtained from Infinite Words. [Citation Graph (0, 0)][DBLP]
    ITA, 1997, v:31, n:5, pp:445-455 [Journal]
  36. Lucian Ilie, Wojciech Plandowski
    Two-variable word equations. [Citation Graph (0, 0)][DBLP]
    ITA, 2000, v:34, n:6, pp:467-501 [Journal]
  37. Lucian Ilie, Grzegorz Rozenberg, Arto Salomaa
    A characterization of poly-slender context-free languages. [Citation Graph (0, 0)][DBLP]
    ITA, 2000, v:34, n:1, pp:77-86 [Journal]
  38. Lucian Ilie, Arto Salomaa
    2-Testability and Relabelings Produce Everything. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1998, v:56, n:3, pp:253-262 [Journal]
  39. Vesa Halava, Tero Harju, Lucian Ilie
    Periods and Binary Words. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2000, v:89, n:2, pp:298-303 [Journal]
  40. Lucian Ilie
    A simple proof that a word of length n has at most 2n distinct squares. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2005, v:112, n:1, pp:163-164 [Journal]
  41. Sorin Constantinescu, Lucian Ilie
    Generalised fine and Wilf's theorem for arbitrary number of periods. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:339, n:1, pp:49-60 [Journal]
  42. Tero Harju, Lucian Ilie
    On Quasi Orders of Words and the Confluence Property. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:200, n:1-2, pp:205-224 [Journal]
  43. Lucian Ilie
    On lengths of words in context-free languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:242, n:1-2, pp:327-359 [Journal]
  44. Lucian Ilie
    On a Conjecture about Slender Context-Free Languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:132, n:2, pp:427-434 [Journal]
  45. Lucian Ilie
    On Computational Complexity of Contextual Languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1997, v:183, n:1, pp:33-44 [Journal]
  46. Lucian Ilie, Pascal Ochem, Jeffrey Shallit
    A generalization of repetition threshold. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:345, n:2-3, pp:359-369 [Journal]
  47. Lucian Ilie, Arto Salomaa
    On Well Quasi Orders of Free Monoids. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:204, n:1-2, pp:131-152 [Journal]
  48. Lucian Ilie, Sheng Yu
    Reducing NFAs by invariant equivalences. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:306, n:1-3, pp:373-390 [Journal]
  49. Maxime Crochemore, Lucian Ilie
    Analysis of Maximal Repetitions in Strings. [Citation Graph (0, 0)][DBLP]
    MFCS, 2007, pp:465-476 [Conf]
  50. Lucian Ilie, Silvana Ilie
    Fast Computation of Good Multiple Spaced Seeds. [Citation Graph (0, 0)][DBLP]
    WABI, 2007, pp:346-358 [Conf]
  51. Lucian Ilie
    A note on the number of squares in a word. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:380, n:3, pp:373-376 [Journal]

  52. Long spaced seeds for finding similarities between biological sequences. [Citation Graph (, )][DBLP]


  53. Towards a Solution to the "Runs" Conjecture. [Citation Graph (, )][DBLP]


  54. A Simple Algorithm for Computing the Lempel Ziv Factorization. [Citation Graph (, )][DBLP]


  55. Remarks on Well Quasi Orders of Words. [Citation Graph (, )][DBLP]


  56. Practical Algorithms for the Longest Common Extension Problem. [Citation Graph (, )][DBLP]


  57. Understanding Maximal Repetitions in Strings. [Citation Graph (, )][DBLP]


  58. LPF Computation Revisited. [Citation Graph (, )][DBLP]


  59. Multiple spaced seeds for homology search. [Citation Graph (, )][DBLP]


  60. Fast computation of neighbor seeds. [Citation Graph (, )][DBLP]


  61. Understanding maximal repetitions in strings [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.006secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002