Algorithm and Design Techniques – A Survey

Algorithm and Design Techniques – A Survey

A. Sheik Abdullah

Contact

T.G.R Abiramie Shree

Contact

P Priyadharshini

Contact

T Saranya

Contact

Algorithm and Design Techniques – A Survey

Article Fingerprint

ReserarchID

CSTSDE7G8GN

Algorithm and Design Techniques – A Survey Banner

AI TAKEAWAY

Connecting with the Eternal Ground

Abstract

Algorithm design plays a significant role in development of any application that is concerned with engineering and technology. Advancement in implementation levels of algorithms made a good impact with the model developed. Meanwhile, the time and space complexity of the execution of the algorithm varies with regard to the input to the algorithm upon fixation of various parametric levels. This paper summarizes a survey on various algorithm design techniques and its applications. The applicability of the algorithms varies with regard to the problem and the nature of computation levels.

References

40 Cites in Article

Reference Format

(2014). Maximum Independent Set Approximation Based on Bellman-Ford Algorithm.
Juan Rivera,H Murat Afsar,Christian Prins (2015). Mathematical formulations and exact algorithm for the multitrip cumulative capacitated single-vehicle routing problem.
Federico Busato,Nicola Bombieri (2016). An Efficient Implementation of the Bellman-Ford Algorithm for Kepler GPU Architectures.
Ganesh Surve,Medha Shah (2017). Parallel implementation of Bellman-ford algorithm using CUDA architecture.
(2017). Efficient Implementation of the Bellman-ford algorithm for GPU.
(2017). Demonstration of Single Link Failure Recovery using Bellman Ford and Dijil (stra Algorithm in SDN.
(2017). A bag of paths framework for network data analysis.
(2018). Figure 1: Directed acyclic graph of the MR framework investigating the causal relationship between LTL and BD..
Stasys Jukna,Georg Schnitger (2015). On the optimality of Bellman–Ford–Moore shortest path algorithm.
(2014). Face Image Abstraction by Ford-Fulkerson Algorithm and Invariant Feature Descriptor for Human Identification.
Aly-Joy Ulusoy,Ivan Stoianov,Aurelie Chazerain (2018). Hydraulically informed graph theoretic measure of link criticality for the resilience analysis of water distribution networks.
Yuhong Sheng,Jinwu Gao (2014). Chance distribution of the maximum flow of uncertain random network.
Janet Anderson,Hong-Jian Lai,Xiaomin Li,Xiaoxia Lin,Murong Xu (2018). Minimax properties of some density measures in graphs and digraphs.
(2014). Using basis dependence distance vectors in the modified Floyd-Warshall algorithm.
A Muholzoev,V Masyagin (2016). Probabilistic Calculation of Tolerances of the Dimension Chain Based on the Floyd-warshall Algorithm.
(2009). Accelerating Boyer Moore searches on binary texts.
Frantisek Franek,Christopher Jennings,W Smyth (2007). A simple fast hybrid pattern-matching algorithm.
Ain Saleh,Nur Rozali,Alya Buja,Kamarularifin Jalil,Fakariah Ali,Teh Rahman (2015). A Method for Web Application Vulnerabilities Detection by Using Boyer-Moore String Matching Algorithm.
Phyela Mbewe,Sampson Asare (2017). Analysis and comparison of adaptive huffman coding and arithmetic coding algorithms.
(2015). High performance parallelization of Boyer-Moore algorithm on many-core accelerators.
(2017). Balancing decoding speed and memory usage for Huffman codes using quaternary tree.
(1994). A variation on the Boyer-Moore algorithm.
Yih-Kai Lin,Shu-Chien Huang,Cheng-Hsing Yang (2011). A fast algorithm for Huffman decoding based on a recursion Huffman tree.
Bruce Watson,Richard Watson (2002). A Boyer–Moore-style algorithm for regular expression pattern matching.
W-W Lu,M Gough (1998). A fast-adaptive Huffman coding algorithm.
G Ong (2000). An algorithm for generating n Huffman codes with a worst case of (n log/sub 2/ n+n log/sub 2/ log/sub 2/ n) comparisons.
S Pigeon,Y Bengio (1993). A memory-efficient adaptive Huffman coding algorithm for very large sets of symbols.
Wang Zhe,Chen Jun,Yuan Gang,Zhao Zhou,Yan (2001). A Quick algorithm for planar fragmented objects stitching Base on KMP algorithm.
(2017). Application of KMP Algorithm in Customized Flow Analysis.
R Yavne (1968). An economical method for calculating the discrete Fourier transform.
Daniel Bernstein (2007). The Tangent FFT.
Dilla Ravilla (2015). Chandra sekara reddy putta "Enhancing the security of mannets using hash algorithm.
Nabil Abdoun,E Safwan,Assad Secure hash algorithm based on efficient chaotic neural network.
R Jain (2005). I Want My IPTV.
H Schwarz,D Marpe,T Wiegand (2007). Overview of the Scalable Video Coding Extension of the H.264/AVC Standard.
R Ahlswede,Ning Cai,S.-Y Li,R Yeung (2000). Network information flow.
Alia Arshad,Dur-E-Shahwar Kundi,Arshad Aziz (2014). Compact implementation of SHA3-512 on FPGA.
George Athanasiou,George-Paris Makkas,Georgiostheodoridis (2014). High throughput pipelined FPGA implementation of the new SHA-3cryptographic hash algorithm.
Harris Lenosioannou,Artemios Michail,Voyiatzis (2015). High Performance Pipelined FPGA Implementation of the SHA-3 Hash Algorithm.
Thomas Muzaffarrao,Ian Newe,Grout (2015). Secure Hash Algorithm-3(SHA-3) implementation on Xilinx FPGAs, Suitable for IOT Applications.

Download References

Funding

No external funding was declared for this work.

Conflict of Interest

The authors declare no conflict of interest.

Ethical Approval

No ethics committee approval was required for this article type.

Data Availability

Not applicable for this article.

How to Cite This Article

A. Sheik Abdullah. 2019. \u201cAlgorithm and Design Techniques – A Survey\u201d. Global Journal of Computer Science and Technology - C: Software & Data Engineering GJCST-C Volume 19 (GJCST Volume 19 Issue C3): .

More Citation Formats

Select Citation Style:

Download Citation

Download Article

GJCST Volume 19 Issue C3
Pg. 43- 52

Explore Journals Explore Volume Read This Issue

Journal Specifications

Crossref Journal DOI 10.17406/gjcst

Print ISSN 0975-4350

e-ISSN 0975-4172

Keywords

Not Found

Classification

GJCST-C Classification: I.1.2

Submission ReceivedDecember 7, 2018
Peer Review Double Blind
Handling Editor
Accepted January 5, 2019
Published January 15, 2019

Version of record

v1.2

Issue date

December 9, 2019

Language

Experiance in AR

Explore published articles in an immersive Augmented Reality environment. Our platform converts research papers into interactive 3D books, allowing readers to view and interact with content using AR and VR compatible devices.

View in VR

Read in 3D

Your published article is automatically converted into a realistic 3D book. Flip through pages and read research papers in a more engaging and interactive format.

View in 3D

Article Matrices

Total Views: 4852

Total Downloads: 1238

2026 Trends

Published Article

Our website is actively being updated, and changes may occur frequently. Please clear your browser cache if needed. For feedback or error reporting, please email [email protected]