We stand with Ukraine  

R. Sridhar

Affiliations:
  • University of Oklahoma, Norman, OK, USA
  • Louisiana State University, Baton Rouge, LA, USA (former)


According to our database1, R. Sridhar authored at least 9 papers between 1987 and 2002.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2002
Fast Parallel Reordering and Isomorphism Testing of k-Trees.
[BibTeX]
[DOI]
John G. Del Greco
,
Chandra N. Sekharan
,
R. Sridhar
Algorithmica, 2002

1998
Solving the all-pair shortest path query problem on interval and circular-arc graphs.
[BibTeX]
[DOI]
Danny Z. Chen
,
D. T. Lee
,
R. Sridhar
,
Chandra N. Sekharan
Networks, 1998

1995
Efficient Algorithms for Shortest Distance Queries on Special Classes of Polygons.
[BibTeX]
[DOI]
R. Sridhar
,
K. Han
,
N. Chandrasekharan
Theor. Comput. Sci., 1995

Highly Parallelizable Problems on Sorted Intervals.
[BibTeX]
[DOI]
R. Sridhar
,
N. Chandrasekharan
Parallel Comput., 1995

Load Balancing Methods for Ray Tracing and Binary Tree Computing Using PVM.
[BibTeX]
[DOI]
Chandra N. Sekharan
,
Vineet Goel
,
R. Sridhar
Parallel Comput., 1995

1993
Efficient Algorithms for All-Pairs Shortest Path Problem on Interval, Directed Path, and Circular-Arc Graphs.
[BibTeX]
Dipti S. Joshi
,
R. Sridhar
,
N. Chandrasekharan
Proceedings of the Computing and Information, 1993

A Distributed Algorithm for Ear Decomposition.
[BibTeX]
Sridhar Hannenhalli
,
Kalyan S. Perumalla
,
N. Chandrasekharan
,
R. Sridhar
Proceedings of the Computing and Information, 1993

1991
An set refinement algorithm with applications.
[BibTeX]
[DOI]
Nageswara S. V. Rao
,
R. Sridhar
,
S. S. Iyengar
Int. J. Comput. Math., 1991

1987
On the minimum vocabulary problem.
[BibTeX]
[DOI]
N. Chandrasekharan
,
R. Sridhar
,
S. S. Iyengar
J. Am. Soc. Inf. Sci., 1987


  Loading...