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.Expand

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.Expand

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.Expand

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.Expand

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… Expand

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… Expand

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,… Expand

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.Expand

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.Expand

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.Expand