Andreas Pavlogiannis

Available identifiers

zbMath Open pavlogiannis.andreasDBLP47/8037WikidataQ41048347 ScholiaQ41048347MaRDI QIDQ650875

List of research outcomes

Publication	Date of Publication	Type
Reachability in bidirected pushdown VASS	2024-06-24	Paper
A truly symbolic linear-time algorithm for SCC decomposition	2024-04-05	Paper
https://portal.mardi4nfdi.de/entity/Q6187059	2024-02-05	Paper
Fast Symbolic Computation of Bottom SCCs - TACAS 2024 artifact	2023-12-23	Dataset
Dynamic Data-Race Detection Through the Fine-Grained Lens	2023-08-21	Paper
Faster Algorithms for Quantitative Analysis of MCs and MDPs with Small Treewidth	2022-12-22	Paper
Stateless model checking under a reads-value-from equivalence	2022-03-25	Paper
Faster algorithms for quantitative verification in bounded treewidth graphs	2021-12-08	Paper
Tight bounds for reachability problems on one-counter and pushdown systems	2021-06-16	Paper
The Complexity of Dynamic Data Race Prediction	2021-01-21	Paper
Limits on amplifiers of natural selection under death-Birth updating	2019-06-06	Paper
Optimal Reachability and a Space-Time Tradeoff for Distance Queries in Constant-Treewidth Graphs	2018-03-02	Paper
Faster algorithms for quantitative verification in constant treewidth graphs	2018-03-01	Paper
Automated competitive analysis of real-time scheduling with graph games	2018-02-16	Paper
Faster Algorithms for Weighted Recursive State Machines	2017-05-19	Paper
Algorithms for algebraic path properties in concurrent systems of constant treewidth components	2016-10-24	Paper
Faster algorithms for algebraic path properties in recursive state machines with constant treewidth	2016-09-29	Paper
Quantitative interprocedural analysis	2016-09-29	Paper
Passively mobile communicating machines that use restricted space	2011-12-07	Paper
All Symmetric Predicates in NSPACE(n 2) Are Stably Computable by the Mediated Population Protocol Model	2010-09-03	Paper

Research outcomes over time

This page was built for person: Andreas Pavlogiannis