default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAshish Kumar Maurya
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j19]Medha Kirti, Ashish Kumar Maurya, Rama Shankar Yadav:
Fault-tolerant allocation of deadline-constrained tasks through preemptive migration in heterogeneous cloud environments. Clust. Comput. 27(8): 11427-11454 (2024)- [j18]Medha Kirti
, Ashish Kumar Maurya, Rama Shankar Yadav:
A Fault-tolerant model for tuple space coordination in distributed environments. Concurr. Comput. Pract. Exp. 36(1) (2024) - [j17]Medha Kirti, Ashish Kumar Maurya, Rama Shankar Yadav:
Fault-tolerance approaches for distributed and cloud computing environments: A systematic review, taxonomy and future directions. Concurr. Comput. Pract. Exp. 36(13) (2024) - [j16]Avaneesh Kumar Yadav, Ranvijay, Rama Shankar Yadav, Ashish Kumar Maurya:
Graph-based extractive text summarization based on single document. Multim. Tools Appl. 83(7): 18987-19013 (2024) - [j15]Sushil Kumar Maurya, Dinesh Singh, Ashish Kumar Maurya:
Deceptive opinion spam detection using feature reduction techniques. Int. J. Syst. Assur. Eng. Manag. 15(3): 1210-1230 (2024) - [j14]Prateek Verma, Ashish Kumar Maurya, Rama Shankar Yadav:
A survey on energy-efficient workflow scheduling algorithms in cloud computing. Softw. Pract. Exp. 54(5): 637-682 (2024) - 2023
- [j13]Sushil Kumar Maurya, Dinesh Singh, Ashish Kumar Maurya:
Deceptive opinion spam detection approaches: a literature survey. Appl. Intell. 53(2): 2189-2234 (2023) - [j12]Dinesh Singh, Ashish Kumar Maurya, Ranvijay, Rama Shankar Yadav:
CRLMDA: CRL minimisation and distribution algorithm in cluster-based VANETs. Int. J. Commun. Networks Distributed Syst. 29(3): 239-267 (2023) - [j11]Dinesh Singh, Ashish Kumar Maurya, Ranvijay, Rama Shankar Yadav:
A trust-based clustering approach to form stable clusters in vehicular ad hoc networks. J. Ambient Intell. Humaniz. Comput. 14(12): 16209-16228 (2023) - [j10]Avaneesh Kumar Yadav, Ranvijay, Rama Shankar Yadav, Ashish Kumar Maurya:
State-of-the-art approach to extractive text summarization: a comprehensive review. Multim. Tools Appl. 82(19): 29135-29197 (2023) - [c5]Medha Kirti, Ashish Kumar Maurya, Rama Shankar Yadav:
Fault Tolerance of Deadline Constrained Tasks based on Load Balancing in Cloud Computing. ICCCNT 2023: 1-6 - [c4]Ravikant Ravikant, Ashish Kumar Maurya:
A Brief Survey of Energy-Efficient Task Scheduling Algorithms in the Cloud. ICCCNT 2023: 1-7 - 2022
- [j9]Niharika Keshari, Dinesh Singh, Ashish Kumar Maurya:
A survey on Vehicular Fog Computing: Current state-of-the-art and future directions. Veh. Commun. 38: 100512 (2022) - 2021
- [j8]Avaneesh Kumar Yadav, Ashish Kumar Maurya, Ranvijay, Rama Shankar Yadav:
Extractive Text Summarization Using Recent Approaches: A Survey. Ingénierie des Systèmes d Inf. 26(1): 109-121 (2021) - [j7]Vinay Kumar, Ashish Kumar Maurya, Karam Veer Singh, Lalit Kumar Singh, Pooja Singh, Aditya Narayan Hati, Vibhav Prakash Singh:
Safety analysis of safety-critical systems for their applicability on NPP systems: A state-of-the-art review. Qual. Reliab. Eng. Int. 37(5): 1796-1831 (2021) - [j6]Amit Biswas, Ashish Kumar Maurya, Anil Kumar Tripathi, Samir Aknine:
FRLLE: a failure rate and load-based leader election algorithm for a bidirectional ring in distributed systems. J. Supercomput. 77(1): 751-779 (2021) - 2020
- [j5]Ashish Kumar Maurya, Kashish Modi, Vinay Kumar, Nenavath Srinivas Naik, Anil Kumar Tripathi:
Energy-aware scheduling using slack reclamation for cluster systems. Clust. Comput. 23(2): 911-923 (2020)
2010 – 2019
- 2019
- [j4]Ashish Kumar Maurya, Anil Kumar Tripathi:
ECP: a novel clustering-based technique to schedule precedence constrained tasks on multiprocessor computing systems. Computing 101(8): 1015-1039 (2019) - [j3]Ashish Kumar Maurya, Anil Kumar Tripathi:
An edge priority-based clustering algorithm for multiprocessor environments. Concurr. Comput. Pract. Exp. 31(11) (2019) - 2018
- [j2]Ashish Kumar Maurya, Anil Kumar Tripathi:
On benchmarking task scheduling algorithms for heterogeneous computing systems. J. Supercomput. 74(7): 3039-3070 (2018) - [c3]Ashish Kumar Maurya, Anil Kumar Tripathi:
Deadline-constrained algorithms for scheduling of bag-of-tasks and workflows in cloud computing environments. HP3C 2018: 6-10 - 2017
- [j1]Dharmendra Prasad Mahato, Ravi Shankar Singh, Anil Kumar Tripathi, Ashish Kumar Maurya:
On scheduling transactions in a grid processing system considering load through Ant Colony Optimization. Appl. Soft Comput. 61: 875-891 (2017) - [c2]Ashish Kumar Maurya, Anil Kumar Tripathi:
Performance Comparison of HEFT, Lookahead, CEFT and PEFT Scheduling Algorithms for Heterogeneous Computing Systems. ICCCT 2017: 128-132 - 2016
- [c1]Dharmendra Prasad Mahato, Ashish Kumar Maurya, Anil Kumar Tripathi, Ravi Shankar Singh:
Dynamic and adaptive load balancing in transaction oriented grid service. ICGHPC 2016: 1-5
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-09-26 01:00 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:
