Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKrishnendu Chatterjee
Person information
- affiliation: IST Austria, Klosterneuburg, Austria
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[c228]Krishnendu Chatterjee, Tobias Meggendorfer, Raimundo Saona, Jakub Svoboda
:
Faster Algorithm for Turn-based Stochastic Games with Bounded Treewidth. SODA 2023: 4590-4605- [c227]Krishnendu Chatterjee, Thomas A. Henzinger, Mathias Lechner, Dorde Zikelic:
A Learner-Verifier Framework for Neural Network Controllers and Certificates of Stochastic Systems. TACAS (1) 2023: 3-25 - 2022
- [j89]Krishnendu Chatterjee, Laurent Doyen:
Graph planning with expected finite horizon. J. Comput. Syst. Sci. 129: 1-21 (2022) - [j88]Krishnendu Chatterjee, Raimundo Saona, Bruno Ziliotto:
Finite-Memory Strategies in POMDPs with Long-Run Average Objectives. Math. Oper. Res. 47(1): 100-119 (2022) - [j87]Laura Schmid, Christian Hilbe, Krishnendu Chatterjee, Martin A. Nowak:
Direct reciprocity between individuals that use different strategy spaces. PLoS Comput. Biol. 18(6) (2022) - [c226]Mathias Lechner, Dorde Zikelic, Krishnendu Chatterjee, Thomas A. Henzinger:
Stability Verification in Stochastic Control Systems via Neural Network Supermartingales. AAAI 2022: 7326-7336 - [c225]Krishnendu Chatterjee, Amir Kafshdar Goharshady, Tobias Meggendorfer, Dorde Zikelic:
Sound and Complete Certificates for Quantitative Termination Analysis of Probabilistic Programs. CAV (1) 2022: 55-78 - [c224]Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Ismaël Jecker, Jakub Svoboda:
Complexity of Spatial Games. FSTTCS 2022: 11:1-11:14 - [c223]Ali Ahmadi, Krishnendu Chatterjee, Amir Kafshdar Goharshady, Tobias Meggendorfer, Roodabeh Safavi, Ðorde Zikelic:
Algorithms and Hardness Results for Computing Cores of Markov Chains. FSTTCS 2022: 29:1-29:20 - [e4]Jean-François Raskin, Krishnendu Chatterjee, Laurent Doyen, Rupak Majumdar:
Principles of Systems Design - Essays Dedicated to Thomas A. Henzinger on the Occasion of His 60th Birthday. Lecture Notes in Computer Science 13660, Springer 2022, ISBN 978-3-031-22336-5 [contents] - [i172]Dorde Zikelic, Mathias Lechner, Krishnendu Chatterjee, Thomas A. Henzinger:
Learning Stabilizing Policies in Stochastic Control Systems. CoRR abs/2205.11991 (2022) - [i171]Mahsa Bastankhah, Krishnendu Chatterjee, Mohammad Ali Maddah-Ali, Stefan Schmid, Jakub Svoboda, Michelle Yeo:
Online Admission Control and Rebalancing in Payment Channel Networks. CoRR abs/2209.11936 (2022) - [i170]Krishnendu Chatterjee, Mona Mohammadi, Raimundo Saona:
Repeated Prophet Inequality with Near-optimal Bounds. CoRR abs/2209.14368 (2022) - [i169]Krishnendu Chatterjee, Jakub Svoboda, Dorde Zikelic, Andreas Pavlogiannis, Josef Tkadlec:
Social Balance on Networks: Local Minima and Best Edge Dynamics. CoRR abs/2210.02394 (2022) - [i168]Matin Ansaripour, Mathias Lechner, Dorde Zikelic, Krishnendu Chatterjee, Thomas A. Henzinger:
Learning Control Policies for Region Stabilization in Stochastic Systems. CoRR abs/2210.05304 (2022) - [i167]Dorde Zikelic, Mathias Lechner, Thomas A. Henzinger, Krishnendu Chatterjee:
Learning Control Policies for Stochastic Systems with Reach-avoid Guarantees. CoRR abs/2210.05308 (2022) - [i166]Mathias Lechner, Dorde Zikelic, Krishnendu Chatterjee, Thomas A. Henzinger, Daniela Rus:
Quantization-aware Interval Bound Propagation for Training Certifiably Robust Quantized Neural Networks. CoRR abs/2211.16187 (2022) - 2021
- [j86]Krishnendu Chatterjee, Wolfgang Dvorák, Monika Henzinger, Alexander Svozil:
Algorithms and conditional lower bounds for planning problems. Artif. Intell. 297: 103499 (2021) - [j85]Martin Zeiner, Ulrich Schmid, Krishnendu Chatterjee:
Optimal strategies for selecting coordinators. Discret. Appl. Math. 289: 392-415 (2021) - [j84]Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Andreas Pavlogiannis:
Faster algorithms for quantitative verification in bounded treewidth graphs. Formal Methods Syst. Des. 57(3): 401-428 (2021) - [j83]Truc Lam Bui, Krishnendu Chatterjee, Tushar Gautam, Andreas Pavlogiannis, Viktor Toman:
The reads-from equivalence for the TSO and PSO memory models. Proc. ACM Program. Lang. 5(OOPSLA): 1-30 (2021) - [j82]Maria Kleshnina, Sabrina S. Streipert, Jerzy A. Filar, Krishnendu Chatterjee:
Mistakes can stabilise the dynamics of rock-paper-scissors games. PLoS Comput. Biol. 17(4) (2021) - [c222]Pratyush Agarwal, Krishnendu Chatterjee, Shreya Pathak, Andreas Pavlogiannis, Viktor Toman:
Stateless Model Checking Under a Reads-Value-From Equivalence. CAV (1) 2021: 341-366 - [c221]Krishnendu Chatterjee, Ehsan Kafshdar Goharshady, Petr Novotný, Jiri Zárevúcky, Dorde Zikelic:
On Lexicographic Proof Rules for Probabilistic Termination. FM 2021: 619-639 - [c220]Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Andreas Pavlogiannis:
Quantitative Verification on Product Graphs of Small Treewidth. FSTTCS 2021: 42:1-42:23 - [c219]Krishnendu Chatterjee, Monika Henzinger, Sagar Kale, Alexander Svozil:
Faster Algorithms for Bounded Liveness in Graphs and Game Graphs. ICALP 2021: 124:1-124:21 - [c218]Petr Tomásek, Karel Horák, Aditya Aradhye, Branislav Bosanský, Krishnendu Chatterjee:
Solving Partially Observable Stochastic Shortest-Path Games. IJCAI 2021: 4182-4189 - [c217]Krishnendu Chatterjee, Laurent Doyen:
Stochastic Processes with Expected Stopping Time. LICS 2021: 1-13 - [c216]Krishnendu Chatterjee, Wolfgang Dvorák, Monika Henzinger, Alexander Svozil:
Symbolic Time and Space Tradeoffs for Probabilistic Verification. LICS 2021: 1-13 - [c215]Mathias Lechner, Dorde Zikelic, Krishnendu Chatterjee, Thomas A. Henzinger:
Infinite Time Horizon Safety of Bayesian Neural Networks. NeurIPS 2021: 10171-10185 - [c214]Ali Asadi, Krishnendu Chatterjee, Hongfei Fu, Amir Kafshdar Goharshady, Mohammad Mahdavi:
Polynomial reachability witnesses via Stellensätze. PLDI 2021: 772-787 - [c213]Krishnendu Chatterjee, Ehsan Kafshdar Goharshady, Petr Novotný, Dorde Zikelic:
Proving non-termination by program reversal. PLDI 2021: 1033-1048 - [c212]Jinyi Wang, Yican Sun, Hongfei Fu, Krishnendu Chatterjee, Amir Kafshdar Goharshady:
Quantitative analysis of assertion violations in probabilistic programs. PLDI 2021: 1171-1186 - [c211]Suguman Bansal, Krishnendu Chatterjee, Moshe Y. Vardi:
On Satisficing in Quantitative Games. TACAS (1) 2021: 20-37 - [i165]Suguman Bansal, Krishnendu Chatterjee, Moshe Y. Vardi:
On Satisficing in Quantitative Games. CoRR abs/2101.02594 (2021) - [i164]Juho Hirvonen, Laura Schmid, Krishnendu Chatterjee, Stefan Schmid:
Classifying Convergence Complexity of Nash Equilibria in Graphical Games Using Distributed Computing Theory. CoRR abs/2102.13457 (2021) - [i163]Krishnendu Chatterjee, Ehsan Kafshdar Goharshady, Petr Novotný, Dorde Zikelic:
Proving Non-termination by Program Reversal. CoRR abs/2104.01189 (2021) - [i162]Krishnendu Chatterjee, Laurent Doyen:
Stochastic Processes with Expected Stopping Time. CoRR abs/2104.07278 (2021) - [i161]Krishnendu Chatterjee, Wolfgang Dvorák, Monika Henzinger, Alexander Svozil:
Symbolic Time and Space Tradeoffs for Probabilistic Verification. CoRR abs/2104.07466 (2021) - [i160]Pratyush Agarwal, Krishnendu Chatterjee, Shreya Pathak, Andreas Pavlogiannis, Viktor Toman:
Stateless Model Checking under a Reads-Value-From Equivalence. CoRR abs/2105.06424 (2021) - [i159]Krishnendu Chatterjee, Ehsan Kafshdar Goharshady, Petr Novotný, Jiri Zárevúcky, Dorde Zikelic:
On Lexicographic Proof Rules for Probabilistic Termination. CoRR abs/2108.02188 (2021) - [i158]Mathias Lechner, Dorde Zikelic, Krishnendu Chatterjee, Thomas A. Henzinger:
Infinite Time Horizon Safety of Bayesian Neural Networks. CoRR abs/2111.03165 (2021) - [i157]Mathias Lechner, Dorde Zikelic, Krishnendu Chatterjee, Thomas A. Henzinger:
Stability Verification in Stochastic Control Systems via Neural Network Supermartingales. CoRR abs/2112.09495 (2021) - 2020
- [j81]Peixin Wang, Hongfei Fu, Krishnendu Chatterjee, Yuxin Deng, Ming Xu:
Proving expected sensitivity of probabilistic programs with randomized variable-dependent termination time. Proc. ACM Program. Lang. 4(POPL): 25:1-25:30 (2020) - [j80]Josef Tkadlec, Andreas Pavlogiannis, Krishnendu Chatterjee, Martin A. Nowak:
Limits on amplifiers of natural selection under death-Birth updating. PLoS Comput. Biol. 16(1) (2020) - [j79]Kamran Kaveh, Alex McAvoy, Krishnendu Chatterjee, Martin A. Nowak:
The Moran process on 2-chromatic graphs. PLoS Comput. Biol. 16(11): 1008402 (2020) - [j78]Andreas Pavlogiannis, Nico Schaumberger, Ulrich Schmid, Krishnendu Chatterjee:
Precedence-Aware Automated Competitive Analysis of Real-Time Scheduling. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 39(11): 3981-3992 (2020) - [c210]Tomás Brázdil, Krishnendu Chatterjee, Petr Novotný, Jiri Vahala:
Reinforcement Learning of Risk-Constrained Policies in Markov Decision Processes. AAAI 2020: 9794-9801 - [c209]Krishnendu Chatterjee, Martin Chmelík, Deep Karkhanis, Petr Novotný, Amélie Royer:
Multiple-Environment Markov Decision Processes: Efficient Analysis and Applications. ICAPS 2020: 48-56 - [c208]Ali Asadi, Krishnendu Chatterjee, Amir Kafshdar Goharshady, Kiarash Mohammadi, Andreas Pavlogiannis:
Faster Algorithms for Quantitative Analysis of MCs and MDPs with Small Treewidth. ATVA 2020: 253-270 - [c207]Krishnendu Chatterjee, Joost-Pieter Katoen, Maximilian Weininger, Tobias Winkler:
Stochastic Games with Lexicographic Reachability-Safety Objectives. CAV (2) 2020: 398-420 - [c206]Krishnendu Chatterjee, Thomas A. Henzinger, Jan Otop:
Multi-Dimensional Long-Run Average Problems for Vector Addition Systems with States. CONCUR 2020: 23:1-23:22 - [c205]Krishnendu Chatterjee, Amir Kafshdar Goharshady, Rasmus Ibsen-Jensen, Andreas Pavlogiannis:
Optimal and Perfectly Parallel Algorithms for On-demand Data-Flow Analysis. ESOP 2020: 112-140 - [c204]Pranav Ashok, Krishnendu Chatterjee, Jan Kretínský, Maximilian Weininger, Tobias Winkler:
Approximating Values of Generalized-Reachability Stochastic Games. LICS 2020: 102-115 - [c203]Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Ismaël Jecker, Jakub Svoboda:
Simplified Game of Life: Algorithms and Complexity. MFCS 2020: 22:1-22:13 - [c202]Krishnendu Chatterjee, Hongfei Fu, Amir Kafshdar Goharshady, Ehsan Kafshdar Goharshady:
Polynomial invariant generation for non-deterministic recursive programs. PLDI 2020: 672-687 - [i156]Krishnendu Chatterjee, Amir Kafshdar Goharshady, Rasmus Ibsen-Jensen, Andreas Pavlogiannis:
Optimal and Perfectly Parallel Algorithms for On-demand Data-flow Analysis. CoRR abs/2001.11070 (2020) - [i155]Tomás Brázdil, Krishnendu Chatterjee, Petr Novotný, Jiri Vahala:
Reinforcement Learning of Risk-Constrained Policies in Markov Decision Processes. CoRR abs/2002.12086 (2020) - [i154]Ali Asadi, Krishnendu Chatterjee, Amir Kafshdar Goharshady, Kiarash Mohammadi, Andreas Pavlogiannis:
Faster Algorithms for Quantitative Analysis of Markov Chains and Markov Decision Processes with Small Treewidth. CoRR abs/2004.08828 (2020) - [i153]Krishnendu Chatterjee, Joost-Pieter Katoen, Maximilian Weininger, Tobias Winkler:
Stochastic Games with Lexicographic Reachability-Safety Objectives. CoRR abs/2005.04018 (2020) - [i152]Krishnendu Chatterjee, Thomas A. Henzinger, Jan Otop:
Multi-dimensional Long-Run Average Problems for Vector Addition Systems with States. CoRR abs/2007.08917 (2020) - [i151]Ali Asadi, Krishnendu Chatterjee, Hongfei Fu, Amir Kafshdar Goharshady, Mohammad Mahdavi:
Inductive Reachability Witnesses. CoRR abs/2007.14259 (2020) - [i150]Jinyi Wang, Yican Sun, Hongfei Fu, Mingzhang Huang, Amir Kafshdar Goharshady, Krishnendu Chatterjee:
Concentration-Bound Analysis for Probabilistic Programs and Probabilistic Recurrence Relations. CoRR abs/2008.00425 (2020) - [i149]Krishnendu Chatterjee, Ehsan Kafshdar Goharshady, Petr Novotný, Jiri Zárevúcky, Dorde Zikelic:
Proving Almost-Sure Termination of Probabilistic Programs via Incremental Pruning. CoRR abs/2008.06295 (2020) - [i148]Truc Lam Bui, Krishnendu Chatterjee, Tushar Gautam, Andreas Pavlogiannis, Viktor Toman:
The Reads-From Equivalence for the TSO and PSO Memory Models. CoRR abs/2011.11763 (2020) - [i147]Jinyi Wang, Yican Sun, Hongfei Fu, Amir Kafshdar Goharshady, Krishnendu Chatterjee:
Quantitative Analysis of Assertion Violations in Probabilistic Programs. CoRR abs/2011.14617 (2020)
2010 – 2019
- 2019
- [j77]Krishnendu Chatterjee, Thomas A. Henzinger, Jan Otop:
Quantitative Automata under Probabilistic Semantics. Log. Methods Comput. Sci. 15(3) (2019) - [j76]Krishnendu Chatterjee, Andreas Pavlogiannis, Viktor Toman:
Value-centric dynamic partial order reduction. Proc. ACM Program. Lang. 3(OOPSLA): 124:1-124:29 (2019) - [j75]Mingzhang Huang, Hongfei Fu, Krishnendu Chatterjee, Amir Kafshdar Goharshady:
Modular verification for almost-sure termination of probabilistic programs. Proc. ACM Program. Lang. 3(OOPSLA): 129:1-129:29 (2019) - [j74]Krishnendu Chatterjee, Amir Kafshdar Goharshady, Nastaran Okati, Andreas Pavlogiannis:
Efficient parameterized algorithms for data packing. Proc. ACM Program. Lang. 3(POPL): 53:1-53:28 (2019) - [j73]Krishnendu Chatterjee, Hongfei Fu, Amir Kafshdar Goharshady:
Non-polynomial Worst-Case Analysis of Recursive Programs. ACM Trans. Program. Lang. Syst. 41(4): 20:1-20:52 (2019) - [j72]Krishnendu Chatterjee, Amir Kafshdar Goharshady, Prateesh Goyal, Rasmus Ibsen-Jensen, Andreas Pavlogiannis:
Faster Algorithms for Dynamic Algebraic Queries in Basic RSMs with Constant Treewidth. ACM Trans. Program. Lang. Syst. 41(4): 23:1-23:46 (2019) - [c201]Tomás Brázdil, Krishnendu Chatterjee, Antonín Kucera, Petr Novotný, Dominik Velan:
Deciding Fast Termination for Probabilistic VASS with Nondeterminism. ATVA 2019: 462-478 - [c200]Guy Avni, Roderick Bloem, Krishnendu Chatterjee, Thomas A. Henzinger, Bettina Könighofer, Stefan Pranger:
Run-Time Optimization for Learned Controllers Through Quantitative Games. CAV (1) 2019: 630-649 - [c199]Krishnendu Chatterjee, Nir Piterman:
Combinations of Qualitative Winning for Stochastic Parity Games. CONCUR 2019: 6:1-6:17 - [c198]Krishnendu Chatterjee, Wolfgang Dvorák, Monika Henzinger, Alexander Svozil:
Near-Linear Time Algorithms for Streett Objectives in Graphs and MDPs. CONCUR 2019: 7:1-7:16 - [c197]Krishnendu Chatterjee, Thomas A. Henzinger, Jan Otop:
Long-Run Average Behavior of Vector Addition Systems with States. CONCUR 2019: 27:1-27:16 - [c196]Krishnendu Chatterjee, Amir Kafshdar Goharshady, Arash Pourdamghani:
Probabilistic Smart Contracts: Secure Randomness on the Blockchain. IEEE ICBC 2019: 403-412 - [c195]Krishnendu Chatterjee, Laurent Doyen:
Graph Planning with Expected Finite Horizon. LICS 2019: 1-13 - [c194]Laura Schmid, Krishnendu Chatterjee, Stefan Schmid:
The Evolutionary Price of Anarchy: Locally Bounded Agents in a Dynamic Virus Game. OPODIS 2019: 21:1-21:16 - [c193]Peixin Wang, Hongfei Fu, Amir Kafshdar Goharshady, Krishnendu Chatterjee, Xudong Qin, Wenjun Shi:
Cost analysis of nondeterministic probabilistic programs. PLDI 2019: 204-220 - [c192]Pranav Ashok, Tomás Brázdil, Krishnendu Chatterjee, Jan Kretínský, Christoph H. Lampert, Viktor Toman:
Strategy Representation by Decision Trees with Linear Classifiers. QEST 2019: 109-128 - [c191]Krishnendu Chatterjee, Amir Kafshdar Goharshady, Arash Pourdamghani:
Hybrid mining: exploiting blockchain's computational power for distributed problem solving. SAC 2019: 374-381 - [c190]Krishnendu Chatterjee, Amir Kafshdar Goharshady, Ehsan Kafshdar Goharshady:
The treewidth of smart contracts. SAC 2019: 400-408 - [c189]Hongfei Fu, Krishnendu Chatterjee:
Termination of Nondeterministic Probabilistic Programs. VMCAI 2019: 468-490 - [i146]Mingzhang Huang, Hongfei Fu, Krishnendu Chatterjee, Amir Kafshdar Goharshady:
Compositional Analysis for Almost-Sure Termination of Probabilistic Programs. CoRR abs/1901.06087 (2019) - [i145]Krishnendu Chatterjee, Hongfei Fu, Amir Kafshdar Goharshady, Ehsan Kafshdar Goharshady:
Polynomial Invariant Generation for Non-deterministic Recursive Programs. CoRR abs/1902.04373 (2019) - [i144]Krishnendu Chatterjee, Hongfei Fu, Amir Kafshdar Goharshady, Peixin Wang, Xudong Qin, Wenjun Shi:
Cost Analysis of Nondeterministic Probabilistic Programs. CoRR abs/1902.04659 (2019) - [i143]Peixin Wang, Hongfei Fu, Krishnendu Chatterjee, Kangli He, Ming Xu:
Proving Expected Sensitivity of Probabilistic Programs with Randomized Execution Time. CoRR abs/1902.04744 (2019) - [i142]Krishnendu Chatterjee, Amir Kafshdar Goharshady, Arash Pourdamghani:
Probabilistic Smart Contracts: Secure Randomness on the Blockchain. CoRR abs/1902.07986 (2019) - [i141]Krishnendu Chatterjee, Raimundo Saona, Bruno Ziliotto:
The Complexity of POMDPs with Long-run Average Objectives. CoRR abs/1904.13360 (2019) - [i140]Krishnendu Chatterjee, Thomas A. Henzinger, Jan Otop:
Long-Run Average Behavior of Vector Addition Systems with States. CoRR abs/1905.05537 (2019) - [i139]Krishnendu Chatterjee, Laura Schmid, Stefan Schmid:
The Evolutionary Price of Anarchy: Locally Bounded Agents in a Dynamic Virus Game. CoRR abs/1906.00110 (2019) - [i138]Pranav Ashok, Tomás Brázdil, Krishnendu Chatterjee, Jan Kretínský, Christoph H. Lampert, Viktor Toman:
Strategy Representation by Decision Trees with Linear Classifiers. CoRR abs/1906.08178 (2019) - [i137]Tomás Brázdil, Krishnendu Chatterjee, Antonín Kucera, Petr Novotný, Dominik Velan:
Deciding Fast Termination for Probabilistic VASS with Nondeterminism. CoRR abs/1907.11010 (2019) - [i136]Krishnendu Chatterjee, Andreas Pavlogiannis, Viktor Toman:
Value-centric Dynamic Partial Order Reduction. CoRR abs/1909.00989 (2019) - [i135]Krishnendu Chatterjee, Wolfgang Dvorák, Monika Henzinger, Alexander Svozil:
Quasipolynomial Set-Based Symbolic Algorithms for Parity Games. CoRR abs/1909.04983 (2019) - [i134]Krishnendu Chatterjee, Wolfgang Dvorák, Monika Henzinger, Alexander Svozil:
Near-Linear Time Algorithms for Streett Objectives in Graphs and MDPs. CoRR abs/1909.05539 (2019) - [i133]Krishnendu Chatterjee, Bhavya Choudhary, Andreas Pavlogiannis:
Optimal Dyck Reachability for Data-Dependence and Alias Analysis. CoRR abs/1910.00241 (2019) - 2018
- [j71]Krishnendu Chatterjee, Bhavya Choudhary, Andreas Pavlogiannis:
Optimal Dyck reachability for data-dependence and alias analysis. Proc. ACM Program. Lang. 2(POPL): 30:1-30:30 (2018) - [j70]Marek Chalupa, Krishnendu Chatterjee, Andreas Pavlogiannis, Nishant Sinha, Kapil Vaidya:
Data-centric dynamic partial order reduction. Proc. ACM Program. Lang. 2(POPL): 31:1-31:30 (2018) - [j69]Sheshansh Agrawal, Krishnendu Chatterjee, Petr Novotný:
Lexicographic ranking supermartingales: an efficient approach to termination of probabilistic programs. Proc. ACM Program. Lang. 2(POPL): 34:1-34:32 (2018) - [j68]Krishnendu Chatterjee, Andreas Pavlogiannis, Alexander Kößler, Ulrich Schmid:
Automated competitive analysis of real-time scheduling with graph games. Real Time Syst. 54(1): 166-207 (2018) - [j67]Krishnendu Chatterjee, Hongfei Fu, Petr Novotný, Rouzbeh Hasheminezhad:
Algorithmic Analysis of Qualitative and Quantitative Termination Problems for Affine Probabilistic Programs. ACM Trans. Program. Lang. Syst. 40(2): 7:1-7:45 (2018) - [j66]Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Amir Kafshdar Goharshady, Andreas Pavlogiannis:
Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components. ACM Trans. Program. Lang. Syst. 40(3): 9:1-9:43 (2018) - [c188]Krishnendu Chatterjee, Martin Chmelik, Ufuk Topcu:
Sensor Synthesis for POMDPs with Reachability Objectives. ICAPS 2018: 47-55 - [c187]Krishnendu Chatterjee, Wolfgang Dvorák, Monika Henzinger, Alexander Svozil:
Algorithms and Conditional Lower Bounds for Planning Problems. ICAPS 2018: 56-64 - [c186]Mingzhang Huang, Hongfei Fu, Krishnendu Chatterjee:
New Approaches for Almost-Sure Termination of Probabilistic Programs. APLAS 2018: 181-201 - [c185]Krishnendu Chatterjee, Thomas A. Henzinger, Jan Otop:
Computing Average Response Time. Principles of Modeling 2018: 143-161 - [c184]Krishnendu Chatterjee, Monika Henzinger, Veronika Loitzenbauer, Simin Oraee, Viktor Toman:
Symbolic Algorithms for Graphs and Markov Decision Processes with Fairness Objectives. CAV (2) 2018: 178-197 - [c183]Krishnendu Chatterjee, Amir Kafshdar Goharshady, Rasmus Ibsen-Jensen, Yaron Velner:
Ergodic Mean-Payoff Games for the Analysis of Attacks in Crypto-Currencies. CONCUR 2018: 11:1-11:17 - [c182]Krishnendu Chatterjee, Amir Kafshdar Goharshady, Yaron Velner:
Quantitative Analysis of Smart Contracts. ESOP 2018: 739-767 - [c181]Krishnendu Chatterjee, Adrián Elgyütt, Petr Novotný, Owen Rouillé:
Expectation Optimization with Probabilistic Guarantees in POMDPs with Discounted-Sum Objectives. IJCAI 2018: 4692-4699 - [c180]Krishnendu Chatterjee, Hongfei Fu, Amir Kafshdar Goharshady, Nastaran Okati:
Computational Approaches for Stochastic Shortest Path on Succinct MDPs. IJCAI 2018: 4700-4707 - [c179]Karel Horák, Branislav Bosanský, Krishnendu Chatterjee:
Goal-HSVI: Heuristic Search Value Iteration for Goal POMDPs. IJCAI 2018: 4764-4770 - [c178]Amir Kafshdar Goharshady, Ali Behrouz, Krishnendu Chatterjee:
Secure Credit Reporting on the Blockchain. iThings/GreenCom/CPSCom/SmartData 2018: 1343-1348 - [c177]Tomás Brázdil, Krishnendu Chatterjee, Antonín Kucera, Petr Novotný, Dominik Velan, Florian Zuleger:
Efficient Algorithms for Asymptotic Bounds on Termination Time in VASS. LICS 2018: 185-194 - [c176]Krishnendu Chatterjee, Wolfgang Dvorák, Monika Henzinger, Alexander Svozil:
Quasipolynomial Set-Based Symbolic Algorithms for Parity Games. LPAR 2018: 233-253 - [c175]