default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSubhash Kumar Yadav
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j13]Rohini Yadav
, Housila P. Singh, Lakshmi N. Upadhyaya, Subhash Kumar Yadav:
Adroit family of estimators of population mean using known auxiliary parameters. J. Comput. Appl. Math. 437: 115455 (2024)- [j12]Arun Pal, Rahul Varshney, Subhash Kumar Yadav, Tolga Zaman:
Improved memory-type ratio estimator for population mean in stratified random sampling under linear and non-linear cost functions. Soft Comput. 28(13-14): 7739-7754 (2024) - 2023
- [j11]Subhash Kumar Yadav, Gajendra K. Vishwakarma, Rahul Varshney, Arun Pal:
Improved Memory Type Product Estimator for Population Mean in Stratified Random Sampling Under Linear Cost Function. SN Comput. Sci. 4(3): 235 (2023) - 2022
- [j10]Subhash Kumar Yadav, Shabbir Ahmad, Muhammad Riaz:
On enhanced estimation and monitoring of population variance using robust auxiliary parameters based estimators. Concurr. Comput. Pract. Exp. 34(24) (2022) - [j9]Tolga Zaman, Hasan Bulut, Subhash Kumar Yadav:
Robust ratio-type estimators for finite population mean in simple random sampling: A simulation study. Concurr. Comput. Pract. Exp. 34(25) (2022) - [j8]Dinesh K. Sharma, Subhash Kumar Yadav, Hari Sharma:
Improvement in estimation of population variance utilising known auxiliary parameters for a decision-making model. Int. J. Math. Model. Numer. Optimisation 12(1): 15-28 (2022) - [j7]Dinesh K. Sharma, Subhash Kumar Yadav:
Optimal generalised Searls estimation procedure of population mean under ranked set sampling scheme. Int. J. Math. Oper. Res. 21(3): 305-320 (2022) - 2021
- [j6]Mradula, Subhash Kumar Yadav, Rahul Varshney, Madhulika Dube:
Efficient estimation of population mean under stratified random sampling with linear cost function. Commun. Stat. Simul. Comput. 50(12): 4364-4387 (2021) - [j5]Subhash Kumar Yadav, Dinesh K. Sharma, Shanya Baghel:
Upgraded family of estimators of population mean using known parameters of auxiliary and study variables. Int. J. Math. Model. Numer. Optimisation 11(3): 252-274 (2021) - [j4]Subhash Kumar Yadav, Cem Kadilar, Dinesh K. Sharma:
New family of estimators for population mean using regression-cum-ratio exponential estimators. Int. J. Math. Oper. Res. 18(1): 85-114 (2021) - [j3]Prem Prakash Mishra, Thangavel Poongodi, Subhash Kumar Yadav, S. S. Mishra:
Algorithmic approach to time-cost analysis of queued commodity flowing through critical path. Int. J. Math. Oper. Res. 18(2): 169-186 (2021)
2010 – 2019
- 2014
- [j2]Subhash Kumar Yadav, Cem Kadilar:
A two parameter variance estimator using auxiliary information. Appl. Math. Comput. 226: 117-122 (2014) - 2013
- [j1]Subhash Kumar Yadav, Cem Kadilar:
Improved class of ratio and product estimators. Appl. Math. Comput. 219(22): 10726-10731 (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-10-07 21:17 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:
