default search action
Lakshmi Manasa
Person information
- affiliation: IIT Bombay, India
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
- [c11]S. Akshay, Patricia Bouyer, Shankara Narayanan Krishna, Lakshmi Manasa, Ashutosh Trivedi:
Stochastic Timed Games Revisited. MFCS 2016: 8:1-8:14 - [i5]S. Akshay, Patricia Bouyer, Shankara Narayanan Krishna, Lakshmi Manasa, Ashutosh Trivedi:
Stochastic Timed Games Revisited. CoRR abs/1607.05671 (2016) - 2015
- [c10]Shibashis Guha, Shankara Narayanan Krishna, Lakshmi Manasa, Ashutosh Trivedi:
Revisiting Robustness in Priced Timed Games. FSTTCS 2015: 261-277 - [c9]Shankara Narayanan Krishna, Lakshmi Manasa, Ashutosh Trivedi:
What's decidable about recursive hybrid automata? HSCC 2015: 31-40 - [c8]Shankara Narayanan Krishna, Lakshmi Manasa, Ashutosh Trivedi:
Time-Bounded Reachability Problem for Recursive Timed Automata is Undecidable. LATA 2015: 237-248 - [c7]Ankush Das, Shankara Narayanan Krishna, Lakshmi Manasa, Ashutosh Trivedi, Dominik Wojtczak:
On Pure Nash Equilibria in Stochastic Games. TAMC 2015: 359-371 - [c6]Shankara Narayanan Krishna, Lakshmi Manasa, Ashutosh Trivedi:
Reachability Games on Recursive Hybrid Automata. TIME 2015: 150-159 - [i4]Shibashis Guha, Shankara Narayanan Krishna, Lakshmi Manasa, Ashutosh Trivedi:
Revisiting Robustness in Priced Timed Games. CoRR abs/1507.05787 (2015) - 2014
- [c5]Thomas Brihaye, Gilles Geeraerts, Shankara Narayanan Krishna, Lakshmi Manasa, Benjamin Monmege, Ashutosh Trivedi:
Adding Negative Prices to Priced Timed Games. CONCUR 2014: 560-575 - [c4]Shankara Narayanan Krishna, Lakshmi Manasa, Ashutosh Trivedi:
Improved Undecidability Results for Reachability Games on Recursive Timed Automata. GandALF 2014: 245-259 - [i3]Thomas Brihaye, Gilles Geeraerts, Shankara Narayanan Krishna, Lakshmi Manasa, Benjamin Monmege, Ashutosh Trivedi:
Adding Negative Prices to Priced Timed Games. CoRR abs/1404.5894 (2014) - [i2]Shankara Narayanan Krishna, Lakshmi Manasa, Ashutosh Trivedi:
On The Reachability Problem for Recursive Hybrid Automata with One and Two Players. CoRR abs/1406.7289 (2014) - 2012
- [c3]Shankara Narayanan Krishna, Lakshmi Manasa, Ashish Chiplunkar:
Nash Equilibrium in Weighted Concurrent Timed Games with Reachability Objectives. ICDCIT 2012: 117-128 - 2011
- [j1]Lakshmi Manasa, Shankara Narayanan Krishna, Chinmay Jain:
Model Checking Weighted Integer Reset Timed Automata. Theory Comput. Syst. 48(3): 648-679 (2011) - 2010
- [i1]Lakshmi Manasa, Shankara Narayanan Krishna:
Integer Reset Timed Automata: Clock Reduction and Determinizability. CoRR abs/1001.1215 (2010)
2000 – 2009
- 2008
- [c2]Lakshmi Manasa, Shankara Narayanan Krishna, Kumar Nagaraj:
Updatable Timed Automata with Additive and Diagonal Constraints. CiE 2008: 407-416 - [c1]P. Vijay Suman, Paritosh K. Pandya, Shankara Narayanan Krishna, Lakshmi Manasa:
Timed Automata with Integer Resets: Language Inclusion and Expressiveness. FORMATS 2008: 78-92
Coauthor Index
aka: Shankara Narayanan Krishna
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-07 21:13 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint