9 citations · 14 across the 7 of their papers we have counts for
8 papers
Beware of Greeks bearing entanglement? Quantum covert channels, information flow and non-local games
David Mestel
Can quantum entanglement increase the capacity of (classical) covert channels? To one familiar with Holevo's Theorem it is tempting to think that the answer is obviously no. Howeve…
A Survey of Requirements for COVID-19 Mitigation Strategies. Part I: Newspaper Clips
Wojciech Jamroga, David Mestel, Peter B. Roenne +2
The COVID-19 pandemic has influenced virtually all aspects of our lives. Across the world, countries have applied various mitigation strategies for the epidemic, based on social, p…
Robust ambiguity for contact tracing
David Mestel
A known drawback of `decentralised' contact tracing architectures is that users who have been in contact with an infected person are able to precisely identify the relevant contact…
Quantifying information flow in interactive systems
David Mestel
We consider the problem of quantifying information flow in interactive systems, modelled as finite-state transducers in the style of Goguen and Meseguer. Our main result is that if…
Translating between models of concurrency
David Mestel, A. W. Roscoe
Hoare's Communicating Sequential Processes (CSP) admits a rich universe of semantic models closely related to the van Glabbeek spectrum. In this paper we study finite observational…
A Proof of Entropy Minimization for Outputs in Deletion Channels via Hidden Word Statistics
Arash Atashpendar, David Mestel, A. W. Roscoe +1
From the output produced by a memoryless deletion channel from a uniformly random input of known length , one obtains a posterior distribution on the channel input. The differen…
From Clustering Supersequences to Entropy Minimizing Subsequences for Single and Double Deletions
Arash Atashpendar, Marc Beunardeau, Aisling Connolly +4
A binary string transmitted via a memoryless i.i.d. deletion channel is received as a subsequence of the original input. From this, one obtains a posterior distribution on the chan…
Widths of regular and context-free languages
David Mestel
Given a partially-ordered finite alphabet and a language , how large can an antichain in be (where is given the lexicographic ordering)? More precisely,…