welcome: please sign in
location: Diff for "Publications"
Differences between revisions 52 and 156 (spanning 104 versions)
⇤ ← Revision 52 as of 2016-07-20 06:35:23 →
Size: 5427
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:
||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:
 * Dundua, B., Florido, M., Kutsia, T., Marin, M., CLP (H): Constraint logic programming for hedges, Theory and Practice of Logic Programming 16 (02), 141-162, 2016
 * Eraşcu, M., Hong, H., Real quantifier elimination for the synthesis of optimal numerical algorithms (Case study: Square root computation), Journal of Symbolic Computation 75, pp. 110-126, 2016
 * Petcu D., Iuhasz, G., Pop D., Talia D., Carretero J., Prodan R., Fahringer T. et al., On Processing Extreme Data, Scalable Computing: Practice and Experience 16 (4), 467-490, 2016
 * Pop, D., Iuhasz, G., Petcu, D., Distributed Platforms and Cloud Services: Enabling Machine Learning for Big Data, Data Science and Big Data Computing, 139-159, 2016

==== Book chapters ====
 * Pop, D.,Echeverria, A., Petcu, D., Conesa, G., Enabling Open and Collaborative Public Service Advertising through Cloud Technologies, in Cloud Computing Technologies for Connected Government, DOI: 10.4018/978-1-4666-8629-8.ch011, 2016		  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 17: Line 19:
 * DiNitto E., Casale G., Petcu D., On MODAClouds’ Toolkit Support for DevOps, Advances in Service-Oriented and Cloud Computing: Workshops of ESOCC 2015, Taormina, Italy, September 15-17, 2015, Revised Selected Papers, vol 567, pp.430, 2016
 * 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
 * Drămnesc, I., Jebelean, T., Stratulat, S., A case study on algorithm discovery from proofs: The insert function on binary trees, 2016 IEEE 11th International Symposium on Applied Computational Intelligence and Informatics (SACI), 231-236, 2016
 * Dramnesc, I., Jebelean, T., Stratulat, S., Combinatorial Techniques for Proof-Based Synthesis of Sorting Algorithms, Proceedings - 17th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2015,7426074, pp. 137-144, 2016
 * Fortis, A.E., Balint, S., Numerical Investigations of Equilibriums in a Flight with High Angle of Attack,Proceedings - 17th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2015, 7426066, pp. 85-89, 2016
 * Irimie, B.-C., Petcu, D., Scalable and Fault Tolerant Monitoring of Security Parameters in the Cloud, Proceedings - 17th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2015, 7426097, pp. 289-295, 2016
 * Istrate, G., Bonchiş, C., Dinu, L.P., The minimum entropy submodular set cover problem, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)9618, pp. 295-306, 2016
 * Istrate, G., Bonchis, C., Heapability, Interactive Particle Systems, Partial Orders: Results and Open Problems, International Workshop on Descriptional Complexity of Formal Systems, pp 18-28, 2016
 * Ivascu, T., An Energy Efficient Intelligent Wireless Body Area Network for Real-Time Vital Signs Monitoring, Proceedings - 17th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2015, 7426094, pp. 265-270, 2016
 * Ivascu, T., Manate, B., Negru, V., A Multi-agent Architecture for Ontology-Based Diagnosis of Mental Disorders, Proceedings - 17th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2015, 7426113, pp. 423-430, 2016
 * Marin, M., Kutsia, T., Dundua, B., A Rewrite-based Computational Model for Functional Logic Programming, Procs. of SCSS, 95-106, 2016
 * Panica S., Petcu D., Unattended Deployment of Enabling Platforms for Cloud-Based Applications, 2016 30th International Conference on Advanced Information Networking and Applications Workshops (WAINA), 144-149, 2016
 * Radoaca, A., Simple Venn Diagrams for Multisets, Proceedings - 17th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2015, 7426080, pp. 181-184, 2016
 * Radoaca, A., Properties of Multisets Compared to Sets, Proceedings - 17th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2015, 7426081, pp. 187-188
 * Radoaca, A., Properties of Multiset Orders by Minimal and Maximal Submultisets, Proceedings - 17th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2015, 7426075, pp. 145-152
 * Tirea, M., Negru, V., Text Mining News System - Quantifying Certain Phenomena Effect on the Stock Market Behavior, Proceedings - 17th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2015, 7426109, pp. 391-398, 2016
 * Tirea, M., Negru, V., Stock Market Trading Strategies Applying Risk and Decision Analysis Models for Detecting Financial Turbulence, Proceedings - 17th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2015, 7426086, pp. 216-223, 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 (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)