Andreas Pavlogiannis

Chatterjee Group

49 Publications

Mark all

[49]
2022 | Published | Journal Article | IST-REx-ID: 10731 | OA
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.
[Published Version] View | Files available | DOI | WoS | arXiv
 
[48]
2022 | Published | Journal Article | IST-REx-ID: 12257 | OA
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.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[47]
2021 | Published | Journal Article | IST-REx-ID: 10191 | OA
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.
[Published Version] View | Files available | DOI | arXiv
 
[46]
2021 | Published | Conference Paper | IST-REx-ID: 10629 | OA
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.
[Published Version] View | Files available | DOI
 
[45]
2021 | Published | Journal Article | IST-REx-ID: 9640 | OA
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.
[Published Version] View | Files available | DOI | WoS | PubMed | Europe PMC
 
[44]
2021 | Published | Conference Paper | IST-REx-ID: 9987 | OA
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.
[Published Version] View | Files available | DOI | WoS | arXiv
 
[43]
2021 | Published | Journal Article | IST-REx-ID: 9393 | OA
K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, “Faster algorithms for quantitative verification in bounded treewidth graphs,” Formal Methods in System Design, vol. 57. Springer, pp. 401–428, 2021.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[42]
2020 | Published | 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 | WoS
 
[41]
2020 | Published | Journal Article | IST-REx-ID: 7212 | OA
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. Public Library of Science, 2020.
[Published Version] View | Files available | DOI | WoS | arXiv
 
[40]
2020 | Published | Conference Paper | IST-REx-ID: 8728 | OA
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.
[Submitted Version] View | Files available | DOI | WoS
 
[39]
2020 | Published | Conference Paper | IST-REx-ID: 7810 | OA
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.
[Published Version] View | Files available | DOI | WoS
 
[38]
2019 | Published | Conference Paper | IST-REx-ID: 10190 | OA
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.
[Published Version] View | Files available | DOI | Download Published Version (ext.) | arXiv
 
[37]
2019 | Published | Journal Article | IST-REx-ID: 7210 | OA
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.
[Published Version] View | Files available | DOI | WoS | PubMed | Europe PMC
 
[36]
2019 | Published | Journal Article | IST-REx-ID: 6380 | OA
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.
[Published Version] View | Files available | DOI
 
[35]
2019 | Published | Journal Article | IST-REx-ID: 7158 | OA
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.
[Submitted Version] View | Files available | DOI | WoS
 
[34]
2018 | Published | Journal Article | IST-REx-ID: 738 | OA
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.
[Published Version] View | Files available | DOI | WoS
 
[33]
2018 | Published | Journal Article | IST-REx-ID: 5751 | OA
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.
[Published Version] View | Files available | DOI | WoS
 
[32]
2018 | Published | Journal Article | IST-REx-ID: 6009 | OA
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, 2018.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[31]
2017 | Published | Conference Paper | IST-REx-ID: 1011 | OA
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.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS
 
[30]
2017 | Published | Journal Article | IST-REx-ID: 10416 | OA
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.
[Published Version] View | Files available | DOI | arXiv
 
[29]
2017 | Published | Journal Article | IST-REx-ID: 10417 | OA
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.
[Published Version] View | Files available | DOI | Download Published Version (ext.) | arXiv
 
[28]
2017 | Published | Journal Article | IST-REx-ID: 512 | OA
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.
[Published Version] View | Files available | DOI
 
[27]
2017 | Published | Technical Report | IST-REx-ID: 5455 | OA
K. Chatterjee, B. Choudhary, and A. Pavlogiannis, Optimal Dyck reachability for data-dependence and alias analysis. IST Austria, 2017.
[Published Version] View | Files available | DOI
 
[26]
2017 | Published | Technical Report | IST-REx-ID: 5456 | OA
M. Chalupa, K. Chatterjee, A. Pavlogiannis, N. Sinha, and K. Vaidya, Data-centric dynamic partial order reduction. IST Austria, 2017.
[Published Version] View | Files available | DOI
 
[25]
2017 | Research Data | IST-REx-ID: 5559 | OA
A. Pavlogiannis, J. Tkadlec, K. Chatterjee, and M. Nowak , “Strong amplifiers of natural selection.” Institute of Science and Technology Austria, 2017.
[Published Version] View | Files available | DOI
 
[24]
2017 | Published | Thesis | IST-REx-ID: 821 | OA
A. Pavlogiannis, “Algorithmic advances in program analysis and their applications,” Institute of Science and Technology Austria, 2017.
[Published Version] View | Files available | DOI
 
[23]
2017 | Published | Conference Paper | IST-REx-ID: 949 | OA
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.
[Submitted Version] View | Files available | DOI | WoS
 
[22]
2016 | Published | Conference Paper | IST-REx-ID: 1071 | OA
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.
[Published Version] View | Files available | DOI
 
[21]
2016 | Published | Technical Report | IST-REx-ID: 5445 | OA
K. Chatterjee, A. Pavlogiannis, and Y. Velner, Quantitative interprocedural analysis. IST Austria, 2016.
[Published Version] View | Files available | DOI
 
[20]
2016 | Published | Technical Report | IST-REx-ID: 5449 | OA
A. Pavlogiannis, J. Tkadlec, K. Chatterjee, and M. Nowak, Amplification on undirected population structures: Comets beat stars. IST Austria, 2016.
[Updated Version] View | Files available | DOI
 
[19]
2016 | Published | Technical Report | IST-REx-ID: 5451 | OA
A. Pavlogiannis, J. Tkadlec, K. Chatterjee, and M. Nowak, Strong amplifiers of natural selection. IST Austria, 2016.
[Published Version] View | Files available | DOI
 
[18]
2016 | Published | Technical Report | IST-REx-ID: 5452 | OA
A. Pavlogiannis, J. Tkadlec, K. Chatterjee, and M. Nowak, Arbitrarily strong amplifiers of natural selection. IST Austria, 2016.
[Published Version] View | Files available | DOI
 
[17]
2016 | Published | Technical Report | IST-REx-ID: 5453 | OA
A. Pavlogiannis, J. Tkadlec, K. Chatterjee, and M. Nowak, Arbitrarily strong amplifiers of natural selection. IST Austria, 2016.
[Published Version] View | Files available | DOI
 
[16]
2016 | Published | Conference Paper | IST-REx-ID: 1437 | OA
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.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[15]
2015 | Published | 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
 
[14]
2015 | Published | Technical Report | IST-REx-ID: 5430 | OA
K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, Faster algorithms for quantitative verification in constant treewidth graphs. IST Austria, 2015.
[Published Version] View | Files available | DOI
 
[13]
2015 | Published | Technical Report | IST-REx-ID: 5437 | OA
K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, Faster algorithms for quantitative verification in constant treewidth graphs. IST Austria, 2015.
[Published Version] View | Files available | DOI
 
[12]
2015 | Published | Journal Article | IST-REx-ID: 1602 | OA
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.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[11]
2015 | Published | 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
 
[10]
2015 | Published | Conference Paper | IST-REx-ID: 1607 | OA
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.
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 
[9]
2015 | Published | Journal Article | IST-REx-ID: 1624 | OA
A. Pavlogiannis, K. Chatterjee, B. Adlam, and M. Nowak, “Cellular cooperation with shift updating and repulsion,” Scientific Reports, vol. 5. Nature Publishing Group, 2015.
[Published Version] View | Files available | DOI
 
[8]
2015 | Published | Technical Report | IST-REx-ID: 5441 | OA
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.
[Published Version] View | Files available | DOI
 
[7]
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.
[Published Version] View | Files available | DOI
 
[6]
2014 | Published | Technical Report | IST-REx-ID: 5419 | OA
K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, Improved algorithms for reachability and shortest path on low tree-width graphs. IST Austria, 2014.
[Published Version] View | Files available | DOI
 
[5]
2014 | Published | Technical Report | IST-REx-ID: 5423 | OA
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.
[Published Version] View | Files available | DOI
 
[4]
2014 | Published | Technical Report | IST-REx-ID: 5427 | OA
K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, Optimal tree-decomposition balancing and reachability on low treewidth graphs. IST Austria, 2014.
[Published Version] View | Files available | DOI
 
[3]
2014 | Published | Journal Article | IST-REx-ID: 2039 | OA
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.
[Published Version] View | Files available | DOI
 
[2]
2013 | Published | 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
 
[1]
2013 | Published | Technical Report | IST-REx-ID: 5406 | OA
K. Chatterjee, T. A. Henzinger, J. Otop, and A. Pavlogiannis, Distributed synthesis for LTL Fragments. IST Austria, 2013.
[Published Version] View | Files available | DOI
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Export / Embed

