Skip to main content
What types of page to search?

Alternatively use our A-Z index.

Publications

What type of publication do you want to show?

2025

Resolving Nondeterminism by Chance

Paul, S., Purser, D., Schewe, S., Tang, Q., Totzke, P., & Yen, D. -D. (2025, August 26). Resolving Nondeterminism by Chance. In 36th International Conference on Concurrency Theory (CONCUR 2025). Aarhus, Denmark.

Conference Paper

The Big-O Problem for Max-Plus Automata is Decidable (PSPACE-Complete)

Daviaud, L., Purser, D., & Tcheng, M. (n.d.). The Big-O Problem for Max-Plus Automata is Decidable (PSPACE-Complete). Logical Methods in Computer Science.

Journal article

2024

2023

2022

On the Skolem Problem and the Skolem Conjecture

Lipton, R., Luca, F., Nieuwveld, J., Ouaknine, J., Purser, D., & Worrell, J. (2022). On the Skolem Problem and the Skolem Conjecture. In Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science (pp. 1-9). ACM. doi:10.1145/3531130.3533328

DOI
10.1145/3531130.3533328
Conference Paper

Skolem Meets Schanuel

Bilu, Y., Luca, F., Nieuwveld, J., Ouaknine, J., Purser, D., & Worrell, J. (2022). Skolem Meets Schanuel. In Leibniz International Proceedings in Informatics Lipics Vol. 241. doi:10.4230/LIPIcs.MFCS.2022.20

DOI
10.4230/LIPIcs.MFCS.2022.20
Conference Paper

What’s decidable about linear loops?

Karimov, T., Lefaucheux, E., Ouaknine, J., Purser, D., Varonka, A., Whiteland, M. A., & Worrell, J. (2022). What’s decidable about linear loops?. Proceedings of the ACM on Programming Languages, 6(POPL), 1-25. doi:10.1145/3498727

DOI
10.1145/3498727
Journal article

The Big-O Problem

Chistikov, D., Kiefer, S., Murawski, A. S., & Purser, D. (2022). The Big-O Problem. Logical Methods in Computer Science, Volume 18, Issue 1. doi:10.46298/lmcs-18(1:40)2022

DOI
10.46298/lmcs-18(1:40)2022
Journal article

2021

Porous Invariants

Lefaucheux, E., Ouaknine, J., Purser, D., & Worrell, J. (2021). Porous Invariants. In Unknown Conference (pp. 172-194). Springer International Publishing. doi:10.1007/978-3-030-81688-9_8

DOI
10.1007/978-3-030-81688-9_8
Conference Paper

2020

Reachability in dynamical systems with rounding

Baier, C., Funke, F., Jantsch, S., Karimov, T., Lefaucheux, E., Ouaknine, J., . . . Whiteland, M. A. (2020). Reachability in dynamical systems with rounding. In Leibniz International Proceedings in Informatics Lipics Vol. 182. doi:10.4230/LIPIcs.FSTTCS.2020.36

DOI
10.4230/LIPIcs.FSTTCS.2020.36
Conference Paper

The big-O problem for labelled Markov chains and weighted automata

Chistikov, D., Kiefer, S., Murawski, A. S., & Purser, D. (2020). The big-O problem for labelled Markov chains and weighted automata. In Leibniz International Proceedings in Informatics Lipics Vol. 171 (pp. 411-4119). doi:10.4230/LIPIcs.CONCUR.2020.41

DOI
10.4230/LIPIcs.CONCUR.2020.41
Conference Paper

The Complexity of Verifying Loop-Free Programs as Differentially Private.

Gaboardi, M., Nissim, K., & Purser, D. (2020). The complexity of verifying loop-free programs as differentially private. In Leibniz International Proceedings in Informatics Lipics Vol. 168. doi:10.4230/LIPIcs.ICALP.2020.129

DOI
10.4230/LIPIcs.ICALP.2020.129
Conference Paper

2019

Structural liveness of Petri nets is ExpSpace-hard and decidable

Jančar, P., & Purser, D. (2019). Structural liveness of Petri nets is ExpSpace-hard and decidable. Acta Informatica, 56(6), 537-552. doi:10.1007/s00236-019-00338-6

DOI
10.1007/s00236-019-00338-6
Journal article

Asymmetric distances for approximate differential privacy

Chistikov, D., Murawski, A. S., & Purser, D. (2019). Asymmetric distances for approximate differential privacy. In Leibniz International Proceedings in Informatics Lipics Vol. 140. doi:10.4230/LIPIcs.CONCUR.2019.10

DOI
10.4230/LIPIcs.CONCUR.2019.10
Conference Paper

2018

Bisimilarity Distances for Approximate Differential Privacy

Chistikov, D., Murawski, A. S., & Purser, D. (2018). Bisimilarity Distances for Approximate Differential Privacy. In Unknown Conference (pp. 194-210). Springer International Publishing. doi:10.1007/978-3-030-01090-4_12

DOI
10.1007/978-3-030-01090-4_12
Conference Paper