welcome: please sign in
location: Diff for "Publications"
Differences between revisions 47 and 158 (spanning 111 versions)
⇤ ← Revision 47 as of 2016-04-22 09:22:24 →
Size: 729
Editor: DanielaZaharie
Comment:
← Revision 158 as of 2021-06-22 07:17:14 → ⇥
Size: 2967
Editor: GabrielIstrate
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/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 4: Line 7:
== Recent Publications ==
Line 7: Line 9:
== 2021 ==
Line 8: Line 11:
   ==== Book chapters ====
  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 https://doi.org/10.1007/s00453-021-00836-5, 2021. Journal version of paper in Proceedings of the 28th European Symposium on Algorithms (ESA'2020).
Line 14: Line 19:

* 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 		 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 no. 335, pp. 213-228, 221.
 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), vol. 198, paper #131, pp.131:1-131:21.
 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 https://doi.org/10.1007/s00453-021-00836-5, 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 no. 335, pp. 213-228, 221.
  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), vol. 198, paper #131, pp.131:1-131:21.
  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)