We study the static membership problem: Given a set S of at most n keys drawn from a universe of size m, store it so that queries of the form \Is x in S?" can be answered quickly. We study schemesâ€¦ (More)

We initiate a systematic study to help distinguish a special group of online users, called hidden paid posters, or termed "Internet water army" in China, from the legitimate ones. On the Internet,â€¦ (More)

We study the k-round twc+party communication complexity of pointer chasing problem for fixed k. Damm, Jukna and Seall 111 showed an uo~er bound of Olnlor(*-â€˜1 n) for this ., . . \ problem. We prove aâ€¦ (More)

Visibly Pushdown Languages (VPLs), recognized by Visibly Pushdown Automata (VPAs), are a nicely behaved family of contextfree languages. It has been shown that VPAs are equivalent to Extendedâ€¦ (More)

We consider the problem of computing the outer-radii of point sets. In this problem, we are given integers n, d, and k, where k â‰¤ d, and a set P of n points in d. The goal is to compute the outerâ€¦ (More)

Given a dictionary S of n binary strings each of length m, we consider the problem of designing a data structure for S that supports d-queries; given a binary query string q of length m, a d-queryâ€¦ (More)