We consider segment intersection searching amidst (possibly intersecting) algebraic arcs in the plane. We show how to preprocess n arcs in time O(n2+ ) into a data structure of si...
We give a generalization for the Deza-Frankl-Singhi Theorem in case of multiple intersections. More exactly, we prove, that if H is a set-system, which satisfies that for some k, ...
A d-simplex is a collection of d + 1 sets such that every d of them have non-empty intersection and the intersection of all of them is empty. A strong d-simplex is a collection of...
In many settings there exists a set of potential participants, but the set of participants who are actually active in the system, and in particular their number, is unknown. This ...
This work introduces two decision problems, StabilizerD and Orbit CosetD, and gives quantum reductions from them to the problem Orbit Superposition (Friedl et al., 2003), as well a...