Travelled to:1 × India
1 × USA
Collaborated with:K.Chatterjee R.Ibsen-Jensen A.K.Goharshady ∅ Y.Velner V.Toman Bhavya Choudhary P.Goyal B.Kragl S.Mishra Nastaran Okati Marek Chalupa N.Sinha Kapil Vaidya
Talks about:algorithm (5) treewidth (3) constant (3) faster (3) dynam (3) data (3) properti (2) quantit (2) partial (2) centric (2)
Person: Andreas Pavlogiannis
DBLP: Pavlogiannis:Andreas
Contributed to:
2015
2015
2017
20192016201820192020Wrote 10 papers:
- CAV-2015-ChatterjeeIP #algorithm #constant #graph #performance #verification
- Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs (KC, RIJ, AP), pp. 140–157.
- POPL-2015-ChatterjeeIPG #algebra #algorithm #constant #performance #recursion #state machine
- Faster Algorithms for Algebraic Path Properties in Recursive State Machines with Constant Treewidth (KC, RIJ, AP, PG), pp. 97–109.
- POPL-2015-ChatterjeePV #analysis #interprocedural
- Quantitative Interprocedural Analysis (KC, AP, YV), pp. 539–551.
- ESOP-2017-ChatterjeeKMP #algorithm #performance #recursion #state machine
- Faster Algorithms for Weighted Recursive State Machines (KC, BK, SM, AP), pp. 287–313.
- OOPSLA-2019-ChatterjeePT #partial order #reduction
- Value-centric dynamic partial order reduction (KC, AP, VT), p. 29.
- POPL-2016-ChatterjeeGIP #algebra #algorithm #component #concurrent #constant
- Algorithms for algebraic path properties in concurrent systems of constant treewidth components (KC, AKG, RIJ, AP), pp. 733–747.
- POPL-2018-ChalupaCPSV #partial order #reduction
- Data-centric dynamic partial order reduction (MC, KC, AP, NS, KV), p. 30.
- POPL-2018-ChatterjeeCP #alias #analysis #data flow #reachability
- Optimal Dyck reachability for data-dependence and alias analysis (KC, BC, AP), p. 30.
- POPL-2019-ChatterjeeGOP #algorithm #performance
- Efficient parameterized algorithms for data packing (KC, AKG, NO, AP), p. 28.
- POPL-2020-Pavlogiannis #effectiveness #performance #predict
- Fast, sound, and effectively complete dynamic race prediction (AP), p. 29.