( en | de | ru )

 

Disambiguation of "Manea, Florin"

Author of the publication

copydeleteadd this publication to your clipboard
An SMT Solver for Regular Expressions and Linear Arithmetic over String Length.

, , , , , , and . CAV (2), volume 12760 of Lecture Notes in Computer Science, page 289-312. Springer, (2021)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Catalina-Oana Manea

Gheorghe Manea

Andrei Manea

Marilena Manea

Laura Manea

 

Other publications of authors with the same name

Accepting Networks of Splicing Processors with Filtered Connections., , , and . MCU, volume 4664 of Lecture Notes in Computer Science, page 218-229. Springer, (2007)A New Characterization of NP, P, and PSPACE with Accepting Hybrid Networks of Evolutionary Processors., , , and . Theory Comput. Syst., 46 (2): 174-192 (2010)On the Solvability Problem for Restricted Classes of Word Equations., , and . DLT, volume 9840 of Lecture Notes in Computer Science, page 306-318. Springer, (2016)Square-Density Increasing Mappings., and . WORDS, volume 9304 of Lecture Notes in Computer Science, page 160-169. Springer, (2015)Equations Enforcing Repetitions Under Permutations., , , and . WORDS, volume 10432 of Lecture Notes in Computer Science, page 72-84. Springer, (2017)The Hardness of Solving Simple Word Equations., , and . MFCS, volume 83 of LIPIcs, page 18:1-18:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Scattered Factor-Universality of Words., , , , and . DLT, volume 12086 of Lecture Notes in Computer Science, page 14-28. Springer, (2020)Hairpin Completion Versus Hairpin Reduction., and . CiE, volume 4497 of Lecture Notes in Computer Science, page 532-541. Springer, (2007)Synchronized Shuffle on Backbones., , and . Fundam. Informaticae, 73 (1-2): 191-202 (2006)Tighter Bounds and Optimal Algorithms for All Maximal α-gapped Repeats and Palindromes - Finding All Maximal α-gapped Repeats and Palindromes in Optimal Worst Case Time on Integer Alphabets., , , , and . Theory Comput. Syst., 62 (1): 162-191 (2018)