default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDaniele Dell'Erba
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j7]Massimo Benerecetti, Daniele Dell'Erba
, Fabio Mogavero, Sven Schewe, Dominik Wojtczak:
Priority Promotion with Parysian flair. J. Comput. Syst. Sci. 147: 103580 (2025)- 2024
- [j6]Massimo Benerecetti, Daniele Dell'Erba, Fabio Mogavero:
Solving mean-payoff games via quasi dominions. Inf. Comput. 297: 105151 (2024) - [j5]Daniele Dell'Erba, Sven Schewe, Qiyi Tang, Tansholpan Zhanabekova:
Semantic flowers for good-for-games and deterministic automata. Inf. Process. Lett. 185: 106468 (2024) - [c7]Daniele Dell'Erba, Yong Li, Sven Schewe:
DFAMiner: Mining Minimal Separating DFAs from Labelled Samples. FM (2) 2024: 48-66 - [i7]Daniele Dell'Erba, Arthur Dumas, Sven Schewe:
An Objective Improvement Approach to Solving Discounted Payoff Games. CoRR abs/2404.04124 (2024) - [i6]Daniele Dell'Erba, Yong Li, Sven Schewe:
DFAMiner: Mining minimal separating DFAs from labelled samples. CoRR abs/2405.18871 (2024) - 2023
- [c6]Daniele Dell'Erba, Arthur Dumas, Sven Schewe:
An Objective Improvement Approach to Solving Discounted Payoff Games. GandALF 2023: 203-219 - [i5]Peter Austin, Daniele Dell'Erba:
Errata to: "Faster Deterministic Exponential Time Algorithm for Energy Games and Mean Payoff Games". CoRR abs/2310.04130 (2023) - 2022
- [j4]Daniele Dell'Erba, Sven Schewe:
Smaller progress measures and separating automata for parity games. Frontiers Comput. Sci. 4 (2022) - [i4]Daniele Dell'Erba, Sven Schewe:
Smaller Progress Measures and Separating Automata for Parity Games. CoRR abs/2205.00744 (2022) - 2021
- [i3]Massimo Benerecetti, Daniele Dell'Erba, Fabio Mogavero, Sven Schewe, Dominik Wojtczak:
Priority Promotion with Parysian Flair. CoRR abs/2105.01738 (2021) - 2020
- [j3]Massimo Benerecetti, Daniele Dell'Erba, Fabio Mogavero:
Robust worst cases for parity games algorithms. Inf. Comput. 272: 104501 (2020) - [c5]Massimo Benerecetti, Daniele Dell'Erba, Fabio Mogavero:
Solving Mean-Payoff Games via Quasi Dominions. TACAS (2) 2020: 289-306 - [i2]Massimo Benerecetti, Daniele Dell'Erba, Marco Faella, Fabio Mogavero:
From Quasi-Dominions to Progress Measures. CoRR abs/2008.04232 (2020)
2010 – 2019
- 2019
- [b1]Daniele Dell'Erba:
Solving Infinite Games on Graphs via Quasi Dominions. University of Naples Federico II, Italy, 2019 - [i1]Massimo Benerecetti, Daniele Dell'Erba, Fabio Mogavero:
Solving Mean-Payoff Games via Quasi Dominions. CoRR abs/1907.06264 (2019) - 2018
- [j2]Massimo Benerecetti, Daniele Dell'Erba, Fabio Mogavero:
Solving parity games via priority promotion. Formal Methods Syst. Des. 52(2): 193-226 (2018) - [j1]Massimo Benerecetti, Daniele Dell'Erba, Fabio Mogavero:
A delayed promotion policy for parity games. Inf. Comput. 262: 221-240 (2018) - 2017
- [c4]Massimo Benerecetti, Daniele Dell'Erba, Fabio Mogavero:
Robust Exponential Worst Cases for Divide-et-Impera Algorithms for Parity Games. GandALF 2017: 121-135 - 2016
- [c3]Massimo Benerecetti, Daniele Dell'Erba, Fabio Mogavero:
Solving Parity Games via Priority Promotion. CAV (2) 2016: 270-290 - [c2]Massimo Benerecetti, Daniele Dell'Erba, Fabio Mogavero:
Improving Priority Promotion for Parity Games. Haifa Verification Conference 2016: 117-133 - [c1]Massimo Benerecetti, Daniele Dell'Erba, Fabio Mogavero:
A Delayed Promotion Policy for Parity Games. GandALF 2016: 30-45
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:47 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:
