We consider routing problems in ad hoc wireless networks modeled as unit graphs in which nodes are points in the plane and two nodes can communicate if the distance between them is less than someâ€¦ (More)

We consider online routing algorithms for routing between the vertices of embedded planar straight line graphs. Our results include (1) two deterministic memoryless routing algorithms, one that worksâ€¦ (More)

Given a permutation T of 1 to n, and a permutation P of 1 to k, for k â‰¤ n, we wish to find a k-element subsequence of T whose elements are ordered according to the permutation P . For example, if Pâ€¦ (More)

There has been much work concentrated on creating accurate shot boundary detection algorithms in recent years. However a truly accurate method of cut detection still eludes researchers in general. Inâ€¦ (More)

Bloom filters are a randomized data structure for membership queries dating back to 1970. Bloom filters sometimes give erroneous answers to queries, called false positives. Bloom analyzed theâ€¦ (More)

Given a set S of n points in the plane, we give an O(n log n)-time algorithm that constructs a plane t-spanner for S, with t â‰ˆ 10, such that the degree of each point of S is bounded from above by 27,â€¦ (More)

We present a succinct representation of a set of n points on an n Ã— n grid using n lg n + o(n lg n) bits to support orthogonal range counting in O(lg n/ lg lg n) time, and range reporting in O(k lgâ€¦ (More)