Computing Bounded Path Decompositions in Logspace. - Shiva Kintali; Sinziana Munteanu (Electron. Colloquium Comput. Complex., 2012)

Deciding Representability of Sets of Words of Equal Length in Polynomial Time. - Francine Blanchet-Sadri; Sinziana Munteanu (IWOCA, 2013)

A note on constructing infinite binary words with polynomial subword complexity. - Francine Blanchet-Sadri; Bob Chen; Sinziana Munteanu (RAIRO Theor. Informatics Appl., 2013)

Recurrence in infinite partial words. - Francine Blanchet-Sadri; Bob Chen; Sinziana Munteanu (Theor. Comput. Sci., 2014)

Recurrent Partial Words and Representable Sets. - Francine Blanchet-Sadri; Aleksandar Chakarov; Bob Chen; Lucas Manuelli; Sinziana Munteanu; Jarett Schwartz; Slater Stich (J. Autom. Lang. Comb., 2016)

Computing generalized de Bruijn sequences. - Francine Blanchet-Sadri; Sinziana Munteanu (Theor. Comput. Sci., 2017)