default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSumit Nain
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2014
[j3]Sumit Nain, Yoad Lustig, Moshe Y. Vardi:
Synthesis from Probabilistic Components. Log. Methods Comput. Sci. 10(2) (2014)- 2008
- [j2]Taolue Chen
, Wan J. Fokkink, Bas Luttik, Sumit Nain:
On finite alphabets and infinite bases. Inf. Comput. 206(5): 492-519 (2008) - 2006
- [j1]Luca Aceto, Wan J. Fokkink, Anna Ingólfsdóttir, Sumit Nain:
Bisimilarity is not finitely based over BPA with interrupt. Theor. Comput. Sci. 366(1-2): 60-81 (2006)
Conference and Workshop Papers
- 2014
- [c11]Krishnendu Chatterjee, Laurent Doyen, Sumit Nain, Moshe Y. Vardi:
The Complexity of Partial-Observation Stochastic Parity Games with Finite-Memory Strategies. FoSSaCS 2014: 242-257 - 2013
- [c10]Sumit Nain, Moshe Y. Vardi:
Solving Partial-Information Stochastic Parity Games. LICS 2013: 341-348 - 2012
- [c9]Sumit Nain, Moshe Y. Vardi:
Synthesizing Probabilistic Composers. FoSSaCS 2012: 421-436 - 2011
- [c8]Yoad Lustig, Sumit Nain, Moshe Y. Vardi:
Synthesis from Probabilistic Components. CSL 2011: 412-427 - 2009
- [c7]Sumit Nain, Moshe Y. Vardi:
Trace Semantics is Fully Abstract. LICS 2009: 59-68 - 2007
- [c6]Sumit Nain, Moshe Y. Vardi:
Branching vs. Linear Time: Semantical Perspective. ATVA 2007: 19-34 - 2006
- [c5]Taolue Chen, Wan J. Fokkink, Sumit Nain:
On Finite Alphabets and Infinite Bases II: Completed and Ready Simulation. FoSSaCS 2006: 1-15 - 2005
- [c4]Luca Aceto, Wan J. Fokkink, Anna Ingólfsdóttir, Sumit Nain:
Bisimilarity Is Not Finitely Based over BPA with Interrupt. CALCO 2005: 52-66 - [c3]Wan J. Fokkink, Sumit Nain:
A Finite Basis for Failure Semantics. ICALP 2005: 755-765 - 2004
- [c2]Wan J. Fokkink, Sumit Nain:
On Finite Alphabets and Infinite Bases: From Ready Pairs to Possible Worlds. FoSSaCS 2004: 182-194 - 2003
- [c1]Stefan Blom, Wan J. Fokkink, Sumit Nain:
On the Axiomatizability of Ready Traces, Ready Simulation, and Failure Traces. ICALP 2003: 109-118
Informal and Other Publications
- 2014
- [i1]Krishnendu Chatterjee, Laurent Doyen, Sumit Nain, Moshe Y. Vardi:
The Complexity of Partial-observation Stochastic Parity Games With Finite-memory Strategies. CoRR abs/1401.3289 (2014)
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-09-04 00:29 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:
