73 citations · 387 across the 61 of their papers we have counts for
5 papers · 1 filter
Improved Methods For Generating Quasi-Gray Codes
Dana Jansens, Prosenjit Bose, Paz Carmi +3
Consider a sequence of bit strings of length d, such that each string differs from the next in a constant number of bits. We call this sequence a quasi-Gray code. We examine the pr…
A Tight Bound on the Maximum Interference of Random Sensors in the Highway Model
Evangelos Kranakis, Danny Krizanc, Pat Morin +2
Consider sensors whose positions are represented by uniform, independent and identically distributed random variables assuming values in the open unit interval . A n…
Odds-On Trees
Prosenjit Bose, Luc Devroye, Karim Douieb +3
Let R^d -> A be a query problem over R^d for which there exists a data structure S that can compute P(q) in O(log n) time for any query point q in R^d. Let D be a probability measu…
Point Location in Disconnected Planar Subdivisions
Prosenjit Bose, Luc Devroye, Karim Douieb +3
Let be a (possibly disconnected) planar subdivision and let be a probability measure over . The current paper shows how to preprocess into an O(n) size data s…
Planar Visibility: Testing and Counting
Joachim Gudmundsson, Pat Morin
In this paper we consider query versions of visibility testing and visibility counting. Let be a set of disjoint line segments in and let be an element of . V…