4 citations · 4 across the 4 of their papers we have counts for
4 papers
HPC optimal parallel communication algorithm for the simulation of fractional-order systems
Cosmin Bonchis, Eva Kaslik, Florin Rosu
A parallel numerical simulation algorithm is presented for fractional-order systems involving Caputo-type derivatives, based on the Adams-Bashforth-Moulton (ABM) predictor-correcto…
Partition into heapable sequences, heap tableaux and a multiset extension of Hammersley's process
Gabriel Istrate, Cosmin Bonchis
We investigate partitioning of integer sequences into heapable subsequences (previously defined and established by Mitzenmacher et al). We show that an extension of patience sortin…
A Parametric Worst-Case Approach to Fairness in TU-Cooperative Games
Cosmin Bonchis, Gabriel Istrate
We propose a parametric family of measures of fairness in allocations of TU-cooperative games. Their definition is based on generalized Renyi Entropy, is related to the Cowell-Kuga…
Improved approximation algorithms for low-density instances of the Minimum Entropy Set Cover Problem
Cosmin Bonchis, Gabriel Istrate
We study the approximability of instances of the minimum entropy set cover problem, parameterized by the average frequency of a random element in the covering sets. We analyze an a…