welcome: please sign in
location: Diff for "Publications"
Differences between revisions 77 and 133 (spanning 56 versions)
⇤ ← Revision 77 as of 2018-10-08 05:34:29 →
Size: 2792
Editor: DanielaZaharie
Comment:
← Revision 133 as of 2020-09-19 10:55:21 → ⇥
Size: 2980
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):
Line 3: Line 3:
== Recent Publications (2018) == || [[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 5: Line 7:

== 2020 ==
Line 6: Line 10:

 * 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. 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.
Line 20: Line 14:

 * 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. 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.
 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), to appear.

Previous years (20xx):

19

18

17

16

15

14

13

12

11

10

09

08

07

06

2020

Journal papers

  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.
  2. 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.

Conference papers

  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.
  2. 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.
  3. 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.

  4. 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.

  5. 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.

  6. 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.
  7. 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), to appear.

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