BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Austria
1 × Estonia
1 × France
1 × Norway
1 × Portugal
1 × Spain
1 × The Netherlands
2 × USA
Collaborated with:
M.Y.Vardi W.Fokkink Y.Lustig T.Chen S.Blom K.Chatterjee L.Doyen
Talks about:
readi (4) finit (4) trace (3) probabilist (2) stochast (2) alphabet (2) partial (2) infinit (2) semant (2) pariti (2)

Person: Sumit Nain

DBLP DBLP: Nain:Sumit

Contributed to:

FoSSaCS 20142014
LICS 20132013
FOSSACS 20122012
CSL 20112011
LICS 20092009
FoSSaCS 20062006
ICALP 20052005
FoSSaCS 20042004
ICALP 20032003

Wrote 9 papers:

FoSSaCS-2014-Chatterjee0NV #complexity #game studies #probability
The Complexity of Partial-Observation Stochastic Parity Games with Finite-Memory Strategies (KC, LD, SN, MYV), pp. 242–257.
LICS-2013-NainV #game studies #probability
Solving Partial-Information Stochastic Parity Games (SN, MYV), pp. 341–348.
FoSSaCS-2012-NainV #probability
Synthesizing Probabilistic Composers (SN, MYV), pp. 421–436.
CSL-2011-LustigNV #component #probability #synthesis
Synthesis from Probabilistic Components (YL, SN, MYV), pp. 412–427.
LICS-2009-NainV #semantics
Trace Semantics is Fully Abstract (SN, MYV), pp. 59–68.
FoSSaCS-2006-ChenFN #finite #infinity #on the #simulation
On Finite Alphabets and Infinite Bases II: Completed and Ready Simulation (TC, WF, SN), pp. 1–15.
ICALP-2005-FokkinkN #finite #semantics
A Finite Basis for Failure Semantics (WF, SN), pp. 755–765.
FoSSaCS-2004-FokkinkN #finite #infinity #on the
On Finite Alphabets and Infinite Bases: From Ready Pairs to Possible Worlds (WF, SN), pp. 182–194.
ICALP-2003-BlomFN #axiom #on the #simulation
On the Axiomatizability of Ready Traces, Ready Simulation, and Failure Traces (SB, WF, SN), pp. 109–118.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.