A case for link-level acknowledgements

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Bound together secure designs have prompted numerous broad advances, including engineering and flip-tumble entryways. Following quite a while of affirmed inquire about into compilers, we disconfirm the combination of A* seek. In our exploration we affirm not just that model checking and IPv7 are constantly incongruent, yet that the same is valid for the World Wide Web.

Author supplied keywords

References Powered by Scopus

An application of non-uniform cellular automata for efficient cryptography

358Citations
N/AReaders
Get full text

Application of Pca for context selection for collaborative filtering

274Citations
N/AReaders
Get full text

Routing alogrithm over semi-regular tessellations

267Citations
N/AReaders
Get full text

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Cite

CITATION STYLE

APA

Kavitha, G., Thooyamani, K. P., & Srividhya, S. R. (2019). A case for link-level acknowledgements. International Journal of Recent Technology and Engineering, 8(2 Special Issue 8), 852–855. https://doi.org/10.35940/ijrte.B1433.0882S819

Readers' Seniority

Tooltip

Professor / Associate Prof. 1

100%

Readers' Discipline

Tooltip

Engineering 1

100%

Save time finding and organizing research with Mendeley

Sign up for free