( en | de | ru )

 

Disambiguation of "Manea, Florin"

Author of the publication

copydeleteadd this publication to your clipboard
All NP-problems can be solved in polynomial time by accepting hybrid networks of evolutionary processors of constant size.

, and . Inf. Process. Lett., 103 (3): 112-118 (2007)

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

Laura Manea

Marilena Manea

 

Other publications of authors with the same name

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)Finding Pseudo-repetitions., , , , and . STACS, volume 20 of LIPIcs, page 257-268. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2013)Accepting Networks of Splicing Processors with Filtered Connections., , , and . MCU, volume 4664 of Lecture Notes in Computer Science, page 218-229. Springer, (2007)Hairpin Completion Versus Hairpin Reduction., and . CiE, volume 4497 of Lecture Notes in Computer Science, page 532-541. Springer, (2007)Equations Enforcing Repetitions Under Permutations., , , and . WORDS, volume 10432 of Lecture Notes in Computer Science, page 72-84. Springer, (2017)Square-Density Increasing Mappings., and . WORDS, volume 9304 of Lecture Notes in Computer Science, page 160-169. Springer, (2015)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)Scattered Factor-Universality of Words., , , , and . DLT, volume 12086 of Lecture Notes in Computer Science, page 14-28. Springer, (2020)Synchronized Shuffle on Backbones., , and . Fundam. Informaticae, 73 (1-2): 191-202 (2006)On the Expressive Power of String Constraints., , , and . Proc. ACM Program. Lang., 7 (POPL): 278-308 (January 2023)