Search the dblp DataBase
Florin Manea :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Florin Manea , Carlos Martín-Vide , Victor Mitrana Accepting Networks of Splicing Processors. [Citation Graph (0, 0)][DBLP ] CiE, 2005, pp:300-309 [Conf ] Florin Manea , Carlos Martín-Vide , Victor Mitrana All NP-Problems Can Be Solved in Polynomial Time by Accepting Networks of Splicing Processors of Constant Size. [Citation Graph (0, 0)][DBLP ] DNA, 2006, pp:47-57 [Conf ] Florin Manea Timed Accepting Hybrid Networks of Evolutionary Processors. [Citation Graph (0, 0)][DBLP ] IWINAC (2), 2005, pp:122-132 [Conf ] Florin Manea , Carlos Martín-Vide , Victor Mitrana Solving 3CNF-SAT and HPP in Linear Time Using WWW. [Citation Graph (0, 0)][DBLP ] MCU, 2004, pp:269-280 [Conf ] Florin Manea , Carlos Martín-Vide , Victor Mitrana A Universal Accepting Hybrid Network of Evolutionary Processors. [Citation Graph (0, 0)][DBLP ] Electr. Notes Theor. Comput. Sci., 2006, v:135, n:3, pp:95-105 [Journal ] Radu Gramatovici , Florin Manea Parsing Local Internal Contextual Languages with Context-Free Choice. [Citation Graph (0, 0)][DBLP ] Fundam. Inform., 2005, v:64, n:1-4, pp:171-183 [Journal ] Florin Manea , Victor Mitrana , Daniel-Claudian Voinescu Synchronized Shuffle on Backbones. [Citation Graph (0, 0)][DBLP ] Fundam. Inform., 2006, v:73, n:1-2, pp:191-202 [Journal ] Liviu Petrisor Dinu , Florin Manea An efficient approach for the rank aggregation problem. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2006, v:359, n:1-3, pp:455-461 [Journal ] Florin Manea , Carlos Martín-Vide , Victor Mitrana Accepting networks of splicing processors: Complexity results. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2007, v:371, n:1-2, pp:72-82 [Journal ] Florin Manea , Victor Mitrana Hairpin Completion Versus Hairpin Reduction. [Citation Graph (0, 0)][DBLP ] CiE, 2007, pp:532-541 [Conf ] Juan Castellanos , Florin Manea , Luis Fernando de Mingo López , Victor Mitrana Accepting Networks of Splicing Processors with Filtered Connections. [Citation Graph (0, 0)][DBLP ] MCU, 2007, pp:218-229 [Conf ] Florin Manea , Victor Mitrana All NP-problems can be solved in polynomial time by accepting hybrid networks of evolutionary processors of constant size. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2007, v:103, n:3, pp:112-118 [Journal ] Florin Manea , Carlos Martín-Vide , Victor Mitrana Erratum to: "Accepting networks of splicing processors: Complexity results" [Theoret. Comput. Sci. 371(2007) 72-82]. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2007, v:378, n:1, pp:131- [Journal ] Hairpin Lengthening. [Citation Graph (, )][DBLP ] Some Remarks on Superposition Based on Watson-Crick-Like Complementarity. [Citation Graph (, )][DBLP ] Filter Position in Networks of Evolutionary Processors Does Not Matter: A Direct Proof. [Citation Graph (, )][DBLP ] Combinatorial Queries and Updates on Partial Words. [Citation Graph (, )][DBLP ] Networks of Evolutionary Picture Processors with Filtered Connections. [Citation Graph (, )][DBLP ] Hard Counting Problems for Partial Words. [Citation Graph (, )][DBLP ] Accepting Networks of Evolutionary Processors: Complexity Aspects - Recent Results and New Challenges. [Citation Graph (, )][DBLP ] Small universal accepting hybrid networks of evolutionary processors. [Citation Graph (, )][DBLP ] Small Universal Accepting Networks of Evolutionary Processors with Filtered Connections [Citation Graph (, )][DBLP ] Accepting Hybrid Networks of Evolutionary Processors with Special Topologies and Small Communication [Citation Graph (, )][DBLP ] On some algorithmic problems regarding the hairpin completion. [Citation Graph (, )][DBLP ] Search in 0.003secs, Finished in 0.003secs