Mario Rossainz López

Orcid: 0000-0002-9504-1272

According to our database1, Mario Rossainz López authored at least 15 papers between 2004 and 2023.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Usability in a Mixed Cryptography and Hardware Security System.
Proceedings of the XI Latin American Conference on Human Computer Interaction, 2023

2020
Use of Data Flow Diagrams for Building Process with Message Passing: A Parallel Design Proposal.
Res. Comput. Sci., 2020

2019
Use of Parallel Patterns of Communication between Processes for search of Sequences DNA and RNAi Strings.
Res. Comput. Sci., 2019

An Algorithm to Classify DNA Sequences of Hepatitis C Virus Based on Localized Conserved Regions and Heuristic Search.
Res. Comput. Sci., 2019

DNA Sequence Recognition using Image Representation.
Res. Comput. Sci., 2019

2017
Partitioning Strategy Divide and Conquer as CPANs. A Methodological Proposal.
Res. Comput. Sci., 2017

Design and implementation of communication patterns using parallel objects.
Int. J. Simul. Process. Model., 2017

2016
Búsqueda paralela exhaustiva aplicada a cadenas de ADN y ARNi.
Res. Comput. Sci., 2016

2015
Solución al problema de ordenación usando PipeLine y Binary Tree como composiciones paralelas de alto nivel.
Res. Comput. Sci., 2015

2014
Spatial-Temporal Model for Emotion Interpretation.
Res. Comput. Sci., 2014

2010
Updates Based on ASP.
Proceedings of the 9th Mexican International Conference on Artificial Intelligence, 2010

2009
Methodology Of Parallel Programming Using Compositions Of Parallel Objects Or CPANS For The Solution Of NP-Complete Problems.
Proceedings of the European Conference on Modelling and Simulation, 2009

2006
An Approach to Structured Parallel Programming Based on a Composition.
Proceedings of the 16th International Conference on Electronics, Communications, and Computers (CONIELECOMP 2006), 27 February 2005, 2006

2005
Design and Use of the CPAN Branch & Bound for the Solution of the Travelling Salesman Problem (TSP).
Proceedings of the 15th International Conference on Electronics, Communications, and Computers (CONIELECOMP 2005), 28 February 2005, 2005

2004
A Parallel Programming Methodology based on High Level Parallel Compositions (CPANs).
Proceedings of the 14th International Conference on Electronics, 2004


  Loading...