Grants


49 Publications

Mark all

[49]
2022 | Published | Journal Article | IST-REx-ID: 10731 | OA
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.
[Published Version] View | Files available | DOI | WoS | arXiv
 
[48]
2022 | Published | Journal Article | IST-REx-ID: 12257 | OA
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.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[47]
2021 | Published | Journal Article | IST-REx-ID: 10191 | OA
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.
[Published Version] View | Files available | DOI | arXiv
 
[46]
2021 | Published | Conference Paper | IST-REx-ID: 10629 | OA
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.
[Published Version] View | Files available | DOI
 
[45]
2021 | Published | Journal Article | IST-REx-ID: 9640 | OA
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.
[Published Version] View | Files available | DOI | WoS | PubMed | Europe PMC
 
[44]
2021 | Published | Conference Paper | IST-REx-ID: 9987 | OA
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.
[Published Version] View | Files available | DOI | WoS | arXiv
 
[43]
2021 | Published | Journal Article | IST-REx-ID: 9393 | OA
K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, “Faster algorithms for quantitative verification in bounded treewidth graphs,” Formal Methods in System Design, vol. 57. Springer, pp. 401–428, 2021.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[42]
2020 | Published | 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 | WoS
 
[41]
2020 | Published | Journal Article | IST-REx-ID: 7212 | OA
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. Public Library of Science, 2020.
[Published Version] View | Files available | DOI | WoS | arXiv
 
[40]
2020 | Published | Conference Paper | IST-REx-ID: 8728 | OA
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.
[Submitted Version] View | Files available | DOI | WoS
 
[39]
2020 | Published | Conference Paper | IST-REx-ID: 7810 | OA
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.
[Published Version] View | Files available | DOI | WoS
 
[38]
2019 | Published | Conference Paper | IST-REx-ID: 10190 | OA
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.
[Published Version] View | Files available | DOI | Download Published Version (ext.) | arXiv
 
[37]
2019 | Published | Journal Article | IST-REx-ID: 7210 | OA
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.
[Published Version] View | Files available | DOI | WoS | PubMed | Europe PMC
 
[36]
2019 | Published | Journal Article | IST-REx-ID: 6380 | OA
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.
[Published Version] View | Files available | DOI
 
[35]
2019 | Published | Journal Article | IST-REx-ID: 7158 | OA
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.
[Submitted Version] View | Files available | DOI | WoS
 
[34]
2018 | Published | Journal Article | IST-REx-ID: 738 | OA
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.
[Published Version] View | Files available | DOI | WoS
 
[33]
2018 | Published | Journal Article | IST-REx-ID: 5751 | OA
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.
[Published Version] View | Files available | DOI | WoS
 
[32]
2018 | Published | Journal Article | IST-REx-ID: 6009 | OA
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, 2018.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[31]
2017 | Published | Conference Paper | IST-REx-ID: 1011 | OA
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.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS
 
[30]
2017 | Published | Journal Article | IST-REx-ID: 10416 | OA
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.
[Published Version] View | Files available | DOI | arXiv
 
[29]
2017 | Published | Journal Article | IST-REx-ID: 10417 | OA
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.
[Published Version] View | Files available | DOI | Download Published Version (ext.) | arXiv
 
[28]
2017 | Published | Journal Article | IST-REx-ID: 512 | OA
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.
[Published Version] View | Files available | DOI
 
[27]
2017 | Published | Technical Report | IST-REx-ID: 5455 | OA
K. Chatterjee, B. Choudhary, and A. Pavlogiannis, Optimal Dyck reachability for data-dependence and alias analysis. IST Austria, 2017.
[Published Version] View | Files available | DOI
 
[26]
2017 | Published | Technical Report | IST-REx-ID: 5456 | OA
M. Chalupa, K. Chatterjee, A. Pavlogiannis, N. Sinha, and K. Vaidya, Data-centric dynamic partial order reduction. IST Austria, 2017.
[Published Version] View | Files available | DOI
 
[25]
2017 | Research Data | IST-REx-ID: 5559 | OA
A. Pavlogiannis, J. Tkadlec, K. Chatterjee, and M. Nowak , “Strong amplifiers of natural selection.” Institute of Science and Technology Austria, 2017.
[Published Version] View | Files available | DOI
 
