Size: 729
Comment:
|
Size: 1148
Comment:
|
Deletions are marked like this. | Additions are marked like this. |
Line 8: | Line 8: |
==== Book chapters ==== |
* 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 15: | Line 12: |
* 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 | * 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 * Istrate, G., Bonchiş, C., Dinu, L.P., The minimum entropy submodular set cover problem, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)9618, pp. 295-306, 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
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
- Istrate, G., Bonchiş, C., Dinu, L.P., The minimum entropy submodular set cover problem, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)9618, pp. 295-306, 2016