On the complexity of approximating k-set packing Elad HazanShmuel SafraOded Schwartz Original Paper Pages: 20 - 39
Free binary decision diagrams for the computation of EAR n Jan KáraDaniel Král’ Original Paper Pages: 40 - 61
Circuits on cylinders Kristoffer Arnsfelt HansenPeter Bro MiltersenV Vinay Original Paper Pages: 62 - 81
A tight lower bound for restricted pir protocols Richard BeigelLance FortnowWilliam Gasarch Original Paper Pages: 82 - 91