All Symmetric Predicates in NSPACE(n2) Are Stably Computable by the Mediated Population Protocol Model. - Ioannis Chatzigiannakis; Othon Michail; Stavros Nikolaou; Andreas Pavlogiannis; Paul G. Spirakis (MFCS, 2010)

Passively Mobile Communicating Logarithmic Space Machines - Ioannis Chatzigiannakis; Othon Michail; Stavros Nikolaou; Andreas Pavlogiannis; Paul G. Spirakis (CoRR, 2010)

Passively mobile communicating machines that use restricted space. - Ioannis Chatzigiannakis; Othon Michail; Stavros Nikolaou; Andreas Pavlogiannis; Paul G. Spirakis (Theor. Comput. Sci., 2011)

Distributed synthesis for LTL fragments. - Krishnendu Chatterjee; Thomas A. Henzinger; Jan Otop; Andreas Pavlogiannis (FMCAD, 2013)

A flood-based information flow analysis and network minimization method for gene regulatory networks. - Andreas Pavlogiannis; Vadim Mozhayskiy; Ilias Tagkopoulos (BMC Bioinform., 2013)

A Framework for Automated Competitive Analysis of On-line Scheduling of Firm-Deadline Tasks. - Krishnendu Chatterjee; Andreas Pavlogiannis; Alexander Kößler; Ulrich Schmid 001 (RTSS, 2014)

Faster Algorithms for Algebraic Path Properties in RSMs with Constant Treewidth. - Krishnendu Chatterjee; Rasmus Ibsen-Jensen; Andreas Pavlogiannis; Prateesh Goyal (CoRR, 2014)

The Time Scale of Evolutionary Innovation. - Krishnendu Chatterjee; Andreas Pavlogiannis; Ben Adlam; Martin A. Nowak (PLoS Comput. Biol., 2014)

Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs. - Krishnendu Chatterjee; Rasmus Ibsen-Jensen; Andreas Pavlogiannis (CAV (1), 2015)

Faster Algorithms for Algebraic Path Properties in Recursive State Machines with Constant Treewidth. - Krishnendu Chatterjee; Rasmus Ibsen-Jensen; Andreas Pavlogiannis; Prateesh Goyal (POPL, 2015)

Quantitative Interprocedural Analysis. - Krishnendu Chatterjee; Andreas Pavlogiannis; Yaron Velner (POPL, 2015)

Optimal Reachability and a Space-Time Tradeoff for Distance Queries in Constant-Treewidth Graphs. - Krishnendu Chatterjee; Rasmus Ibsen-Jensen; Andreas Pavlogiannis (ESA, 2016)

Data-centric Dynamic Partial Order Reduction. - Krishnendu Chatterjee; Andreas Pavlogiannis; Nishant Sinha; Kapil Vaidya (CoRR, 2016)

JTDec: A Tool for Tree Decompositions in Soot. - Krishnendu Chatterjee; Amir Kafshdar Goharshady; Andreas Pavlogiannis (ATVA, 2017)

Faster Algorithms for Weighted Recursive State Machines. - Krishnendu Chatterjee; Bernhard Kragl; Samarth Mishra; Andreas Pavlogiannis (ESOP, 2017)

Strong Amplifiers of Natural Selection: Proofs. - Andreas Pavlogiannis; Josef Tkadlec; Krishnendu Chatterjee; Martin A. Nowak (CoRR, 2018)

Fixation probability and fixation time in structured populations. - Josef Tkadlec; Andreas Pavlogiannis; Krishnendu Chatterjee; Martin A. Nowak (CoRR, 2018)

Data-centric dynamic partial order reduction. - Marek Chalupa; Krishnendu Chatterjee; Andreas Pavlogiannis; Nishant Sinha; Kapil Vaidya (Proc. ACM Program. Lang., 2018)

Optimal Dyck reachability for data-dependence and alias analysis. - Krishnendu Chatterjee; Bhavya Choudhary; Andreas Pavlogiannis (Proc. ACM Program. Lang., 2018)

