|
Size: 4873
Comment:
|
Size: 1148
Comment:
|
| Deletions are marked like this. | Additions are marked like this. |
| Line 1: | Line 1: |
| ||Previous years: ||[[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]] || | ||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 5: |
| Line 6: | Line 8: |
| * Drămnesc, I., Jebelean, T., Synthesis of list algorithms by mechanical proving, ''Journal of Symbolic Computation'' 69 (1), pp. 61-92, 2015 * Dundua, B., Florido, M., Kutsia, T., Marin, M. CLP (H): Constraint logic programming for hedges. ''Theory and Practice of Logic Programming'', 1-22, 2015. * Istrate, G., Identifying almost-sorted permutations from TCP buffer dynamics. ''Scientific Annals of Computer Science'', XXV (1), pp. 133-154, 2015. * Istrate, G., Reachability and Recurrence in a Modular Generalization of Annihilating Random Walks (and lights-out games) to hypergraphs. ''Theoretical Computer Science'', 580, pp. 83-93, 2015. * Istrate, G., Two notes on generalized Darboux properties and related features of additive functions. ''Analele Universitatii Bucuresti Ser. Informatica, ''special issue dedicated to Professor Solomon Marcus' s 90th birthday , LXII (2), pp. 61-76, 2015. * Kutsia, T., Marin, M., Regular expression order-sorted unification and matching. ''Journal of Symbolic Computation'' 67, pp. 42-67 (2015) * Li, J., Agathos, A., Zaharie, D., Bioucas-Dias, J.M. , Plaza, A., Li, X. Minimum volume simplex analysis: A fast algorithm for linear hyperspectral unmixing, ''IEEE Transactions on Geoscience and Remote Sensing'', 53 (9), 7090960, pp. 5067-5082, 2015 * Măruşter, L., Măruşter, S., On the error estimation and T-stability of the Mann iteration, ''Journal of Computational and Applied Mathematics'' 276, pp. 110-116, 2015 * Măruşter, S., Strong convergence of the mann iteration for demicontractive mappings, Applied Mathematical Sciences, 9 (41-44), pp. 2061-2068, 2015 * Petcu, D., Panica, S., Crăciun, C., Neagul, M., Şandru, C., Cloud resource orchestration within an open-source component-based platform as a service, '' Concurrency Computation'' 27 (9), pp. 2443-2469, 2015 ==== Book chapters ==== * Di Nitto E., Solberg A., Petcu D., On MODAClouds' Approach for Application Design and Execution on Multi-Clouds, M. Helfert, B. Donnelan (Eds.), European Project Space, Cases and Examples, SCITEPRESS, 2015, Portugal, ISBN: 978-989-758-034-5, 49-60 * Pop D., Echeverria A., Petcu D., Conesa G., Enabling Open and Collaborative Public Service Advertising through Cloud Technologies, In book: Cloud Computing Technologies for Connected Government, Edition: 1, Chapter: 11, Publisher: IGI Global, Editors: Zaigham Mahmood, 268-290 |
* 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 24: | Line 11: |
| * Aisenberg, J., Bonet, M.L., Buss, S., Crăciun, A., Istrate, G. Short Proofs of the Kneser-Lovász Coloring Principle. ''Proceedings of the 42nd International Colloquium on Automata, Languages, and Programming (ICALP 2015) '', Lecture Notes in Computer Science vol. 9135, pp. 44-55. 2015. * Casale G., Ardagna D., Artac M., Barbier F., Di Nitto E., Henry A., Iuhasz G., Joubert C., Merseguer J., Munteanu V. I., Perez J. F., Petcu D., Rossi M. , Sheridan C., Spais I., Vladusic D., DICE: Quality-Driven Development of Data-Intensive Cloud Applications, Proceedings of the 7th International Workshop on Modeling in Software Engineering (MiSE 2015), 16-17 May 2015, Florence, Italy. * Dogaru, R., Micota, F., Zaharie, D., Searching for Taxonomy-based Similarity Measures for Medical Data, In ''Proceedings of the 7th Balkan Conference on Informatics (BCI 2015)'', art. nr. 27, ACM Press. * Istrate, G., Bonchiş, C. Partition into heapable sequences, heap tableaux and a multiset extension of Hammersley’s process. ''Proceedings of the 26th Annual Symposium on Combinatorial Pattern Matching (CPM 2015)'', Lecture Notes in Computer Science 9133, pp. 261-271. Springer Verlag, 2015. * Onchiş, D.M., Goţia, S.L., Enhancing dental radiographic images in spline-type spaces, ''Proceedings - 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2014'', 7034730, pp. 559-564, 2015 * Onchiş, D.M., Frunzăverde, D., Găianu, M., Ciubotariu, R., Multi-phase identification in microstructures images using a GPU accelerated fuzzy C-Means segmentation, ''Proceedings - 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2014'', 7034736, pp. 602-607, 2015 * Tirea, M., Negru, V., Intelligent stock market analysis system - A fundamental and macro-economical analysis approach, ''Proceedings - 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2014'', 7034725, pp. 519-526, 2015 |
* 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