Harry Vinall-Smeeth

Orcid: 0000-0003-2422-9435

According to our database1, Harry Vinall-Smeeth authored at least 6 papers between 2023 and 2025.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
A Lower Bound on Unambiguous Context Free Grammars via Communication Complexity.
Proc. ACM Manag. Data, May, 2025

Factorised Representations of Join Queries: Tight Bounds and a New Dichotomy.
CoRR, March, 2025

Supercritical Size-Width Tree-Like Resolution Trade-Offs for Graph Isomorphism.
Proceedings of the 50th International Symposium on Mathematical Foundations of Computer Science, 2025

2024
From Quantifier Depth to Quantifier Number: Separating Structures with k Variables.
Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science, 2024

Structured d-DNNF Is Not Closed under Negation.
Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, 2024

2023
A Dichotomy for Succinct Representations of Homomorphisms.
Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023


  Loading...