|
Size: 3846
Comment:
|
Size: 2572
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 (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 6: | Line 10: |
| * 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 |
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 18: | Line 14: |
| * 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. * 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 |
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. |
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.