Sotabase

Career

· PhD in Computer Science, Columbia University2023–
· Postdoctoral Researcher, Simons Institute, UC Berkeley2023–2025
· M.S., Mathematics (C&O), University of Waterloo2019–
· Software Engineer, Alphabet Inc. (Google)2016–2018
· Software Engineer, Startup (Marmot Labs)2015–2016
· Software Engineer, Intel Corporation (McAfee)2014–2015
· M.S., Computer Science, University of Waterloo2013–
· Research Assistant, University of Waterloo2013–2014
· B.S., Computer Engineering, University of Tehran2011–

Publications (20)

Automatic Theorem Proving in Walnut
arXiv.org · 2016
134
cited
Decision algorithms for Fibonacci-automatic Words, I: Basic results
RAIRO - Theoretical Informatics and Applications · 2016
54
cited
Decision Algorithms for Fibonacci-Automatic Words, with Applications to Pattern Avoidance
arXiv.org · 2014
37
cited
Decision Algorithms for Fibonacci-Automatic Words, III: Enumeration and Abelian Properties
International Journal of Foundations of Computer Science · 2016
33
cited
Mechanical Proofs of Properties of the Tribonacci Word
Words · 2014
28
cited
Decision algorithms for Fibonacci-automatic words, II: Related sequences and avoidability
Theoretical Computer Science · 2017
25
cited
On the Number of Unbordered Factors
Language and Automata Theory and Applications · 2012
23
cited
A generalization of CHSH and the algebraic structure of optimal strategies
Quantum · 2019
20
cited
Nonlocal games, compression theorems, and the arithmetical hierarchy
Symposium on the Theory of Computing · 2021
16
cited
Repetition Avoidance in Circular Factors
International Conference on Developments in Language Theory · 2012
9
cited
A New Approach to the Paperfolding Sequences
Conference on Computability in Europe · 2015
8
cited
On the complexity of zero gap MIP
International Colloquium on Automata, Languages and Programming · 2020
8
cited
Approximation algorithms for noncommutative constraint satisfaction problems
arXiv.org · 2023
5
cited
A Quantum Unique Games Conjecture
Information Technology Convergence and Services · 2024
5
cited
Approximation Algorithms for Noncommutative CSPs
IEEE Annual Symposium on Foundations of Computer Science · 2024
4
cited
Lower Bounds on Regular Expression Size
arXiv.org · 2017
3
cited
Shortest Repetition-Free Words Accepted by Automata
Workshop on Descriptional Complexity of Formal Systems · 2013
2
cited
Filtrations of Formal Languages by Arithmetic Progressions
Fundamenta Informaticae · 2011
Some Aspects of Noncommutativity in Polynomial Optimization
2023
Sotabase
Hamoon Mousavi | Researcher Profile | Sotabase | Sotabase