PSPramod Kumar Sethy

Pramod Kumar Sethy

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Pramod Kumar Sethy has a total of 7 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Length-driven communication in networks of evolutionary processors

    by Erzsébet Csuhaj-Varjú, Pramod Kumar Sethy

    In this paper, we introduce a new method of filtering strings before communication in networks of evolutionary processors which is based on whether the length of strings at the given node increases, decreases, or remains unchanged after an evolutionary step is performed. This filtering mechanism differs from the usual ones, where context conditions are considered, as it is based only on quantitative conditions (the lengths of the strings) and does not take into account qualitative properties of the string to be communicated. We prove that any recursively enumerable language can be obtained as the language of a variant of hybrid networks of evolutionary processors with this new communication mode. We also show how two well-known NP-complete problems can be solved by the new model in linear time.


  • Generalized Distributed Reaction Systems

    by Artiom Alhazov, Erzsébet Csuhaj-Varjú, Pramod Kumar Sethy

    In this paper, we introduce the notion of a generalized distributed reaction system with computations following the concept of the original reaction system: the resulting products in the individual components are obtained by applying rules which take into account the objects in the components of the system as reactants and inhibitors and yield results in specified components of the system. As specific variants, we investigate (i) generalized distributed reaction systems which look at all components for the presence or absence of objects, but the resulting products are only produced in the component the rule is assigned to as well as (ii) generalized distributed reaction systems which look for the presence or absence of objects only in the component the rule is assigned to, but the resulting products can be sent to specified components within the whole system. We first show how all these variants of generalized distributed reaction systems can be flattened to a reaction system having only one component. Moreover, we show how each of these two variants, which are restricted variants of the general model, can simulate even the general model. Finally, we prove that all these variants of generalized distributed reaction systems working with the standard, total parallel application of rules can be transferred into a usual reaction system working with the sequential application of rules.


  • CS-Based Energy-Efficient Service Allocation in Cloud

    by Sambit Kumar Mishra, Subham Kumar Sahoo, Chinmaya Kumar Swain, Abhishek Guru, Pramod Kumar Sethy, Bibhudatta Sahoo