default search action
Arpit Sharma 0002
Person information
- affiliation: Indian Institute of Science Education and Research Bhopal (IISER Bhopal), India
- affiliation (PhD): RWTH Aachen Technical University, Germany
Other persons with the same name
- Arpit Sharma — disambiguation page
- Arpit Sharma 0001 — Walmart Labs, Sunnyvale, CA, USA (and 1 more)
- Arpit Sharma 0003 — Vellore Institute of Technology, School of Mechanical Engineering, Chennai, India
- Arpit Sharma 0004 — The Citadel, Charleston, SC, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c25]Naimish Sharma, Arpit Sharma:
Classification of Crowd-Based Software Requirements via Unsupervised Learning. QUATIC 2024: 237-252 - [c24]Susmoy Das, Arpit Sharma:
A Formal Framework of Model and Logical Embeddings for Verification of Stochastic Systems. SAC 2024: 1712-1721 - 2023
- [j2]Ambarish Moharil, Arpit Sharma:
TABASCO: A transformer based contextualization toolkit. Sci. Comput. Program. 230: 102994 (2023) - [c23]Susmoy Das, Arpit Sharma:
On the Use of Model and Logical Embeddings for Model Checking of Probabilistic Systems. FORTE 2023: 115-131 - [i2]Susmoy Das, Arpit Sharma:
Probabilistic Model Checking of Temporal Interaction Dynamics in the Supreme Court. CoRR abs/2311.05177 (2023) - 2022
- [c22]Arman Kazmi, Sidharth Ranjan, Arpit Sharma, Rajakrishnan Rajkumar:
Linguistically Motivated Features for Classifying Shorter Text into Fiction and Non-Fiction Genre. COLING 2022: 922-937 - [c21]Susmoy Das, Arpit Sharma:
Embeddings Between State and Action Based Probabilistic Logics. FACS 2022: 121-140 - [c20]Ambarish Moharil, Arpit Sharma:
Identification of Intra-Domain Ambiguity using Transformer-based Machine Learning. NLBSE 2022: 51-58 - 2021
- [j1]Arpit Sharma:
The linear time-branching time spectrum of equivalences for stochastic systems with non-determinism. Theor. Comput. Sci. 850: 148-167 (2021) - [c19]Susmoy Das, Arpit Sharma:
State Space Minimization Preserving Embeddings for Continuous-Time Markov Chains. EPEW 2021: 44-61 - [c18]Siba Mishra, Arpit Sharma:
A Generalized Semantic Filter for Glossary Term Extraction from Large-Sized Software Requirements. ISEC 2021: 4:1-4:9 - [c17]Siba Mishra, Arpit Sharma:
Crawling Wikipedia Pages to Train Word Embeddings Model for Software Engineering Domain. ISEC 2021: 18:1-18:5 - [c16]Kushagra Bhatia, Arpit Sharma:
Sector classification for crowd-based software requirements. SAC 2021: 1312-1320 - [c15]Susmoy Das, Arpit Sharma:
Embeddings between state and action labeled probabilistic systems. SAC 2021: 1759-1767 - 2020
- [c14]Kushagra Bhatia, Siba Mishra, Arpit Sharma:
Clustering Glossary Terms Extracted from Large-Sized Software Requirements using FastText. ISEC 2020: 5:1-5:11 - [c13]Siba Mishra, Arpit Sharma:
Automatic Word Embeddings-Based Glossary Term Extraction from Large-Sized Software Requirements. REFSQ 2020: 203-218
2010 – 2019
- 2019
- [c12]Arpit Sharma:
Revisiting Trace Equivalences for Markov Automata. FACS 2019: 252-260 - [c11]Arpit Sharma:
The Linear Time-Branching Time Spectrum of Equivalences for Stochastic Systems with Non-determinism. ICTAC 2019: 41-58 - [c10]Siba Mishra, Arpit Sharma:
On the Use of Word Embeddings for Identifying Domain Specific Ambiguities in Requirements. RE Workshops 2019: 234-240 - [c9]Arpit Sharma:
Stuttering for Markov Automata. TASE 2019: 144-151 - 2018
- [c8]Arpit Sharma:
Trace Relations and Logical Preservation for Markov Automata. FORMATS 2018: 162-178 - [c7]Arpit Sharma:
Non-bisimulation Based Behavioral Relations for Markov Automata. FORMATS 2018: 179-196 - 2017
- [c6]Arpit Sharma:
Interactive Markovian Equivalence. EPEW 2017: 33-49 - [c5]Arpit Sharma:
Trace Relations and Logical Preservation for Continuous-Time Markov Decision Processes. ICTAC 2017: 192-209 - 2015
- [b1]Arpit Sharma:
Reduction Techniques for Nondeterministic and Probabilistic Systems. RWTH Aachen University, Germany, 2015 - 2014
- [c4]Arpit Sharma, Joost-Pieter Katoen:
Layered Reduction for Abstract Probabilistic Automata. ACSD 2014: 21-31 - 2013
- [c3]Arpit Sharma, Joost-Pieter Katoen:
Layered Reduction for Modal Specification Theories. FACS 2013: 329-347 - 2012
- [c2]Arpit Sharma:
Weighted Probabilistic Equivalence Preserves ω-Regular Properties. MMB/DFT 2012: 121-135 - [i1]Arpit Sharma:
A Two Step Perspective for Kripke Structure Reduction. CoRR abs/1210.0408 (2012) - 2011
- [c1]Arpit Sharma, Joost-Pieter Katoen:
Weighted Lumpability on Markov Chains. Ershov Memorial Conference 2011: 322-339
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-11-07 20:32 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint