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 LibreCat | DOI
 

2012 | Journal Article | LibreCat-ID: 8175 | OA
Approximation Algorithms for QMA-Complete Problems
S. Gharibian, J. Kempe, SIAM Journal on Computing 41 (2012) 1028–1050.
LibreCat | DOI | Download (ext.) | arXiv
 

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

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

2010 | Journal Article | LibreCat-ID: 42803
Algorithmic Enumeration of Ideal Classes for Quaternion Orders
M. Kirschmer, J. Voight, SIAM Journal on Computing 39 (2010) 1714–1747.
LibreCat | DOI
 

2005 | Journal Article | LibreCat-ID: 18763
Abstract Combinatorial Programs and Efficient Property Testers
A. Czumaj, C. Sohler, SIAM Journal on Computing 34 (2005) 580–615.
LibreCat | DOI
 

2005 | Journal Article | LibreCat-ID: 18855
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 | DOI
 

2003 | Conference Paper | LibreCat-ID: 19952
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 | DOI
 

2000 | Journal Article | LibreCat-ID: 17010
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 | DOI
 

1996 | Journal Article | LibreCat-ID: 16701
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 | DOI
 

1994 | Journal Article | LibreCat-ID: 16728
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 | DOI
 

1987 | Journal Article | LibreCat-ID: 16772
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 | DOI
 

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

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

Filters and Search Terms

issn=1095-7111

Search

Filter Publications

Display / Sort

Export / Embed