![](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
Transactions on Computational Science, Volume 27, 2016
- Marina L. Gavrilova, C. J. Kenneth Tan:
Transactions on Computational Science XXVII. Lecture Notes in Computer Science 9570, Springer 2016, ISBN 978-3-662-50411-6 - Alexander V. Bogdanov
, Vladimir Gaiduchok, Ivan Gankevich
, Yuri Tipikin, N. V. Yuzhanin:
The Use of Service Desk System to Keep Track of Computational Tasks on Supercomputers. 1-9 - Himanshu Thapliyal
:
Mapping of Subtractor and Adder-Subtractor Circuits on Reversible Quantum Gates. 10-34 - Alexander B. Degtyarev
, Ivan Gankevich
:
Balancing Load on a Multiprocessor System with Event-Driven Approach. 35-52 - Alexander Yu. Aleksandrov
, Alexey V. Platonov
, Yangzhou Chen:
On Stability of Difference Schemes for a Class of Nonlinear Switched Systems. 53-67 - Alexei Yu. Uteshev
, Marina V. Yashina
:
On Maxwell's Conjecture for Coulomb Potential Generated by Point Charges. 68-80 - Oleg Iakushkin
, Olga Sedova, Valery Grishkin
:
Application Control and Horizontal Scaling in Modern Cloud Middleware. 81-96 - Itsuo Takanami, Tadayoshi Horita, Masakazu Akiba, Mina Terauchi, Tsuneo Kanno:
A Built-in Self-repair Circuit for Restructuring Mesh-Connected Processor Arrays by Direct Spare Replacement. 97-119 - Garima Mehta, Malay Kishore Dutta
, Pyung Soo Kim
:
A Secure Encryption Method for Biometric Templates Based on Chaotic Theory. 120-140
![](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.