Size: 199
Comment:
|
Size: 926
Comment:
|
Deletions are marked like this. | Additions are marked like this. |
Line 1: | Line 1: |
||Previous years: ||[[Publications/2009|2009]]||[[Publications/2008|2008]]||[[Publications/2007|2007]]||[[Publications/2006|2006]]||[[Publications/2005|2005]]|| '''Recent Publications''' |
||Previous years: ||[[Publications/2015|2015]]||[[Publications/2014|2014]] ||[[Publications/2013|2013]] ||[[Publications/2012|2012]] ||[[Publications/2011|2011]] ||[[Publications/2010|2010]] ||[[Publications/2009|2009]] ||[[Publications/2008|2008]] ||[[Publications/2007|2007]] ||[[Publications/2006|2006]] ||[[Publications/2005|2005]] || |
Line 5: | Line 4: |
== Recent Publications == | |
Line 7: | Line 7: |
==== Journal papers ==== * Eraşcu, M., Hong, H., Real quantifier elimination for the synthesis of optimal numerical algorithms (Case study: Square root computation), Journal of Symbolic Computation 75, pp. 110-126, 2016 |
|
Line 8: | Line 10: |
==== Book chapters ==== ==== Conference papers ==== * Drămnesc, I., Jebelean, T., Stratulat, S., Proof–based synthesis of sorting algorithms for trees, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 9618, pp. 562-575, 2016 |
Recent Publications
Journal papers
- Eraşcu, M., Hong, H., Real quantifier elimination for the synthesis of optimal numerical algorithms (Case study: Square root computation), Journal of Symbolic Computation 75, pp. 110-126, 2016
Book chapters
Conference papers
- Drămnesc, I., Jebelean, T., Stratulat, S., Proof–based synthesis of sorting algorithms for trees, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 9618, pp. 562-575, 2016