• Publications
  • Influence
Routing with guaranteed delivery in ad hoc wireless networks
TLDR
The first distributed algorithms for routing that do not require duplication of packets or memory at the nodes and yet guarantee that a packet is delivered to its destination are described.
Online Routing in Triangulations
TLDR
This work considers online routing strategies for routing between the vertices of embedded planar straight line graphs and proposes two deterministic memoryless routing strategies and a randomized memoryless strategy that works for all triangulations.
Routing with Guaranteed Delivery in Ad Hoc Wireless Networks
TLDR
The first distributed algorithms for routing that do not require duplication of packets or memory at the nodes and yet guarantee that a packet is delivered to its destination are described.
Layout of Graphs with Bounded Tree-Width
TLDR
It is proved that the queue-number is bounded by the tree-width, thus resolving an open problem due to Ganley and Heath and disproving a conjecture of Pemmaraju.
Range Mode and Range Median Queries on Lists and Trees
We consider algorithms for preprocessing labelled lists and trees so that, for any two nodes u and v we can answer queries of the form: What is the mode or median label in the sequence of labels on
An Improved Algorithm for Subdivision Traversal without Extra Storage
  • P. Bose, Pat Morin
  • Mathematics, Computer Science
    Int. J. Comput. Geom. Appl.
  • 1 August 2002
We describe an algorithm for enumerating all vertices, edges and faces of a planar subdivision stored in any of the usual pointer-based representations, while using only a constant amount of memory
Online routing in geometric graphs
This thesis considers the problem of finding a path from a source to a destination in a graph in which only local information is available. This type of routing problem occurs regularly in robotics,
Output-Sensitive Algorithms for Computing Nearest-Neighbour Decision Boundaries
TLDR
Output-sensitive algorithms for computing this decision boundary for point sets on the line and in ℝ2 are developed, which is the best possible when parameterizing with respect to n and k.
Array Layouts for Comparison-Based Searching
TLDR
After extensive testing and tuning on a wide variety of modern hardware, the conclusion that, for small values of n, sorted order, combined with a good implementation of binary search, is best is arrived at.
On the false-positive rate of Bloom filters
TLDR
It is shown that Bloom's analysis is incorrect and give a correct analysis of randomized data structure for membership queries dating back to 1970.
...
1
2
3
4
5
...