Avgerinos Delkos

According to our database1, Avgerinos Delkos authored at least 5 papers between 2022 and 2026.

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

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2026
Prover-Adversary games for systems over (non-deterministic) branching programs.
Log. Methods Comput. Sci., 2026

2025
Proof complexity of positive branching programs.
Log. Methods Comput. Sci., 2025

A Significance-Based Account of Ceteris paribus Counterfactuals.
Proceedings of the Logic, Language, Information, and Computation, 2025

2023
A dynamic approach to ceteris paribus counterfactuals.
CoRR, 2023

2022
Proof Complexity of Monotone Branching Programs.
Proceedings of the Revolutions and Revelations in Computability, 2022


  Loading...