[24]
2017 | Published | Thesis | IST-REx-ID: 821 | OA
A. Pavlogiannis, “Algorithmic advances in program analysis and their applications,” Institute of Science and Technology Austria, 2017.
[Published Version] View | Files available | DOI
 
[23]
2017 | Published | Conference Paper | IST-REx-ID: 949 | OA
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.
[Submitted Version] View | Files available | DOI | WoS
 
[22]
2016 | Published | Conference Paper | IST-REx-ID: 1071 | OA
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.
[Published Version] View | Files available | DOI
 
[21]
2016 | Published | Technical Report | IST-REx-ID: 5445 | OA
K. Chatterjee, A. Pavlogiannis, and Y. Velner, Quantitative interprocedural analysis. IST Austria, 2016.
[Published Version] View | Files available | DOI
 
[20]
2016 | Published | Technical Report | IST-REx-ID: 5449 | OA
A. Pavlogiannis, J. Tkadlec, K. Chatterjee, and M. Nowak, Amplification on undirected population structures: Comets beat stars. IST Austria, 2016.
[Updated Version] View | Files available | DOI
 
[19]
2016 | Published | Technical Report | IST-REx-ID: 5451 | OA
A. Pavlogiannis, J. Tkadlec, K. Chatterjee, and M. Nowak, Strong amplifiers of natural selection. IST Austria, 2016.
[Published Version] View | Files available | DOI
 
[18]
2016 | Published | Technical Report | IST-REx-ID: 5452 | OA
A. Pavlogiannis, J. Tkadlec, K. Chatterjee, and M. Nowak, Arbitrarily strong amplifiers of natural selection. IST Austria, 2016.
[Published Version] View | Files available | DOI
 
[17]
2016 | Published | Technical Report | IST-REx-ID: 5453 | OA
A. Pavlogiannis, J. Tkadlec, K. Chatterjee, and M. Nowak, Arbitrarily strong amplifiers of natural selection. IST Austria, 2016.
[Published Version] View | Files available | DOI
 
[16]
2016 | Published | Conference Paper | IST-REx-ID: 1437 | OA
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.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[15]
2015 | Published | 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
 
[14]
2015 | Published | Technical Report | IST-REx-ID: 5430 | OA
K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, Faster algorithms for quantitative verification in constant treewidth graphs. IST Austria, 2015.
[Published Version] View | Files available | DOI
 
[13]
2015 | Published | Technical Report | IST-REx-ID: 5437 | OA
K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, Faster algorithms for quantitative verification in constant treewidth graphs. IST Austria, 2015.
[Published Version] View | Files available | DOI
 
[12]
2015 | Published | Journal Article | IST-REx-ID: 1602 | OA
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.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[11]
2015 | Published | 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
 
[10]
2015 | Published | Conference Paper | IST-REx-ID: 1607 | OA
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.
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 
[9]
2015 | Published | Journal Article | IST-REx-ID: 1624 | OA
A. Pavlogiannis, K. Chatterjee, B. Adlam, and M. Nowak, “Cellular cooperation with shift updating and repulsion,” Scientific Reports, vol. 5. Nature Publishing Group, 2015.
[Published Version] View | Files available | DOI
 
[8]
2015 | Published | Technical Report | IST-REx-ID: 5441 | OA
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.
[Published Version] View | Files available | DOI
 
[7]
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.
[Published Version] View | Files available | DOI
 
[6]
2014 | Published | Technical Report | IST-REx-ID: 5419 | OA
K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, Improved algorithms for reachability and shortest path on low tree-width graphs. IST Austria, 2014.
[Published Version] View | Files available | DOI
 
[5]
2014 | Published | Technical Report | IST-REx-ID: 5423 | OA
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.
[Published Version] View | Files available | DOI
 
[4]
2014 | Published | Technical Report | IST-REx-ID: 5427 | OA
K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, Optimal tree-decomposition balancing and reachability on low treewidth graphs. IST Austria, 2014.
[Published Version] View | Files available | DOI
 
[3]
2014 | Published | Journal Article | IST-REx-ID: 2039 | OA
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.
[Published Version] View | Files available | DOI
 
[2]
2013 | Published | 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
 
[1]
2013 | Published | Technical Report | IST-REx-ID: 5406 | OA
K. Chatterjee, T. A. Henzinger, J. Otop, and A. Pavlogiannis, Distributed synthesis for LTL Fragments. IST Austria, 2013.
[Published Version] View | Files available | DOI
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Export / Embed