Prof. Dr. Florin Manea

Name Card

Main Affiliation
 
Staff Status
unigoe
 

1-50 of 50
 
The bibliographical data in your publication list are complete
You can correct existing data in the blue highlighted fields.To do this, please click on the coloured field. It is not possible to delete data here.
Fields that are not marked in colour (e. g. the authors) can be edited using the input form. To do so, click on the in front of the respective publication.
The bibliographic data in your publication list may be incomplete. You can
  • add any missing data in the fields marked in red or
  • correct existing data in the blue highlighted fields.
To do this, please click on the coloured field. It is not possible to delete data here.
Fields that are not marked in colour (e. g. the authors) can be edited using the input form. To do so, click on the in front of the respective publication.
Check/Uncheck all
  • 2022 | Journal Article | 
    ​ ​Fast and Longest Rollercoasters​
    Gawrychowski, P.; Manea, F.   & Serafin, R.​ (2022) 
    Algorithmica, 84(4) pp. 1081​-1106​.​ DOI: https://doi.org/10.1007/s00453-021-00908-6 
    ​Details  DOI 
  • 2021 | Journal Article
    ​ ​Reconstructing Words from Right-Bounded-Block Words​
    Fleischmann, P.; Lejeune, M.; Manea, F. ; Nowotka, D. & Rigo, M.​ (2021) 
    International Journal of Foundations of Computer Science, 32(06) pp. 619​-640​.​ DOI: https://doi.org/10.1142/S0129054121420016 
    ​Details  DOI 
  • 2021 | Journal Article | Research Paper | 
    ​ ​On the structure of solution-sets to regular word equations​
    Day, J. D. & Manea, F. ​ (2021) 
    Theory of Computing Systems,.​ DOI: https://doi.org/10.1007/s00224-021-10058-5 
    ​Details  DOI 
  • 2021 | Journal Article | 
    ​ ​On Turing Machines Deciding According to the Shortest Computations †​
    Manea, F. ​ (2021) 
    Axioms, 10(4) pp. 304​.​ DOI: https://doi.org/10.3390/axioms10040304 
    ​Details  DOI 
  • 2020 | Journal Article
    ​ ​Preface — Special Issue: A Collection of Papers in Honour of the 60th Birthday of Victor Mitrana​
    Csuhaj-Varjú, E. & Manea, F. ​ (2020) 
    International Journal of Foundations of Computer Science, 31(01) pp. 1​-6​.​ DOI: https://doi.org/10.1142/S0129054120020013 
    ​Details  DOI 
  • 2020 | Journal Article
    ​ ​Equations enforcing repetitions under permutations​
    Day, J. D.; Fleischmann, P.; Manea, F.   & Nowotka, D.​ (2020) 
    Discrete Applied Mathematics, 285 pp. 61​-78​.​ DOI: https://doi.org/10.1016/j.dam.2020.05.026 
    ​Details  DOI 
  • 2019 | Journal Article
    ​ ​Hide and seek with repetitions​
    Gawrychowski, P.; Manea, F. ; Mercaş, R. & Nowotka, D.​ (2019) 
    Journal of Computer and System Sciences, 101 pp. 42​-67​.​ DOI: https://doi.org/10.1016/j.jcss.2018.10.004 
    ​Details  DOI 
  • 2019 | Journal Article
    ​ ​Rollercoasters: Long Sequences without Short Runs​
    Biedl, T.; Biniaz, A.; Cummings, R.; Lubiw, A.; Manea, F. ; Nowotka, D. & Shallit, J.​ (2019) 
    SIAM Journal on Discrete Mathematics, 33(2) pp. 845​-861​.​ DOI: https://doi.org/10.1137/18M1192226 
    ​Details  DOI 
  • 2018 | Journal Article
    ​ ​Revisiting Shinohara's algorithm for computing descriptive patterns​
    Fernau, H.; Manea, F. ; Mercaş, R. & Schmid, M. L.​ (2018) 
    Theoretical Computer Science, 733 pp. 44​-54​.​ DOI: https://doi.org/10.1016/j.tcs.2018.04.035 
    ​Details  DOI 
  • 2018 | Journal Article
    ​ ​On the Complexity of Solving Restricted Word Equations​
    Manea, F. ; Nowotka, D. & Schmid, M. L.​ (2018) 
    International Journal of Foundations of Computer Science, 29(05) pp. 893​-909​.​ DOI: https://doi.org/10.1142/S0129054118420108 
    ​Details  DOI 
  • 2018 | Journal Article
    ​ ​Unary patterns under permutations​
    Currie, J.; Manea, F. ; Nowotka, D. & Reshadi, K.​ (2018) 
    Theoretical Computer Science, 743 pp. 72​-82​.​ DOI: https://doi.org/10.1016/j.tcs.2018.05.033 
    ​Details  DOI 
  • 2017 | Journal Article
    ​ ​TCS Special Issue: Combinatorics on Words – WORDS 2015​
    Manea, F.   & Nowotka, D.​ (2017) 
    Theoretical Computer Science, 684 pp. 1​-2​.​ DOI: https://doi.org/10.1016/j.tcs.2017.05.027 
    ​Details  DOI 
  • 2017 | Journal Article
    ​ ​TCS Special Issue on Languages and Combinatorics in Theory and Nature​
    Manea, F. ; Truthe, B. & Vaszil, G.​ (2017) 
    Theoretical Computer Science, 682 pp. 2​-4​.​ DOI: https://doi.org/10.1016/j.tcs.2017.05.012 
    ​Details  DOI 
  • 2017 | Journal Article | Research Paper | 
    ​ ​Tighter Bounds and Optimal Algorithms for All Maximal α-gapped Repeats and Palindromes​
    Gawrychowski, P.; I, T.; Inenaga, S.; Köppl, D. & Manea, F. ​ (2017) 
    Theory of Computing Systems, 62(1) pp. 162​-191​.​ DOI: https://doi.org/10.1007/s00224-017-9794-5 
    ​Details  DOI 
  • 2017 | Journal Article
    ​ ​The extended equation of Lyndon and Schützenberger​
    Manea, F. ; Müller, M.; Nowotka, D. & Seki, S.​ (2017) 
    Journal of Computer and System Sciences, 85 pp. 132​-167​.​ DOI: https://doi.org/10.1016/j.jcss.2016.11.003 
    ​Details  DOI 
  • 2016 | Journal Article
    ​ ​Bounded Prefix-Suffix Duplication: Language Theoretic and Algorithmic Results​
    Dumitran, M.; Gil, J.; Manea, F.   & Mitrana, V.​ (2016) 
    International Journal of Foundations of Computer Science, 26(07) pp. 933​-952​.​ DOI: https://doi.org/10.1142/S0129054115400079 
    ​Details  DOI 
  • 2015 | Journal Article
    ​ ​Cubic patterns with permutations​
    Manea, F. ; Müller, M. & Nowotka, D.​ (2015) 
    Journal of Computer and System Sciences, 81(7) pp. 1298​-1310​.​ DOI: https://doi.org/10.1016/j.jcss.2015.04.001 
    ​Details  DOI 
  • 2015 | Journal Article
    ​ ​INNER PALINDROMIC CLOSURE​
    DASSOW, J.; Manea, F. ; MERCAŞ, R. & MÜLLER, M.​ (2015) 
    International Journal of Foundations of Computer Science, 25(08) pp. 1049​-1063​.​ DOI: https://doi.org/10.1142/S0129054114400231 
    ​Details  DOI 
  • 2015 | Journal Article
    ​ ​On the Power of Accepting Networks of Evolutionary Processors with Special Topologies and Random Context Filters​
    Dassow, J.; Manea, F.   & Truthe, B.​ (2015) 
    Fundamenta Informaticae, 136(1-2) pp. 1​-35​.​ DOI: https://doi.org/10.3233/FI-2015-1142 
    ​Details  DOI 
  • 2014 | Journal Article
    ​ ​The pseudopalindromic completion of regular languages​
    Fazekas, S. Z.; Manea, F. ; Mercaş, R. & Shikishima-Tsuji, K.​ (2014) 
    Information and Computation, 239 pp. 222​-236​.​ DOI: https://doi.org/10.1016/j.ic.2014.09.001 
    ​Details  DOI 
  • 2014 | Journal Article
    ​ ​Regular languages of partial words​
    Dassow, J.; Manea, F.   & Mercaş, R.​ (2014) 
    Information Sciences, 268 pp. 290​-304​.​ DOI: https://doi.org/10.1016/j.ins.2013.12.032 
    ​Details  DOI 
  • 2014 | Journal Article
    ​ ​Prefix–suffix duplication​
    García López, J.; Manea, F.   & Mitrana, V.​ (2014) 
    Journal of Computer and System Sciences, 80(7) pp. 1254​-1265​.​ DOI: https://doi.org/10.1016/j.jcss.2014.02.011 
    ​Details  DOI 
  • 2014 | Journal Article
    ​ ​An algorithmic toolbox for periodic partial words​
    Manea, F. ; Mercaş, R. & Tiseanu, C.​ (2014) 
    Discrete Applied Mathematics, 179 pp. 174​-192​.​ DOI: https://doi.org/10.1016/j.dam.2014.07.017 
    ​Details  DOI 
  • 2014 | Journal Article
    ​ ​Syllabic Languages and Go-through Automata​
    Dinu, L. P.; Gramatovici, R. & Manea, F. ​ (2014) 
    Fundamenta Informaticae, 131(3-4) pp. 409​-424​.​ DOI: https://doi.org/10.3233/FI-2014-1022 
    ​Details  DOI 
  • 2013 | Journal Article
    ​ ​The hardness of counting full words compatible with partial words​
    Manea, F.   & Tiseanu, C.​ (2013) 
    Journal of Computer and System Sciences, 79(1) pp. 7​-22​.​ DOI: https://doi.org/10.1016/j.jcss.2012.04.001 
    ​Details  DOI 
  • 2013 | Journal Article | Research Paper
    ​ ​Accepting Networks of Evolutionary Processors with Subregular Filters​
    Manea, F.   & Truthe, B.​ (2013) 
    Theory of Computing Systems, 55(1) pp. 84​-109​.​ DOI: https://doi.org/10.1007/s00224-013-9502-z 
    ​Details  DOI 
  • 2013 | Journal Article | Research Paper
    ​ ​Hairpin lengthening: language theoretic and algorithmic results​
    Manea, F. ; Martín-Vide, C. & Mitrana, V.​ (2013) 
    Journal of Logic and Computation, 25(4) pp. 987​-1009​.​ DOI: https://doi.org/10.1093/logcom/exs076 
    ​Details  DOI 
  • 2012 | Journal Article
    ​ ​Language classes generated by tree controlled grammars with bounded nonterminal complexity​
    Turaev, S.; Dassow, J.; Manea, F.   & Selamat, M. H.​ (2012) 
    Theoretical Computer Science, 449 pp. 134​-144​.​ DOI: https://doi.org/10.1016/j.tcs.2012.04.013 
    ​Details  DOI 
  • 2012 | Journal Article
    ​ ​Generating Networks of Splicing Processors​
    Dassow, J.; Manea, F.   & Truthe, B.​ (2012) 
    RAIRO - Theoretical Informatics and Applications, 46(4) pp. 547​-572​.​ DOI: https://doi.org/10.1051/ita/2012016 
    ​Details  DOI 
  • 2012 | Journal Article
    ​ ​Networks of evolutionary processors: the power of subregular filters​
    Dassow, J.; Manea, F.   & Truthe, B.​ (2012) 
    Acta Informatica, 50(1) pp. 41​-75​.​ DOI: https://doi.org/10.1007/s00236-012-0172-0 
    ​Details  DOI 
  • 2012 | Journal Article
    ​ ​Networks of evolutionary processors: computationally complete normal forms​
    Dassow, J.; Manea, F.   & Truthe, B.​ (2012) 
    Natural Computing, 11(4) pp. 595​-607​.​ DOI: https://doi.org/10.1007/s11047-012-9331-z 
    ​Details  DOI 
  • 2012 | Journal Article
    ​ ​Complexity results for deciding Networks of Evolutionary Processors​
    Manea, F. ​ (2012) 
    Theoretical Computer Science, 456 pp. 65​-79​.​ DOI: https://doi.org/10.1016/j.tcs.2012.06.029 
    ​Details  DOI 
  • 2012 | Journal Article
    ​ ​On external contextual grammars with subregular selection languages​
    Dassow, J.; Manea, F.   & Truthe, B.​ (2012) 
    Theoretical Computer Science, 449 pp. 64​-73​.​ DOI: https://doi.org/10.1016/j.tcs.2012.04.008 
    ​Details  DOI 
  • 2011 | Journal Article
    ​ ​Bounded hairpin completion​
    Ito, M.; Leupold, P.; Manea, F.   & Mitrana, V.​ (2011) 
    Information and Computation, 209(3) pp. 471​-485​.​ DOI: https://doi.org/10.1016/j.ic.2010.11.014 
    ​Details  DOI 
  • 2011 | Journal Article
    ​ ​ON THE DESCRIPTIONAL COMPLEXITY OF ACCEPTING NETWORKS OF EVOLUTIONARY PROCESSORS WITH FILTERED CONNECTIONS​
    DRĂGOI, C. & Manea, F. ​ (2011) 
    International Journal of Foundations of Computer Science, 19(05) pp. 1113​-1132​.​ DOI: https://doi.org/10.1142/S0129054108006170 
    ​Details  DOI 
  • 2011 | Journal Article
    ​ ​SOME REMARKS ON THE HAIRPIN COMPLETION​
    Manea, F. ; MITRANA, V. & YOKOMORI, T.​ (2011) 
    International Journal of Foundations of Computer Science, 21(05) pp. 859​-872​.​ DOI: https://doi.org/10.1142/S0129054110007593 
    ​Details  DOI 
  • 2011 | Journal Article
    ​ ​Complexity-preserving simulations among three variants of accepting networks of evolutionary processors​
    Bottoni, P.; Labella, A.; Manea, F. ; Mitrana, V.; Petre, I. & Sempere, J. M.​ (2011) 
    Natural Computing, 10(1) pp. 429​-445​.​ DOI: https://doi.org/10.1007/s11047-010-9238-5 
    ​Details  DOI 
  • 2010 | Journal Article
    ​ ​A series of algorithmic results related to the iterated hairpin completion​
    Manea, F. ​ (2010) 
    Theoretical Computer Science, 411(48) pp. 4162​-4178​.​ DOI: https://doi.org/10.1016/j.tcs.2010.06.014 
    ​Details  DOI 
  • 2009 | Journal Article
    ​ ​On some algorithmic problems regarding the hairpin completion​
    Manea, F. ; Martín-Vide, C. & Mitrana, V.​ (2009) 
    Discrete Applied Mathematics, 157(9) pp. 2143​-2152​.​ DOI: https://doi.org/10.1016/j.dam.2007.09.022 
    ​Details  DOI 
  • 2009 | Journal Article
    ​ ​Small universal accepting hybrid networks of evolutionary processors​
    Loos, R.; Manea, F.   & Mitrana, V.​ (2009) 
    Acta Informatica, 47(2) pp. 133​-146​.​ DOI: https://doi.org/10.1007/s00236-009-0113-8 
    ​Details  DOI 
  • 2009 | Journal Article
    ​ ​On small, reduced, and fast universal accepting networks of splicing processors​
    Loos, R.; Manea, F.   & Mitrana, V.​ (2009) 
    Theoretical Computer Science, 410(4-5) pp. 406​-416​.​ DOI: https://doi.org/10.1016/j.tcs.2008.09.048 
    ​Details  DOI 
  • 2009 | Journal Article
    ​ ​Two complementary operations inspired by the DNA hairpin formation: Completion and reduction​
    Manea, F. ; Mitrana, V. & Yokomori, T.​ (2009) 
    Theoretical Computer Science, 410(4-5) pp. 417​-425​.​ DOI: https://doi.org/10.1016/j.tcs.2008.09.049 
    ​Details  DOI 
  • 2008 | Journal Article | Research Paper
    ​ ​A New Characterization of NP, P, and PSPACE with Accepting Hybrid Networks of Evolutionary Processors​
    Manea, F. ; Margenstern, M.; Mitrana, V. & Pérez-Jiménez, M. J.​ (2008) 
    Theory of Computing Systems, 46(2) pp. 174​-192​.​ DOI: https://doi.org/10.1007/s00224-008-9124-z 
    ​Details  DOI 
  • 2007 | Journal Article
    ​ ​All NP-problems can be solved in polynomial time by accepting hybrid networks of evolutionary processors of constant size​
    Manea, F.   & Mitrana, V.​ (2007) 
    Information Processing Letters, 103(3) pp. 112​-118​.​ DOI: https://doi.org/10.1016/j.ipl.2007.03.001 
    ​Details  DOI 
  • 2007 | Journal Article
    ​ ​On the recognition of context-free languages using accepting hybrid networks of evolutionary processors​
    Manea, F. ​ (2007) 
    International Journal of Computer Mathematics, 84(3) pp. 273​-285​.​ DOI: https://doi.org/10.1080/00207160701210760 
    ​Details  DOI 
  • 2007 | Journal Article | Research Paper
    ​ ​On the size complexity of universal accepting hybrid networks of evolutionary processors​
    Manea, F. ; MARTIN-VIDE, C. & MITRANA, V.​ (2007) 
    Mathematical Structures in Computer Science, 17(4) pp. 753​-771​.​ DOI: https://doi.org/10.1017/S0960129507006202 
    ​Details  DOI 
  • 2007 | Journal Article
    ​ ​Accepting networks of splicing processors: Complexity results​
    Manea, F. ; Martín-Vide, C. & Mitrana, V.​ (2007) 
    Theoretical Computer Science, 371(1-2) pp. 72​-82​.​ DOI: https://doi.org/10.1016/j.tcs.2006.10.015 
    ​Details  DOI 
  • 2007 | Journal Article
    ​ ​Freeness of partial words​
    Manea, F.   & Mercaş, R.​ (2007) 
    Theoretical Computer Science, 389(1-2) pp. 265​-277​.​ DOI: https://doi.org/10.1016/j.tcs.2007.09.028 
    ​Details  DOI 
  • 2007 | Journal Article | Erratum
    ​ ​Erratum to: “Accepting networks of splicing processors: Complexity results” [Theoret. Comput. Sci. 371 (2007) 72–82]​
    Manea, F. ; Martín-Vide, C. & Mitrana, V.​ (2007) 
    Theoretical Computer Science, 378(1) pp. 131​.​ DOI: https://doi.org/10.1016/j.tcs.2007.03.033 
    ​Details  DOI 
  • 2006 | Journal Article
    ​ ​An efficient approach for the rank aggregation problem​
    Dinu, L. P. & Manea, F. ​ (2006) 
    Theoretical Computer Science, 359(1-3) pp. 455​-461​.​ DOI: https://doi.org/10.1016/j.tcs.2006.05.024 
    ​Details  DOI 

Publication List

All Articles (Book & Journal) Articles & Preprints Papers (Journal & Conference)

Type

Subtype

Date issued

Author

Language

Fulltext

Options

Citation Style

GRO View APA Chicago MLA Vancouver
https://publications.goettingen-research-online.de URI: /cris/rp/rp114433
ID: 0000000
PREF: default TOKEN:

0

Sort

Issue Date
ASC DESC
Title
ASC DESC

Embed

JavaScript
Link

Export

Activate Export Mode
Deactivate Export Mode

Select some or all items (max. 800 for CSV/Excel) from the publications list, then choose an export format below.