Florin Manea
Florin Manea
Подтвержден адрес электронной почты в домене 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
562006
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, 2007
472007
Accepting networks of splicing processors: Complexity results
F Manea, C Martin-Vide, V Mitrana
Theoretical Computer Science 371 (1-2), 72-82, 2007
472007
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
432007
Freeness of partial words
F Manea, R Mercaş
Theoretical Computer Science 389 (1-2), 265-277, 2007
422007
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
38*2010
On some algorithmic problems regarding the hairpin completion
F Manea, C Martín-Vide, V Mitrana
Discrete Applied Mathematics 157 (9), 2143-2152, 2009
352009
Tighter bounds and optimal algorithms for all maximal α-gapped repeats and palindromes
P Gawrychowski, I Tomohiro, S Inenaga, D Köppl, F Manea
Theory of Computing Systems 62 (1), 162-191, 2018
34*2018
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
342009
Hairpin completion versus hairpin reduction
F Manea, V Mitrana
Conference on Computability in Europe, 532-541, 2007
322007
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
International Workshop on DNA-Based Computers, 47-57, 2006
322006
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
302015
Accepting networks of evolutionary word and picture processors: A survey
F Manea, C Martín-Vide, V Mitrana
Scientific Applications of Language Methods, 525-561, 2011
282011
Testing generalised freeness of words
P Gawrychowski, F Manea, D Nowotka
31st International Symposium on Theoretical Aspects of Computer Science …, 2014
262014
Solving 3CNF-SAT and HPP in linear time using WWW
F Manea, C Martín-Vide, V Mitrana
International Conference on Machines, Computations, and Universality, 269-280, 2004
262004
Finding pseudo-repetitions
P Gawrychowski, F Manea, R Mercas, D Nowotka, C Tiseanu
LIPIcs-Leibniz International Proceedings in Informatics 20, 257-268, 2013
252013
Accepting Networks of Evolutionary Processors with Filtered Connections.
C Dragoi, F Manea, V Mitrana
J. UCS 13 (11), 1598-1614, 2007
252007
Fine and Wilf’s theorem and pseudo-repetitions
F Manea, R Mercaş, D Nowotka
International Symposium on Mathematical Foundations of Computer Science, 668-680, 2012
222012
Bounded hairpin completion
M Ito, P Leupold, F Manea, V Mitrana
Information and Computation 209 (3), 471-485, 2011
192011
Small universal accepting hybrid networks of evolutionary processors
R Loos, F Manea, V Mitrana
Acta Informatica 47 (2), 133-146, 2010
182010
В данный момент система не может выполнить эту операцию. Повторите попытку позднее.
Статьи 1–20