Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 927
Volume 927, August 2022
- T. Lakshmi Surekha, N. Chandra Sekhara Rao, C. K. Shahnazeer, Syed Mufassir Yaseen, Surendra Kumar Shukla
, Singh Bharat, Mahendran Arumugam:
Digital misinformation and fake news detection using WoT integration with Asian social networks fusion based feature extraction with text and image classification by machine learning architectures. 1-14 - A. Satish Kumar, S. Revathy:
A hybrid soft computing with big data analytics based protection and recovery strategy for security enhancement in large scale real world online social networks. 15-30 - Vladimir Lemus, Eduardo Acuña-Yeomans, Víctor Zamora, Francisco Hernández Quiroz, Hector Zenil:
Computable model discovery and high-level-programming approximations to algorithmic complexity. 31-41 - Sándor Vágvölgyi:
Deterministic top-down tree automata with Boolean deterministic look-ahead. 42-64 - Trevor Clokie, Thomas F. Lidbetter, Antonio Molina Lovett, Jeffrey O. Shallit, Leon Witzman:
Computational aspects of sturdy and flimsy numbers. 65-86 - Mohd Abdul Rahim Khan, Shavkatov Navruzbek Shavkatovich, Bharti Nagpal, Anil Kumar, Mohd Anul Haq, V. Jeevika Tharini, Sathishkumar Karupusamy, Malik Bader Alazzam:
Optimizing hybrid metaheuristic algorithm with cluster head to improve performance metrics on the IoT. 87-97 - Jason P. Bell, Jeffrey O. Shallit:
Lie complexity of words. 98-108 - Tooru Akagi, Yuki Kuhara, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Combinatorics of minimal absent words for a sliding window. 109-119 - Jean-Luc Baril, Sergey Kirgizov, Vincent Vajnovszki:
Gray codes for Fibonacci q-decreasing words. 120-132 - Philip Bille, Inge Li Gørtz, Max Rishøj Pedersen, Eva Rotenberg, Teresa Anna Steiner:
String indexing for top-k close consecutive occurrences. 133-147 - Shuangjun Zhang, Haibin Kan, Liguan Wang:
Preprocessing succinct non-interactive arguments for rank-1 constraint satisfiability from holographic proofs. 148-161
a service of 
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.
last updated on 2024-04-26 18:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
