default search action
David Mestel
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i10]David Mestel, Steven Chaplick, Steven Kelk, Ruben Meuwese:
Split-or-decompose: Improved FPT branching algorithms for maximum agreement forests. CoRR abs/2409.18634 (2024) - 2023
- [j2]David Mestel, Johannes Müller, Pascal Reisert
:
How efficient are replay attacks against vote privacy? A formal quantitative analysis. J. Comput. Secur. 31(5): 421-467 (2023) - 2022
- [c5]David Mestel, Johannes Müller, Pascal Reisert
How Efficient are Replay Attacks against Vote Privacy? A Formal Quantitative Analysis. CSF 2022: 179-194 - [c4]David Mestel:
Beware of Greeks bearing entanglement? Quantum covert channels, information flow and non-local games. CSF 2022: 276-288 - [i9]David Mestel:
Beware of Greeks bearing entanglement? Quantum covert channels, information flow and non-local games. CoRR abs/2202.02069 (2022) - [i8]David Mestel, Johannes Müller, Pascal Reisert:
How Efficient are Replay Attacks against Vote Privacy? A Formal Quantitative Analysis. IACR Cryptol. ePrint Arch. 2022: 743 (2022) - 2020
- [j1]David Mestel, A. W. Roscoe
Translating between models of concurrency. Acta Informatica 57(3-5): 403-438 (2020) - [i7]David Mestel:
Robust ambiguity for contact tracing. CoRR abs/2007.01288 (2020) - [i6]Wojciech Jamroga, David Mestel, Peter B. Rønne, Peter Y. A. Ryan, Marjan Skrobot:
A Survey of Requirements for COVID-19 Mitigation Strategies. Part I: Newspaper Clips. CoRR abs/2011.07887 (2020)
2010 – 2019
- 2019
- [c3]David Mestel:
Quantifying Information Flow in Interactive Systems. CSF 2019: 414-427 - [c2]David Mestel:
Widths of Regular and Context-Free Languages. FSTTCS 2019: 49:1-49:14 - [i5]David Mestel, A. W. Roscoe:
Translating between models of concurrency. CoRR abs/1904.09875 (2019) - [i4]David Mestel:
Quantifying information flow in interactive systems. CoRR abs/1905.04332 (2019) - 2018
- [b1]David Mestel:
Quantifying information flow. University of Oxford, UK, 2018 - [i3]Arash Atashpendar, Marc Beunardeau, Aisling Connolly, Rémi Géraud, David Mestel, A. W. Roscoe, Peter Y. A. Ryan:
From Clustering Supersequences to Entropy Minimizing Subsequences for Single and Double Deletions. CoRR abs/1802.00703 (2018) - [i2]Arash Atashpendar, David Mestel, A. W. Roscoe, Peter Y. A. Ryan:
A Proof of Entropy Minimization for Outputs in Deletion Channels via Hidden Word Statistics. CoRR abs/1807.11609 (2018) - 2017
- [i1]David Mestel:
On the widths of regular and context free languages, with an application to information flow. CoRR abs/1709.08696 (2017) - 2016
- [c1]David Mestel, A. W. Roscoe:
Reducing Complex CSP Models to Traces via Priority. MFPS 2016: 237-252
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-18 19:29 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: