welcome: please sign in
location: Diff for "Publications"
Differences between revisions 136 and 156 (spanning 20 versions)
⇤ ← Revision 136 as of 2020-09-22 13:37:56 →
Size: 4137
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:
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]] || ||		 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:
== 2020 ==

== 2021 ==
Line 10: Line 11:
 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.
 1. R Garrappa, E Kaslik. Stability of fractional-order systems with Prabhakar derivatives. Nonlinear Dynamics, 1-12.
 1. CA Popa, E Kaslik. Finite-Time Mittag–Leffler Synchronization of Neutral-Type Fractional-Order Neural Networks with Leakage Delay and Time-Varying Delays. Mathematics 8 (7), 1146.
 1. R Garrappa, E Kaslik. On initial conditions for fractional delay differential equations. Communications in Nonlinear Science and Numerical Simulation, 105359.
 1. E Kaslik, M Neamţu. Dynamics of a tourism sustainability model with distributed delay. Chaos, Solitons & Fractals 133, 109610.
 		  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 19: Line 19:
 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.

---- /!\ '''Edit conflict - other version:''' ----
 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), vol. 180, to appear.

---- /!\ '''Edit conflict - your version:''' ----
 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), vol. 180, to appear.

---- /!\ '''End of edit conflict''' ----		  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-02-24 11:37:59 by DanielaZaharie)