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. (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
| DOI
2012 | Journal Article | LibreCat-ID: 8175 | 
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
| DOI
| Download (ext.)
| arXiv
2011 | Journal Article | LibreCat-ID: 23739
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
| DOI
2011 | Journal Article | LibreCat-ID: 23740
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
| DOI
2010 | Journal Article | LibreCat-ID: 42803
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
| DOI
2005 | Journal Article | LibreCat-ID: 18763
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
| DOI
2005 | Journal Article | LibreCat-ID: 18855
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
| DOI
2003 | Conference Paper | LibreCat-ID: 19952
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
| DOI
2000 | Journal Article | LibreCat-ID: 17010
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
| DOI
1996 | Journal Article | LibreCat-ID: 16701
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
| DOI
1994 | Journal Article | LibreCat-ID: 16728
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
| DOI
1987 | Journal Article | LibreCat-ID: 16772
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
| DOI
1987 | Journal Article | LibreCat-ID: 16773
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
| DOI
1986 | Journal Article | LibreCat-ID: 16771
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
| DOI