Publications

Found 172 results
[ Author(Desc)] Title Type Year
Filters: First Letter Of Last Name is R  [Clear All Filters]
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
Rebelo AN, Costa O., Rocha AP, Soares JM, Lago P. Is autonomic control of the heart rate at rest altered by detraining? A study of heart rate variability in professional soccer players. {Revista portuguesa de cardiologia : orgão oficial da Sociedade Portuguesa de Cardiologia = Portuguese journal of cardiology : an official journal of the Portuguese Society of Cardiology}. 1997;{16}:{535-541, 508}.Edit
Rebelo C, Soares C, Da Costa J. empirical evaluation of ranking trees on some metalearning problems. aaai workshop - technical report. 2008;ws-08-09:85-90.Edit
Rebelo JC, Reis H. Discrete orbits, recurrence and solvable subgroups of Diff(C^2,0). Journal of Geometric Analysis. 2017;27(1):1-55.Edit
[2007-12] Rêgo EF. Intuicionismo e Teoria de Categorias/Topos. Tempo Linguagens e Limites Cognitivos em Matemática. .Edit
[2007-11] Rêgo EF. O Teorema de Banach-Tarski: Paradoxo ou Ilusão? O Axioma da Escolha: status quo, defesa e crítica. .Edit
[2005-42] Rêgo EF. Shrinking Complexity:Some Heuristics for Contractible Spaces .Edit
Reina S, Silva C, Gaio A., Correia A., Duarte R. HIV screening in tuberculosis patients, in the Northern Region of Portugal. The International Journal of Tuberculosis and Lung Disease. 2015;19(12).Edit
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 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.
[2004-29] Reis H. Semi-complete vector fields of saddle-node type in C^n .
Reis H. Semi-complete foliations associated to Hamiltonian vector fields in dimension 2. J. Math. Anal. Appl.. 2007;328(2):813-820.
[2005-22] Reis H. Equivalence and semi-completude of foliations .
Reis R, Rodaro E. Regular Ideal Languages and Synchronizing Automata. In: Combinatorics on Words, WORDS 2013. Vol LNCS, 8079.; 2013. 2. p. 205-216p.
Reis H. Semi-complete vector fields of saddle-node type in C^n. Trans. Amer. Math. Soc.. 2008;360(12):6611-6630.
[2005-6] Reis H. Semi-complete Foliations associated to Hamiltonian Vector Fields .
Reis R, Rodaro E. Regular Ideal Languages and Synchronizing Automata. Karhumäki J, Zamboni L, editors 2013.Edit
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.
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
Rhodes J, Silva PV. Turing machines and bimachines. Theoret. Comput. Sci.. 2008;400:182-224.Edit
Rhodes J, Silva PV. Further results on monoids acting on trees. Internat. J. Algebra Comput.. 2012;22:1250034, 69.Edit
[2016-7] Rhodes J, Schilling A, Silva PV. The semaphore codes attached to a Turing machine via resets and their various limits .Edit
[2012-8] Rhodes J, Silva PV. A new notion of vertex independence and rank for .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

Pages

Error | CMUP

Error

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