N. Chandrasekharan

According to our database1, N. Chandrasekharan authored at least 12 papers between 1984 and 1996.

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

1996
MasPaWS - A Massively Parallel War Simulator.
Simul. Pract. Theory, 1996

1995
Efficient Algorithms for Shortest Distance Queries on Special Classes of Polygons.
Theor. Comput. Sci., 1995

Highly Parallelizable Problems on Sorted Intervals.
Parallel Comput., 1995

1993
Efficient Parallel Algorithms for Finding Chordless Cycles in Graphs.
Parallel Process. Lett., 1993

An Efficient Parallel Algorithm for Min-Cost Flow on Directed Series-Parallel Networks.
Proceedings of the Seventh International Parallel Processing Symposium, 1993

Efficient Algorithms for All-Pairs Shortest Path Problem on Interval, Directed Path, and Circular-Arc Graphs.
Proceedings of the Computing and Information, 1993

A Distributed Algorithm for Ear Decomposition.
Proceedings of the Computing and Information, 1993

1992
Efficient Algorithms for Computing Matching and Chromatic Polynominals on Series-Parallel Graphs.
Proceedings of the Computing and Information, 1992

1990
Isomorphism Testing of k-Trees is in NC, for Fixed k.
Inf. Process. Lett., 1990

1988
NC Algorithms for Recognizing Chordal Graphs and <i>k</i> Trees.
IEEE Trans. Computers, 1988

1987
On the minimum vocabulary problem.
J. Am. Soc. Inf. Sci., 1987

1984
Recognition and Top-Down Generation of beta-Acyclic Database Schemes.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1984


  Loading...