default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVed Prakash
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j3]Ved Prakash, Sumit Mishra:
Hierarchical non-dominated sort: analysis and improvement. Genet. Program. Evolvable Mach. 25(1): 14 (2024)- [c10]Sumit Mishra, Srinibas Swain, Ved Prakash:
Know How Much Sensitive Precision and Recall Validity Measures Are? ICPR (2) 2024: 335-350 - [i3]Ved Prakash, Kartavya Kothari:
Efficient Feature Interactions with Transformers: Improving User Spending Propensity Predictions in Gaming. CoRR abs/2409.17077 (2024) - 2023
- [j2]Ved Prakash, Suman Pandey:
Metaheuristic algorithm for energy efficient clustering scheme in wireless sensor networks. Microprocess. Microsystems 101: 104898 (2023) - [c9]Ved Prakash, Sumit Mishra
, Carlos A. Coello Coello:
On the Computational Complexity of Efficient Non-dominated Sort Using Binary Search. EMO 2023: 419-432 - 2022
- [j1]Dhirendra Prasad Yadav, Anand Singh Jalal, Ved Prakash:
Human burn depth and grafting prognosis using ResNeXt topology based deep learning network. Multim. Tools Appl. 81(13): 18897-18914 (2022) - 2021
- [c8]Sumit Mishra, Ved Prakash, Maxim Buzdalov:
Labeling-oriented non-dominated sorting is Θ(MN3). GECCO Companion 2021: 189-190 - [c7]Sumit Mishra, Ved Prakash:
Time complexity analysis of the deductive sort in the best case. GECCO Companion 2021: 337-338 - [c6]Sumit Mishra, Sanjay Moulik, Ved Prakash:
Invalid Scenarios of External Cluster Validity Indices: An Analysis Using Bell Polynomial. SMC 2021: 2215-2220 - [i2]Ved Prakash, Akash Kumar Behera, Mohammad Masiur Rahaman:
A phase-field model for thermo-mechanical fracture with an open-source implementation of it using Gridap in Julia. CoRR abs/2110.12284 (2021)
2010 – 2019
- 2018
- [c5]Jinesh P. Nair, Ranjit K. Guha, Atanu Guchhait, P. S. Chandrashekhar Thejaswi, SaiDhiraj Amuru, Ved Prakash, Daeryong Lee:
Capacity Based Efficient Beam-Selection Methods for mmWave 5G MIMO Communication Systems. ICC 2018: 1-7 - 2014
- [c4]Hartmut Klauck, Ved Prakash:
An Improved Interactive Streaming Algorithm for the Distinct Elements Problem. ICALP (1) 2014: 919-930 - [c3]Ved Prakash:
Efficient delegation protocols for data streams. SIGMOD PhD Symposium 2014: 6-10 - [i1]Hartmut Klauck, Ved Prakash:
An Improved Interactive Streaming Algorithm for the Distinct Elements Problem. CoRR abs/1402.6800 (2014) - 2013
- [c2]Hartmut Klauck, Ved Prakash:
Streaming computations with a loquacious prover. ITCS 2013: 305-320 - 2011
- [c1]Ved Prakash, Brajesh Kumar, Anup Kumar Srivastava:
Energy efficiency comparison of some topology-based and location-based mobile ad hoc routing protocols. ICCCS 2011: 36-39
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-12-13 19:11 CET 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:
