Andreas Pavlogiannis
Chatterjee Group
49 Publications
2022 | Journal Article | IST-REx-ID: 10731 |

J. Svoboda, J. Tkadlec, A. Pavlogiannis, K. Chatterjee, and M. A. Nowak, “Infection dynamics of COVID-19 virus under lockdown and reopening,” Scientific Reports, vol. 12, no. 1. Springer Nature, 2022.
View
| Files available
| DOI
| arXiv
2022 | Journal Article | IST-REx-ID: 12257 |

K. Chatterjee, J. Svoboda, D. Zikelic, A. Pavlogiannis, and J. Tkadlec, “Social balance on networks: Local minima and best-edge dynamics,” Physical Review E, vol. 106, no. 3. American Physical Society, 2022.
View
| DOI
| Download Preprint (ext.)
| arXiv
2021 | Journal Article | IST-REx-ID: 10191 |

T. L. Bui, K. Chatterjee, T. Gautam, A. Pavlogiannis, and V. Toman, “The reads-from equivalence for the TSO and PSO memory models,” Proceedings of the ACM on Programming Languages, vol. 5, no. OOPSLA. Association for Computing Machinery, 2021.
View
| Files available
| DOI
| arXiv
2021 | Conference Paper | IST-REx-ID: 10629 |

K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, “Quantitative verification on product graphs of small treewidth,” in 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Virtual, 2021, vol. 213.
View
| Files available
| DOI
2021 | Journal Article | IST-REx-ID: 9640 |

J. Tkadlec, A. Pavlogiannis, K. Chatterjee, and M. A. Nowak, “Fast and strong amplifiers of natural selection,” Nature Communications, vol. 12, no. 1. Springer Nature, 2021.
View
| Files available
| DOI
| PubMed | Europe PMC
2021 | Conference Paper | IST-REx-ID: 9987 |

P. Agarwal, K. Chatterjee, S. Pathak, A. Pavlogiannis, and V. Toman, “Stateless model checking under a reads-value-from equivalence,” in 33rd International Conference on Computer-Aided Verification , Virtual, 2021, vol. 12759, pp. 341–366.
View
| Files available
| DOI
| arXiv
2020 | Journal Article | IST-REx-ID: 7212 |

J. Tkadlec, A. Pavlogiannis, K. Chatterjee, and M. A. Nowak, “Limits on amplifiers of natural selection under death-Birth updating,” PLoS computational biology, vol. 16. PLoS, 2020.
View
| Files available
| DOI
| arXiv
2020 | Journal Article | IST-REx-ID: 8788
A. Pavlogiannis, N. Schaumberger, U. Schmid, and K. Chatterjee, “Precedence-aware automated competitive analysis of real-time scheduling,” IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 39, no. 11. IEEE, pp. 3981–3992, 2020.
View
| DOI
2020 | Conference Paper | IST-REx-ID: 7810 |

K. Chatterjee, A. K. Goharshady, R. Ibsen-Jensen, and A. Pavlogiannis, “Optimal and perfectly parallel algorithms for on-demand data-flow analysis,” in European Symposium on Programming, Dublin, Ireland, 2020, vol. 12075, pp. 112–140.
View
| Files available
| DOI
2020 | Conference Paper | IST-REx-ID: 8728 |

A. Asadi, K. Chatterjee, A. K. Goharshady, K. Mohammadi, and A. Pavlogiannis, “Faster algorithms for quantitative analysis of MCs and MDPs with small treewidth,” in Automated Technology for Verification and Analysis, Hanoi, Vietnam, 2020, vol. 12302, pp. 253–270.
View
| Files available
| DOI
2019 | Conference Paper | IST-REx-ID: 10190 |

K. Chatterjee, A. Pavlogiannis, and V. Toman, “Value-centric dynamic partial order reduction,” in Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications, Athens, Greece, 2019, vol. 3.
View
| Files available
| DOI
| Download Published Version (ext.)
| arXiv
2019 | Journal Article | IST-REx-ID: 7210 |

J. Tkadlec, A. Pavlogiannis, K. Chatterjee, and M. A. Nowak, “Population structure determines the tradeoff between fixation probability and fixation time,” Communications Biology, vol. 2. Springer Nature, 2019.
View
| Files available
| DOI
| PubMed | Europe PMC
2019 | Journal Article | IST-REx-ID: 6380 |

K. Chatterjee, A. K. Goharshady, N. Okati, and A. Pavlogiannis, “Efficient parameterized algorithms for data packing,” Proceedings of the ACM on Programming Languages, vol. 3, no. POPL. ACM, 2019.
View
| Files available
| DOI
2019 | Journal Article | IST-REx-ID: 7158 |

K. Chatterjee, A. K. Goharshady, P. Goyal, R. Ibsen-Jensen, and A. Pavlogiannis, “Faster algorithms for dynamic algebraic queries in basic RSMs with constant treewidth,” ACM Transactions on Programming Languages and Systems, vol. 41, no. 4. ACM, 2019.
View
| Files available
| DOI
2018 | Journal Article | IST-REx-ID: 5751 |

A. Pavlogiannis, J. Tkadlec, K. Chatterjee, and M. A. Nowak, “Construction of arbitrarily strong amplifiers of natural selection using evolutionary graph theory,” Communications Biology, vol. 1, no. 1. Springer Nature, 2018.
View
| Files available
| DOI
2018 | Journal Article | IST-REx-ID: 738 |

K. Chatterjee, A. Pavlogiannis, A. Kößler, and U. Schmid, “Automated competitive analysis of real time scheduling with graph games,” Real-Time Systems, vol. 54, no. 1. Springer, pp. 166–207, 2018.
View
| Files available
| DOI
2018 | Journal Article | IST-REx-ID: 6009 |

K. Chatterjee, R. Ibsen-Jensen, A. K. Goharshady, and A. Pavlogiannis, “Algorithms for algebraic path properties in concurrent systems of constant treewidth components,” ACM Transactions on Programming Languages and Systems, vol. 40, no. 3. Association for Computing Machinery (ACM), 2018.
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2017 | Conference Paper | IST-REx-ID: 1011 |

K. Chatterjee, B. Kragl, S. Mishra, and A. Pavlogiannis, “Faster algorithms for weighted recursive state machines,” presented at the ESOP: European Symposium on Programming, Uppsala, Sweden, 2017, vol. 10201, pp. 287–313.
View
| DOI
| Download Submitted Version (ext.)
2017 | Journal Article | IST-REx-ID: 512 |

A. Pavlogiannis, J. Tkadlec, K. Chatterjee, and M. Nowak, “Amplification on undirected population structures: Comets beat stars,” Scientific Reports, vol. 7, no. 1. Nature Publishing Group, 2017.
View
| Files available
| DOI
2017 | Journal Article | IST-REx-ID: 10416 |

K. Chatterjee, B. Choudhary, and A. Pavlogiannis, “Optimal Dyck reachability for data-dependence and Alias analysis,” Proceedings of the ACM on Programming Languages, vol. 2, no. POPL. Association for Computing Machinery, 2017.
View
| Files available
| DOI
| arXiv
2017 | Technical Report | IST-REx-ID: 5455 |

K. Chatterjee, B. Choudhary, and A. Pavlogiannis, Optimal Dyck reachability for data-dependence and alias analysis. IST Austria, 2017.
View
| Files available
| DOI
2017 | Journal Article | IST-REx-ID: 10417 |

M. Chalupa, K. Chatterjee, A. Pavlogiannis, N. Sinha, and K. Vaidya, “Data-centric dynamic partial order reduction,” Proceedings of the ACM on Programming Languages, vol. 2, no. POPL. Association for Computing Machinery, 2017.
View
| Files available
| DOI
| Download Published Version (ext.)
| arXiv
2017 | Technical Report | IST-REx-ID: 5456 |

M. Chalupa, K. Chatterjee, A. Pavlogiannis, N. Sinha, and K. Vaidya, Data-centric dynamic partial order reduction. IST Austria, 2017.
View
| Files available
| DOI
2017 | Research Data | IST-REx-ID: 5559 |

A. Pavlogiannis, J. Tkadlec, K. Chatterjee, and M. Nowak , “Strong amplifiers of natural selection.” IST Austria, 2017.
View
| Files available
| DOI
2017 | Thesis | IST-REx-ID: 821 |

A. Pavlogiannis, “Algorithmic advances in program analysis and their applications,” IST Austria, 2017.
View
| Files available
| DOI
2017 | Conference Paper | IST-REx-ID: 949 |

K. Chatterjee, A. K. Goharshady, and A. Pavlogiannis, “JTDec: A tool for tree decompositions in soot,” presented at the ATVA: Automated Technology for Verification and Analysis, Pune, India, 2017, vol. 10482, pp. 59–66.
View
| Files available
| DOI
2016 | Technical Report | IST-REx-ID: 5445 |

K. Chatterjee, A. Pavlogiannis, and Y. Velner, Quantitative interprocedural analysis. IST Austria, 2016.
View
| Files available
| DOI
2016 | Technical Report | IST-REx-ID: 5449 |

A. Pavlogiannis, J. Tkadlec, K. Chatterjee, and M. Nowak, Amplification on undirected population structures: Comets beat stars. IST Austria, 2016.
View
| Files available
| DOI
2016 | Technical Report | IST-REx-ID: 5453 |

A. Pavlogiannis, J. Tkadlec, K. Chatterjee, and M. Nowak, Arbitrarily strong amplifiers of natural selection. IST Austria, 2016.
View
| Files available
| DOI
2016 | Technical Report | IST-REx-ID: 5451 |

A. Pavlogiannis, J. Tkadlec, K. Chatterjee, and M. Nowak, Strong amplifiers of natural selection. IST Austria, 2016.
View
| Files available
| DOI
2016 | Technical Report | IST-REx-ID: 5452 |

A. Pavlogiannis, J. Tkadlec, K. Chatterjee, and M. Nowak, Arbitrarily strong amplifiers of natural selection. IST Austria, 2016.
View
| Files available
| DOI
2016 | Conference Paper | IST-REx-ID: 1071 |

K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, “Optimal reachability and a space time tradeoff for distance queries in constant treewidth graphs,” presented at the ESA: European Symposium on Algorithms, Aarhus, Denmark, 2016, vol. 57.
View
| Files available
| DOI
2016 | Conference Paper | IST-REx-ID: 1437 |

K. Chatterjee, A. K. Goharshady, R. Ibsen-Jensen, and A. Pavlogiannis, “Algorithms for algebraic path properties in concurrent systems of constant treewidth components,” presented at the POPL: Principles of Programming Languages, St. Petersburg, FL, USA, 2016, vol. 20–22, pp. 733–747.
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2015 | Journal Article | IST-REx-ID: 1624 |

A. Pavlogiannis, K. Chatterjee, B. Adlam, and M. Nowak, “Cellular cooperation with shift updating and repulsion,” Scientific Reports, vol. 5. Nature Publishing Group, 2015.
View
| Files available
| DOI
2015 | Technical Report | IST-REx-ID: 5437 |

K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, Faster algorithms for quantitative verification in constant treewidth graphs. IST Austria, 2015.
View
| Files available
| DOI
2015 | Technical Report | IST-REx-ID: 5430 |

K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, Faster algorithms for quantitative verification in constant treewidth graphs. IST Austria, 2015.
View
| Files available
| DOI
2015 | Technical Report | IST-REx-ID: 5441 |

K. Chatterjee, R. Ibsen-Jensen, A. K. Goharshady, and A. Pavlogiannis, Algorithms for algebraic path properties in concurrent systems of constant treewidth components. IST Austria, 2015.
View
| Files available
| DOI
2015 | Journal Article | IST-REx-ID: 1602 |

K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, and P. Goyal, “Faster algorithms for algebraic path properties in recursive state machines with constant treewidth,” ACM SIGPLAN Notices, vol. 50, no. 1. ACM, pp. 97–109, 2015.
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2015 | Journal Article | IST-REx-ID: 1604
K. Chatterjee, A. Pavlogiannis, and Y. Velner, “Quantitative interprocedural analysis,” Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT , vol. 50, no. 1. ACM, pp. 539–551, 2015.
View
| Files available
| DOI
2015 | Conference Paper | IST-REx-ID: 1607 |

K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, “Faster algorithms for quantitative verification in constant treewidth graphs,” presented at the CAV: Computer Aided Verification, San Francisco, CA, USA, 2015, vol. 9206, pp. 140–157.
View
| Files available
| DOI
| Download Preprint (ext.)
2015 | Conference Paper | IST-REx-ID: 1714
K. Chatterjee, A. Pavlogiannis, A. Kößler, and U. Schmid, “A framework for automated competitive analysis of on-line scheduling of firm-deadline tasks,” in Real-Time Systems Symposium, Rome, Italy, 2015, vol. 2015, no. January, pp. 118–127.
View
| Files available
| DOI
2014 | Technical Report | IST-REx-ID: 5419 |

K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, Improved algorithms for reachability and shortest path on low tree-width graphs. IST Austria, 2014.
View
| Files available
| DOI
2014 | Technical Report | IST-REx-ID: 5423 |

K. Chatterjee, A. Kössler, A. Pavlogiannis, and U. Schmid, A framework for automated competitive analysis of on-line scheduling of firm-deadline tasks. IST Austria, 2014.
View
| Files available
| DOI
2014 | Technical Report | IST-REx-ID: 5427 |

K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, Optimal tree-decomposition balancing and reachability on low treewidth graphs. IST Austria, 2014.
View
| Files available
| DOI
2014 | Journal Article | IST-REx-ID: 2039 |

K. Chatterjee, A. Pavlogiannis, B. Adlam, and M. Nowak, “The time scale of evolutionary innovation,” PLoS Computational Biology, vol. 10, no. 9. Public Library of Science, 2014.
View
| Files available
| DOI
2014 | Research Data Reference | IST-REx-ID: 9739
K. Chatterjee, A. Pavlogiannis, B. Adlam, and M. Novak, “Detailed proofs for ‘The time scale of evolutionary innovation.’” Public Library of Science, 2014.
View
| Files available
| DOI
2013 | Conference Paper | IST-REx-ID: 1376
K. Chatterjee, T. A. Henzinger, J. Otop, and A. Pavlogiannis, “Distributed synthesis for LTL fragments,” in 13th International Conference on Formal Methods in Computer-Aided Design, Portland, OR, United States, 2013, pp. 18–25.
View
| Files available
| DOI
2013 | Technical Report | IST-REx-ID: 5406 |

K. Chatterjee, T. A. Henzinger, J. Otop, and A. Pavlogiannis, Distributed synthesis for LTL Fragments. IST Austria, 2013.
View
| Files available
| DOI
49 Publications
2022 | Journal Article | IST-REx-ID: 10731 |

J. Svoboda, J. Tkadlec, A. Pavlogiannis, K. Chatterjee, and M. A. Nowak, “Infection dynamics of COVID-19 virus under lockdown and reopening,” Scientific Reports, vol. 12, no. 1. Springer Nature, 2022.
View
| Files available
| DOI
| arXiv
2022 | Journal Article | IST-REx-ID: 12257 |

K. Chatterjee, J. Svoboda, D. Zikelic, A. Pavlogiannis, and J. Tkadlec, “Social balance on networks: Local minima and best-edge dynamics,” Physical Review E, vol. 106, no. 3. American Physical Society, 2022.
View
| DOI
| Download Preprint (ext.)
| arXiv
2021 | Journal Article | IST-REx-ID: 10191 |

T. L. Bui, K. Chatterjee, T. Gautam, A. Pavlogiannis, and V. Toman, “The reads-from equivalence for the TSO and PSO memory models,” Proceedings of the ACM on Programming Languages, vol. 5, no. OOPSLA. Association for Computing Machinery, 2021.
View
| Files available
| DOI
| arXiv
2021 | Conference Paper | IST-REx-ID: 10629 |

K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, “Quantitative verification on product graphs of small treewidth,” in 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Virtual, 2021, vol. 213.
View
| Files available
| DOI
2021 | Journal Article | IST-REx-ID: 9640 |

J. Tkadlec, A. Pavlogiannis, K. Chatterjee, and M. A. Nowak, “Fast and strong amplifiers of natural selection,” Nature Communications, vol. 12, no. 1. Springer Nature, 2021.
View
| Files available
| DOI
| PubMed | Europe PMC
2021 | Conference Paper | IST-REx-ID: 9987 |

P. Agarwal, K. Chatterjee, S. Pathak, A. Pavlogiannis, and V. Toman, “Stateless model checking under a reads-value-from equivalence,” in 33rd International Conference on Computer-Aided Verification , Virtual, 2021, vol. 12759, pp. 341–366.
View
| Files available
| DOI
| arXiv
2020 | Journal Article | IST-REx-ID: 7212 |

J. Tkadlec, A. Pavlogiannis, K. Chatterjee, and M. A. Nowak, “Limits on amplifiers of natural selection under death-Birth updating,” PLoS computational biology, vol. 16. PLoS, 2020.
View
| Files available
| DOI
| arXiv
2020 | Journal Article | IST-REx-ID: 8788
A. Pavlogiannis, N. Schaumberger, U. Schmid, and K. Chatterjee, “Precedence-aware automated competitive analysis of real-time scheduling,” IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 39, no. 11. IEEE, pp. 3981–3992, 2020.
View
| DOI
2020 | Conference Paper | IST-REx-ID: 7810 |

K. Chatterjee, A. K. Goharshady, R. Ibsen-Jensen, and A. Pavlogiannis, “Optimal and perfectly parallel algorithms for on-demand data-flow analysis,” in European Symposium on Programming, Dublin, Ireland, 2020, vol. 12075, pp. 112–140.
View
| Files available
| DOI
2020 | Conference Paper | IST-REx-ID: 8728 |

A. Asadi, K. Chatterjee, A. K. Goharshady, K. Mohammadi, and A. Pavlogiannis, “Faster algorithms for quantitative analysis of MCs and MDPs with small treewidth,” in Automated Technology for Verification and Analysis, Hanoi, Vietnam, 2020, vol. 12302, pp. 253–270.
View
| Files available
| DOI
2019 | Conference Paper | IST-REx-ID: 10190 |

K. Chatterjee, A. Pavlogiannis, and V. Toman, “Value-centric dynamic partial order reduction,” in Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications, Athens, Greece, 2019, vol. 3.
View
| Files available
| DOI
| Download Published Version (ext.)
| arXiv
2019 | Journal Article | IST-REx-ID: 7210 |

J. Tkadlec, A. Pavlogiannis, K. Chatterjee, and M. A. Nowak, “Population structure determines the tradeoff between fixation probability and fixation time,” Communications Biology, vol. 2. Springer Nature, 2019.
View
| Files available
| DOI
| PubMed | Europe PMC
2019 | Journal Article | IST-REx-ID: 6380 |

K. Chatterjee, A. K. Goharshady, N. Okati, and A. Pavlogiannis, “Efficient parameterized algorithms for data packing,” Proceedings of the ACM on Programming Languages, vol. 3, no. POPL. ACM, 2019.
View
| Files available
| DOI
2019 | Journal Article | IST-REx-ID: 7158 |

K. Chatterjee, A. K. Goharshady, P. Goyal, R. Ibsen-Jensen, and A. Pavlogiannis, “Faster algorithms for dynamic algebraic queries in basic RSMs with constant treewidth,” ACM Transactions on Programming Languages and Systems, vol. 41, no. 4. ACM, 2019.
View
| Files available
| DOI
2018 | Journal Article | IST-REx-ID: 5751 |

A. Pavlogiannis, J. Tkadlec, K. Chatterjee, and M. A. Nowak, “Construction of arbitrarily strong amplifiers of natural selection using evolutionary graph theory,” Communications Biology, vol. 1, no. 1. Springer Nature, 2018.
View
| Files available
| DOI
2018 | Journal Article | IST-REx-ID: 738 |

K. Chatterjee, A. Pavlogiannis, A. Kößler, and U. Schmid, “Automated competitive analysis of real time scheduling with graph games,” Real-Time Systems, vol. 54, no. 1. Springer, pp. 166–207, 2018.
View
| Files available
| DOI
2018 | Journal Article | IST-REx-ID: 6009 |

K. Chatterjee, R. Ibsen-Jensen, A. K. Goharshady, and A. Pavlogiannis, “Algorithms for algebraic path properties in concurrent systems of constant treewidth components,” ACM Transactions on Programming Languages and Systems, vol. 40, no. 3. Association for Computing Machinery (ACM), 2018.
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2017 | Conference Paper | IST-REx-ID: 1011 |

K. Chatterjee, B. Kragl, S. Mishra, and A. Pavlogiannis, “Faster algorithms for weighted recursive state machines,” presented at the ESOP: European Symposium on Programming, Uppsala, Sweden, 2017, vol. 10201, pp. 287–313.
View
| DOI
| Download Submitted Version (ext.)
2017 | Journal Article | IST-REx-ID: 512 |

A. Pavlogiannis, J. Tkadlec, K. Chatterjee, and M. Nowak, “Amplification on undirected population structures: Comets beat stars,” Scientific Reports, vol. 7, no. 1. Nature Publishing Group, 2017.
View
| Files available
| DOI
2017 | Journal Article | IST-REx-ID: 10416 |

K. Chatterjee, B. Choudhary, and A. Pavlogiannis, “Optimal Dyck reachability for data-dependence and Alias analysis,” Proceedings of the ACM on Programming Languages, vol. 2, no. POPL. Association for Computing Machinery, 2017.
View
| Files available
| DOI
| arXiv
2017 | Technical Report | IST-REx-ID: 5455 |

K. Chatterjee, B. Choudhary, and A. Pavlogiannis, Optimal Dyck reachability for data-dependence and alias analysis. IST Austria, 2017.
View
| Files available
| DOI
2017 | Journal Article | IST-REx-ID: 10417 |

M. Chalupa, K. Chatterjee, A. Pavlogiannis, N. Sinha, and K. Vaidya, “Data-centric dynamic partial order reduction,” Proceedings of the ACM on Programming Languages, vol. 2, no. POPL. Association for Computing Machinery, 2017.
View
| Files available
| DOI
| Download Published Version (ext.)
| arXiv
2017 | Technical Report | IST-REx-ID: 5456 |

M. Chalupa, K. Chatterjee, A. Pavlogiannis, N. Sinha, and K. Vaidya, Data-centric dynamic partial order reduction. IST Austria, 2017.
View
| Files available
| DOI
2017 | Research Data | IST-REx-ID: 5559 |

A. Pavlogiannis, J. Tkadlec, K. Chatterjee, and M. Nowak , “Strong amplifiers of natural selection.” IST Austria, 2017.
View
| Files available
| DOI
2017 | Thesis | IST-REx-ID: 821 |

A. Pavlogiannis, “Algorithmic advances in program analysis and their applications,” IST Austria, 2017.
View
| Files available
| DOI
2017 | Conference Paper | IST-REx-ID: 949 |

K. Chatterjee, A. K. Goharshady, and A. Pavlogiannis, “JTDec: A tool for tree decompositions in soot,” presented at the ATVA: Automated Technology for Verification and Analysis, Pune, India, 2017, vol. 10482, pp. 59–66.
View
| Files available
| DOI
2016 | Technical Report | IST-REx-ID: 5445 |

K. Chatterjee, A. Pavlogiannis, and Y. Velner, Quantitative interprocedural analysis. IST Austria, 2016.
View
| Files available
| DOI
2016 | Technical Report | IST-REx-ID: 5449 |

A. Pavlogiannis, J. Tkadlec, K. Chatterjee, and M. Nowak, Amplification on undirected population structures: Comets beat stars. IST Austria, 2016.
View
| Files available
| DOI
2016 | Technical Report | IST-REx-ID: 5453 |

A. Pavlogiannis, J. Tkadlec, K. Chatterjee, and M. Nowak, Arbitrarily strong amplifiers of natural selection. IST Austria, 2016.
View
| Files available
| DOI
2016 | Technical Report | IST-REx-ID: 5451 |

A. Pavlogiannis, J. Tkadlec, K. Chatterjee, and M. Nowak, Strong amplifiers of natural selection. IST Austria, 2016.
View
| Files available
| DOI
2016 | Technical Report | IST-REx-ID: 5452 |

A. Pavlogiannis, J. Tkadlec, K. Chatterjee, and M. Nowak, Arbitrarily strong amplifiers of natural selection. IST Austria, 2016.
View
| Files available
| DOI
2016 | Conference Paper | IST-REx-ID: 1071 |

K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, “Optimal reachability and a space time tradeoff for distance queries in constant treewidth graphs,” presented at the ESA: European Symposium on Algorithms, Aarhus, Denmark, 2016, vol. 57.
View
| Files available
| DOI
2016 | Conference Paper | IST-REx-ID: 1437 |

K. Chatterjee, A. K. Goharshady, R. Ibsen-Jensen, and A. Pavlogiannis, “Algorithms for algebraic path properties in concurrent systems of constant treewidth components,” presented at the POPL: Principles of Programming Languages, St. Petersburg, FL, USA, 2016, vol. 20–22, pp. 733–747.
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2015 | Journal Article | IST-REx-ID: 1624 |

A. Pavlogiannis, K. Chatterjee, B. Adlam, and M. Nowak, “Cellular cooperation with shift updating and repulsion,” Scientific Reports, vol. 5. Nature Publishing Group, 2015.
View
| Files available
| DOI
2015 | Technical Report | IST-REx-ID: 5437 |

K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, Faster algorithms for quantitative verification in constant treewidth graphs. IST Austria, 2015.
View
| Files available
| DOI
2015 | Technical Report | IST-REx-ID: 5430 |

K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, Faster algorithms for quantitative verification in constant treewidth graphs. IST Austria, 2015.
View
| Files available
| DOI
2015 | Technical Report | IST-REx-ID: 5441 |

K. Chatterjee, R. Ibsen-Jensen, A. K. Goharshady, and A. Pavlogiannis, Algorithms for algebraic path properties in concurrent systems of constant treewidth components. IST Austria, 2015.
View
| Files available
| DOI
2015 | Journal Article | IST-REx-ID: 1602 |

K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, and P. Goyal, “Faster algorithms for algebraic path properties in recursive state machines with constant treewidth,” ACM SIGPLAN Notices, vol. 50, no. 1. ACM, pp. 97–109, 2015.
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2015 | Journal Article | IST-REx-ID: 1604
K. Chatterjee, A. Pavlogiannis, and Y. Velner, “Quantitative interprocedural analysis,” Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT , vol. 50, no. 1. ACM, pp. 539–551, 2015.
View
| Files available
| DOI
2015 | Conference Paper | IST-REx-ID: 1607 |

K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, “Faster algorithms for quantitative verification in constant treewidth graphs,” presented at the CAV: Computer Aided Verification, San Francisco, CA, USA, 2015, vol. 9206, pp. 140–157.
View
| Files available
| DOI
| Download Preprint (ext.)
2015 | Conference Paper | IST-REx-ID: 1714
K. Chatterjee, A. Pavlogiannis, A. Kößler, and U. Schmid, “A framework for automated competitive analysis of on-line scheduling of firm-deadline tasks,” in Real-Time Systems Symposium, Rome, Italy, 2015, vol. 2015, no. January, pp. 118–127.
View
| Files available
| DOI
2014 | Technical Report | IST-REx-ID: 5419 |

K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, Improved algorithms for reachability and shortest path on low tree-width graphs. IST Austria, 2014.
View
| Files available
| DOI
2014 | Technical Report | IST-REx-ID: 5423 |

K. Chatterjee, A. Kössler, A. Pavlogiannis, and U. Schmid, A framework for automated competitive analysis of on-line scheduling of firm-deadline tasks. IST Austria, 2014.
View
| Files available
| DOI
2014 | Technical Report | IST-REx-ID: 5427 |

K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, Optimal tree-decomposition balancing and reachability on low treewidth graphs. IST Austria, 2014.
View
| Files available
| DOI
2014 | Journal Article | IST-REx-ID: 2039 |

K. Chatterjee, A. Pavlogiannis, B. Adlam, and M. Nowak, “The time scale of evolutionary innovation,” PLoS Computational Biology, vol. 10, no. 9. Public Library of Science, 2014.
View
| Files available
| DOI
2014 | Research Data Reference | IST-REx-ID: 9739
K. Chatterjee, A. Pavlogiannis, B. Adlam, and M. Novak, “Detailed proofs for ‘The time scale of evolutionary innovation.’” Public Library of Science, 2014.
View
| Files available
| DOI
2013 | Conference Paper | IST-REx-ID: 1376
K. Chatterjee, T. A. Henzinger, J. Otop, and A. Pavlogiannis, “Distributed synthesis for LTL fragments,” in 13th International Conference on Formal Methods in Computer-Aided Design, Portland, OR, United States, 2013, pp. 18–25.
View
| Files available
| DOI
2013 | Technical Report | IST-REx-ID: 5406 |

K. Chatterjee, T. A. Henzinger, J. Otop, and A. Pavlogiannis, Distributed synthesis for LTL Fragments. IST Austria, 2013.
View
| Files available
| DOI