default search action
Parikshit Pareek
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j5]Anshuman Singh
, Parikshit Pareek
A Stress-Cognizant Optimal Battery Dispatch Framework for Multimarket Participation. IEEE Trans. Ind. Informatics 20(5): 7259-7268 (2024) - [i11]Parikshit Pareek, Abhijith Jayakumar, Carleton Coffrin, Sidhant Misra:
Demystifying Quantum Power Flow: Unveiling the Limits of Practical Quantum Advantage. CoRR abs/2402.08617 (2024) - [i10]Parikshit Pareek, Kaarthik Sundar, Deepjyoti Deka, Sidhant Misra:
Optimization Proxies using Limited Labeled Data and Training Time - A Semi-Supervised Bayesian Neural Network Approach. CoRR abs/2410.03085 (2024) - [i9]Parikshit Pareek, L. P. M. I. Sampath, Anshuman Singh, Lalit Goel, Hoay Beng Gooi, Hung Dinh Nguyen:
Degradation-Infused Energy Portfolio Allocation Framework: Risk-Averse Fair Storage Participation. CoRR abs/2411.01506 (2024) - 2023
- [j4]Sel Ly
Scalable Probabilistic Optimal Power Flow for High Renewables Using Lite Polynomial Chaos Expansion. IEEE Syst. J. 17(2): 2282-2293 (2023) - [j3]Parikshit Pareek
Locating Critical Prosumers in P2P Dominant Grids Using State-Sensitivity Function. IEEE Trans. Smart Grid 14(5): 4145-4148 (2023) - [i8]Parikshit Pareek, Deepjyoti Deka, Sidhant Misra:
Graph-Structured Kernel Design for Power Flow Learning using Gaussian Processes. CoRR abs/2308.07867 (2023) - [i7]Parikshit Pareek, Mohasha Isuru Sampath Lahanda Purage, Hung D. Nguyen, Yi Shyh Eddy Foo:
A Convergence Predictor Model for Consensus-based Decentralised Energy Markets. CoRR abs/2308.09603 (2023) - [i6]Parikshit Pareek, Deepjyoti Deka, Sidhant Misra:
Data-Efficient Power Flow Learning for Network Contingencies. CoRR abs/2310.00763 (2023) - 2021
- [j2]Parikshit Pareek
A Convexification Approach for Small-Signal Stability Constrained Optimal Power Flow. IEEE Trans. Control. Netw. Syst. 8(4): 1930-1941 (2021) - [j1]Parikshit Pareek
Optimal Steady-State Voltage Control Using Gaussian Process Learning. IEEE Trans. Ind. Informatics 17(10): 7017-7027 (2021) - [c1]Logesh Kumar
Health-Focused Optimal Power Flow. ISGT 2021: 1-5 - 2020
- [i5]Parikshit Pareek, Hung D. Nguyen:
Gaussian Process Learning-based Probabilistic Optimal Power Flow. CoRR abs/2004.07757 (2020) - [i4]Logesh Kumar, Parikshit Pareek, Sivakumar Nadarajan, Souvik Dasgupta, Amit Gupta, Hung D. Nguyen:
Health-Focused Optimal Power Flow. CoRR abs/2011.11849 (2020)
2010 – 2019
- 2019
- [i3]Parikshit Pareek, Hung D. Nguyen:
Probabilistic Robust Small-Signal Stability Framework using Gaussian Process Learning. CoRR abs/1910.01588 (2019) - [i2]Parikshit Pareek, Chuan Wang, Hung D. Nguyen:
Non-parametric Probabilistic Load Flow using Gaussian Process Learning. CoRR abs/1911.03093 (2019) - [i1]Parikshit Pareek, Hung D. Nguyen:
Small-Signal Stability Constrained Optimal Power Flow: A Convexification Approach. CoRR abs/1911.12001 (2019)
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-12 22:01 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: