|
Size: 5427
Comment:
|
Size: 2950
Comment:
|
| Deletions are marked like this. | Additions are marked like this. |
| Line 1: | Line 1: |
| ||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]] || | Previous years (20xx): || [[Publications/2019|19]] || [[Publications/2018|18]] ||[[Publications/2017|17]] || [[Publications/2016|16]] ||[[Publications/2015|15]] || ||[[Publications/2014|14]] ||[[Publications/2013|13]] ||[[Publications/2012|12]] ||[[Publications/2011|11]] ||[[Publications/2010|10]] || ||[[Publications/2009|09]] ||[[Publications/2008|08]] ||[[Publications/2007|07]] ||[[Publications/2006|06]] || || |
| Line 4: | Line 8: |
| == Recent Publications == |
== 2020 == |
| Line 8: | Line 10: |
| * Dundua, B., Florido, M., Kutsia, T., Marin, M., CLP (H): Constraint logic programming for hedges, Theory and Practice of Logic Programming 16 (02), 141-162, 2016 * 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 * Petcu D., Iuhasz, G., Pop D., Talia D., Carretero J., Prodan R., Fahringer T. et al., On Processing Extreme Data, Scalable Computing: Practice and Experience 16 (4), 467-490, 2016 * Pop, D., Iuhasz, G., Petcu, D., Distributed Platforms and Cloud Services: Enabling Machine Learning for Big Data, Data Science and Big Data Computing, 139-159, 2016 ==== Book chapters ==== * Pop, D.,Echeverria, A., Petcu, D., Conesa, G., Enabling Open and Collaborative Public Service Advertising through Cloud Technologies, in Cloud Computing Technologies for Connected Government, DOI: 10.4018/978-1-4666-8629-8.ch011, 2016 |
1. Turcu, F., Bonchiș C., Najim M. Vector partitions, multi-dimensional Faà di Bruno formulae and generating algorithms. Discrete Applied Mathematics, vol 272(2020), pp. 90-99, Elsevier. 1. Balogh, J., Bonchiş C., Diniş D., Istrate G., Todinca I. On the heapability of finite partial orders. Discrete Mathematics and Theoretical Computer Science, vol 22, no 1 (2020), paper #17. |
| Line 17: | Line 14: |
| * DiNitto E., Casale G., Petcu D., On MODAClouds’ Toolkit Support for DevOps, Advances in Service-Oriented and Cloud Computing: Workshops of ESOCC 2015, Taormina, Italy, September 15-17, 2015, Revised Selected Papers, vol 567, pp.430, 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 * Drămnesc, I., Jebelean, T., Stratulat, S., A case study on algorithm discovery from proofs: The insert function on binary trees, 2016 IEEE 11th International Symposium on Applied Computational Intelligence and Informatics (SACI), 231-236, 2016 * Dramnesc, I., Jebelean, T., Stratulat, S., Combinatorial Techniques for Proof-Based Synthesis of Sorting Algorithms, Proceedings - 17th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2015,7426074, pp. 137-144, 2016 * Fortis, A.E., Balint, S., Numerical Investigations of Equilibriums in a Flight with High Angle of Attack,Proceedings - 17th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2015, 7426066, pp. 85-89, 2016 * Irimie, B.-C., Petcu, D., Scalable and Fault Tolerant Monitoring of Security Parameters in the Cloud, Proceedings - 17th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2015, 7426097, pp. 289-295, 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 * Istrate, G., Bonchis, C., Heapability, Interactive Particle Systems, Partial Orders: Results and Open Problems, International Workshop on Descriptional Complexity of Formal Systems, pp 18-28, 2016 * Ivascu, T., An Energy Efficient Intelligent Wireless Body Area Network for Real-Time Vital Signs Monitoring, Proceedings - 17th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2015, 7426094, pp. 265-270, 2016 * Ivascu, T., Manate, B., Negru, V., A Multi-agent Architecture for Ontology-Based Diagnosis of Mental Disorders, Proceedings - 17th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2015, 7426113, pp. 423-430, 2016 * Marin, M., Kutsia, T., Dundua, B., A Rewrite-based Computational Model for Functional Logic Programming, Procs. of SCSS, 95-106, 2016 * Panica S., Petcu D., Unattended Deployment of Enabling Platforms for Cloud-Based Applications, 2016 30th International Conference on Advanced Information Networking and Applications Workshops (WAINA), 144-149, 2016 * Radoaca, A., Simple Venn Diagrams for Multisets, Proceedings - 17th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2015, 7426080, pp. 181-184, 2016 * Radoaca, A., Properties of Multisets Compared to Sets, Proceedings - 17th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2015, 7426081, pp. 187-188 * Radoaca, A., Properties of Multiset Orders by Minimal and Maximal Submultisets, Proceedings - 17th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2015, 7426075, pp. 145-152 * Tirea, M., Negru, V., Text Mining News System - Quantifying Certain Phenomena Effect on the Stock Market Behavior, Proceedings - 17th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2015, 7426109, pp. 391-398, 2016 * Tirea, M., Negru, V., Stock Market Trading Strategies Applying Risk and Decision Analysis Models for Detecting Financial Turbulence, Proceedings - 17th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2015, 7426086, pp. 216-223, 2016 |
1. Istrate G., Bonchiș C., Gatina C. It's not whom you know, it's what you (or your friends) can do: Coalitional Frameworks for Network Centralities. Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, AAMAS'2020, pp. 566-574. IFAAMAS and ACM Press. 1. Besik Dundua, Temur Kutsia, Mircea Marin and Cleopatra Pau. Constraint Solving over Multiple Similarity Relations. In Proceedings of 5-th International Conference on Formal Structures for Computation and Deduction (FSCD 2020). In print. 1. Mircea Marin, Besik Dundua and Temur Kutsia. A Rule-based System for Computation and Deduction in Mathematica. In Proceedings of 13-th International Workshop on Rewriting Logic And Its Applications (WRA 2020). In print. 1. B. Dundua, T. Kutsia, M. Marin, C. Pau. Extending the \rho Log calculus with proximity relations. In Proceedings of the Fourth International Conference on Applications of Mathematics and Informatics in Natural Sciences and Engineering (AMINSE 2019), Springer Proceedings in Mathematics & Statistics. In print. 1. B. Dundua, T. Kutsia, M. Marin, and M. Rukhaia. Specification and Analysis of ABAC Policies in a Rule-Based Framework. In Proceedings of the Fourth International Conference on Applications of Mathematics and Informatics in Natural Sciences and Engineering (AMINSE 2019), Springer Proceedings in Mathematics & Statistics. In print. 1. K. Chandrasekaran, E. Grigorescu, G. Istrate, S. Kulkarni, Y.-S. Lin, M. Zhu. The Maximum Binary Tree Problem. In Proceedings of the 28th European Symposium on Algorithms (ESA'2020), Leibniz Institute Proceedings in Computer Science (LIPICS), vol. 173, paper #30. 1. Karthekeyan Chandrasekaran, Elena Grigorescu, Gabriel Istrate, Shub- hang Kulkarni, Young-San Lin, Minshen Zhu. Fixed-Parameter Algorithms for Longest Heapable Subsequence and Maximum Binary Tree. In Proceedings of the 15th International Symposium on Parameterized and Exact Computation (IPEC’2020), Leibniz Institute Proceedings in Computer Science (LIPICS), to appear. |
Previous years (20xx):
2020
Journal papers
- Turcu, F., Bonchiș C., Najim M. Vector partitions, multi-dimensional Faà di Bruno formulae and generating algorithms. Discrete Applied Mathematics, vol 272(2020), pp. 90-99, Elsevier.
- Balogh, J., Bonchiş C., Diniş D., Istrate G., Todinca I. On the heapability of finite partial orders. Discrete Mathematics and Theoretical Computer Science, vol 22, no 1 (2020), paper #17.
Conference papers
- Istrate G., Bonchiș C., Gatina C. It's not whom you know, it's what you (or your friends) can do: Coalitional Frameworks for Network Centralities. Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, AAMAS'2020, pp. 566-574. IFAAMAS and ACM Press.
- Besik Dundua, Temur Kutsia, Mircea Marin and Cleopatra Pau. Constraint Solving over Multiple Similarity Relations. In Proceedings of 5-th International Conference on Formal Structures for Computation and Deduction (FSCD 2020). In print.
- Mircea Marin, Besik Dundua and Temur Kutsia. A Rule-based System for Computation and Deduction in Mathematica. In Proceedings of 13-th International Workshop on Rewriting Logic And Its Applications (WRA 2020). In print.
B. Dundua, T. Kutsia, M. Marin, C. Pau. Extending the \rho Log calculus with proximity relations. In Proceedings of the Fourth International Conference on Applications of Mathematics and Informatics in Natural Sciences and Engineering (AMINSE 2019), Springer Proceedings in Mathematics & Statistics. In print.
B. Dundua, T. Kutsia, M. Marin, and M. Rukhaia. Specification and Analysis of ABAC Policies in a Rule-Based Framework. In Proceedings of the Fourth International Conference on Applications of Mathematics and Informatics in Natural Sciences and Engineering (AMINSE 2019), Springer Proceedings in Mathematics & Statistics. In print.
- K. Chandrasekaran, E. Grigorescu, G. Istrate, S. Kulkarni, Y.-S. Lin, M. Zhu. The Maximum Binary Tree Problem. In Proceedings of the 28th European Symposium on Algorithms (ESA'2020), Leibniz Institute Proceedings in Computer Science (LIPICS), vol. 173, paper #30.
- Karthekeyan Chandrasekaran, Elena Grigorescu, Gabriel Istrate, Shub- hang Kulkarni, Young-San Lin, Minshen Zhu. Fixed-Parameter Algorithms for Longest Heapable Subsequence and Maximum Binary Tree. In Proceedings of the 15th International Symposium on Parameterized and Exact Computation (IPEC’2020), Leibniz Institute Proceedings in Computer Science (LIPICS), to appear.