Automated competitive analysis of real-time scheduling with graph games. - Krishnendu Chatterjee; Andreas Pavlogiannis; Alexander Kößler; Ulrich Schmid 001 (Real Time Syst., 2018)

Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components. - Krishnendu Chatterjee; Rasmus Ibsen-Jensen; Amir Kafshdar Goharshady; Andreas Pavlogiannis (ACM Trans. Program. Lang. Syst., 2018)

Fast, Sound and Effectively Complete Dynamic Race Detection. - Andreas Pavlogiannis (CoRR, 2019)

Efficient parameterized algorithms for data packing. - Krishnendu Chatterjee; Amir Kafshdar Goharshady; Nastaran Okati; Andreas Pavlogiannis (Proc. ACM Program. Lang., 2019)

Value-centric dynamic partial order reduction. - Krishnendu Chatterjee; Andreas Pavlogiannis; Viktor Toman (Proc. ACM Program. Lang., 2019)

Faster Algorithms for Dynamic Algebraic Queries in Basic RSMs with Constant Treewidth. - Krishnendu Chatterjee; Amir Kafshdar Goharshady; Prateesh Goyal; Rasmus Ibsen-Jensen; Andreas Pavlogiannis (ACM Trans. Program. Lang. Syst., 2019)

Faster Algorithms for Quantitative Analysis of MCs and MDPs with Small Treewidth. - Ali Asadi; Krishnendu Chatterjee; Amir Kafshdar Goharshady; Kiarash Mohammadi; Andreas Pavlogiannis (ATVA, 2020)

Optimal and Perfectly Parallel Algorithms for On-demand Data-Flow Analysis. - Krishnendu Chatterjee; Amir Kafshdar Goharshady; Rasmus Ibsen-Jensen; Andreas Pavlogiannis (ESOP, 2020)

The Complexity of Dynamic Data Race Prediction. - Umang Mathur 001; Andreas Pavlogiannis; Mahesh Viswanathan 001 (LICS, 2020)

Faster Algorithms for Quantitative Analysis of Markov Chains and Markov Decision Processes with Small Treewidth. - Ali Asadi; Krishnendu Chatterjee; Amir Kafshdar Goharshady; Kiarash Mohammadi; Andreas Pavlogiannis (CoRR, 2020)

The Fine-Grained Complexity of Andersen's Pointer Analysis. - Andreas Pavlogiannis (CoRR, 2020)

Fast, sound, and effectively complete dynamic race prediction. - Andreas Pavlogiannis (Proc. ACM Program. Lang., 2020)

Limits on amplifiers of natural selection under death-Birth updating. - Josef Tkadlec; Andreas Pavlogiannis; Krishnendu Chatterjee; Martin A. Nowak (PLoS Comput. Biol., 2020)

Precedence-Aware Automated Competitive Analysis of Real-Time Scheduling. - Andreas Pavlogiannis; Nico Schaumberger; Ulrich Schmid 001; Krishnendu Chatterjee (IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2020)

Stateless Model Checking Under a Reads-Value-From Equivalence. - Pratyush Agarwal; Krishnendu Chatterjee; Shreya Pathak; Andreas Pavlogiannis; Viktor Toman (CAV (1), 2021)

Dynamic Data-Race Detection Through the Fine-Grained Lens. - Rucha Kulkarni; Umang Mathur 001; Andreas Pavlogiannis (CONCUR, 2021)

Quantitative Verification on Product Graphs of Small Treewidth. - Krishnendu Chatterjee; Rasmus Ibsen-Jensen; Andreas Pavlogiannis (FSTTCS, 2021)

Faster algorithms for quantitative verification in bounded treewidth graphs. - Krishnendu Chatterjee; Rasmus Ibsen-Jensen; Andreas Pavlogiannis (Formal Methods Syst. Des., 2021)

