DOI,IST REx ID,Research Group,Title of publication
10.24963/ijcai.2018/653,5977,KrCh,Computational approaches for stochastic shortest path on succinct MDPs
10.1145/3009837.3009873,1194,KrCh,Stochastic invariants for probabilistic termination
10.1016/j.jcss.2016.09.009,1294,KrCh,Trading performance for stability in Markov decision processes
10.1007/978-3-662-54577-5_26,13160,KrCh,Index appearance record for transforming Rabin automata into parity automata
10.1016/j.nahs.2016.04.006,1407,"ToHe,KrCh",Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games
10.1038/s41598-017-00107-w,512,KrCh,Amplification on undirected population structures: Comets beat stars
10.15479/AT:IST-2017-870-v1-1,5455,KrCh,Optimal Dyck reachability for data-dependence and alias analysis
10.15479/AT:IST-2017-872-v1-1,5456,KrCh,Data-centric dynamic partial order reduction
10.4230/LIPIcs.MFCS.2017.61,551,KrCh,Faster Monte Carlo algorithms for fixation probability of the Moran process on undirected graphs
10.4230/LIPIcs.MFCS.2017.39,552,KrCh,Faster algorithms for mean-payoff parity games
10.4230/LIPIcs.MFCS.2017.55,553,KrCh,Strategy complexity of concurrent safety games
10.15479/AT:ISTA:51,5559,KrCh,Strong amplifiers of natural selection
10.1007/978-3-319-63121-9_18,625,"KrCh,ToHe",The cost of exactness in quantitative reachability
10.1007/978-3-319-63387-9_6,628,KrCh,Automated recurrence analysis for almost linear expected runtime bounds
null,1009,KrCh,Optimizing expectation with guarantees in POMDPs
10.1007/978-3-662-54434-1_11,1011,"KrCh,ToHe",Faster algorithms for weighted recursive state machines
10.1145/3158118,10416,KrCh,Optimal Dyck reachability for data-dependence and Alias analysis
10.1145/3158121,10418,"KrCh,ToHe",A new proof rule for almost-sure termination
10.1016/j.ipl.2017.02.003,1065,"KrCh,HeEd",Pushdown reachability with constant treewidth
10.1016/j.ic.2016.10.006,1066,"KrCh,ToHe",Quantitative fair simulation games