A 5-bit 2 GS/s binary-search ADC with charge-steering comparators

2017 ◽  
Author(s):  
U-Fat Chio ◽  
Sai-Weng Sin ◽  
U Seng-Pan ◽  
Franco Maloberti ◽  
R. P. Martins
Keyword(s):  
Binary Search

An algorithm of packet classification based on binary search on levels

2009 ◽  
Vol 29 (2) ◽  
pp. 500-502
Author(s):  
Deng PAN ◽  
Da-fang ZHANG ◽  
Kun XIE ◽  
Ji ZHANG
Keyword(s):  
Packet Classification ◽  
Binary Search

scholarly journals Beyond Binary Search: Parallel In-place Construction of Implicit Search Tree Layouts

2021 ◽  
pp. 1-1
Author(s):  
Kyle Berney ◽  
Henri Casanova ◽  
Ben Karsin ◽  
Nodari Sitchinava
Keyword(s):  
Search Tree ◽  
Binary Search

scholarly journals E-ART: A New Encryption Algorithm Based on the Reflection of Binary Search Tree

Cryptography ◽  
2021 ◽  
Vol 5 (1) ◽  
pp. 4
Author(s):  
Bayan Alabdullah ◽  
Natalia Beloff ◽  
Martin White
Keyword(s):  
Data Storage ◽  
Statistical Tests ◽  
Data Encryption ◽  
Search Tree ◽  
Binary Search ◽  
Binary Search Tree ◽  
Security Level ◽  
Avalanche Effect ◽  
High Security Level ◽  
Tree Data Structure

Data security has become crucial to most enterprise and government applications due to the increasing amount of data generated, collected, and analyzed. Many algorithms have been developed to secure data storage and transmission. However, most existing solutions require multi-round functions to prevent differential and linear attacks. This results in longer execution times and greater memory consumption, which are not suitable for large datasets or delay-sensitive systems. To address these issues, this work proposes a novel algorithm that uses, on one hand, the reflection property of a balanced binary search tree data structure to minimize the overhead, and on the other hand, a dynamic offset to achieve a high security level. The performance and security of the proposed algorithm were compared to Advanced Encryption Standard and Data Encryption Standard symmetric encryption algorithms. The proposed algorithm achieved the lowest running time with comparable memory usage and satisfied the avalanche effect criterion with 50.1%. Furthermore, the randomness of the dynamic offset passed a series of National Institute of Standards and Technology (NIST) statistical tests.

An analytic approach for the analysis of rotations in fringe-balanced binary search trees

1998 ◽  
Vol 2 (2) ◽  
pp. 173-184 ◽  
Author(s):  
Alois Panholzer ◽  
Helmut Prodinger
Keyword(s):  
Binary Search ◽  
Analytic Approach ◽  
Binary Search Trees ◽  
Search Trees

A graph build algorithm for layout compaction using binary search tree

2003 ◽  
Author(s):  
A. Arun ◽  
S.K. Saxena ◽  
D.R. Chowdhury
Keyword(s):  
Search Tree ◽  
Binary Search ◽  
Binary Search Tree

scholarly journals Fun-Sort—or the chaos of unordered binary search

2004 ◽  
Vol 144 (3) ◽  
pp. 231-236 ◽  
Author(s):  
Therese Biedl ◽  
Timothy Chan ◽  
Erik D. Demaine ◽  
Rudolf Fleischer ◽  
Mordecai Golin ◽  
...  
Keyword(s):  
Binary Search
Sign in / Sign up

Export Citation Format

Share Document