Please note that LibreCat no longer supports Internet Explorer versions 8 or 9 (or earlier).
We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.
14 Publications
2023 | Journal Article | LibreCat-ID: 50271
Gharibian S, Le Gall F. Dequantizing the Quantum Singular Value Transformation: Hardness and Applications to Quantum Chemistry and the Quantum PCP Conjecture. SIAM Journal on Computing. 2023;52(4):1009-1038. doi:10.1137/22m1513721
LibreCat
| DOI
2012 | Journal Article | LibreCat-ID: 8175 | 
Gharibian S, Kempe J. Approximation Algorithms for QMA-Complete Problems. SIAM Journal on Computing. 2012;41(4):1028-1050. doi:10.1137/110842272
LibreCat
| DOI
| Download (ext.)
| arXiv
2011 | Journal Article | LibreCat-ID: 23739
Briest P, Krysta P, Vöcking B. Approximation Techniques for Utilitarian Mechanism Design. SIAM Journal on Computing. 2011:1587-1622. doi:10.1137/090772988
LibreCat
| DOI
2011 | Journal Article | LibreCat-ID: 23740
Briest P, Krysta P. Buying Cheap Is Expensive: Approximability of Combinatorial Pricing Problems. SIAM Journal on Computing. 2011:1554-1586. doi:10.1137/090752353
LibreCat
| DOI
2010 | Journal Article | LibreCat-ID: 42803
Kirschmer M, Voight J. Algorithmic Enumeration of Ideal Classes for Quaternion Orders. SIAM Journal on Computing. 2010;39(5):1714-1747. doi:10.1137/080734467
LibreCat
| DOI
2005 | Journal Article | LibreCat-ID: 18763
Czumaj A, Sohler C. Abstract Combinatorial Programs and Efficient Property Testers. SIAM Journal on Computing. 2005;34(3):580-615. doi:10.1137/s009753970444199x
LibreCat
| DOI
2005 | Journal Article | LibreCat-ID: 18855
Czumaj A, Ergün F, Fortnow L, et al. Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time. SIAM Journal on Computing. 2005;35(1):91-109. doi:10.1137/s0097539703435297
LibreCat
| DOI
2003 | Conference Paper | LibreCat-ID: 19952
Fomin FV, Thilikos DM. 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. doi:10.1137/s0097539702419649
LibreCat
| DOI
2000 | Journal Article | LibreCat-ID: 17010
Czumaj A, Meyer auf der Heide F, Stemann V. Contention Resolution in Hashing Based Shared Memory Simulations. SIAM Journal on Computing. 2000:1703-1739. doi:10.1137/s009753979529564x
LibreCat
| DOI
1996 | Journal Article | LibreCat-ID: 16701
Gil J, Meyer auf der Heide F, Wigderson A. The Tree Model for Hashing: Lower and Upper Bounds. SIAM Journal on Computing. 1996:936-955. doi:10.1137/s0097539793255722
LibreCat
| DOI
1994 | Journal Article | LibreCat-ID: 16728
Dietzfelbinger M, Karlin A, Mehlhorn K, Meyer auf der Heide F, Rohnert H, Tarjan RE. Dynamic Perfect Hashing: Upper and Lower Bounds. SIAM Journal on Computing. 1994:738-761. doi:10.1137/s0097539791194094
LibreCat
| DOI
1987 | Journal Article | LibreCat-ID: 16772
Borodin A, Fich F, Meyer auf der Heide F, Upfal E, Wigderson A. A Time-Space Tradeoff for Element Distinctness. SIAM Journal on Computing. 1987:97-99. doi:10.1137/0216007
LibreCat
| DOI
1987 | Journal Article | LibreCat-ID: 16773
Meyer auf der Heide F, Wigderson A. The Complexity of Parallel Sorting. SIAM Journal on Computing. 1987:100-107. doi:10.1137/0216008
LibreCat
| DOI
1986 | Journal Article | LibreCat-ID: 16771
Meyer auf der Heide F. Efficient Simulations among Several Models of Parallel Computers. SIAM Journal on Computing. 1986:106-119. doi:10.1137/0215008
LibreCat
| DOI