Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 625 matches
- 2024
- K. Sudheeradh, N. Neha Jahnavi, Pramod N. Chine, Gaurav S. Kasbekar:
Efficient and Secure Group Key Management Scheme Based on Factorial Trees for Dynamic IoT Settings. IEEE Access 12: 5659-5671 (2024) - Lingzhe Zhang, Xiang-Dong Huang, Yan-Kai Wang, Jialin Qiao, Shaoxu Song, Jian-Min Wang:
Time-tired compaction: An elastic compaction scheme for LSM-tree based time-series database. Adv. Eng. Informatics 59: 102224 (2024) - Benjamin Doerr, Amirhossein Rajabi, Carsten Witt:
Simulated Annealing is a Polynomial-Time Approximation Scheme for the Minimum Spanning Tree Problem. Algorithmica 86(1): 64-89 (2024) - Junfeng Tian, Ruxin Bai, Tianfeng Zhang:
Supporting dynamic update scheme for assured deletion based-multi-copy association tree. Clust. Comput. 27(2): 1983-2001 (2024) - Elena M. Parilina, Georges Zaccour:
Payment schemes for sustaining cooperation in dynamic games played over event trees. Eur. J. Oper. Res. 313(3): 1200-1216 (2024) - Weichen Peng, Luo Chen, Xue Ouyang, Wei Xiong:
A Time-Identified R-Tree: A Workload-Controllable Dynamic Spatio-Temporal Index Scheme for Streaming Processing. ISPRS Int. J. Geo Inf. 13(2): 49 (2024) - Nguyen Binh Long, Do Tuan Anh, Ha-Bang Ban, Huynh Thi Thanh Binh:
A multipopulation multitasking evolutionary scheme with adaptive knowledge transfer to solve the clustered minimum routing cost tree problem. Inf. Sci. 657: 119961 (2024) - Roselinkiruba R, A. Krishna Kumar:
Reversible key frame selection data hiding in videos using search tree labelling scheme. Multim. Tools Appl. 83(2): 3855-3878 (2024) - Tariqul Islam, Faisal Haque Bappy, Md Nafis Ul Haque Shifat, Farhan Ahmad, Kamrul Hasan, Tarannum Shaila Zaman:
An Efficient and Scalable Auditing Scheme for Cloud Data Storage using an Enhanced B-tree. CoRR abs/2401.08953 (2024) - Esther Galby, Andrea Munaro, Shizhou Yang:
Polynomial-time approximation schemes for induced subgraph problems on fractionally tree-independence-number-fragile graphs. CoRR abs/2402.18352 (2024) - 2023
- Carla E. Garcia, Insoo Koo:
Extremely Randomized Trees Regressor Scheme for Mobile Network Coverage Prediction and REM Construction. IEEE Access 11: 65170-65180 (2023) - Zhenpeng Liu, Lele Ren, Yongjiang Feng, Shuo Wang, Jianhang Wei:
Data Integrity Audit Scheme Based on Quad Merkle Tree and Blockchain. IEEE Access 11: 59263-59273 (2023) - Sara Nasirian, Paola Pierleoni, Alberto Belli, Marco Mercuri, Lorenzo Palma:
Pizzza: A Joint Sector Shape and Minimum Spanning Tree-Based Clustering Scheme for Energy Efficient Routing in Wireless Sensor Networks. IEEE Access 11: 68200-68215 (2023) - Hongyan Zhang, Yu Zhou, Zhi-Qiang Feng:
Balanced Binary Tree Schemes for Computing Zernike Radial Polynomials. IEEE Access 11: 106567-106579 (2023) - Zhouqi Liu, Lei Wang, Jin Huang, Xinping Guo, Tianqi Cheng, Yuwei Wang, Cong Liu, ChunXiang Liu:
An Effective Denoising Method for the Point Cloud of Trees Based on the Hybrid Filtering Scheme. Autom. Control. Comput. Sci. 57(5): 504-513 (2023) - Qing Wang, Xi Zhang, Jing Qin, Jixin Ma, Xinyi Huang:
A Verifiable Symmetric Searchable Encryption Scheme Based on the AVL Tree. Comput. J. 66(1): 174-183 (2023) - Yong Zhao, Shao-Jun Yang, Wei Wu, Xinyi Huang:
A Lattice-Based Redactable Signature Scheme using Cryptographic Accumulators for Trees. Comput. J. 66(12): 2961-2973 (2023) - Gururaj S. Kori, Mahabaleshwar S. Kakkasageri:
Classification And Regression Tree (CART) based resource allocation scheme for Wireless Sensor Networks. Comput. Commun. 197: 242-254 (2023) - Junfeng Tian, Qi Zhu:
A differential privacy trajectory data storage and publishing scheme based on radix tree. Concurr. Comput. Pract. Exp. 35(22) (2023) - Peiqian Liu, Duoduo Wu, Zihao Shen, Hui Wang:
Trajectory privacy data publishing scheme based on local optimisation and R-tree. Connect. Sci. 35(1) (2023) - Love Allen Chijioke Ahakonye, Cosmas Ifeanyi Nwakanma, Jae-Min Lee, Dong-Seong Kim:
SCADA intrusion detection scheme exploiting the fusion of modified decision tree and Chi-square feature selection. Internet Things 21: 100676 (2023) - Tran Cong Dao, Nguyen Thi Tam, Nguyen Quang Quy, Huynh Thi Thanh Binh:
An energy-efficient scheme for maximizing data aggregation tree lifetime in wireless sensor network. J. Ambient Intell. Humaniz. Comput. 14(9): 12329-12344 (2023) - K. Swapna Sudha, N. Jeyanthi:
Merkle hash tree improved strongly constrained discrete hashing function-based authentication scheme for enabling security for smart home IoT applications. Peer Peer Netw. Appl. 16(5): 2367-2379 (2023) - Aditya Jayaprakash, Mohammad R. Salavatipour:
Approximation Schemes for Capacitated Vehicle Routing on Graphs of Bounded Treewidth, Bounded Doubling, or Highway Dimension. ACM Trans. Algorithms 19(2): 20:1-20:36 (2023) - Qian Zhou, Hua Dai, Yuanlong Liu, Geng Yang, Xun Yi, Zheng Hu:
A novel semantic-aware search scheme based on BCI-tree index over encrypted cloud data. World Wide Web (WWW) 26(5): 3055-3079 (2023) - Ziyang Shen, Chaoming Fang, Fengshi Tian, Jie Yang, Mohamad Sawan:
PN-TMS: Pruned Node-fusion Tree-based Multicast Scheme for Efficient Neuromorphic Systems. AICAS 2023: 1-5 - Esther Galby, Andrea Munaro, Shizhou Yang:
Polynomial-Time Approximation Schemes for Independent Packing Problems on Fractionally Tree-Independence-Number-Fragile Graphs. SoCG 2023: 34:1-34:15 - Maksim Iavich, Tamari Kuchukhidze, Tetiana Okhrimenko:
Verkle Tree-based Post-Quantum Digital Signature Scheme using Stateless Updatable Vector Commitment. CPITS II 2023: 157-166 - Lei Sun, Xiaolong Xu:
SNNLog: A Log Parsing Scheme with Siamese Network and Fixed Depth Tree in Networks. CSCWD 2023: 1025-1030 - Kai-Wei Lin, Yu-Chi Chen:
A File Verification Scheme Based on Verkle Trees. ICCE-Taiwan 2023: 295-296
skipping 595 more matches
loading more results
failed to load more results, please try again later
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-05-10 12:19 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint