406 search results - page 13 / 82 » Privacy-Preserving Set Union |
FSTTCS
2010
Springer
13 years 5 months ago
2010
Springer
ABSTRACT. The maximum independent set problem (MAXIS) on general graphs is known to be NPhard to approximate within a factor of n1-, for any > 0. However, there are many "...
WEA
2010
Springer
14 years 2 months ago
2010
Springer
Abstract. The disjoint-set data structure is used to maintain a collection of non-overlapping sets of elements from a finite universe. Algorithms that operate on this data structu...
STACS
2007
Springer
14 years 1 months ago
2007
Springer
COMPGEOM
2010
ACM
14 years 17 days ago
2010
ACM
CPC
2008
13 years 7 months ago
2008
