Reducing Complex CSP Models to Traces via Priority. - David Mestel; A. W. Roscoe 001 (MFPS, 2016)

On the widths of regular and context free languages, with an application to information flow. - David Mestel (CoRR, 2017)

From Clustering Supersequences to Entropy Minimizing Subsequences for Single and Double Deletions. - Arash Atashpendar; Marc Beunardeau; Aisling Connolly; Rémi Géraud; David Mestel; A. W. Roscoe 001; Peter Y. A. Ryan (CoRR, 2018)

A Proof of Entropy Minimization for Outputs in Deletion Channels via Hidden Word Statistics. - Arash Atashpendar; David Mestel; A. W. Roscoe 001; Peter Y. A. Ryan (CoRR, 2018)

Quantifying information flow. - David Mestel (2018)

Quantifying Information Flow in Interactive Systems. - David Mestel (CSF, 2019)

Widths of Regular and Context-Free Languages. - David Mestel (FSTTCS, 2019)

Translating between models of concurrency. - David Mestel; A. W. Roscoe 001 (Acta Informatica, 2020)

Robust ambiguity for contact tracing. - David Mestel (CoRR, 2020)

A Survey of Requirements for COVID-19 Mitigation Strategies. Part I: Newspaper Clips. - Wojciech Jamroga; David Mestel; Peter B. Rønne; Peter Y. A. Ryan; Marjan Skrobot (CoRR, 2020)

Beware of Greeks bearing entanglement? Quantum covert channels, information flow and non-local games. - David Mestel (CSF, 2022)

How efficient are replay attacks against vote privacy? A formal quantitative analysis. - David Mestel; Johannes Müller 001; Pascal Reisert (J. Comput. Secur., 2023)

Split-or-decompose: Improved FPT branching algorithms for maximum agreement forests. - David Mestel; Steven Chaplick; Steven Kelk; Ruben Meuwese (CoRR, 2024)

The Decision Problem for Regular First Order Theories. - Umang Mathur 001; David Mestel; Mahesh Viswanathan 001 (Proc. ACM Program. Lang., 2025)