Daniele Dell'Erba

Orcid: 0000-0003-1196-6110

According to our database1, Daniele Dell'Erba authored at least 14 papers between 2016 and 2025.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Priority Promotion with Parysian flair.
J. Comput. Syst. Sci., 2025

2024
Semantic flowers for good-for-games and deterministic automata.
Inf. Process. Lett., March, 2024

DFAMiner: Mining Minimal Separating DFAs from Labelled Samples.
Proceedings of the Formal Methods - 26th International Symposium, 2024

2023
Errata to: "Faster Deterministic Exponential Time Algorithm for Energy Games and Mean Payoff Games".
CoRR, 2023

An Objective Improvement Approach to Solving Discounted Payoff Games.
Proceedings of the Fourteenth International Symposium on Games, 2023

2022
Smaller progress measures and separating automata for parity games.
Frontiers Comput. Sci., 2022

2020
Robust worst cases for parity games algorithms.
Inf. Comput., 2020

From Quasi-Dominions to Progress Measures.
CoRR, 2020

Solving Mean-Payoff Games via Quasi Dominions.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2020

2019
Solving Infinite Games on Graphs via Quasi Dominions.
PhD thesis, 2019

2018
A delayed promotion policy for parity games.
Inf. Comput., 2018

2017
Robust Exponential Worst Cases for Divide-et-Impera Algorithms for Parity Games.
Proceedings of the Proceedings Eighth International Symposium on Games, 2017

2016
Improving Priority Promotion for Parity Games.
Proceedings of the Hardware and Software: Verification and Testing, 2016

Solving Parity Games via Priority Promotion.
Proceedings of the Computer Aided Verification - 28th International Conference, 2016


  Loading...