A Prolog simulator for deterministic P systems with active membranes A Cordón-Franco, MA Gutiérrez-Naranjo, MJ Pérez-Jiménez, ... New Generation Computing 22 (4), 349-363, 2004 | 40 | 2004 |
A colouring protocol for the generalized Russian cards problem A Cordón-Franco, H Van Ditmarsch, D Fernández-Duque, ... Theoretical Computer Science 495, 81-95, 2013 | 26 | 2013 |
A geometric protocol for cryptography with cards A Cordón-Franco, H Van Ditmarsch, D Fernández-Duque, ... Designs, Codes and Cryptography 74 (1), 113-125, 2015 | 20 | 2015 |
Implementing in Prolog an effective cellular solution to the Knapsack problem A Cordón-Franco, MA Gutiérrez-Naranjo, MJ Pérez-Jiménez, ... International Workshop on Membrane Computing, 140-152, 2003 | 19 | 2003 |
A secure additive protocol for card players A Cordón-Franco, H van Ditmarsch, D Fernández-Duque, JJ Joosten, ... arXiv preprint arXiv:1111.0156, 2011 | 13 | 2011 |
Secure communication of local states in interpreted systems M Albert, A Cordón-Franco, H van Ditmarsch, D Fernández-Duque, ... International Symposium on Distributed Computing and Artificial Intelligence …, 2011 | 13 | 2011 |
Exploring computation trees associated with P systems A Cordón-Franco, MA Gutiérrez-Naranjo, MJ Pérez-Jiménez, ... International Workshop on Membrane Computing, 278-286, 2004 | 13 | 2004 |
Weak metrics on configurations of a P system A Cordón Franco, MÁ Gutiérrez Naranjo, MJ Pérez Jiménez, ... Proceedings of the Second Brainstorming Week on Membrane Computing, 139-151 …, 2004 | 13 | 2004 |
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 54 (2012), Pages 163–175 A secure A Cordón-franco, H Van Ditmarsch, D Fernández-duque, JJ Joosten, ... | 13* | |
Fragments of Arithmetic and true sentences A Cordón‐Franco, A Fernández‐Margarit, FF Lara‐Martín Mathematical Logic Quarterly 51 (3), 313-328, 2005 | 12 | 2005 |
A note on parameter free Π1‐induction and restricted exponentiation A Cordón‐Franco, A Fernández‐Margarit, FF Lara‐Martín Mathematical Logic Quarterly 57 (5), 444-455, 2011 | 11 | 2011 |
On the quantifier complexity of Δ n+1 (T)– induction A Cordón-Franco, A Fernández-Margarit, FF Lara-Martín Archive for Mathematical Logic 43 (3), 371-398, 2004 | 8 | 2004 |
On the optimality of conservation results for local reflection in arithmetic A Cordón-Franco, A Fernández-Margarit, FF Lara-Martín The Journal of Symbolic Logic 78 (4), 1025-1035, 2013 | 6 | 2013 |
Cellular solutions of some numerical NP-complete problems: A Prolog implementation A Cordón-Franco, MA Gutiérrez-Naranjo, MJ Pérez-Jiménez, ... Molecular Computational Models: Unconventional Approaches, 115-149, 2005 | 6 | 2005 |
Fragments of Arithmetic with Extensions of Bounded Complexity A Cordón Franco, A Fernández Margarit, FF Lara Martín Preprint, Sevilla, August, 2003 | 6 | 2003 |
Provably total primitive recursive functions: theories with induction A Cordón-Franco, A Fernández-Margarit, FF Lara-Martín International Workshop on Computer Science Logic, 355-369, 2004 | 5 | 2004 |
Approximating non-discrete P systems A Cordón-Franco, F Sancho-Caparrini International Workshop on Membrane Computing, 287-295, 2004 | 5 | 2004 |
Local induction and provably total computable functions A Cordón-Franco, FF Lara-Martín Annals of Pure and Applied Logic 165 (9), 1429-1444, 2014 | 4 | 2014 |
Secure communication of local states in multi-agent systems M Albert, A Cordón–Franco, H van Ditmarsch, D Fernández–Duque, ... Proceedings of the Logics in Security workshop (LIS). ESSLLI 2010, 2010 | 4 | 2010 |
Existentially closed models and conservation results in bounded arithmetic A Cordón-Franco, A Fernández-Margarit, FF Lara-Martín Journal of Logic and Computation 19 (1), 123-143, 2009 | 4 | 2009 |