We consider the planar point location problem from the perspective of expected search time. We are given a planar polygonal subdivision S and for each polygon of the subdivision t...
We study the problem of "privacy amplification": key agreement between two parties who both know a weak secret w, such as a password. (Such a setting is ubiquitous on th...
Abstract. A set of phylogenetic trees with overlapping leaf sets is consistent if it can be merged without conflicts into a supertree. In this paper, we study the polynomial-time a...
Abstract. We consider weakly-verifiable puzzles which are challengeresponse puzzles such that the responder may not be able to verify for itself whether it answered the challenge ...
—Distributed object search is the primary function of Peer-to-Peer (P2P) file sharing system to locate and transfer the file. The predominant search schemes in unstructured P2P...