default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMihir Vahanwala
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j2]Mihir Vahanwala
:
Skolem and positivity completeness of ergodic Markov chains. Inf. Process. Lett. 186: 106481 (2024)- [j1]S. Akshay, Hugo Bazille, Blaise Genest, Mihir Vahanwala:
On Robustness for the Skolem, Positivity and Ultimate Positivity Problems. Log. Methods Comput. Sci. 20(2) (2024) - [c5]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Adwait Godbole, Shankara Narayanan Krishna, Mihir Vahanwala:
Fairness and Liveness Under Weak Consistency. Taming the Infinities of Concurrency 2024: 1-21 - [c4]Valérie Berthé, Toghrul Karimov, Joris Nieuwveld, Joël Ouaknine, Mihir Vahanwala, James Worrell:
On the Decidability of Monadic Second-Order Logic with Arithmetic Predicates. LICS 2024: 11:1-11:14 - [i8]Valérie Berthé, Toghrul Karimov, Joris Nieuwveld, Joël Ouaknine, Mihir Vahanwala, James Worrell:
On the Decidability of Monadic Second-Order Logic with Arithmetic Predicates. CoRR abs/2405.07953 (2024) - [i7]Rajab Aghamov, Christel Baier, Toghrul Karimov, Joris Nieuwveld, Joël Ouaknine, Jakob Piribauer, Mihir Vahanwala:
Model Checking Markov Chains as Distribution Transformers. CoRR abs/2406.15087 (2024) - 2023
- [c3]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Adwait Godbole, Shankaranarayanan Krishna, Mihir Vahanwala:
Overcoming Memory Weakness with Unified Fairness - Systematic Verification of Liveness in Weak Memory Models. CAV (1) 2023: 184-205 - [c2]Mihir Vahanwala:
Robust Positivity Problems for Linear Recurrence Sequences: The Frontiers of Decidability for Explicitly Given Neighbourhoods. FSTTCS 2023: 17:1-17:21 - [i6]Mihir Vahanwala:
Robust Positivity Problems for low-order Linear Recurrence Sequences. CoRR abs/2305.04870 (2023) - [i5]Mihir Vahanwala:
Skolem and Positivity Completeness of Ergodic Markov Chains. CoRR abs/2305.04881 (2023) - [i4]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Adwait Godbole, Shankaranarayanan Krishna, Mihir Vahanwala:
Overcoming Memory Weakness with Unified Fairness. CoRR abs/2305.17605 (2023) - [i3]Mihir Vahanwala:
Characterising Robust Instances of Ultimate Positivity for Linear Dynamical Systems. CoRR abs/2308.06421 (2023) - [i2]Valérie Berthé, Toghrul Karimov, Joël Ouaknine, Mihir Vahanwala, James Worrell:
The Monadic Theory of Toric Words. CoRR abs/2311.04895 (2023) - 2022
- [c1]S. Akshay, Hugo Bazille, Blaise Genest, Mihir Vahanwala:
On Robustness for the Skolem and Positivity Problems. STACS 2022: 5:1-5:20 - [i1]S. Akshay, Hugo Bazille, Blaise Genest, Mihir Vahanwala:
On Robustness for the Skolem, Positivity and Ultimate Positivity Problems. CoRR abs/2211.02365 (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 2024-10-23 21:24 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:
