Folgen
Florin Manea
Florin Manea
Bestätigte E-Mail-Adresse bei informatik.uni-goettingen.de - Startseite
Titel
Zitiert von
Zitiert von
Jahr
An efficient approach for the rank aggregation problem
LP Dinu, F Manea
Theoretical Computer Science 359 (1-3), 455-461, 2006
602006
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
512007
Accepting networks of splicing processors: Complexity results
F Manea, C Martin-Vide, V Mitrana
Theoretical Computer Science 371 (1-2), 72-82, 2007
482007
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
472007
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
44*2010
Freeness of partial words
F Manea, R Mercaş
Theoretical Computer Science 389 (1-2), 265-277, 2007
432007
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
41*2018
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
37*2018
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
352015
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
352009
On some algorithmic problems regarding the hairpin completion
F Manea, C Martín-Vide, V Mitrana
Discrete Applied Mathematics 157 (9), 2143-2152, 2009
342009
Hairpin completion versus hairpin reduction
F Manea, V Mitrana
Computation and Logic in the Real World: Third Conference on Computability …, 2007
332007
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
322010
Accepting Networks of Evolutionary Processors with Filtered Connections.
C Dragoi, F Manea, V Mitrana
J. Univers. Comput. Sci. 13 (11), 1598-1614, 2007
312007
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
312006
Solving 3CNF-SAT and HPP in linear time using WWW
F Manea, C Martín-Vide, V Mitrana
Machines, Computations, and Universality: 4th International Conference, MCU …, 2005
292005
Testing generalised freeness of words
P Gawrychowski, F Manea, D Nowotka
31st International Symposium on Theoretical Aspects of Computer Science …, 2014
252014
Finding pseudo-repetitions
P Gawrychowski, F Manea, R Mercaş, D Nowotka, C Tiseanu
252012
Fine and Wilf’s theorem and pseudo-repetitions
F Manea, R Mercaş, D Nowotka
Mathematical Foundations of Computer Science 2012: 37th International …, 2012
232012
Bounded hairpin completion
M Ito, P Leupold, F Manea, V Mitrana
Information and Computation 209 (3), 471-485, 2011
222011
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20