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, Sevag, and François Le Gall. “Dequantizing the Quantum Singular Value Transformation: Hardness and Applications to Quantum Chemistry and the Quantum PCP Conjecture.” SIAM Journal on Computing, vol. 52, no. 4, Society for Industrial & Applied Mathematics (SIAM), 2023, pp. 1009–38, doi:10.1137/22m1513721.
LibreCat
| DOI
2012 | Journal Article | LibreCat-ID: 8175 | 
Gharibian, Sevag, and Julia Kempe. “Approximation Algorithms for QMA-Complete Problems.” SIAM Journal on Computing, vol. 41, no. 4, Society for Industrial & Applied Mathematics (SIAM), 2012, pp. 1028–50, doi:10.1137/110842272.
LibreCat
| DOI
| Download (ext.)
| arXiv
2011 | Journal Article | LibreCat-ID: 23739
Briest, Patrick, et al. “Approximation Techniques for Utilitarian Mechanism Design.” SIAM Journal on Computing, 2011, pp. 1587–622, doi:10.1137/090772988.
LibreCat
| DOI
2011 | Journal Article | LibreCat-ID: 23740
Briest, Patrick, and Piotr Krysta. “Buying Cheap Is Expensive: Approximability of Combinatorial Pricing Problems.” SIAM Journal on Computing, 2011, pp. 1554–86, doi:10.1137/090752353.
LibreCat
| DOI
2010 | Journal Article | LibreCat-ID: 42803
Kirschmer, Markus, and John Voight. “Algorithmic Enumeration of Ideal Classes for Quaternion Orders.” SIAM Journal on Computing, vol. 39, no. 5, Society for Industrial & Applied Mathematics (SIAM), 2010, pp. 1714–47, doi:10.1137/080734467.
LibreCat
| DOI
2005 | Journal Article | LibreCat-ID: 18763
Czumaj, Artur, and Christian Sohler. “Abstract Combinatorial Programs and Efficient Property Testers.” SIAM Journal on Computing, vol. 34, no. 3, 2005, pp. 580–615, doi:10.1137/s009753970444199x.
LibreCat
| DOI
2005 | Journal Article | LibreCat-ID: 18855
Czumaj, Artur, et al. “Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time.” SIAM Journal on Computing, vol. 35, no. 1, 2005, pp. 91–109, doi:10.1137/s0097539703435297.
LibreCat
| DOI
2003 | Conference Paper | LibreCat-ID: 19952
Fomin, Fedor V., and Dimitrios M. Thilikos. “Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-Up.” 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, Artur, et al. “Contention Resolution in Hashing Based Shared Memory Simulations.” SIAM Journal on Computing, 2000, pp. 1703–39, doi:10.1137/s009753979529564x.
LibreCat
| DOI
1996 | Journal Article | LibreCat-ID: 16701
Gil, Joseph, et al. “The Tree Model for Hashing: Lower and Upper Bounds.” SIAM Journal on Computing, 1996, pp. 936–55, doi:10.1137/s0097539793255722.
LibreCat
| DOI
1994 | Journal Article | LibreCat-ID: 16728
Dietzfelbinger, Martin, et al. “Dynamic Perfect Hashing: Upper and Lower Bounds.” SIAM Journal on Computing, 1994, pp. 738–61, doi:10.1137/s0097539791194094.
LibreCat
| DOI
1987 | Journal Article | LibreCat-ID: 16772
Borodin, A., et al. “A Time-Space Tradeoff for Element Distinctness.” SIAM Journal on Computing, 1987, pp. 97–99, doi:10.1137/0216007.
LibreCat
| DOI
1987 | Journal Article | LibreCat-ID: 16773
Meyer auf der Heide, Friedhelm, and Avi Wigderson. “The Complexity of Parallel Sorting.” SIAM Journal on Computing, 1987, pp. 100–07, doi:10.1137/0216008.
LibreCat
| DOI
1986 | Journal Article | LibreCat-ID: 16771
Meyer auf der Heide, Friedhelm. “Efficient Simulations among Several Models of Parallel Computers.” SIAM Journal on Computing, 1986, pp. 106–19, doi:10.1137/0215008.
LibreCat
| DOI