welcome: please sign in
location: Diff for "Publications"
Differences between revisions 107 and 133 (spanning 26 versions)
Revision 107 as of 2020-01-14 20:41:40
Size: 4339
Comment:
Revision 133 as of 2020-09-19 10:55:21
Size: 2980
Comment:
Deletions are marked like this. Additions are marked like this.
Line 1: Line 1:
||<tablewidth="731px" tableheight="30px">Previous years: ||[[Publications/2018|2018]] ||[[Publications/2017|2017]] ||[[Publications/2016|2016]] ||[[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:
== 2019 ==
=== Journal papers ===
 1. Balint, A.M., Balint, S., Tanasie, L., An axis symmetric 2D description of the growth process of a single crystal hollow tube, grown from the melt by pulling down method. Part.1, Mathematics in Engineering, Science and Aerospace 10(1), pp. 143-162, 2019
 1. Balint, A.M., Balint, S., Tanasie, L., An axis symmetric 2D description of the growth process of a single crystal hollow tube, grown from the melt, by pulling down method. Part 2, Mathematics in Engineering, Science and Aerospace 10(1), pp. 163-174, 2019
 1. Bonchiş, C., Kaslik, E., Roşu, F., HPC optimal parallel communication algorithm for the simulation of fractional-order systems, Journal of Supercomputing, 75(3), pp. 1014-1025, 2019
 1. Brandibur, O., Kaslik, E., Stability Analysis of Two-Dimensional Incommensurate Systems of Fractional-Order Differential Equations, Trends in Mathematics, pp. 77-92, 2019
 1. Drăgan, I., Iuhasz, G., Petcu, D., A Scalable Platform for Monitoring Data Intensive Applications, Journal of Grid Computing (in print), 2019
 1. Drămnesc, I., Jebelean, T., Stratulat, Mechanical synthesis of sorting algorithms for binary trees by logic and combinatorial techniques Journal of Symbolic Computation, 90, pp. 3-41, 2019
 1. Dăianu, D.M., Mîndruţă, C., Polynomials of Arithmetically Homogeneous Functions: Stability and Hyperstability, Results in Mathematics,74(1),59, 2019
 1. Garrappa, R., Kaslik, E., Popolizio, M., Evaluation of fractional integrals and derivatives of elementary functions: Overview and tutorial, Mathematics, 7(5),407, 2019
 1. Pungila, C., Negru, V., Accelerating DNA Biometrics in Criminal Investigations Through GPU-Based Pattern Matching, Advances in Intelligent Systems and Computing, 771, pp. 459-468, 2019
== 2020 ==
==== Journal papers ====
 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 16: Line 13:
=== Conference papers ===
 1. Drămnesc, I., Jebelean, T., Proof–based synthesis of sorting algorithms using multisets in Theorema, Electronic Proceedings in Theoretical Computer Science, EPTCS, 303, pp. 76-91, 2019
 1. Istrate, G., Bonchiș, C., Brîndușescu, A. Attacking power indices by manipulating player reliability. In Proceedings of the 18th International Conference on Autonomous Agents and Multiagent Systems (AAMAS'2019). Montreal, Canada, pp. 538-54, ACM Press, 2019
 1. Iuhasz, G., Petcu, D., Perspectives on Anomaly and Event Detection in Exascale Systems, Proceedings - 5th IEEE International Conference on Big Data Security on Cloud, BigDataSecurity 2019, 5th IEEE International Conference on High Performance and Smart Computing, HPSC 2019 and 4th IEEE International Conference on Intelligent Data and Security, IDS 2019, 8819496, pp. 225-229, 2019
 1. Onchis, D.M., Istin, C., Real, P., Refined Deep Learning for Digital Objects Recognition via Betti Invariants, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 11678 LNCS, pp. 613-621, 2019
 1. Real, P., Molina-Abril, H., Díaz del Río, F., Onchis, D., Generating second order (co)homological information within at-model context, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 11382 LNCS, pp. 68-81, 2019
 1. Real, P., Molina-Abril, H., Díaz-del-Río, F., Blanco-Trejo, S., Onchis, D., Enhanced Parallel Generation of Tree Structures for the Recognition of 3D Images, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 11524 LNCS, pp. 292-301, 2019.
 1. Adrian Crăciun, Georgiana Șurlea. Grobner Bases with Reduction Machines. In Proceedings of FROM 2019, Electronic Proceedings in Theoretical Computer Science (EPTCS) vol. 303, pp. 61-75, 2019.
 1. B Dundua, T Kutsia, M Marin. , Springer Verlag.
 1. M Marin, T Kutsia, B Dundua.
==== Conference papers ====
 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. Karthekeyan Chandrasekaran, Elena Grigorescu, Gabriel Istrate, Shubhang Kulkarni, Young-San Lin, Minshen 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, Shubhang 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):

19

18

17

16

15

14

13

12

11

10

09

08

07

06

2020

Journal papers

  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.
  2. 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

  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.
  2. 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.
  3. 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.
  4. 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.

  5. 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.

  6. Karthekeyan Chandrasekaran, Elena Grigorescu, Gabriel Istrate, Shubhang Kulkarni, Young-San Lin, Minshen 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.
  7. Karthekeyan Chandrasekaran, Elena Grigorescu, Gabriel Istrate, Shubhang 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.

Publications (last edited 2024-10-13 10:44:20 by DanielaZaharie)