Publications

Found 2268 results
[ Author(Asc)] Title Type Year
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z 
R
[2015-19] Rito C. New surfaces with $K^2=7$ and $p_g=q\leq 2$ .
Rito C.. A surface with canonical map of degree 24. International Journal of Mathematics. 2017;28(6).Edit
[2013-19] Rito C. Surfaces with $p_g=0,$ $K^2=3$ and 5-torsion .
Rito C. Cuspidal quintics and surfaces with $p_g=0,$ $K^2=3$ and 5-torsion. LMS Journal of Computation and Mathematics. 2016;19(1):42-53.
Ribeiro C., Ladeira I., Gaio A., Brito MC. Pneumococcal pneumonia-are the new severity scores more accurate in predictingadverse outcomes? [Pneumonia pneumocócica-serão os novos scoresmais precisos a prever eventos desfavoráveis?]. Revista Portuguesa de Pneumologia. 2013;19:252-259.Edit
[2011-5] Rhodes J, Silva PV. Further results on monoids acting on trees .Edit
[2015-22] Rhodes J, Schilling A, Silva PV. Random walks on semaphore codes and delay de Bruijn semigroups .Edit
Rhodes J, Schilling A, Silva PV. The semaphore codes attached to a Turing machine via resets and their various limits. Internat. J. Algebra Comput.. 2016;26(4):675-704.Edit
Rhodes J, Silva PV. A new notion of vertex independence and rank for finite graphs. Internat. J. Algebra Comput.. 2015;25(1-2):123-167.Edit
Rhodes J, Schilling A, Silva PV. Random walks on semaphore codes and delay de Bruijn semigroups. Internat. J. Algebra Comput.. 2016;26(4):635-673.Edit
Rhodes J, Silva PV. Further results on monoids acting on trees. Internat. J. Algebra Comput.. 2012;22:1250034, 69.Edit
[2012-8] Rhodes J, Silva PV. A new notion of vertex independence and rank for .Edit
[2006-46] Rhodes J, Silva PV. An algebraic analysis of Turing machines and Cook’s Theorem leading to a profinite fractal different .Edit
Rhodes J, Silva PV. Boolean Representations of Simplicial Complexes and Matroids. Vol Springer Monographs in Mathematics Springer 2015.Edit
Rhodes J, Silva PV. Turing machines and bimachines. Theoret. Comput. Sci.. 2008;400:182-224.Edit
[2016-7] Rhodes J, Schilling A, Silva PV. The semaphore codes attached to a Turing machine via resets and their various limits .Edit
Restivo A, Silva PV. On the lattice of prefix codes. Theoret. Comput. Sci.. 2002;289:755-782.Edit
Restivo A, Silva PV. Periodicity vectors for labelled trees. Discrete Appl. Math.. 2003;126:241-260.Edit
[2005-22] Reis H. Equivalence and semi-completude of foliations .
Reis R, Rodaro E. The Language of Initially Connected Deterministic Finite Automata (Extended Abstract). In: Proceedings of 14th Italian Conference on Theoretical Computer Science.; 2013. 1. p. 179-184p.
[2004-29] Reis H. Semi-complete vector fields of saddle-node type in C^n .
Reis H. Equivalence and semi-completude of foliations. Nonlinear Analysis. Theory, Methods & Applications. 2006;64(8):1654-1665.
[2005-6] Reis H. Semi-complete Foliations associated to Hamiltonian Vector Fields .
Reis R, Rodaro E. Reset Regular Decomposition Complexity of Regular Ideal Languages (extended Abstract). In: Proceedings of 14th Italian Conference on Theoretical Computer Science.; 2013. 3. p. 30-35p.
Reis R, Rodaro E. Regular Ideal Languages and Synchronizing Automata. Karhumäki J, Zamboni L, editors 2013.Edit

Pages