welcome: please sign in
location: Diff for "Publications"
Differences between revisions 111 and 156 (spanning 45 versions)
⇤ ← Revision 111 as of 2020-01-15 10:46:38 →
Size: 5312
Editor: GabrielIstrate
Comment:
← Revision 156 as of 2021-05-17 04:14:10 → ⇥
Size: 2894
Editor: GabrielIstrate
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]] ||

== 2020 ==
==== Journal papers ====
 1. Flavius Turcu, Cosmin Bonchiș, Mohamed Najim. Vector partitions, multi-dimensional Faà di Bruno formulae and generating algorithms. Discrete Applied Mathematics, vol 272(2020), pp. 90-99, Elsevier.		 Previous years (20xx):
||[[Publications/2020|20]] ||[[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 8: Line 7:
  ==== Conference papers ====
 1. Gabriel Istrate, Cosmin Bonchiș, Claudiu Gatina. It's not whom you know, it's what you (or your friends) can do: Coalitional Frameworks for Network Centralities. To appear in the Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, AAMAS'2020, Auckland, New Zealand. ACM Press.
Line 13: Line 9:
== 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		 == 2021 ==
==== Journal papers ====
 1. Drămnesc, I., Jebelean, T., Synthesis of sorting algorithms using multisets in Theorema, Journal of Logical and Algebraic Methods in Programming, 2021, 119, 100635
 1. Eraşcu, M., Micota, F., Zaharie, D., Scalable optimal deployment in the cloud of component-based applications using optimization modulo theory, mathematical programming and symmetry breaking, Journal of Logical and Algebraic Methods in Programming, 2021, 121, 100664
 1. Kaslik, E., Neamţu, M., Vesa, L.F., Global stability analysis of an unemployment model with distributed delay, Mathematics and Computers in Simulation, 2021, 185, pp. 535–546
 1. Miok, K., Škrlj, B., Zaharie, D., Robnik-Šikonja, M., To BAN or Not to BAN: Bayesian Attention Networks for Reliable Hate Speech Detection, Cognitive Computation, 2021
 1. Onchis, D.M., Gillich, G.-R., Stable and explainable deep learning damage prediction for prismatic cantilever steel beam, Computers in Industry, 2021, 125, 103359
 1. Karthekeyan Chandrasekaran, Elena Grigorescu, Gabriel Istrate, Shubhang Kulkarni, Young-San Lin, Minshen Zhu. The Maximum Binary Tree Problem. Algorithmica (to appear, 2021). Journal version of paper in Proceedings of the 28th European Symposium on Algorithms (ESA'2020).
Line 25: Line 18:
=== 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. Variadic Equational Matching. In Proceedings of the 12th International Conference on Intelligent Computer Mathematics (CICM'19), Lecture Notes in Artificial Intelligence, vol. 11617, pp. 77-92, Springer Verlag.
 1. M Marin, T Kutsia, B Dundua. A Rule-based Approach to the Decidability of Safety of ABACα. In Proceedings of the 24th ACM Symposium on Access Control Models and Technologies (SACMAT'2019), ACM Press. 		==== Conference papers ====
 1. G. Istrate. Models We Can Trust: Towards a Systematic Discipline of (Agent-Based) Model Interpretation and Validation. Proceedings of the 20th International Conference on Autonomous Agents and Multiagent Systems, AAMAS'2021, pp.6-11. IFAAMAS and ACM Press.
 1. G. Istrate. Game-theoretic Models of Moral and Other-Regarding Agents. Proceedings of the 18th Conference on Theoretical Aspects of Rationality and Knowledge (TARK'2021), June 25-27, 2021, Tsinghua University, Beijing, China (online), Electronic Proceedings in Theoretical Computer Science (to appear).
 1. G. Istrate, C. Bonchis and A. Craciun. Kernelization, Proof Complexity and Social Choice. Proceedings of the 48th International Colloquium on Automata, Languages, and Programming (ICALP). July, 12 - 16 2021. Glasgow, Scotland (online), Leibniz International Proceedings in Informatics (LIPICS, to appear).
 1. Isabela Drămnesc, Tudor Jebelean. Synthesis of Merging algorithms on binary trees using multisets in Theorema. SACI'2021.
 1. Alexandra Fortiș, Florin Fortiș. Cloud computing projects: a bibliometric overview. AINA'2021, CCPI Workshop.

Previous years (20xx):

20

19

18

17

16

15

14

13

12

11

10

09

08

07

06

2021

Journal papers

  1. Drămnesc, I., Jebelean, T., Synthesis of sorting algorithms using multisets in Theorema, Journal of Logical and Algebraic Methods in Programming, 2021, 119, 100635
  2. Eraşcu, M., Micota, F., Zaharie, D., Scalable optimal deployment in the cloud of component-based applications using optimization modulo theory, mathematical programming and symmetry breaking, Journal of Logical and Algebraic Methods in Programming, 2021, 121, 100664
  3. Kaslik, E., Neamţu, M., Vesa, L.F., Global stability analysis of an unemployment model with distributed delay, Mathematics and Computers in Simulation, 2021, 185, pp. 535–546
  4. Miok, K., Škrlj, B., Zaharie, D., Robnik-Šikonja, M., To BAN or Not to BAN: Bayesian Attention Networks for Reliable Hate Speech Detection, Cognitive Computation, 2021
  5. Onchis, D.M., Gillich, G.-R., Stable and explainable deep learning damage prediction for prismatic cantilever steel beam, Computers in Industry, 2021, 125, 103359
  6. Karthekeyan Chandrasekaran, Elena Grigorescu, Gabriel Istrate, Shubhang Kulkarni, Young-San Lin, Minshen Zhu. The Maximum Binary Tree Problem. Algorithmica (to appear, 2021). Journal version of paper in Proceedings of the 28th European Symposium on Algorithms (ESA'2020).

Conference papers

  1. G. Istrate. Models We Can Trust: Towards a Systematic Discipline of (Agent-Based) Model Interpretation and Validation. Proceedings of the 20th International Conference on Autonomous Agents and Multiagent Systems, AAMAS'2021, pp.6-11. IFAAMAS and ACM Press.
  2. G. Istrate. Game-theoretic Models of Moral and Other-Regarding Agents. Proceedings of the 18th Conference on Theoretical Aspects of Rationality and Knowledge (TARK'2021), June 25-27, 2021, Tsinghua University, Beijing, China (online), Electronic Proceedings in Theoretical Computer Science (to appear).
  3. G. Istrate, C. Bonchis and A. Craciun. Kernelization, Proof Complexity and Social Choice. Proceedings of the 48th International Colloquium on Automata, Languages, and Programming (ICALP). July, 12 - 16 2021. Glasgow, Scotland (online), Leibniz International Proceedings in Informatics (LIPICS, to appear).
  4. Isabela Drămnesc, Tudor Jebelean. Synthesis of Merging algorithms on binary trees using multisets in Theorema. SACI'2021.
  5. Alexandra Fortiș, Florin Fortiș. Cloud computing projects: a bibliometric overview. AINA'2021, CCPI Workshop.

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