![](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
Computer Science Review, Volume 36
Volume 36, May 2020
- Zouhaier Brahmia
, Hind Hamrouni, Rafik Bouaziz:
XML data manipulation in conventional and temporal XML databases: A survey. 100231 - Masoudeh Keshavarzi
, Hamid Reza Ghaffary
:
I2CE3: A dedicated and separated attack chain for ransomware offenses as the most infamous cyber extortion. 100233 - Bechir Alaya, Lamri Laouamer, Nihel Msilini:
Homomorphic encryption systems statement: Trends and challenges. 100235 - Shaymaa Adnan Abdulrahman, Wael Khalifa, Mohamed Roushdy
, Abdel-Badeeh M. Salem:
Comparative study for 8 computational intelligence algorithms for human identification. 100237 - Rodrigo Bavaresco
, Diórgenes Eugênio da Silveira, Eduardo Souza dos Reis, Jorge L. V. Barbosa
, Rodrigo da Rosa Righi, Cristiano André da Costa
, Rodolfo Stoffel Antunes
, Márcio Miguel Gomes, Clauter Gatti, Mariangela Vanzin, Saint Clair Junior, Elton Silva, Carlos Moreira:
Conversational agents in business: A systematic literature review and future research directions. 100239 - Hela Ltifi, Christophe Kolski, Mounir Ben Ayed:
Survey on Visualization and Visual Analytics pipeline-based models: Conceptual aspects, comparative studies and challenges. 100245 - Roberto Interdonato, Matteo Magnani, Diego Perna, Andrea Tagarelli, Davide Vega
:
Multilayer network simplification: Approaches, models and methods. 100246
![](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.