Observatorio de I+D+i UPM
• ESPAÑOL
• ENGLISH
INVESTIGADORES
ESTRUCTURAS DE I+D+I
ACTIVIDAD INVESTIGADORA
INNOVACIÓN
Investigador
Victor Mitrana
Categoría Investigador
CATEDRATICO UNIVERSIDAD (I3)
Sexo:
V
Escuela UPM
E.T.S DE ING. DE SISTEMAS INFORMÁTICOS
Departamento:
SISTEMAS INFORMÁTICOS (N)
Area Conocimiento
CC. DE COMPUTACION E INTELIGENCIA ARTIFICIAL
Grupo de Investigación:
Grupo de Modelización Matemática y Biocomputación
Email (Directorio UPM)
victor.mitrana
upm.es
Teléfono (Directorio UPM)
910673591
Datos de Memorias relacionados
Proyectos de I+D+i y generación de recursos
6 Proyectos de I+D+i
1: (2011)
NETWORKS OF BIO-INSPIRED PROCESSORS:HARDWARE IMPLENTATIONS
2: (2011)
Red Temática Nacional en Computación Biomolecular y Biocelular
3: (2012)
NETWORKS OF BIO-INSPIRED PROCESSORS: HARDWARE IMPLEMENTATIONS
4: (2012)
Renovación y nuevas actividades de la red temática en computación biomolecular y biocelular
5: (2013)
Renovación y Nuevas Actividades de la Red Temática en Computación Biomolecular y Biocelular. TIN2011-15874-E (2012)
6: (2018)
Deep-Augur: Deep-Augur
Formación de Investigadores y Movilidad
9 Estancias y sabáticos recogidos en programas oficiales
1: (2011)
Investigador de la Fundación Alexander von Humboldt
2: (2011)
Profesor invitado
3: (2014)
Alexander von Humbold Fellowship: Computational Aspects of Reaction Systems
4: (2014)
Combinatorial Aspects of Words and their Applications
5: (2014)
Combinatorial Aspects of Words and their Applications
6: (2016)
Investigador invitado en el Turku Centre for Computer Science
7: (2016)
Profesor investigador invitado en la Facultad de Informática de la Universidad "La Sapienza"
8: (2017)
Profesor invitado
9: (2017)
Profesor invitado
2 Tesis Doctorales
1: (2010)
Combinatorial Aspects in Formal Language Theory
2: (2010)
On Parikh Matrices and Ambiguity
Difusión de Resultados de Investigación
33 Artículos en revistas
1: (2010)
A New Characterization of NP, P, and PSPACE with Accepting Hybrid Networks of Evolutionary Processors
2: (2010)
Accepting splicing systems
3: (2010)
Small universal accepting hybrid networks of evolutionary processors
4: (2010)
SOME REMARKS ON THE HAIRPIN COMPLETION
5: (2011)
Bounded hairpin completion
6: (2011)
Complexity-preserving simulations among three variants of accepting networks of evolutionary processors
7: (2011)
FILTER POSITION IN NETWORKS OF SUBSTITUTION PROCESSORS DOES NOT MATTER
8: (2011)
New bounds for the query complexity of an algorithm that learns DFAs with correction and equivalence queries
9: (2011)
The role of evolutionary operations in accepting hybrid networks of evolutionary processors
10: (2012)
Accepting splicing systems with permitting and forbidding words
11: (2013)
Accepting splicing systems with permitting and forbidding words
12: (2013)
Accepting splicing systems with permitting and forbidding words
13: (2014)
Accepting Networks of Evolutionary Picture Processors
14: (2014)
Bounded Prefix-Suffix Duplication
15: (2014)
Networks of polarized evolutionary processors
16: (2014)
Networks of Polarized Evolutionary Processors Are Computationally Complete
17: (2014)
Prefix-suffix duplication
18: (2014)
Prefix-suffix duplication
19: (2014)
Solving 2D-Pattern Matching with Networks of Picture Processors
20: (2014)
Transducers based on Networks of Evolutionary Processors
21: (2015)
Ambiguity of the Multiple Interpretations on Regular Languages
22: (2015)
Bounded Prefix-Suffix Duplication: Language Theoretic and Algorithmic Results
23: (2015)
Bounded Prefix-Suffix Duplication: Language Theoretic and Algorithmic Results
24: (2015)
Hairpin lengthening: language theoretic and algorithmic results
25: (2016)
Networks of splicing processors with evaluation sets as optimization problems solvers
26: (2016)
On the Computational Power of Networks of Polarized Evolutionary Processors. (JCR Journal Q2)
27: (2016)
Transducers Based on Networks of Polarized Evolutionary Processors
28: (2017)
Networks of picture processors as problem solvers
29: (2017)
Networks of polarized multiset processors
30: (2017)
On the computational power of networks of polarized evolutionary processors
31: (2017)
Prefix-suffix square reduction
32: (2017)
Prefix-suffix square reduction
33: (2017)
Transducers based on networks of polarized evolutionary processors
3 Capítulos de libros
1: (2011)
Context insertions
2: (2014)
Networks of Polarized Evolutionary Processors Are Computationally Complete
3: (2014)
Two Variants of Synchronized Shuffle on Backbones
6 Conferencias invitadas en congresos
1: (2010)
Networks of Cell-like Processors
2: (2011)
Hairpin lengthening: algorithmic results
3: (2011)
Splicing Systems: Accepting Versus Generating.
4: (2013)
Bio-operations: Computational models, algorithms, formal languages
5: (2014)
Extended Finite Automata Over Groups
6: (2016)
Networks of picture processors
1 Cursos, seminarios y tutoriales
1: (2011)
Networks of evolutionary picture processors
1 Libros
1: (2015)
Evolving Computability
2 Otras Publicaciones
1: (2011)
Deciding regularity of hairpin completions of regular languages in polynomial time
2: (2011)
Preface
8 Ponencia en Congresos
1: (2010)
Hairpin Lengthening
2: (2011)
On the Degree of Team Cooperation in CD Grammar Systems.
3: (2011)
Simulating Accepting Networks of Evolutionary Processors with Filtered Connections by Accepting Evolutionary P Systems
4: (2012)
Networks of Polarized Evolutionary Processors as Problem Solvers
5: (2012)
Uniform Distributed Pushdown Automata Systems
6: (2014)
Bounded prefix-suffix duplication
7: (2014)
Networks of Polarized Evolutionary Processors Are Computationally Complete
8: (2017)
Networks of Polarized Splicing Processors
• TOMA DE DATOS DE MEMORIAS Y CV
• UPM.ES
S2i 2021 Observatorio de investigación @ UPM con la colaboración del Consejo Social UPM
Cofinanciación del MINECO en el marco del Programa INNPACTO (IPT-020000-2010-22)
