default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHarshit J. Motwani
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2026
[j4]Constantin Enea
, Rupak Majumdar, Harshit Jitendra Motwani, V. R. Sathiyanarayana:
Verifying Almost-Sure Termination for Randomized Distributed Algorithms. Proc. ACM Program. Lang. 10(POPL): 1412-1441 (2026)- 2025
- [c6]Krishnendu Chatterjee, Ehsan Kafshdar Goharshady, Mehrdad Karrabi, Harshit J. Motwani, Maximilian Seeliger, Dorde Zikelic:
Quantified Linear and Polynomial Arithmetic Satisfiability via Template-based Skolemization. AAAI 2025: 11158-11166 - [c5]S. Akshay, Supratik Chakraborty, Soroush Farokhnia, Amir Kafshdar Goharshady, Harshit Jitendra Motwani, Dorde Zikelic:
LP-Based Weighted Model Integration over Non-Linear Real Arithmetic. IJCAI 2025: 9040-9048 - [c4]Giovanna Kobus Conrado, Amir Kafshdar Goharshady, Harshit Jitendra Motwani, Sergei Novozhilov:
Combinatorial Parameterized Algorithms for Chemical Descriptors based on Molecular Graph Sparsity. LAGOS 2025: 247-254 - [i4]Arash Bahari Kordabad, Rupak Majumdar, Harshit J. Motwani, Sadegh Soudjani:
On Certificates for Almost Sure Reachability in Stochastic Systems. CoRR abs/2507.20194 (2025) - 2024
- [j3]James Cruickshank, Fatemeh Mohammadi, Harshit J. Motwani, Anthony Nixon, Shin-ichi Tanigawa:
Global Rigidity of Line Constrained Frameworks. SIAM J. Discret. Math. 38(1): 743-763 (2024) - [c3]S. Akshay, Supratik Chakraborty, Amir Kafshdar Goharshady, R. Govind, Harshit J. Motwani, Sai Teja Varanasi:
Practical Approximate Quantifier Elimination for Non-linear Real Arithmetic. FM (1) 2024: 111-130 - [c2]S. Akshay, Supratik Chakraborty, Amir Kafshdar Goharshady, R. Govind, Harshit J. Motwani, Sai Teja Varanasi:
Automated Synthesis of Decision Lists for Polynomial Specifications over Integers. LPAR 2024: 484-502 - [c1]Giovanna Kobus Conrado, Amir Kafshdar Goharshady, Pavel Hudec, Pingjiang Li, Harshit J. Motwani:
Faster Treewidth-Based Approximations for Wiener Index. SEA 2024: 6:1-6:19 - [i3]Krishnendu Chatterjee, Ehsan Kafshdar Goharshady, Mehrdad Karrabi, Harshit J. Motwani, Maximilian Seeliger, Dorde Zikelic:
Quantified Linear and Polynomial Arithmetic Satisfiability via Template-based Skolemization. CoRR abs/2412.16226 (2024) - 2023
- [j2]Alessio Borzì, Xiangying Chen, Harshit J. Motwani, Lorenzo Venturello, Martin Vodicka:
The leading coefficient of Lascoux polynomials. Discret. Math. 346(2): 113217 (2023) - [j1]Amir Kafshdar Goharshady, S. Hitarth, Fatemeh Mohammadi, Harshit J. Motwani:
Algebro-geometric Algorithms for Template-Based Synthesis of Polynomial Programs. Proc. ACM Program. Lang. 7(OOPSLA1): 727-756 (2023) - [i2]Giovanna Kobus Conrado, Amir Kafshdar Goharshady, Harshit J. Motwani, Sergei Novozhilov:
Parameterized Algorithms for Topological Indices in Chemistry. CoRR abs/2303.13279 (2023) - 2022
- [i1]Amir Kafshdar Goharshady, S. Hitarth, Fatemeh Mohammadi, Harshit J. Motwani:
Template-based Program Synthesis using Stellensätze. CoRR abs/2209.03602 (2022)
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 2026-02-05 00:05 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:
