Avgerinos Delkos

According to our database, Avgerinos Delkos authored at least 4 papers between 2022 and 2025.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2025

Proof complexity of positive branching programs.

Anupam Das, Avgerinos Delkos

Log. Methods Comput. Sci., 2025

A Significance-Based Account of Ceteris paribus Counterfactuals.

Avgerinos Delkos, Marianna Girlando

Proceedings of the Logic, Language, Information, and Computation, 2025

2023

A dynamic approach to ceteris paribus counterfactuals.

Avgerinos Delkos, Marianna Girlando

CoRR, 2023

2022

Proof Complexity of Monotone Branching Programs.

Anupam Das, Avgerinos Delkos

Proceedings of the Revolutions and Revelations in Computability, 2022