default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDavid Purser
Person information
- affiliation: Max Planck Institute for Software Systems (MPI-SWS), Saarbrücken, Germany
- affiliation (PhD 2020): University of Warwick, Coventry, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j17]Engel Lefaucheux, Joël Ouaknine
, David Purser, James Worrell:
Porous invariants for linear systems. Formal Methods Syst. Des. 63(1): 235-271 (2024)- [j16]David Purser, Elli Anastasiadi:
SIGLOG Monthly 245: January 2024. ACM SIGLOG News 11(1): 13-20 (2024) - [c17]Sougata Bose, Rasmus Ibsen-Jensen, David Purser, Patrick Totzke, Pierre Vandenhove:
The Power of Counting Steps in Quantitative Games. CONCUR 2024: 13:1-13:18 - [c16]Ismaël Jecker, Filip Mazowiecki, David Purser:
Determinisation and Unambiguisation of Polynomially-Ambiguous Rational Weighted Automata. LICS 2024: 46:1-46:13 - [i13]Sougata Bose, Rasmus Ibsen-Jensen, David Purser, Patrick Totzke, Pierre Vandenhove:
The Power of Counting Steps in Quantitative Games. CoRR abs/2406.17482 (2024) - 2023
- [j15]David Purser:
SIGLOG Monthly 233: January 2023. ACM SIGLOG News 10(1): 52-61 (2023) - [j14]David Purser:
SIGLOG Monthly 236: April 2023. ACM SIGLOG News 10(2): 24-43 (2023) - [j13]David Purser:
SIGLOG Monthly 239: July 2023. ACM SIGLOG News 10(3): 20-25 (2023) - [j12]David Purser:
SIGLOG Monthly 242. ACM SIGLOG News 10(4): 46-52 (2023) - [c15]Sougata Bose, David Purser, Patrick Totzke:
History-Deterministic Vector Addition Systems. CONCUR 2023: 18:1-18:17 - [c14]Laure Daviaud, David Purser:
The Big-O Problem for Max-Plus Automata is Decidable (PSPACE-Complete). LICS 2023: 1-13 - [c13]Engel Lefaucheux, Joël Ouaknine, David Purser, Mohammadamin Sharifi:
Model Checking Linear Dynamical Systems under Floating-point Rounding. TACAS (1) 2023: 47-65 - [i12]Laure Daviaud, David Purser:
The Big-O Problem for Max-Plus Automata is Decidable (PSPACE-Complete). CoRR abs/2304.05229 (2023) - [i11]Sougata Bose, David Purser, Patrick Totzke:
History-deterministic Vector Addition Systems. CoRR abs/2305.01981 (2023) - [i10]Ismaël Jecker, Filip Mazowiecki, David Purser:
Determinisation and Unambiguisation of Polynomially-Ambiguous Rational Weighted Automata. CoRR abs/2310.02204 (2023) - 2022
- [j11]Dmitry Chistikov, Stefan Kiefer, Andrzej S. Murawski, David Purser:
The Big-O Problem. Log. Methods Comput. Sci. 18(1) (2022) - [j10]Toghrul Karimov, Engel Lefaucheux, Joël Ouaknine, David Purser, Anton Varonka, Markus A. Whiteland, James Worrell:
What's decidable about linear loops? Proc. ACM Program. Lang. 6(POPL): 1-25 (2022) - [j9]David Purser:
SIGLOG monthly 221. ACM SIGLOG News 9(1): 25-34 (2022) - [j8]David Purser:
SIGLOG monthly 224. ACM SIGLOG News 9(2): 34-50 (2022) - [j7]David Purser:
SIGLOG monthly 227. ACM SIGLOG News 9(3): 63 (2022) - [j6]David Purser:
SIGLOG Monthly 230. ACM SIGLOG News 9(4): 44-49 (2022) - [c12]Christel Baier, Florian Funke, Simon Jantsch, Toghrul Karimov, Engel Lefaucheux, Joël Ouaknine, David Purser, Markus A. Whiteland, James Worrell:
Parameter Synthesis for Parametric Probabilistic Dynamical Systems and Prefix-Independent Specifications. CONCUR 2022: 10:1-10:16 - [c11]Richard Lipton, Florian Luca, Joris Nieuwveld, Joël Ouaknine, David Purser, James Worrell:
On the Skolem Problem and the Skolem Conjecture. LICS 2022: 5:1-5:9 - [c10]Wojciech Czerwinski, Engel Lefaucheux, Filip Mazowiecki, David Purser, Markus A. Whiteland:
The boundedness and zero isolation problems for weighted automata over nonnegative rationals. LICS 2022: 15:1-15:13 - [c9]Yuri Bilu, Florian Luca, Joris Nieuwveld, Joël Ouaknine, David Purser, James Worrell:
Skolem Meets Schanuel. MFCS 2022: 20:1-20:15 - [i9]Yuri Bilu, Florian Luca, Joris Nieuwveld, Joël Ouaknine, David Purser, James Worrell:
Skolem Meets Schanuel. CoRR abs/2204.13417 (2022) - [i8]Wojciech Czerwinski, Engel Lefaucheux, Filip Mazowiecki, David Purser, Markus A. Whiteland:
The boundedness and zero isolation problems for weighted automata over nonnegative rationals. CoRR abs/2205.13516 (2022) - [i7]Engel Lefaucheux, Joël Ouaknine, David Purser, Mohammadamin Sharifi:
Model Checking Linear Dynamical Systems under Floating-point Rounding. CoRR abs/2211.04301 (2022) - 2021
- [j5]David Purser:
SIGLOG monthly 209. ACM SIGLOG News 8(1): 4-14 (2021) - [j4]David Purser:
SIGLOG monthly 212. ACM SIGLOG News 8(2): 30-45 (2021) - [j3]David Purser:
SIGLOG monthly 215. ACM SIGLOG News 8(3): 30-39 (2021) - [j2]David Purser:
SIGLOG monthly 218. ACM SIGLOG News 8(4): 25-32 (2021) - [c8]Engel Lefaucheux, Joël Ouaknine, David Purser, James Worrell:
Porous Invariants. CAV (2) 2021: 172-194 - [c7]Christel Baier, Florian Funke, Simon Jantsch, Toghrul Karimov, Engel Lefaucheux, Florian Luca, Joël Ouaknine, David Purser, Markus A. Whiteland, James Worrell:
The Orbit Problem for Parametric Linear Dynamical Systems. CONCUR 2021: 28:1-28:17 - [i6]Christel Baier, Florian Funke, Simon Jantsch, Engel Lefaucheux, Florian Luca, Joël Ouaknine, David Purser, Markus A. Whiteland, James Worrell:
The Orbit Problem for Parametric Linear Dynamical Systems. CoRR abs/2104.10634 (2021) - [i5]Engel Lefaucheux, Joël Ouaknine, David Purser, James Worrell:
Porous Invariants. CoRR abs/2106.00662 (2021) - 2020
- [b1]David Purser:
On the complexity of verifying differential privacy. University of Warwick, Coventry, UK, 2020 - [c6]Dmitry Chistikov, Stefan Kiefer, Andrzej S. Murawski, David Purser:
The Big-O Problem for Labelled Markov Chains and Weighted Automata. CONCUR 2020: 41:1-41:19 - [c5]Christel Baier, Florian Funke, Simon Jantsch, Toghrul Karimov, Engel Lefaucheux, Joël Ouaknine, Amaury Pouly, David Purser, Markus A. Whiteland:
Reachability in Dynamical Systems with Rounding. FSTTCS 2020: 36:1-36:17 - [c4]Marco Gaboardi, Kobbi Nissim, David Purser:
The Complexity of Verifying Loop-Free Programs as Differentially Private. ICALP 2020: 129:1-129:17 - [i4]Dmitry Chistikov, Stefan Kiefer, Andrzej S. Murawski, David Purser:
The Big-O Problem for Labelled Markov Chains and Weighted Automata. CoRR abs/2007.07694 (2020) - [i3]Christel Baier, Florian Funke, Simon Jantsch, Toghrul Karimov, Engel Lefaucheux, Joël Ouaknine, Amaury Pouly, David Purser, Markus A. Whiteland:
Reachability in Dynamical Systems with Rounding. CoRR abs/2009.13353 (2020)
2010 – 2019
- 2019
- [j1]Petr Jancar, David Purser:
Structural liveness of Petri nets is ExpSpace-hard and decidable. Acta Informatica 56(6): 537-552 (2019) - [c3]Dmitry Chistikov, Andrzej S. Murawski, David Purser:
Asymmetric Distances for Approximate Differential Privacy. CONCUR 2019: 10:1-10:17 - [i2]Marco Gaboardi, Kobbi Nissim, David Purser:
The Complexity of Verifying Circuits as Differentially Private. CoRR abs/1911.03272 (2019) - 2018
- [c2]Dmitry Chistikov, Andrzej S. Murawski, David Purser:
Bisimilarity Distances for Approximate Differential Privacy. ATVA 2018: 194-210 - [c1]Neha Gupta, Henry Crosby, David Purser, Stephen A. Jarvis, Weisi Guo:
Twitter Usage Across Industry: A Spatiotemporal Analysis. BigDataService 2018: 64-71 - [i1]Dmitry Chistikov, Andrzej S. Murawski, David Purser:
Bisimilarity Distances for Approximate Differential Privacy. CoRR abs/1807.10015 (2018)
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-12-10 21:43 CET 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:
