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
Rito C.. New surfaces with $K^2=7$ and $p_g=q\leq 2$. The Asian Journal of Mathematics. In Press.Edit
Rito C., Roulleau X., Sarti A.. Explicit Schoen surfaces. Algebraic Geometry. In Press.Edit
Rito C. New canonical triple covers of surfaces. Proceedings of the American Mathematical Society. 2015;143(11):4647-4653.
Rito C. A surface with $q=2$ and canonical map of degree $16$. Michigan Mathematical Journal. 2017;66(1):99-105.
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
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. The semaphore codes attached to a Turing machine via resets and their various limits. Internat. J. Algebra Comput.. 2016;26(4):675-704.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. Turing machines and bimachines. Theoret. Comput. Sci.. 2008;400:182-224.Edit
[2011-5] Rhodes J, Silva PV. Further results on monoids acting on trees .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. Boolean Representations of Simplicial Complexes and Matroids. Vol Springer Monographs in Mathematics Springer 2015.Edit
[2016-7] Rhodes J, Schilling A, Silva PV. The semaphore codes attached to a Turing machine via resets and their various limits .Edit
[2015-22] Rhodes J, Schilling A, Silva PV. Random walks on semaphore codes and delay de Bruijn semigroups .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
Restivo A, Silva PV. Periodicity vectors for labelled trees. Discrete Appl. Math.. 2003;126:241-260.Edit
Restivo A, Silva PV. On the lattice of prefix codes. Theoret. Comput. Sci.. 2002;289:755-782.Edit
Reis H. Semi-complete vector fields of saddle-node type in C^n. Trans. Amer. Math. Soc.. 2008;360(12):6611-6630.
[2004-29] Reis H. Semi-complete vector fields of saddle-node type in C^n .
Reis R, Rodaro E. Regular Ideal Languages and Synchronizing Automata. Karhumäki J, Zamboni L, editors 2013.Edit
[2005-6] Reis H. Semi-complete Foliations associated to Hamiltonian Vector Fields .
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.
Reis H. Equivalence and semi-completude of foliations. Nonlinear Analysis. Theory, Methods & Applications. 2006;64(8):1654-1665.
Reis R, Rodaro E. Ideal regular languages and strongly connected synchronizing automata. Theoretical Computer Science. 2016;653:97-107.

Pages

Error | CMUP

Error

The website encountered an unexpected error. Please try again later.