in this paper we will determine the multiple point manifolds of certain self-transverse immersions in euclidean spaces. following the triple points, these immersions have a double point self-intersection set which is the image of an immersion of a smooth 5-dimensional manifold, cobordant to dold manifold $v^5$ or a boundary. we will show there is an immersion of $s^7times p^2$ in $mathbb{r}^{13...

In the private matching problem, a client and a server each hold a set of n input elements. The client wants to privately compute the intersection of these two sets: he learns which elements he has in common with the server (and nothing more), while the server gains no information at all. In certain applications it would be useful to have a private matching protocol that reports a match even if...

Set intersection is a fundamental operation in information retrieval and database systems. This paper introduces linear space data structures to represent sets such that their intersection can be computed in a worst-case efficient way. In general, given k (preprocessed) sets, with totally n elements, we will show how to compute their intersection in expected time O(n/ √ w + kr), where r is the ...