Hamoon Mousavi

According to our database1, Hamoon Mousavi authored at least 18 papers between 2013 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
A Quantum Unique Games Conjecture.
CoRR, 2024

Approximation Algorithms for Noncommutative CSPs.
Proceedings of the 65th IEEE Annual Symposium on Foundations of Computer Science, 2024

2023
Approximation algorithms for noncommutative constraint satisfaction problems.
CoRR, 2023

2022
Nonlocal games, compression theorems, and the arithmetical hierarchy.
Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

2020
A generalization of CHSH and the algebraic structure of optimal strategies.
Quantum, 2020

On the Complexity of Zero Gap MIP.
Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

2017
Decision algorithms for Fibonacci-automatic words, II: Related sequences and avoidability.
Theor. Comput. Sci., 2017

Lower Bounds on Regular Expression Size.
CoRR, 2017

2016
Decision algorithms for Fibonacci-automatic Words, I: Basic results.
RAIRO Theor. Informatics Appl., 2016

Decision Algorithms for Fibonacci-Automatic Words, III: Enumeration and Abelian Properties.
Int. J. Found. Comput. Sci., 2016

Automatic Theorem Proving in Walnut.
CoRR, 2016

2015
Mechanical Proofs of Properties of the Tribonacci Word.
Proceedings of the Combinatorics on Words - 10th International Conference, 2015

A New Approach to the Paperfolding Sequences.
Proceedings of the Evolving Computability - 11th Conference on Computability in Europe, 2015

2014
Decision Algorithms for Fibonacci-Automatic Words, with Applications to Pattern Avoidance.
CoRR, 2014

2013
Filtrations of Formal Languages by Arithmetic Progressions.
Fundam. Informaticae, 2013

On the Number of Unbordered Factors.
Proceedings of the Language and Automata Theory and Applications, 2013

Repetition Avoidance in Circular Factors.
Proceedings of the Developments in Language Theory - 17th International Conference, 2013

Shortest Repetition-Free Words Accepted by Automata.
Proceedings of the Descriptional Complexity of Formal Systems, 2013


  Loading...