1 paper
Diego Arroyuelo, Juan Pablo Castillo
We introduce space- and time-efficient algorithms and data structures for the offline set intersection problem. We show that a sorted integer set S⊆[0..u) of n elem…