@articleGharibian_Le Gall_2023, title=Dequantizing the Quantum Singular Value Transformation: Hardness and Applications to Quantum Chemistry and the Quantum PCP Conjecture, volume=52, DOI=10.1137/22m1513721, number=4, journal=SIAM Journal on Computing, publisher=Society for Industrial &; Applied Mathematics (SIAM), author=Gharibian, Sevag and Le Gall, François, year=2023, pages=1009–1038 
LibreCat: /record/50271
DOI: 10.1137/22m1513721

@articleGharibian_Kempe_2012, title=Approximation Algorithms for QMA-Complete Problems, volume=41, DOI=10.1137/110842272, number=4, journal=SIAM Journal on Computing, publisher=Society for Industrial &; Applied Mathematics (SIAM), author=Gharibian, Sevag and Kempe, Julia, year=2012, pages=1028–1050 
LibreCat: /record/8175
DOI: 10.1137/110842272
arXiv: 1101.3884

@articleBriest_Krysta_Vöcking_2011, title=Approximation Techniques for Utilitarian Mechanism Design, DOI=10.1137/090772988, journal=SIAM Journal on Computing, author=Briest, Patrick and Krysta, Piotr and Vöcking, Berthold, year=2011, pages=1587–1622 
LibreCat: /record/23739
DOI: 10.1137/090772988

@articleBriest_Krysta_2011, title=Buying Cheap Is Expensive: Approximability of Combinatorial Pricing Problems, DOI=10.1137/090752353, journal=SIAM Journal on Computing, author=Briest, Patrick and Krysta, Piotr, year=2011, pages=1554–1586 
LibreCat: /record/23740
DOI: 10.1137/090752353

@articleKirschmer_Voight_2010, title=Algorithmic Enumeration of Ideal Classes for Quaternion Orders, volume=39, DOI=10.1137/080734467, number=5, journal=SIAM Journal on Computing, publisher=Society for Industrial &; Applied Mathematics (SIAM), author=Kirschmer, Markus and Voight, John, year=2010, pages=1714–1747 
LibreCat: /record/42803
DOI: 10.1137/080734467

@articleCzumaj_Sohler_2005, title=Abstract Combinatorial Programs and Efficient Property Testers, volume=34, DOI=10.1137/s009753970444199x, number=3, journal=SIAM Journal on Computing, author=Czumaj, Artur and Sohler, Christian, year=2005, pages=580–615 
LibreCat: /record/18763
DOI: 10.1137/s009753970444199x

@articleCzumaj_Ergün_Fortnow_Magen_Newman_Rubinfeld_Sohler_2005, title=Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time, volume=35, DOI=10.1137/s0097539703435297, number=1, journal=SIAM Journal on Computing, author=Czumaj, Artur and Ergün, Funda and Fortnow, Lance and Magen, Avner and Newman, Ilan and Rubinfeld, Ronitt and Sohler, Christian, year=2005, pages=91–109 
LibreCat: /record/18855
DOI: 10.1137/s0097539703435297

@inproceedingsFomin_Thilikos_2003, title=Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-Up, DOI=10.1137/s0097539702419649, booktitle=Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA 2003), author=Fomin, Fedor V. and Thilikos, Dimitrios M., year=2003 
LibreCat: /record/19952
DOI: 10.1137/s0097539702419649

@articleCzumaj_Meyer auf der Heide_Stemann_2000, title=Contention Resolution in Hashing Based Shared Memory Simulations, DOI=10.1137/s009753979529564x, journal=SIAM Journal on Computing, author=Czumaj, Artur and Meyer auf der Heide, Friedhelm and Stemann, Volker, year=2000, pages=1703–1739 
LibreCat: /record/17010
DOI: 10.1137/s009753979529564x

@articleGil_Meyer auf der Heide_Wigderson_1996, title=The Tree Model for Hashing: Lower and Upper Bounds, DOI=10.1137/s0097539793255722, journal=SIAM Journal on Computing, author=Gil, Joseph and Meyer auf der Heide, Friedhelm and Wigderson, Avi, year=1996, pages=936–955 
LibreCat: /record/16701
DOI: 10.1137/s0097539793255722

@articleDietzfelbinger_Karlin_Mehlhorn_Meyer auf der Heide_Rohnert_Tarjan_1994, title=Dynamic Perfect Hashing: Upper and Lower Bounds, DOI=10.1137/s0097539791194094, journal=SIAM Journal on Computing, author=Dietzfelbinger, Martin and Karlin, Anna and Mehlhorn, Kurt and Meyer auf der Heide, Friedhelm and Rohnert, Hans and Tarjan, Robert E., year=1994, pages=738–761 
LibreCat: /record/16728
DOI: 10.1137/s0097539791194094

@articleBorodin_Fich_Meyer auf der Heide_Upfal_Wigderson_1987, title=A Time-Space Tradeoff for Element Distinctness, DOI=10.1137/0216007, journal=SIAM Journal on Computing, author=Borodin, A. and Fich, F. and Meyer auf der Heide, Friedhelm and Upfal, E. and Wigderson, A., year=1987, pages=97–99 
LibreCat: /record/16772
DOI: 10.1137/0216007

@articleMeyer auf der Heide_Wigderson_1987, title=The Complexity of Parallel Sorting, DOI=10.1137/0216008, journal=SIAM Journal on Computing, author=Meyer auf der Heide, Friedhelm and Wigderson, Avi, year=1987, pages=100–107 
LibreCat: /record/16773
DOI: 10.1137/0216008

@articleMeyer auf der Heide_1986, title=Efficient Simulations among Several Models of Parallel Computers, DOI=10.1137/0215008, journal=SIAM Journal on Computing, author=Meyer auf der Heide, Friedhelm, year=1986, pages=106–119 
LibreCat: /record/16771
DOI: 10.1137/0215008