关注
Florin Manea
Florin Manea
University of Göttingen
在 informatik.uni-goettingen.de 的电子邮件经过验证 - 首页
标题
引用次数
引用次数
年份
An efficient approach for the rank aggregation problem
LP Dinu, F Manea
Theoretical Computer Science 359 (1-3), 455-461, 2006
672006
Accepting networks of splicing processors: Complexity results
F Manea, C Martin-Vide, V Mitrana
Theoretical Computer Science 371 (1-2), 72-82, 2007
542007
Tighter Bounds and Optimal Algorithms for All Maximal α-gapped Repeats and Palindromes: Finding All Maximal α-gapped Repeats and Palindromes in Optimal …
P Gawrychowski, T I, S Inenaga, D Köppl, F Manea
Theory of Computing Systems 62, 162-191, 2018
53*2018
On the size complexity of universal accepting hybrid networks of evolutionary processors
F Manea, C Martin-Vide, V Mitrana
Mathematical Structures in Computer Science 17 (4), 753-771, 2007
532007
All NP-problems can be solved in polynomial time by accepting hybrid networks of evolutionary processors of constant size
F Manea, V Mitrana
Information Processing Letters 103 (3), 112-118, 2007
502007
A new characterization for NP, P, and PSPACE with accepting hybrid networks of evolutionary processors
F Manea, M Margenstern, V Mitrana, M Perez-Jimenez
Theory of Computing Systems 46 (2), 174-192, 2010
49*2010
Freeness of partial words
F Manea, R Mercaş
Theoretical Computer Science 389 (1-2), 265-277, 2007
442007
The satisfiability of word equations: Decidable and undecidable theories
JD Day, V Ganesh, P He, F Manea, D Nowotka
Reachability Problems: 12th International Conference, RP 2018, Marseille …, 2018
43*2018
An SMT solver for regular expressions and linear arithmetic over string length
M Berzish, M Kulczynski, F Mora, F Manea, JD Day, D Nowotka, ...
International Conference on Computer Aided Verification, 289-312, 2021
402021
Efficiently testing Simon's congruence
P Gawrychowski, M Kosche, T Koß, F Manea, S Siemer
arXiv preprint arXiv:2005.01112, 2020
382020
On solving word equations using SAT
JD Day, T Ehlers, M Kulczynski, F Manea, D Nowotka, DB Poulsen
Reachability Problems: 13th International Conference, RP 2019, Brussels …, 2019
382019
On some algorithmic problems regarding the hairpin completion
F Manea, C Martín-Vide, V Mitrana
Discrete Applied Mathematics 157 (9), 2143-2152, 2009
382009
Two complementary operations inspired by the DNA hairpin formation: Completion and reduction
F Manea, V Mitrana, T Yokomori
Theoretical Computer Science 410 (4-5), 417-425, 2009
382009
All NP-problems can be solved in polynomial time by accepting networks of splicing processors of constant size
F Manea, C Martin-Vide, V Mitrana
DNA Computing: 12th International Meeting on DNA Computing, DNA12, Seoul …, 2006
382006
Scattered factor-universality of words
L Barker, P Fleischmann, K Harwardt, F Manea, D Nowotka
International Conference on Developments in Language Theory, 14-28, 2020
362020
Pattern matching with variables: Fast algorithms and new hardness results
H Fernau, F Manea, R Mercas, ML Schmid
32nd International Symposium on Theoretical Aspects of Computer Science …, 2015
362015
Accepting Networks of Evolutionary Word and Picture Processors: A Survey.
F Manea, C Martín-Vide, V Mitrana
Scientific Applications of Language Methods 2, 525-560, 2010
362010
Accepting Networks of Evolutionary Processors with Filtered Connections.
C Dragoi, F Manea, V Mitrana
J. Univers. Comput. Sci. 13 (11), 1598-1614, 2007
362007
Hairpin completion versus hairpin reduction
F Manea, V Mitrana
Computation and Logic in the Real World: Third Conference on Computability …, 2007
352007
Testing k-binomial equivalence
DD Freydenberger, P Gawrychowski, J Karhumäki, F Manea, W Rytter
arXiv preprint arXiv:1509.00622, 2015
312015
系统目前无法执行此操作，请稍后再试。
文章 1–20