Tight bounds for reachability problems on one-counter and pushdown systems. - Jakob Cetti Hansen; Adam Husted Kjelstrøm; Andreas Pavlogiannis (Inf. Process. Lett., 2021)

Optimal prediction of synchronization-preserving races. - Umang Mathur 001; Andreas Pavlogiannis; Mahesh Viswanathan 001 (Proc. ACM Program. Lang., 2021)

The reads-from equivalence for the TSO and PSO memory models. - Truc Lam Bui; Krishnendu Chatterjee; Tushar Gautam; Andreas Pavlogiannis; Viktor Toman (Proc. ACM Program. Lang., 2021)

The fine-grained and parallel complexity of andersen's pointer analysis. - Anders Alnor Mathiasen; Andreas Pavlogiannis (Proc. ACM Program. Lang., 2021)

Fixation Maximization in the Positional Moran Process. - Joachim Brendborg; Panagiotis Karras; Andreas Pavlogiannis; Asger Ullersted Rasmussen; Josef Tkadlec (AAAI, 2022)

A tree clock data structure for causal orderings in concurrent executions. - Umang Mathur 001; Andreas Pavlogiannis; Hünkar Can Tunç; Mahesh Viswanathan 001 (ASPLOS, 2022)

Reachability in Bidirected Pushdown VASS. - Moses Ganardi; Rupak Majumdar; Andreas Pavlogiannis; Lia Schütze; Georg Zetzsche (ICALP, 2022)

Invasion Dynamics in the Biased Voter Process. - Loke Durocher; Panagiotis Karras; Andreas Pavlogiannis; Josef Tkadlec (IJCAI, 2022)

Efficient approximations for cache-conscious data placement. - Ali Ahmadi; Majid Daliri; Amir Kafshdar Goharshady; Andreas Pavlogiannis (PLDI, 2022)

Dynamic data race prediction: fundamentals, theory, and practice (tutorial). - Umang Mathur 001; Andreas Pavlogiannis (ESEC/SIGSOFT FSE, 2022)

Social Balance on Networks: Local Minima and Best Edge Dynamics. - Krishnendu Chatterjee; Jakub Svoboda; Dorde Zikelic; Andreas Pavlogiannis; Josef Tkadlec (CoRR, 2022)

The decidability and complexity of interleaved bidirected Dyck reachability. - Adam Husted Kjelstrøm; Andreas Pavlogiannis (Proc. ACM Program. Lang., 2022)

CFL/Dyck Reachability: An Algorithmic Perspective. - Andreas Pavlogiannis (ACM SIGLOG News, 2022)

Maximizing the Probability of Fixation in the Positional Voter Model. - Petros Petsinis; Andreas Pavlogiannis; Panagiotis Karras (AAAI, 2023)

A Truly Symbolic Linear-Time Algorithm for SCC Decomposition. - Casper Abild Larsen; Simon Meldahl Schmidt; Jesper Steensgaard; Anna Blume Jakobsen; Jaco van de Pol; Andreas Pavlogiannis (TACAS (2), 2023)

Sound Dynamic Deadlock Prediction in Linear Time. - Hünkar Can Tunç; Umang Mathur 001; Andreas Pavlogiannis; Mahesh Viswanathan 001 (Proc. ACM Program. Lang., 2023)

Optimal Reads-From Consistency Checking for C11-Style Memory Models. - Hünkar Can Tunç; Parosh Aziz Abdulla; Soham Chakraborty 001; Shankaranarayanan Krishna; Umang Mathur 001; Andreas Pavlogiannis (Proc. ACM Program. Lang., 2023)

Optimal Reads-From Consistency Checking for C11-Style Memory Models. - Hünkar Can Tunç; Parosh Aziz Abdulla; Soham Chakraborty 001; Shankaranarayanan Krishna; Umang Mathur 001; Andreas Pavlogiannis (Zenodo, 2023)

Optimal Reads-From Consistency Checking for C11-Style Memory Models. - Hünkar Can Tunç; Parosh Aziz Abdulla; Soham Chakraborty 001; Shankaranarayanan Krishna; Umang Mathur 001; Andreas Pavlogiannis (Zenodo, 2023)

