4 citations · 5 across the 7 of their papers we have counts for
8 papers
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…
A Simple Convex Layers Algorithm
Raimi A. Rufai, Dana S. Richards
Given a set of points in the plane, the first layer of is formed by the points that appear on 's convex hull. In general, a point belongs to layer , if it…
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.…
Routing Number Of A Pyramid
Indranil Banerjee, Dana Richards
In this short note we give the routing number of pyramid graph under the \textit{routing via matching} model introduced by Alon et al\cite{5}. This model can be viewed as a communi…
Routing and Sorting Via Matchings On Graphs
Indranil Banerjee, Dana Richards
The paper is divided in to two parts. In the first part we present some new results for the \textit{routing via matching} model introduced by Alon et al\cite{5}. This model can be…
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…
Computing Maximal Layers Of Points in
Indranil Banerjee, Dana Richards
In this paper we present a randomized algorithm for computing the collection of maximal layers for a point set in (). The input to our algorithm is a point set $P…