Algorithmics: theory & practice
Algorithmics: theory & practice
Handbook of theoretical computer science (vol. B)
An extensional treatment of lazy data flow deadlock
Selected papers of the workshop on Topology and completion in semantics
Computing tomorrow
Domination of aggregation operators and preservation of transitivity
International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems
On the aggregation of some classes of fuzzy relations
Technologies for constructing intelligent systems
Algorithms Sequential And Parallel: A Unified Approach (Charles River Media Computer Engineering (Hardcover))
Aggregation of infinite sequences
Information Sciences: an International Journal
An Application of Generalized Complexity Spaces to Denotational Semantics via the Domain of Words
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Aggregation of asymmetric distances in Computer Science
Information Sciences: an International Journal
Fuzzy Sets and Systems
Norms induced from OWA operators
IEEE Transactions on Fuzzy Systems
Generalized Distance Functions in the Theory of Computation
The Computer Journal
International Journal of Computer Mathematics - APPLICATIONS OF COMPUTATIONAL MATHEMATICS IN SCIENCE AND ENGINEERING
Discrete Choquet Integral as a Distance Metric
IEEE Transactions on Fuzzy Systems
The average running time of an algorithm as a midpoint between fuzzy sets
Mathematical and Computer Modelling: An International Journal
On aggregation of normed structures
Mathematical and Computer Modelling: An International Journal
Quasi-Metrics And The Semantics Of Logic Programs
Fundamenta Informaticae
International Journal of Computer Mathematics - COMPUTATIONAL AND MATHEMATICAL METHODS IN SCIENCE AND ENGINEERING
Hi-index | 0.20 |
The problem of how to merge, by means of a function, a family of metrics into a single one was studied deeply by J. Borsik and J. Dobos [On a product of metric spaces, Math. Slovaca31 (1981) 193-205]. Motivated by the utility of quasi-metrics in Computer Science, the Borsik and Dobos study was extended to the quasi-metric context in such a way that a general description of how to combine through a function a family of quasi-metrics in order to obtain a single one as output was provided by G. Mayor and O. Valero [Aggregation of asymmetric distances in Computer Science, Inform. Sci.180 (2010) 803-812]. In this paper, inspired by the fact that fixed point theory provides an efficient tool in many fields of applied sciences, we have proved fixed point theorems for a new type of contractions, that we have called projective @F-contractions, defined between quasi-metric spaces that have been obtained via the so-called quasi-metric aggregation functions. Moreover, we show that the new fixed point results are useful to discuss, on the one hand, the complexity of a collection of recursive programs whose running times of computing hold a coupled system of recurrence equations and, on the other hand, to analyze simultaneously the complexity and the correctness of recursive algorithms that perform a computation by means of a recursive denotational specification.