4 citations · 5 across the 7 of their papers we have counts for
4 papers · 1 filter
Oblivious Set-maxima for Intersection of Convex Polygons
Avah Banerjee, Dana Richards
In this paper we revisit the well known set-maxima problem in the oblivious setting. Let be a set of elements with an underlying total order. Let $\math…
New Results On Routing Via Matchings On Graphs
Indranil Banerjee, Dana Richards
In this paper we present some new complexity results on the routing time of a graph under the \textit{routing via matching} model. This is a parallel routing model which was introd…
Sorting Networks On Restricted Topologies
Indranil Banerjee, Dana Richards, Igor Shinkar
The sorting number of a graph with vertices is the minimum depth of a sorting network with inputs and outputs that uses only the edges of the graph to perform comparisons.…
Sorting Under 1- Cost Model
Indranil Banerjee, Dana Richards
In this paper we study the problem of sorting under non-uniform comparison costs, where costs are either 1 or . If comparing a pair has an associated cost of then…