Sciweavers

JACM
1998
51views more  JACM 1998»
13 years 4 months ago
Explicit OR-Dispersers with Polylogarithmic Degree
Michael E. Saks, Aravind Srinivasan, Shiyu Zhou
JACM
1998
52views more  JACM 1998»
13 years 4 months ago
Randomized Binary Search Trees
Conrado Martínez, Salvador Roura
JACM
1998
88views more  JACM 1998»
13 years 4 months ago
A Threshold of ln n for Approximating Set Cover
Given a collection Ᏺ of subsets of S ϭ {1, . . . , n}, set cover is the problem of selecting as few as possible subsets from Ᏺ such that their union covers S, and max k-cover ...
Uriel Feige
JACM
1998
82views more  JACM 1998»
13 years 4 months ago
Relational Expressive Power of Constraint Query Languages
Michael Benedikt, Guozhu Dong, Leonid Libkin, Lims...