welcome: please sign in
location: Diff for "Publications"
Differences between revisions 4 and 49 (spanning 45 versions)
Revision 4 as of 2010-12-04 20:23:01
Size: 203
Editor: anonymous
Comment:
Revision 49 as of 2016-04-22 09:46:03
Size: 1148
Comment:
Deletions are marked like this. Additions are marked like this.
Line 1: Line 1:
'''Recent Publications'''
||Previous years: ||[[Publications/2009|2009]]||[[Publications/2008|2008]]||[[Publications/2007|2007]]||[[Publications/2006|2006]]||[[Publications/2005|2005]]||
||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:
==== Conference papers ====
Line 9: 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
 * 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

Previous years:

2015

2014

2013

2012

2011

2010

2009

2008

2007

2006

2005

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

Publications (last edited 2024-02-24 11:37:59 by DanielaZaharie)