welcome: please sign in
location: Diff for "Publications"
Differences between revisions 77 and 156 (spanning 79 versions)
⇤ ← Revision 77 as of 2018-10-08 05:34:29 →
Size: 2792
Editor: DanielaZaharie
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/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/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 3: Line 6:
== Recent Publications (2018) ==
Line 5: Line 7:


== 2021 ==
Line 6: Line 11:

 * Aisenberg, J, Bonet, M.L., Buss, S,, Crăciun, A., Istrate, G., Short proofs of the Kneser–Lovász coloring principle, Information and Computation, vol. 461(2), pp. 296-310, 2018.
 * Bonchiş, C., Kaslik, E., Roşu, F., HPC optimal parallel communication algorithm for the simulation of fractional-order systems, Journal of Supercomputing, pp. 1-12, 2018
 * Drăgan, I., Selea, T., Fortiş, T.-F., Towards the integration of a HPC build system in the cloud ecosystem, Advances in Intelligent Systems and Computing 611, pp. 916-925, 2018
 * Gravvanis, G.A., Morrison, J.P., Petcu, D., Lynn, T., Filelis-Papadopoulos, C.K., Special Issue: Recent trends in cloud computing, Future Generation Computer Systems 79, pp. 700-702, 2018
 * Măruşter, Ş., Măruşter, L., Sharp estimation of local convergence radius for the Picard iteration, Journal of Fixed Point Theory and Applications 20(1),28
 * Onchis, D.M., Zappalà, S., Realizable algorithm for approximating Hilbert–Schmidt operators via Gabor multipliers, Journal of Computational and Applied Mathematics 337, pp. 119-124, 2018
 * Onchis, D., Zappalà, S., Stability of spline-type systems in the Abelian case, Symmetry 10(1),7, 2017
 * Popa, C.-A., Kaslik, E., Multistability and multiperiodicity in impulsive hybrid quaternion-valued neural networks with mixed delays, Neural Networks 99, pp. 1-18, 2018
 * Pungila, C., Negru, V., FAST: A high-performance architecture for heterogeneous big data forensics, Advances in Intelligent Systems and Computing, 649, pp. 618-627, 2018

==== 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 (to appear, 2021). Journal version of paper in Proceedings of the 28th European Symposium on Algorithms (ESA'2020).
Line 20: Line 19:

 * Bonchiș, C., Istrate, G., Rochian, V. The language (and series) of Hammersley-type processes. In Proceedings of the 8th Conference on Machines, Computations and Universality (MCU’2018), June 28-30, Fontainebleau, France. Lecture Notes in Computer Science, vol 10881, pp. 69-87, Springer Verlag, 2018.
 * Istrate, G. Stochastic Stability in Schelling’s Segregation Model with Markovian Asynchronous Update. In Proceedings of the Fifth International Workshop on Asynchronous Cellular Automata and Asynchronous Discrete Models (ACA’2018), satellite workshop of ACRI’2018, Lake Como, Italy, September 17-21. Lecture Notes in Computer Science, Springer Verlag, 2018.
 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)