The secondary and approximate authorization model and its application to Bell-LaPadula policies
Proceedings of the eleventh ACM symposium on Access control models and technologies
Reconfigurable hardware solution to parallel prefix computation
The Journal of Supercomputing
A Design of Automatic Visualizations for Divide-and-Conquer Algorithms
Electronic Notes in Theoretical Computer Science (ENTCS)
A novel approach for fast covering the Boolean sets
ISTASC'08 Proceedings of the 8th conference on Systems theory and scientific computation
Using control network programming in teaching nondeterminism
Proceedings of the 13th International Conference on Computer Systems and Technologies
| Hi-index | 0.00 |
From the Publisher:Filling the void left by other algorithms books, Algorithms and Data Structures provides an approach that emphasizes design techniques. The volume includes application of algorithms, examples, end-of-section exercises, end-of-chapter exercises, hints and solutions to selected exercises, figures and notes to help the reader master the design and analysis of algorithms. This volume covers data structures, searching techniques, divided-and-conquer sorting and selection, greedy algorithms, dynamic programming, text searching, computational algebra, P and NP and parallel algorithms. For those interested in a better understanding of algorithms.