welcome: please sign in
location: Diff for "Publications"
Differences between revisions 44 and 132 (spanning 88 versions)
⇤ ← Revision 44 as of 2016-04-22 09:06:00 →
Size: 6498
Editor: DanielaZaharie
Comment:
← Revision 132 as of 2020-09-18 19:12:17 → ⇥
Size: 2950
Editor: GabrielIstrate
Comment:
Deletions are marked like this. Additions are marked like this.
Line 1: Line 1:
||Previous years: ||[[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/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 8:
== Recent Publications == == 2020 ==
Line 6: Line 10:
 * Bouvry P., Mayer R., Muszynski J., Petcu D., Rauber A., Tempesti G., Trinh T., Varrette S., Resilience within Ultrascale Computing System: Challenges and Opportunities from Nesus Project, ''Supercomputing Frontiers and Innovations'' vol. 2, No. 2, 46-63, 2015
 * Carretero J., Distefano S., Petcu D., Pop, D., Rauber T., Ruenger G., Singh D.E., Energy-efficient Algorithms for Ultrascale Systems, ''Supercomputing Frontiers and Innovations'' vol 2, No. 2, 77-104, 2015
 * Da Costa G., Fahringer T., Rico-Gallego, J.-A., Grasso I., Hristov A., Karatza H.D., Lastovetsky A., Marozzo F., Petcu D., Stavrinides G. L., Talia D., Trunfio P., Astsatryan H., Exascale Machines Require New Programming Paradigms and Runtimes, ''Supercomputing Frontiers and Innovations'' vol 2, No. 2, 6-27, 2015
 * Drămnesc I., Jebelean T., Synthesis of list algorithms by mechanical proving, ''Journal of Symbolic Computation'' 69 (1), pp. 61-92, 2015
 * Dundua B., Florido M., Kutsia T., Marin, M. CLP (H): Constraint logic programming for hedges. ''Theory and Practice of Logic Programming'', 1-22, 2015.
 * Fortiş, T.-F., Munteanu, V.I., Negru, V., A taxonomic view of cloud computing services, ''International Journal of Computational Science and Engineering,'' 11 (1), pp. 17-28, 2015
 * Istrate G., Identifying almost-sorted permutations from TCP buffer dynamics. ''Scientific Annals of Computer Science'', XXV (1), pp. 133-154, 2015.
 * Istrate G., Reachability and Recurrence in a Modular Generalization of Annihilating Random Walks (and lights-out games) to hypergraphs. ''Theoretical Computer Science'', 580, pp. 83-93, 2015.
 * Istrate G., Two notes on generalized Darboux properties and related features of additive functions. ''Analele Universitatii Bucuresti Ser. Informatica, ''special issue dedicated to Professor Solomon Marcus' s 90th birthday , LXII (2), pp. 61-76, 2015.
 * Kutsia T., Marin M., Regular expression order-sorted unification and matching. ''Journal of Symbolic Computation'' 67, pp. 42-67 (2015)
 * Li J., Agathos A., Zaharie D., Bioucas-Dias J.M., Plaza A., Li X. Minimum volume simplex analysis: A fast algorithm for linear hyperspectral unmixing, ''IEEE Transactions on Geoscience and Remote Sensing'', 53 (9), 7090960, pp. 5067-5082, 2015
 * Măruşter, L., Măruşter, S., On the error estimation and T-stability of the Mann iteration, ''Journal of Computational and Applied Mathematics'' 276, pp. 110-116, 2015
 * Măruşter, S., Strong convergence of the mann iteration for demicontractive mappings, ''Applied Mathematical Sciences'', 9 (41-44), pp. 2061-2068, 2015
 * Muscalagiu, I., Popa, H.E., Negru, V., Improving the performances of asynchronous search algorithms in scale-free networks using the nogood processor technique, ''Computing and Informatics'', 34 (1), pp. 254-274, 2015
 * Pungila, C., Negru, V., Real-time hybrid compression of pattern matching automata for heterogeneous signature-based intrusion detection, Advances in Intelligent Systems and Computing 369, pp. 65-74, 2015
 * Pungila, C., Manate, B., Negru, V., A heterogeneous fault-resilient architecture for mining anomalous activity patterns in smart homes, Advances in Intelligent Systems and Computing, 369, pp. 133-143, 2015
 * Petcu D., Panica S., Crăciun C., Neagul M., Şandru C., Cloud resource orchestration within an open-source component-based platform as a service, '' Concurrency Computation'' 27 (9), pp. 2443-2469, 2015

==== Book chapters ====
 * Di Nitto E., Solberg A., Petcu D., On MODAClouds' Approach for Application Design and Execution on Multi-Clouds, M. Helfert, B. Donnelan (Eds.), ''European Project Space, Cases and Examples'', SCITEPRESS, 2015, Portugal, ISBN: 978-989-758-034-5, 49-60
 * Pop D., Echeverria A., Petcu D., Conesa G., Enabling Open and Collaborative Public Service Advertising through Cloud Technologies, In book: ''Cloud Computing Technologies for Connected Government'', Edition: 1, Chapter: 11, Publisher: IGI Global, Editors: Zaigham Mahmood, 268-290		  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 29: Line 14:
 * Aisenberg, J., Bonet, M.L., Buss, S., Crăciun, A., Istrate, G. Short Proofs of the Kneser-Lovász Coloring Principle. ''Proceedings of the 42nd International Colloquium on Automata, Languages, and Programming (ICALP 2015) '', Lecture Notes in Computer Science vol. 9135, pp. 44-55. 2015.
 * Casale G., Ardagna D., Artac M., Barbier F., Di Nitto E., Henry A., Iuhasz G., Joubert C., Merseguer J., Munteanu V. I., Perez J. F., Petcu D., Rossi M. , Sheridan C., Spais I., Vladusic D., DICE: Quality-Driven Development of Data-Intensive Cloud Applications, ''Proceedings of the 7th International Workshop on Modeling in Software Engineering (MiSE 2015)'', 16-17 May 2015, Florence, Italy.
 * Dogaru, R., Micota, F., Zaharie, D., Searching for Taxonomy-based Similarity Measures for Medical Data, In ''Proceedings of the 7th Balkan Conference on Informatics (BCI 2015)'', art. nr. 27, ACM Press.
 * Istrate, G., Bonchiş, C. Partition into heapable sequences, heap tableaux and a multiset extension of Hammersley’s process. ''Proceedings of the 26th Annual Symposium on Combinatorial Pattern Matching (CPM 2015)'', Lecture Notes in Computer Science 9133, pp. 261-271. Springer Verlag, 2015.
 * Onchiş, D.M., Goţia, S.L., Enhancing dental radiographic images in spline-type spaces, ''Proceedings - 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2014'', 7034730, pp. 559-564, 2015
 * Onchiş, D.M., Frunzăverde, D., Găianu, M., Ciubotariu, R., Multi-phase identification in microstructures images using a GPU accelerated fuzzy C-Means segmentation, ''Proceedings - 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2014'', 7034736, pp. 602-607, 2015
 * Tirea, M., Negru, V., Intelligent stock market analysis system - A fundamental and macro-economical analysis approach, ''Proceedings - 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2014'', 7034725, pp. 519-526, 2015		  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. K. Chandrasekaran, E. Grigorescu, G. Istrate, S. Kulkarni, Y.-S. Lin, M. 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, Shub- hang 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. K. Chandrasekaran, E. Grigorescu, G. Istrate, S. Kulkarni, Y.-S. Lin, M. 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, Shub- hang 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)