DOI,IST REx ID,Research Group,Title of publication
10.1109/CSF.2011.21,3361,"ToHe,KrCh",The complexity of quantitative information flow problems
10.48550/arXiv.1104.0127,3363,"KrCh,ToHe",The decidability frontier for probabilistic automata on infinite words
10.1007/978-3-642-19835-9_24,3365,"KrCh,ToHe",QUASY: quantitative synthesis tool
10.1007/978-3-642-22110-1_20,3366,"ToHe,KrCh",Quantitative synthesis for concurrent programs
10.15479/AT:IST-2011-0009,5379,KrCh,An O(n2) time algorithm for alternating Büchi games
10.15479/AT:IST-2011-0008,5380,KrCh,Bounded rationality in concurrent parity games
10.15479/AT:IST-2011-0007,5381,KrCh,Partial-observation stochastic games: How to win when belief fails
10.15479/AT:IST-2011-0006,5382,KrCh,Robustness of structurally equivalent concurrent parity games
10.15479/AT:IST-2011-0004,5384,KrCh,Decidable problems for probabilistic automata on infinite words
10.15479/AT:IST-2011-0003,5385,"ToHe,KrCh",Temporal specifications with accumulative values
10.15479/AT:IST-2011-0001,5387,KrCh,Energy and mean-payoff parity Markov decision processes
10.4204/EPTCS.25.7,489,KrCh,How do we remember the past in randomised strategies?
10.15479/AT:IST-2010-0004,5388,"KrCh,ToHe",Quantitative synthesis for concurrent programs
10.15479/AT:IST-2010-0002,5390,KrCh,"Topological, automata-theoretic and logical characterization of finitary languages"
10.1007/978-3-642-14162-1_50,3851,KrCh,Energy parity games
10.4204/EPTCS.25.6,3852,KrCh,Discounting in games across time scales
10.1007/978-3-642-15375-4_19,3853,"KrCh,HeEd,ToHe",Mean-payoff automaton expressions
10.1007/978-3-642-15375-4_20,3854,KrCh,Obliging games
10.1007/978-3-642-15155-2_24,3855,"KrCh,ToHe",Qualitative analysis of partially-observable Markov Decision Processes
10.1007/978-3-642-15155-2_23,3856,"KrCh,ToHe",Randomness for free