default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHamoon Mousavi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i12]Hamoon Mousavi, Taro Spirig:
A Quantum Unique Games Conjecture. CoRR abs/2409.20028 (2024)- 2023
- [i11]Eric Culf, Hamoon Mousavi, Taro Spirig:
Approximation algorithms for noncommutative constraint satisfaction problems. CoRR abs/2312.16765 (2023) - 2022
- [c7]Hamoon Mousavi, Seyed Sajjad Nezhadi, Henry Yuen:
Nonlocal games, compression theorems, and the arithmetical hierarchy. STOC 2022: 1-11 - 2021
- [i10]Hamoon Mousavi, Seyed Sajjad Nezhadi, Henry Yuen:
Nonlocal Games, Compression Theorems, and the Arithmetical Hierarchy. CoRR abs/2110.04651 (2021) - 2020
- [j5]David Cui, Arthur Mehta, Hamoon Mousavi, Seyed Sajjad Nezhadi:
A generalization of CHSH and the algebraic structure of optimal strategies. Quantum 4: 346 (2020) - [c6]Hamoon Mousavi, Seyed Sajjad Nezhadi, Henry Yuen:
On the Complexity of Zero Gap MIP. ICALP 2020: 87:1-87:12 - [i9]Hamoon Mousavi, Seyed Sajjad Nezhadi, Henry Yuen:
On the complexity of zero gap MIP. CoRR abs/2002.10490 (2020)
2010 – 2019
- 2017
- [j4]Chen Fei Du, Hamoon Mousavi, Eric Rowland
, Luke Schaeffer, Jeffrey O. Shallit:
Decision algorithms for Fibonacci-automatic words, II: Related sequences and avoidability. Theor. Comput. Sci. 657: 146-162 (2017) - [i8]Hamoon Mousavi:
Lower Bounds on Regular Expression Size. CoRR abs/1712.00811 (2017) - 2016
- [j3]Chen Fei Du, Hamoon Mousavi, Luke Schaeffer, Jeffrey O. Shallit:
Decision Algorithms for Fibonacci-Automatic Words, III: Enumeration and Abelian Properties. Int. J. Found. Comput. Sci. 27(8): 943-964 (2016) - [j2]Hamoon Mousavi, Luke Schaeffer, Jeffrey O. Shallit:
Decision algorithms for Fibonacci-automatic Words, I: Basic results. RAIRO Theor. Informatics Appl. 50(1): 39-66 (2016) - [i7]Hamoon Mousavi:
Automatic Theorem Proving in Walnut. CoRR abs/1603.06017 (2016) - 2015
- [c5]Daniel Goc, Hamoon Mousavi, Luke Schaeffer, Jeffrey O. Shallit:
A New Approach to the Paperfolding Sequences. CiE 2015: 34-43 - [c4]Hamoon Mousavi, Jeffrey O. Shallit:
Mechanical Proofs of Properties of the Tribonacci Word. WORDS 2015: 170-190 - 2014
- [i6]Chen Fei Du, Hamoon Mousavi, Luke Schaeffer, Jeffrey O. Shallit:
Decision Algorithms for Fibonacci-Automatic Words, with Applications to Pattern Avoidance. CoRR abs/1406.0670 (2014) - [i5]Hamoon Mousavi, Jeffrey O. Shallit:
Mechanical Proofs of Properties of the Tribonacci Word. CoRR abs/1407.5841 (2014) - 2013
- [j1]Hamoon Mousavi, Jeffrey O. Shallit:
Filtrations of Formal Languages by Arithmetic Progressions. Fundam. Informaticae 123(2): 135-142 (2013) - [c3]Hamoon Mousavi, Jeffrey O. Shallit:
Shortest Repetition-Free Words Accepted by Automata. DCFS 2013: 182-193 - [c2]Hamoon Mousavi, Jeffrey O. Shallit:
Repetition Avoidance in Circular Factors. Developments in Language Theory 2013: 384-395 - [c1]Daniel Goc, Hamoon Mousavi, Jeffrey O. Shallit:
On the Number of Unbordered Factors. LATA 2013: 299-310 - [i4]Hamoon Mousavi, Jeffrey O. Shallit:
Shortest Repetition-Free Words Accepted by Automata. CoRR abs/1304.2959 (2013) - 2012
- [i3]Daniel Goc, Hamoon Mousavi, Jeffrey O. Shallit:
On the Number of Unbordered Factors. CoRR abs/1211.1301 (2012) - [i2]Hamoon Mousavi, Jeffrey O. Shallit:
Repetition Avoidance in Circular Factors. CoRR abs/1212.0052 (2012) - 2011
- [i1]Hamoon Mousavi, Jeffrey O. Shallit:
Filtrations of Formal Languages by Arithmetic Progressions. CoRR abs/1112.3758 (2011)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-22 21:13 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
