default search action
A. Sreekumar
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j8]K. T. Jafseer, S. Shailesh, A. Sreekumar:
CPOCEDS-concept preserving online clustering for evolving data streams. Clust. Comput. 27(3): 2983-2998 (2024) - [j7]R. Sreemol, M. B. Santosh Kumar, A. Sreekumar:
A secure finger vein recognition system using WS-progressive GAN and C4 classifier. Int. J. Biom. 16(1): 44-67 (2024) - [j6]N. Suresh Kumar, G. Santhosh Kumar, Shailesh Sivan, A. Sreekumar:
Novel abstraction methods for TDMA based MAC protocols: Case of IIoT MAC Wireless HART Verification. Telecommun. Syst. 85(1): 125-150 (2024) - 2023
- [j5]N. Suresh Kumar
, G. Santhosh Kumar, Shailesh Sivan, A. Sreekumar:
Formal Verification of a MAC Protocol for Underwater Sensor Networks. IEEE Access 11: 111846-111859 (2023) - 2022
- [j4]Shini Renjith
Taxonomy grooming algorithm - An autodidactic domain specific dimensionality reduction approach for fast clustering of social media text data. Concurr. Comput. Pract. Exp. 34(11) (2022) - 2021
- [j3]Shini Renjith
SemRec - An efficient ensemble recommender with sentiment based clustering for social media text corpus. Concurr. Comput. Pract. Exp. 33(20) (2021) - 2020
- [j2]Shini Renjith
An extensive study on the evolution of context-aware personalized travel recommender systems. Inf. Process. Manag. 57(1) (2020)
2010 – 2019
- 2019
- [i9]Divya Sindhu Lekha, Sruthi K. S, Kannan Balakrishnan, A. Sreekumar:
Profile Closeness in Complex Networks. CoRR abs/1903.06232 (2019) - 2017
- [j1]V. P. Binu, A. Sreekumar:
Secure and Efficient Secret Sharing Scheme with General Access Structures Based on Elliptic Curve and Pairing. Wirel. Pers. Commun. 92(4): 1531-1543 (2017) - 2016
- [c1]Manoj Changat
On the Center Sets of Some Graph Classes. CALDAM 2016: 240-253 - [i8]V. P. Binu, Divya G. Nair, A. Sreekumar:
Secret Sharing Homomorphism and Secure E-voting. CoRR abs/1602.05372 (2016) - [i7]V. P. Binu, A. Sreekumar:
Threshold Multi Secret Sharing Using Elliptic Curve and Pairing. CoRR abs/1603.09524 (2016) - 2015
- [i6]V. P. Binu, A. Sreekumar:
Lossless Secret Image Sharing Schemes. CoRR abs/1501.02892 (2015) - [i5]V. P. Binu, A. Sreekumar:
Simple and Efficient Secret Sharing Schemes for Sharing Data and Image. CoRR abs/1502.07475 (2015) - 2014
- [i4]V. P. Binu, A. Sreekumar:
An Epitome of Multi Secret Sharing Schemes for General Access Structure. CoRR abs/1406.5596 (2014) - [i3]V. P. Binu, A. Sreekumar:
Generalized Secret Sharing using Permutation Ordered Binary System. CoRR abs/1407.3609 (2014) - [i2]V. P. Binu, A. Sreekumar:
Efficient Multi Secret Sharing with Generalized Access Structures. CoRR abs/1407.6684 (2014) - 2013
- [i1]R. Ram Kumar, Kannan Balakrishnan, Manoj Changat, A. Sreekumar, Prasanth G. Narasimha-Shenoi:
On The Center Sets and Center Numbers of Some Graph Classes. CoRR abs/1312.3182 (2013)
Coauthor Index
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.
last updated on 2024-06-06 22:10 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: