Complexity of Regex Crosswords. - Stephen A. Fenner; Daniel Padé (LATA, 2019)

Depth-2 QAC circuits cannot simulate quantum parity. - Daniel Padé; Stephen A. Fenner; Daniel Grier; Thomas Thierauf (CoRR, 2020)

The complexity of regex crosswords. - Stephen A. Fenner; Daniel Padé; Thomas Thierauf (Inf. Comput., 2022)

Tight bounds on depth-2 QAC-circuits computing parity. - Stephen A. Fenner; Daniel Grier; Daniel Padé; Thomas Thierauf (CoRR, 2025)