( en | de | ru )

 

Disambiguation of "Peña, Ricardo"

Author of the publication

copydeleteadd this publication to your clipboard
Generalized optimization methodology of second level for system design.

, , , and . CONIELECOMP, page 22-27. IEEE Computer Society, (2011)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Jorge Alejandro Peña Sebald

Effektivität und Angemessenheit: Messung interkultureller Kompetenz im Assessment Center. Uni Jena, (2008)

Miguel Peña

Jesús Ismael Irsula Peña

Hugo Peña-Cortés

Sascha Peña Hempel

 

Other publications of authors with the same name

A resource semantics and abstract machine for Safe: A functional language with regions and explicit deallocation., , and . Inf. Comput., (2014)White-Box Path Generation in Recursive Programs., and . TFP, volume 12222 of Lecture Notes in Computer Science, page 121-135. Springer, (2020)Generalized optimization methodology of second level for system design., , , and . CONIELECOMP, page 22-27. IEEE Computer Society, (2011)Interpolation-Based Height Analysis for Improving a Recurrence Solver., , , and . FOPARA, volume 7177 of Lecture Notes in Computer Science, page 36-53. Springer, (2011)Extending Liquid Types to Arrays., , , and . ACM Trans. Comput. Log., 21 (2): 13:1-13:41 (2020)Preface., , and . PROLE, volume 258 of Electronic Notes in Theoretical Computer Science, page 1-2. Elsevier, (2009)Reasoning About Skeletons in Eden., and . PARCO, volume 33 of John von Neumann Institute for Computing Series, page 851-858. Central Institute for Applied Mathematics, Jülich, Germany, (2005)A Space Consumption Analysis by Abstract Interpretation., , and . FOPARA, volume 6324 of Lecture Notes in Computer Science, page 34-50. Springer, (2009)Certification of Safe Polynomial Memory Bounds., and . FM, volume 6664 of Lecture Notes in Computer Science, page 184-199. Springer, (2011)An Assertional Proof of Red-Black Trees Using Dafny.. J. Autom. Reason., 64 (4): 767-791 (2020)