Gharibian S, Le Gall F. Dequantizing the Quantum Singular Value Transformation: Hardness and Applications to Quantum Chemistry and the Quantum PCP Conjecture. SIAM Journal on Computing. 2023;52(4):1009-1038. doi:10.1137/22m1513721

Gharibian S, Kempe J. Approximation Algorithms for QMA-Complete Problems. SIAM Journal on Computing. 2012;41(4):1028-1050. doi:10.1137/110842272

Briest P, Krysta P, Vöcking B. Approximation Techniques for Utilitarian Mechanism Design. SIAM Journal on Computing. 2011:1587-1622. doi:10.1137/090772988

Briest P, Krysta P. Buying Cheap Is Expensive: Approximability of Combinatorial Pricing Problems. SIAM Journal on Computing. 2011:1554-1586. doi:10.1137/090752353

Kirschmer M, Voight J. Algorithmic Enumeration of Ideal Classes for Quaternion Orders. SIAM Journal on Computing. 2010;39(5):1714-1747. doi:10.1137/080734467

Czumaj A, Sohler C. Abstract Combinatorial Programs and Efficient Property Testers. SIAM Journal on Computing. 2005;34(3):580-615. doi:10.1137/s009753970444199x

Czumaj A, Ergün F, Fortnow L, et al. Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time. SIAM Journal on Computing. 2005;35(1):91-109. doi:10.1137/s0097539703435297

Fomin FV, Thilikos DM. Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-Up. In: Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA 2003). ; 2003. doi:10.1137/s0097539702419649

Czumaj A, Meyer auf der Heide F, Stemann V. Contention Resolution in Hashing Based Shared Memory Simulations. SIAM Journal on Computing. 2000:1703-1739. doi:10.1137/s009753979529564x

Gil J, Meyer auf der Heide F, Wigderson A. The Tree Model for Hashing: Lower and Upper Bounds. SIAM Journal on Computing. 1996:936-955. doi:10.1137/s0097539793255722