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 A., Capela A., da Costa J., Guedes C., Carrapatoso E., Cardoso JS. A shortest path approach for staff line detection. Delgado J., Ng K, Nesi P., Bellini P., editors 2007.Edit
Rebelo JC, Reis H. Separatrices for C^2 actions on 3-manifolds. Commentarii Mathematici Helvetici. 2013;88(3):677-714.Edit
[2004-32] Rebelo P, Smirnov GV. A uniform cooling of alloys .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. Semi-complete foliations associated to Hamiltonian vector fields in dimension 2. J. Math. Anal. Appl.. 2007;328(2):813-820.
[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
Reis H. Semi-complete vector fields of saddle-node type in C^n. Trans. Amer. Math. Soc.. 2008;360(12):6611-6630.
[2005-22] Reis H. Equivalence and semi-completude of foliations .
[2005-6] Reis H. Semi-complete Foliations associated to Hamiltonian Vector Fields .
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. Equivalence and semi-completude of foliations. Nonlinear Analysis. Theory, Methods & Applications. 2006;64(8):1654-1665.
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 R, Rodaro E. Ideal regular languages and strongly connected synchronizing automata. Theoretical Computer Science. 2016;653:97-107.
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
[2016-7] Rhodes J, Schilling A, Silva PV. The semaphore codes attached to a Turing machine via resets and their various limits .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. Boolean Representations of Simplicial Complexes and Matroids. Vol Springer Monographs in Mathematics Springer 2015.Edit
[2012-8] Rhodes J, Silva PV. A new notion of vertex independence and rank for .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

Pages