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
S. Gharibian and F. 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, pp. 1009–1038, 2023, doi: 10.1137/22m1513721.
LibreCat | DOI
 

2012 | Journal Article | LibreCat-ID: 8175 | OA
S. Gharibian and J. Kempe, “Approximation Algorithms for QMA-Complete Problems,” SIAM Journal on Computing, vol. 41, no. 4, pp. 1028–1050, 2012, doi: 10.1137/110842272.
LibreCat | DOI | Download (ext.) | arXiv
 

2011 | Journal Article | LibreCat-ID: 23739
P. Briest, P. Krysta, and B. Vöcking, “Approximation Techniques for Utilitarian Mechanism Design,” SIAM Journal on Computing, pp. 1587–1622, 2011.
LibreCat | DOI
 

2011 | Journal Article | LibreCat-ID: 23740
P. Briest and P. Krysta, “Buying Cheap Is Expensive: Approximability of Combinatorial Pricing Problems,” SIAM Journal on Computing, pp. 1554–1586, 2011.
LibreCat | DOI
 

2010 | Journal Article | LibreCat-ID: 42803
M. Kirschmer and J. Voight, “Algorithmic Enumeration of Ideal Classes for Quaternion Orders,” SIAM Journal on Computing, vol. 39, no. 5, pp. 1714–1747, 2010, doi: 10.1137/080734467.
LibreCat | DOI
 

2005 | Journal Article | LibreCat-ID: 18763
A. Czumaj and C. Sohler, “Abstract Combinatorial Programs and Efficient Property Testers,” SIAM Journal on Computing, vol. 34, no. 3, pp. 580–615, 2005.
LibreCat | DOI
 

2005 | Journal Article | LibreCat-ID: 18855
A. Czumaj et al., “Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time,” SIAM Journal on Computing, vol. 35, no. 1, pp. 91–109, 2005.
LibreCat | DOI
 

2003 | Conference Paper | LibreCat-ID: 19952
F. V. Fomin and D. M. Thilikos, “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.
LibreCat | DOI
 

2000 | Journal Article | LibreCat-ID: 17010
A. Czumaj, F. Meyer auf der Heide, and V. Stemann, “Contention Resolution in Hashing Based Shared Memory Simulations,” SIAM Journal on Computing, pp. 1703–1739, 2000.
LibreCat | DOI
 

1996 | Journal Article | LibreCat-ID: 16701
J. Gil, F. Meyer auf der Heide, and A. Wigderson, “The Tree Model for Hashing: Lower and Upper Bounds,” SIAM Journal on Computing, pp. 936–955, 1996.
LibreCat | DOI
 

1994 | Journal Article | LibreCat-ID: 16728
M. Dietzfelbinger, A. Karlin, K. Mehlhorn, F. Meyer auf der Heide, H. Rohnert, and R. E. Tarjan, “Dynamic Perfect Hashing: Upper and Lower Bounds,” SIAM Journal on Computing, pp. 738–761, 1994.
LibreCat | DOI
 

1987 | Journal Article | LibreCat-ID: 16772
A. Borodin, F. Fich, F. Meyer auf der Heide, E. Upfal, and A. Wigderson, “A Time-Space Tradeoff for Element Distinctness,” SIAM Journal on Computing, pp. 97–99, 1987.
LibreCat | DOI
 

1987 | Journal Article | LibreCat-ID: 16773
F. Meyer auf der Heide and A. Wigderson, “The Complexity of Parallel Sorting,” SIAM Journal on Computing, pp. 100–107, 1987.
LibreCat | DOI
 

1986 | Journal Article | LibreCat-ID: 16771
F. Meyer auf der Heide, “Efficient Simulations among Several Models of Parallel Computers,” SIAM Journal on Computing, pp. 106–119, 1986.
LibreCat | DOI
 

Filters and Search Terms

issn=1095-7111

Search

Filter Publications

Display / Sort

Citation Style: IEEE

Export / Embed