Gharibian, Sevag, and François Le Gall. “Dequantizing the Quantum Singular Value Transformation: Hardness and Applications to Quantum Chemistry and the Quantum PCP Conjecture.”https://doi.org/10.1137/22m1513721__SIAM Journal on Computing 52, no. 4 (2023): 1009–38.https://doi.org/10.1137/22m1513721 .
LibreCat: /record/50271
DOI: 10.1137/22m1513721

Gharibian, Sevag, and Julia Kempe. “Approximation Algorithms for QMA-Complete Problems.”https://doi.org/10.1137/110842272__SIAM Journal on Computing 41, no. 4 (2012): 1028–50.https://doi.org/10.1137/110842272 .
LibreCat: /record/8175
DOI: 10.1137/110842272
arXiv: 1101.3884

Briest, Patrick, Piotr Krysta, and Berthold Vöcking. “Approximation Techniques for Utilitarian Mechanism Design.”https://doi.org/10.1137/090772988__SIAM Journal on Computing, 2011, 1587–1622.https://doi.org/10.1137/090772988 .
LibreCat: /record/23739
DOI: 10.1137/090772988

Briest, Patrick, and Piotr Krysta. “Buying Cheap Is Expensive: Approximability of Combinatorial Pricing Problems.”https://doi.org/10.1137/090752353__SIAM Journal on Computing, 2011, 1554–86.https://doi.org/10.1137/090752353 .
LibreCat: /record/23740
DOI: 10.1137/090752353

Kirschmer, Markus, and John Voight. “Algorithmic Enumeration of Ideal Classes for Quaternion Orders.”https://doi.org/10.1137/080734467__SIAM Journal on Computing 39, no. 5 (2010): 1714–47.https://doi.org/10.1137/080734467 .
LibreCat: /record/42803
DOI: 10.1137/080734467

Czumaj, Artur, and Christian Sohler. “Abstract Combinatorial Programs and Efficient Property Testers.”https://doi.org/10.1137/s009753970444199x__SIAM Journal on Computing 34, no. 3 (2005): 580–615.https://doi.org/10.1137/s009753970444199x .
LibreCat: /record/18763
DOI: 10.1137/s009753970444199x

Czumaj, Artur, Funda Ergün, Lance Fortnow, Avner Magen, Ilan Newman, Ronitt Rubinfeld, and Christian Sohler. “Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time.”https://doi.org/10.1137/s0097539703435297__SIAM Journal on Computing 35, no. 1 (2005): 91–109.https://doi.org/10.1137/s0097539703435297 .
LibreCat: /record/18855
DOI: 10.1137/s0097539703435297

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

Czumaj, Artur, Friedhelm Meyer auf der Heide, and Volker Stemann. “Contention Resolution in Hashing Based Shared Memory Simulations.”https://doi.org/10.1137/s009753979529564x__SIAM Journal on Computing, 2000, 1703–39.https://doi.org/10.1137/s009753979529564x .
LibreCat: /record/17010
DOI: 10.1137/s009753979529564x

Gil, Joseph, Friedhelm Meyer auf der Heide, and Avi Wigderson. “The Tree Model for Hashing: Lower and Upper Bounds.”https://doi.org/10.1137/s0097539793255722__SIAM Journal on Computing, 1996, 936–55.https://doi.org/10.1137/s0097539793255722 .
LibreCat: /record/16701
DOI: 10.1137/s0097539793255722

Dietzfelbinger, Martin, Anna Karlin, Kurt Mehlhorn, Friedhelm Meyer auf der Heide, Hans Rohnert, and Robert E. Tarjan. “Dynamic Perfect Hashing: Upper and Lower Bounds.”https://doi.org/10.1137/s0097539791194094__SIAM Journal on Computing, 1994, 738–61.https://doi.org/10.1137/s0097539791194094 .
LibreCat: /record/16728
DOI: 10.1137/s0097539791194094

Borodin, A., F. Fich, Friedhelm Meyer auf der Heide, E. Upfal, and A. Wigderson. “A Time-Space Tradeoff for Element Distinctness.”https://doi.org/10.1137/0216007__SIAM Journal on Computing, 1987, 97–99.https://doi.org/10.1137/0216007 .
LibreCat: /record/16772
DOI: 10.1137/0216007

Meyer auf der Heide, Friedhelm, and Avi Wigderson. “The Complexity of Parallel Sorting.”https://doi.org/10.1137/0216008__SIAM Journal on Computing, 1987, 100–107.https://doi.org/10.1137/0216008 .
LibreCat: /record/16773
DOI: 10.1137/0216008

Meyer auf der Heide, Friedhelm. “Efficient Simulations among Several Models of Parallel Computers.”https://doi.org/10.1137/0215008__SIAM Journal on Computing, 1986, 106–19.https://doi.org/10.1137/0215008 .
LibreCat: /record/16771
DOI: 10.1137/0215008