Dequantizing the Quantum Singular Value Transformation: Hardness and Applications to Quantum Chemistry and the Quantum PCP Conjecture
S. Gharibian, F. Le Gall, SIAM Journal on Computing 52 (2023) 1009–1038.

Approximation Algorithms for QMA-Complete Problems
S. Gharibian, J. Kempe, SIAM Journal on Computing 41 (2012) 1028–1050.

Approximation Techniques for Utilitarian Mechanism Design
P. Briest, P. Krysta, B. Vöcking, SIAM Journal on Computing (2011) 1587–1622.

Buying Cheap Is Expensive: Approximability of Combinatorial Pricing Problems
P. Briest, P. Krysta, SIAM Journal on Computing (2011) 1554–1586.

Algorithmic Enumeration of Ideal Classes for Quaternion Orders
M. Kirschmer, J. Voight, SIAM Journal on Computing 39 (2010) 1714–1747.

Abstract Combinatorial Programs and Efficient Property Testers
A. Czumaj, C. Sohler, SIAM Journal on Computing 34 (2005) 580–615.

Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time
A. Czumaj, F. Ergün, L. Fortnow, A. Magen, I. Newman, R. Rubinfeld, C. Sohler, SIAM Journal on Computing 35 (2005) 91–109.

Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-Up
F.V. Fomin, D.M. Thilikos, in: Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA 2003), 2003.

Contention Resolution in Hashing Based Shared Memory Simulations
A. Czumaj, F. Meyer auf der Heide, V. Stemann, SIAM Journal on Computing (2000) 1703–1739.

The Tree Model for Hashing: Lower and Upper Bounds
J. Gil, F. Meyer auf der Heide, A. Wigderson, SIAM Journal on Computing (1996) 936–955.