![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Theoretical Computer Science, Volume 817
Volume 817, May 2020
- Lila Kari:
Editorial. iii - Junlei Zhu, Yuehua Bu:
List r-dynamic coloring of sparse graphs. 1-11 - Chun Yan, Meixuan Li
, Wei Liu, Man Qi
:
Improved adaptive genetic algorithm for the vehicle Insurance Fraud Identification Model based on a BP Neural Network. 12-23 - Abir Smiti, Zied Elouedi:
Dynamic maintenance case base using knowledge discovery techniques for case based reasoning systems. 24-32 - Yunong Zhang, Huanchang Huang, Min Yang
, Jian Li:
Discrete-time formulation, control, solution and verification of pendulum systems with zeroing neural dynamics. 33-43 - Yunong Zhang, Min Yang
, Binbin Qiu, Jian Li, Mingjie Zhu:
From mathematical equivalence such as Ma equivalence to generalized Zhang equivalency including gradient equivalency. 44-54 - Juan Hu
, Hong Peng, Jun Wang, Wenping Yu:
kNN-P: A kNN classifier optimized by P systems. 55-65 - Mithun Basak, Laxman Saha
, Gour Kanta Das, Kalishankar Tiwary:
Fault-tolerant metric dimension of circulant graphs Cn(1, 2, 3). 66-79 - Chuangyin Dang, Yinyu Ye:
Erratum/Correction to "On the complexity of an expanded Tarski's fixed point problem under the componentwise ordering" [Theor. Comput. Sci. 732 (2018) 26-45]. 80 - Frédéric Blanqui
, Jean-Pierre Jouannaud, Mitsuhiro Okada:
Corrigendum to "Inductive-data-type systems" [Theoret. Comput. Sci. 272 (1-2) (2002) 41-68]. 81-82
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.