Sound Dynamic Deadlock Prediction in Linear Time. - Hünkar Can Tunç; Umang Mathur 001; Andreas Pavlogiannis; Mahesh Viswanathan 001 (Zenodo, 2023)

Fast Symbolic Computation of Bottom SCCs - TACAS 2024 artifact. - Anna Blume Jakobsen; Rasmus Skibdahl Melanchton Jørgensen; Jaco van de Pol; Andreas Pavlogiannis (Zenodo, 2023)

Reachability-Aware Fair Influence Maximization. - Wenyue Ma 001; Maximilian K. Egger; Andreas Pavlogiannis; Yuchen Li 001; Panagiotis Karras (APWeb/WAIM (3), 2024)

CSSTs: A Dynamic Data Structure for Partial Orders in Concurrent Execution Analysis. - Hünkar Can Tunç; Ameya Prashant Deshmukh; Berk Çirisci; Constantin Enea; Andreas Pavlogiannis (ASPLOS (3), 2024)

Optimistic Prediction of Synchronization-Reversal Data Races. - Zheng Shi; Umang Mathur 001; Andreas Pavlogiannis (ICSE, 2024)

Seed Selection in the Heterogeneous Moran Process. - Petros Petsinis; Andreas Pavlogiannis; Josef Tkadlec; Panagiotis Karras (IJCAI, 2024)

Robust Reward Placement under Uncertainty. - Petros Petsinis; Kaichen Zhang; Andreas Pavlogiannis; Jingbo Zhou; Panagiotis Karras (IJCAI, 2024)

A Better Approximation for Interleaved Dyck Reachability. - Giovanna Kobus Conrado; Andreas Pavlogiannis (SOAP@PLDI, 2024)

Fast Symbolic Computation of Bottom SCCs. - Anna Blume Jakobsen; Rasmus Skibdahl Melanchton Jørgensen; Jaco van de Pol; Andreas Pavlogiannis (TACAS (3), 2024)

How Hard Is Weak-Memory Testing? - Soham Chakraborty 001; Shankara Narayanan Krishna; Umang Mathur 001; Andreas Pavlogiannis (Proc. ACM Program. Lang., 2024)

On-the-Fly Static Analysis via Dynamic Bidirected Dyck Reachability. - Shankaranarayanan Krishna; Aniket Lal; Andreas Pavlogiannis; Omkar Tuppe (Proc. ACM Program. Lang., 2024)

sfGPUMC: A Stateless Model Checker for GPU Weak Memory Concurrency. - Soham Chakraborty 001; S. Krishna 004; Andreas Pavlogiannis; Omkar Tuppe (CAV (3), 2025)

On Exact Sizes of Minimal CNOT Circuits. - Jens Emil Christensen; Søren Fuglede Jørgensen; Andreas Pavlogiannis; Jaco van de Pol (RC, 2025)

Program Analysis via Multiple Context Free Language Reachability. - Giovanna Kobus Conrado; Adam Husted Kjelstrøm; Jaco van de Pol; Andreas Pavlogiannis (Proc. ACM Program. Lang., 2025)

AWDIT: An Optimal Weak Database Isolation Tester. - Lasse Møldrup; Andreas Pavlogiannis (Proc. ACM Program. Lang., 2025)

CFL-based methods for approximating interleaved Dyck reachability. - Giovanna Kobus Conrado; Andreas Pavlogiannis (Int. J. Softw. Tools Technol. Transf., 2025)

Testing Message-Passing Concurrency. - Zheng Shi; Lasse Møldrup; Umang Mathur 001; Andreas Pavlogiannis (CoRR, 2025)

GPUMC: A Stateless Model Checker for GPU Weak Memory Concurrency. - Soham Chakraborty 001; S. Krishna 004; Andreas Pavlogiannis; Omkar Tuppe (CoRR, 2025)