| Data-centric dynamic partial order reduction M Chalupa, K Chatterjee, A Pavlogiannis, N Sinha, K Vaidya Proceedings of the ACM on Programming Languages 2 (POPL), 1-30, 2017 | 79 | 2017 |
| Population structure determines the tradeoff between fixation probability and fixation time J Tkadlec, A Pavlogiannis, K Chatterjee, MA Nowak Communications biology 2 (1), 138, 2019 | 74 | 2019 |
| Passively mobile communicating machines that use restricted space I Chatzigiannakis, O Michail, S Nikolaou, A Pavlogiannis, PG Spirakis Proceedings of the 7th ACM ACM SIGACT/SIGMOBILE International Workshop on …, 2011 | 74 | 2011 |
| Optimal Dyck reachability for data-dependence and alias analysis K Chatterjee, B Choudhary, A Pavlogiannis Proceedings of the ACM on Programming Languages 2 (POPL), 1-30, 2017 | 70 | 2017 |
| Construction of arbitrarily strong amplifiers of natural selection using evolutionary graph theory A Pavlogiannis, J Tkadlec, K Chatterjee, MA Nowak Communications biology 1 (1), 71, 2018 | 62 | 2018 |
| Limits on amplifiers of natural selection under death-Birth updating J Tkadlec, A Pavlogiannis, K Chatterjee, MA Nowak PLoS computational biology 16 (1), e1007494, 2020 | 57 | 2020 |
| Fast, sound, and effectively complete dynamic race prediction A Pavlogiannis Proceedings of the ACM on Programming Languages 4 (POPL), 1-29, 2019 | 50 | 2019 |
| Amplification on undirected population structures: comets beat stars A Pavlogiannis, J Tkadlec, K Chatterjee, MA Nowak Scientific reports 7 (1), 82, 2017 | 49 | 2017 |
| The time scale of evolutionary innovation K Chatterjee, A Pavlogiannis, B Adlam, MA Nowak PLoS computational biology 10 (9), e1003818, 2014 | 47 | 2014 |
| Fast and strong amplifiers of natural selection J Tkadlec, A Pavlogiannis, K Chatterjee, MA Nowak Nature Communications 12 (1), 4009, 2021 | 39 | 2021 |
| Distributed synthesis for LTL fragments K Chatterjee, TA Henzinger, J Otop, A Pavlogiannis 2013 Formal Methods in Computer-Aided Design, 18-25, 2013 | 35 | 2013 |
| Optimal prediction of synchronization-preserving races U Mathur, A Pavlogiannis, M Viswanathan Proceedings of the ACM on Programming Languages 5 (POPL), 1-29, 2021 | 34 | 2021 |
| Value-centric dynamic partial order reduction K Chatterjee, A Pavlogiannis, V Toman Proceedings of the ACM on Programming Languages 3 (OOPSLA), 1-29, 2019 | 31 | 2019 |
| Algorithms for algebraic path properties in concurrent systems of constant treewidth components K Chatterjee, AK Goharshady, R Ibsen-Jensen, A Pavlogiannis Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of …, 2016 | 29 | 2016 |
| Faster algorithms for algebraic path properties in recursive state machines with constant treewidth K Chatterjee, R Ibsen-Jensen, A Pavlogiannis, P Goyal Proceedings of the 42Nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of …, 2015 | 29 | 2015 |
| The complexity of dynamic data race prediction U Mathur, A Pavlogiannis, M Viswanathan Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer …, 2020 | 25 | 2020 |
| Efficient parameterized algorithms for data packing K Chatterjee, AK Goharshady, N Okati, A Pavlogiannis Proceedings of the ACM on Programming Languages 3 (POPL), 1-28, 2019 | 25 | 2019 |
| Optimal and perfectly parallel algorithms for on-demand data-flow analysis K Chatterjee, AK Goharshady, R Ibsen-Jensen, A Pavlogiannis Programming Languages and Systems: 29th European Symposium on Programming …, 2020 | 23 | 2020 |
| Stateless model checking under a reads-value-from equivalence P Agarwal, K Chatterjee, S Pathak, A Pavlogiannis, V Toman International Conference on Computer Aided Verification, 341-366, 2021 | 22 | 2021 |
| Faster algorithms for dynamic algebraic queries in basic RSMs with constant treewidth K Chatterjee, AK Goharshady, P Goyal, R Ibsen-Jensen, A Pavlogiannis ACM Transactions on Programming Languages and Systems (TOPLAS) 41 (4), 1-46, 2019 | 21 | 2019 |
Krishnendu ChatterjeeProfessor, IST AustriaVerified email at ist.ac.at
