![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Sapna Jain
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j16]Sapna Jain
, Rama Bhargava:
Natural convection flow on a bent wavy vertical enclosure filled with power-law nanofluid simulated by Element Free Galerkin method. Math. Comput. Simul. 205: 970-986 (2023) - [j15]Anupam Choudhary
, Abhishek Badholia, Anurag Sharma, Brijesh Patel
, Sapna Jain:
A dynamic K-means-based clustering algorithm using fuzzy logic for CH selection and data transmission based on machine learning. Soft Comput. 27(10): 6135-6149 (2023) - [c1]Thirumal Raman, Sravan Kumar, Anwesh Reddy Paduri, Gaurav Mahto, Sapna Jain, Bindhu K, Narayana Darapaneni:
CNN Based Study of Improvised Food Image Classification. CCWC 2023: 1051-1057 - 2021
- [j14]Anupam Choudhary
, Sapna Jain, Abhishek Badholia
, Anurag Sharma, Brijesh Patel
:
A less computationally complex clustering algorithm based on dynamic K-means for increasing lifetime of wireless sensor networks. Int. J. Comput. Appl. Technol. 67(1): 1-16 (2021)
2010 – 2019
- 2016
- [j13]Sapna Jain:
Sufficient Conditions for Burst Error Identification and Correction in LRTJ-Spaces. Ars Comb. 125: 129-150 (2016) - [j12]Sapna Jain:
On Row-Cyclic Array Codes Detecting and Correcting CT-Bursts Array Errors. Ars Comb. 127: 239-259 (2016) - [j11]Sapna Jain:
Error location technique in RT-spaces. Ars Comb. 128: 33-46 (2016) - [j10]Sapna Jain:
Duality in lpγ-spaces. Ars Comb. 129: 107-122 (2016) - 2015
- [j9]Sapna Jain:
Correction of 2-dimensional occasional and cluster errors in LRTJ-spaces. Ars Comb. 118: 179-189 (2015) - [j8]Sapna Jain:
On some important classes of row-cyclic array codes. Ars Comb. 120: 305-320 (2015) - [j7]Sapna Jain:
MacWilliams Duality in LRTJ-Spaces. Ars Comb. 121: 207-225 (2015) - [j6]Sapna Jain:
Solid Bursts-From Hamming to TR-Spaces. Ars Comb. 123: 215-230 (2015) - 2014
- [j5]Sapna Jain:
On a Class of Blockwise-Bursts in Array Codes. Ars Comb. 114: 273-292 (2014) - [j4]Sapna Jain:
Decoding of Blockwise-Burst Errors in Row-Cyclic Array Codes. Ars Comb. 115: 139-151 (2014) - 2013
- [j3]Nicolas Bruno, Sapna Jain, Jingren Zhou:
Recurring Job Optimization for Massively Distributed Query Processing. IEEE Data Eng. Bull. 36(1): 46-55 (2013) - [j2]Nicolas Bruno, Sapna Jain, Jingren Zhou:
Continuous Cloud-Scale Query Optimization and Processing. Proc. VLDB Endow. 6(11): 961-972 (2013)
2000 – 2009
- 2008
- [j1]Sapna Jain:
CT bursts - from classical to array coding. Discret. Math. 308(9): 1489-1499 (2008)
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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-04-24 22:52 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint