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.
LibreCat: /record/50271
DOI: 10.1137/22m1513721

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

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

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

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

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

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.
LibreCat: /record/18855
DOI: 10.1137/s0097539703435297

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.
LibreCat: /record/19952
DOI: 10.1137/s0097539702419649

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

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.
LibreCat: /record/16701
DOI: 10.1137/s0097539793255722

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

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

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

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