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

Gharibian, S., &; Kempe, J. (2012). Approximation Algorithms for QMA-Complete Problems. SIAM Journal on Computing, 41(4), 1028–1050.https://doi.org/10.1137/110842272 
LibreCat: /record/8175
DOI: 10.1137/110842272
arXiv: 1101.3884

Briest, P., Krysta, P., &; Vöcking, B. (2011). Approximation Techniques for Utilitarian Mechanism Design. SIAM Journal on Computing, 1587–1622.https://doi.org/10.1137/090772988 
LibreCat: /record/23739
DOI: 10.1137/090772988

Briest, P., &; Krysta, P. (2011). Buying Cheap Is Expensive: Approximability of Combinatorial Pricing Problems. SIAM Journal on Computing, 1554–1586.https://doi.org/10.1137/090752353 
LibreCat: /record/23740
DOI: 10.1137/090752353

Kirschmer, M., &; Voight, J. (2010). Algorithmic Enumeration of Ideal Classes for Quaternion Orders. SIAM Journal on Computing, 39(5), 1714–1747.https://doi.org/10.1137/080734467 
LibreCat: /record/42803
DOI: 10.1137/080734467

Czumaj, A., &; Sohler, C. (2005). Abstract Combinatorial Programs and Efficient Property Testers. SIAM Journal on Computing, 34(3), 580–615.https://doi.org/10.1137/s009753970444199x 
LibreCat: /record/18763
DOI: 10.1137/s009753970444199x

Czumaj, A., Ergün, F., Fortnow, L., Magen, A., Newman, I., Rubinfeld, R., &; Sohler, C. (2005). Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time. SIAM Journal on Computing, 35(1), 91–109.https://doi.org/10.1137/s0097539703435297 
LibreCat: /record/18855
DOI: 10.1137/s0097539703435297

Fomin, F. V., &; Thilikos, D. M. (2003). Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-Up. In Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA 2003).https://doi.org/10.1137/s0097539702419649 
LibreCat: /record/19952
DOI: 10.1137/s0097539702419649

Czumaj, A., Meyer auf der Heide, F., &; Stemann, V. (2000). Contention Resolution in Hashing Based Shared Memory Simulations. SIAM Journal on Computing, 1703–1739.https://doi.org/10.1137/s009753979529564x 
LibreCat: /record/17010
DOI: 10.1137/s009753979529564x

Gil, J., Meyer auf der Heide, F., &; Wigderson, A. (1996). The Tree Model for Hashing: Lower and Upper Bounds. SIAM Journal on Computing, 936–955.https://doi.org/10.1137/s0097539793255722 
LibreCat: /record/16701
DOI: 10.1137/s0097539793255722

Dietzfelbinger, M., Karlin, A., Mehlhorn, K., Meyer auf der Heide, F., Rohnert, H., &; Tarjan, R. E. (1994). Dynamic Perfect Hashing: Upper and Lower Bounds. SIAM Journal on Computing, 738–761.https://doi.org/10.1137/s0097539791194094 
LibreCat: /record/16728
DOI: 10.1137/s0097539791194094

Borodin, A., Fich, F., Meyer auf der Heide, F., Upfal, E., &; Wigderson, A. (1987). A Time-Space Tradeoff for Element Distinctness. SIAM Journal on Computing, 97–99.https://doi.org/10.1137/0216007 
LibreCat: /record/16772
DOI: 10.1137/0216007

Meyer auf der Heide, F., &; Wigderson, A. (1987). The Complexity of Parallel Sorting. SIAM Journal on Computing, 100–107.https://doi.org/10.1137/0216008 
LibreCat: /record/16773
DOI: 10.1137/0216008

Meyer auf der Heide, F. (1986). Efficient Simulations among Several Models of Parallel Computers. SIAM Journal on Computing, 106–119.https://doi.org/10.1137/0215008 
LibreCat: /record/16771
DOI: 10.1137/0215008