Write in a clean editor, then format for International Journal of Computer Mathematics Computer Systems Theory in one click — DocuGuru applies the official Taylor & Francis template with author–year references and exports a submission-ready PDF plus the editable LaTeX source. Free to start.
International Journal of Computer Mathematics Computer Systems Theory is a peer-reviewed journal published by Taylor & Francis, covering Advanced Graph Theory Research, Interconnection Networks and Systems, Graph theory and applications.
| Publisher | Taylor & Francis |
|---|---|
| Reference style | Author–year (Chicago, T&F) Author–year — (Smith, 2023) in the text Smith, Ada, Ben Jones, and Cara Lee. 2023. "A Representative Article Title." International Journal of Computer Mathematics Computer Systems Theory 12 (3): 45–58.
Formats any DOI in International Journal of Computer Mathematics Computer Systems Theory style. No sign-up. |
| Publishes research in | Advanced Graph Theory Research Interconnection Networks and Systems Graph theory and applications graph theory and CDMA systems Graph Labeling and Dimension Problems |
| ISSN | 2379-9927 |
| Citation impact (2-yr) | 0.4 |
| h-index | 12 |
| i10-index | 14 |
| Total citations | 528 |
| Top institutions publishing here | Fujian Normal University |
| Journal website | www.tandfonline.com |
| You get | A submission-ready PDF and the editable LaTeX source — ready to submit. |
Citations each year’s papers have accumulated so far — the most recent years are still building up.
One of cloud computing’s fundamental problems is the balancing of loads, which is essential for evenly distributing the workload across all nodes. This study proposes a new load balancing algorithm, which combines maximum-minimum and round-robin (MMRR) algorithm so that tasks with long execution time are allocated using maximum-minimum and tasks with lowest execution task will…
The LESS signature scheme, introduced in 2020, represented a fresh start for code-based signatures. In this paper we explore advanced functionalities for signature schemes, stemming from the work of LESS. First, we adapt a recent protocol of Beullens et al. to obtain a construction for (linkable) ring signatures. Then, we realize an identity-based signature scheme…
A system is t/t-diagnosable if, provided the number of faulty processors is bounded by t, all faulty processors can be isolated within a set of size at most t with at most one fault-free processor mistaken as a faulty one. The pessimistic diagnosability of a system G, denoted by , is the maximal number of…
In this paper, without transforming the original inertial neural networks into the first-order differential equation by some variable substitutions, fuzziness, time-varying and distributed delays are introduced into inertial networks and the existence, the uniqueness and the asymptotic stability for the neural networks are investigated. The existence of a unique equilibrium point is proved by using…
Automatic sequences such as the Thue–Morse sequence and the Rudin–Shapiro sequence are highly predictable and thus not suitable in cryptography. In particular, they have small expansion complexity. However, they still have a large maximum order complexity. Certain subsequences of automatic sequences are not automatic anymore and may be attractive candidates for applications in cryptography. In…
