Остановите войну!
for scientists:
default search action
Andreas Pavlogiannis
- > Home > Persons > Andreas Pavlogiannis
Publications
- 2022
- [i24]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) - 2021
- [j18]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) - [j16]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) - [c17]Pratyush Agarwal, Krishnendu Chatterjee, Shreya Pathak, Andreas Pavlogiannis, Viktor Toman:
Stateless Model Checking Under a Reads-Value-From Equivalence. CAV (1) 2021: 341-366 - [c15]Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Andreas Pavlogiannis:
Quantitative Verification on Product Graphs of Small Treewidth. FSTTCS 2021: 42:1-42:23 - [i22]Pratyush Agarwal, Krishnendu Chatterjee, Shreya Pathak, Andreas Pavlogiannis, Viktor Toman:
Stateless Model Checking under a Reads-Value-From Equivalence. CoRR abs/2105.06424 (2021) - 2020
- [j12]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) - [j11]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) - [c14]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 - [c13]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 - [i19]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) - [i18]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) - [i14]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) - 2019
- [j10]Krishnendu Chatterjee, Andreas Pavlogiannis, Viktor Toman:
Value-centric dynamic partial order reduction. Proc. ACM Program. Lang. 3(OOPSLA): 124:1-124:29 (2019) - [j9]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) - [j8]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) - [i12]Krishnendu Chatterjee, Andreas Pavlogiannis, Viktor Toman:
Value-centric Dynamic Partial Order Reduction. CoRR abs/1909.00989 (2019) - [i11]Krishnendu Chatterjee, Bhavya Choudhary, Andreas Pavlogiannis:
Optimal Dyck Reachability for Data-Dependence and Alias Analysis. CoRR abs/1910.00241 (2019) - 2018
- [j7]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) - [j6]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) - [j5]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) - [j4]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) - [i10]Andreas Pavlogiannis, Josef Tkadlec, Krishnendu Chatterjee, Martin A. Nowak:
Strong Amplifiers of Natural Selection: Proofs. CoRR abs/1802.02509 (2018) - [i9]Josef Tkadlec, Andreas Pavlogiannis, Krishnendu Chatterjee, Martin A. Nowak:
Fixation probability and fixation time in structured populations. CoRR abs/1810.02687 (2018) - 2017
- [c11]Krishnendu Chatterjee, Amir Kafshdar Goharshady, Andreas Pavlogiannis:
JTDec: A Tool for Tree Decompositions in Soot. ATVA 2017: 59-66 - [c10]Krishnendu Chatterjee, Bernhard Kragl, Samarth Mishra, Andreas Pavlogiannis:
Faster Algorithms for Weighted Recursive State Machines. ESOP 2017: 287-313 - [i8]Krishnendu Chatterjee, Bernhard Kragl, Samarth Mishra, Andreas Pavlogiannis:
Faster Algorithms for Weighted Recursive State Machines. CoRR abs/1701.04914 (2017) - 2016
- [c9]Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Andreas Pavlogiannis:
Optimal Reachability and a Space-Time Tradeoff for Distance Queries in Constant-Treewidth Graphs. ESA 2016: 28:1-28:17 - [c8]Krishnendu Chatterjee, Amir Kafshdar Goharshady, Rasmus Ibsen-Jensen, Andreas Pavlogiannis:
Algorithms for algebraic path properties in concurrent systems of constant treewidth components. POPL 2016: 733-747 - [i7]Krishnendu Chatterjee, Andreas Pavlogiannis, Nishant Sinha, Kapil Vaidya:
Data-centric Dynamic Partial Order Reduction. CoRR abs/1610.01188 (2016) - 2015
- [c7]Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Andreas Pavlogiannis:
Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs. CAV (1) 2015: 140-157 - [c6]Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Andreas Pavlogiannis, Prateesh Goyal:
Faster Algorithms for Algebraic Path Properties in Recursive State Machines with Constant Treewidth. POPL 2015: 97-109 - [c5]Krishnendu Chatterjee, Andreas Pavlogiannis, Yaron Velner:
Quantitative Interprocedural Analysis. POPL 2015: 539-551 - [i6]Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Andreas Pavlogiannis:
Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs. CoRR abs/1504.07384 (2015) - [i5]Krishnendu Chatterjee, Amir Kafshdar Goharshady, Rasmus Ibsen-Jensen, Andreas Pavlogiannis:
Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components. CoRR abs/1510.07565 (2015) - 2014
- [j3]Krishnendu Chatterjee, Andreas Pavlogiannis, Ben Adlam, Martin A. Nowak:
The Time Scale of Evolutionary Innovation. PLoS Comput. Biol. 10(9) (2014) - [c4]Krishnendu Chatterjee, Andreas Pavlogiannis, Alexander Kößler, Ulrich Schmid:
A Framework for Automated Competitive Analysis of On-line Scheduling of Firm-Deadline Tasks. RTSS 2014: 118-127 - [i4]Krishnendu Chatterjee, Andreas Pavlogiannis, Alexander Kößler, Ulrich Schmid:
A Framework for Automated Competitive Analysis of On-line Scheduling of Firm-Deadline Tasks. CoRR abs/1409.2291 (2014) - [i3]Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Andreas Pavlogiannis, Prateesh Goyal:
Faster Algorithms for Algebraic Path Properties in RSMs with Constant Treewidth. CoRR abs/1410.7724 (2014) - 2013
- [c3]Krishnendu Chatterjee, Thomas A. Henzinger, Jan Otop, Andreas Pavlogiannis:
Distributed synthesis for LTL fragments. FMCAD 2013: 18-25
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-06 22:52 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint