S. Gharibian and F. Le Gall, “Dequantizing the Quantum Singular Value Transformation: Hardness and Applications to Quantum Chemistry and the Quantum PCP Conjecture,”10.1137/22m1513721__SIAM Journal on Computing, vol. 52, no. 4, pp. 1009–1038, 2023, doi:10.1137/22m1513721 .

S. Gharibian and J. Kempe, “Approximation Algorithms for QMA-Complete Problems,”10.1137/110842272__SIAM Journal on Computing, vol. 41, no. 4, pp. 1028–1050, 2012, doi:10.1137/110842272 .

P. Briest, P. Krysta, and B. Vöcking, “Approximation Techniques for Utilitarian Mechanism Design,” SIAM Journal on Computing, pp. 1587–1622, 2011.

P. Briest and P. Krysta, “Buying Cheap Is Expensive: Approximability of Combinatorial Pricing Problems,” SIAM Journal on Computing, pp. 1554–1586, 2011.

M. Kirschmer and J. Voight, “Algorithmic Enumeration of Ideal Classes for Quaternion Orders,”10.1137/080734467__SIAM Journal on Computing, vol. 39, no. 5, pp. 1714–1747, 2010, doi:10.1137/080734467 .

A. Czumaj and C. Sohler, “Abstract Combinatorial Programs and Efficient Property Testers,” SIAM Journal on Computing, vol. 34, no. 3, pp. 580–615, 2005.

A. Czumaj et al., “Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time,” SIAM Journal on Computing, vol. 35, no. 1, pp. 91–109, 2005.

F. V. Fomin and D. M. Thilikos, “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.

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

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

M. Dietzfelbinger, A. Karlin, K. Mehlhorn, F. Meyer auf der Heide, H. Rohnert, and R. E. Tarjan, “Dynamic Perfect Hashing: Upper and Lower Bounds,” SIAM Journal on Computing, pp. 738–761, 1994.

A. Borodin, F. Fich, F. Meyer auf der Heide, E. Upfal, and A. Wigderson, “A Time-Space Tradeoff for Element Distinctness,” SIAM Journal on Computing, pp. 97–99, 1987.

F. Meyer auf der Heide and A. Wigderson, “The Complexity of Parallel Sorting,” SIAM Journal on Computing, pp. 100–107, 1987.

F. Meyer auf der Heide, “Efficient Simulations among Several Models of Parallel Computers,” SIAM Journal on Computing, pp. 106–119, 1986.