Arithmetic Expression Construction. - Leo Alcock; Sualeh Asif; Jeffrey Bosboom; Josh Brunner; Charlotte Chen; Erik D. Demaine; Rogers Epstein; Adam Hesterberg; Lior Hirschfeld; William Hu; Jayson Lynch; Sarah Scheffler; et al. (ISAAC, 2020)

Tetris is NP-hard even with $O(1)$ rows or columns. - Sualeh Asif; Michael J. Coulombe; Erik D. Demaine; Martin L. Demaine; Adam Hesterberg; Jayson Lynch; Mihir Singhal (CoRR, 2020)

PSPACE-completeness of Pulling Blocks to Reach a Goal. - Joshua Ani; Sualeh Asif; Erik D. Demaine; Yevhenii Diomidov; Dylan H. Hendrickson; Jayson Lynch; Sarah Scheffler; Adam Suhl (J. Inf. Process., 2020)

Tetris is NP-hard even with O(1) Rows or Columns. - Sualeh Asif; Michael J. Coulombe; Erik D. Demaine; Martin L. Demaine; Adam Hesterberg; Jayson Lynch; Mihir Singhal (J. Inf. Process., 2020)

Formal Security Definition of Metadata-Private Messaging. - Shengtong Zhang; Arvid Lunnemark; Sualeh Asif (IACR Cryptol. ePrint Arch., 2022)

Computing L-polynomials of Picard curves from Cartier-Manin matrices. - Sualeh Asif; Francesc Fité; Dylan Pentland; A. V. Sutherland (Math. Comput., 2022)