Ranjan K. Sen

According to our database1, Ranjan K. Sen authored at least 15 papers between 1992 and 2015.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2015
Implementation of data-aware community in Kapgari village community.
Proceedings of the 2015 IEEE Global Humanitarian Technology Conference, 2015

2014
Bottom-up integration of data-aware communities: Some initial work in Kapgari village community.
Proceedings of the IEEE Global Humanitarian Technology Conference, 2014

2013
Data-aware environment for grass-roots development in village communities: A pilot study in Kapgari and surrounding villages.
Proceedings of the International Joint Conference on Awareness Science and Technology & Ubi-Media Computing, 2013

2012
Socio-economic Development of Extremely Poor Communities in Kapgari Area - Some Experiments and Field Results.
Proceedings of the 2012 IEEE Global Humanitarian Technology Conference, 2012

2004
o(log4 n) time parallel maximal matching algorithm using linear number of processors.
Parallel Algorithms Appl., 2004

2000
Improved Parallel Algorithm for Maximal Matching Based on Depth-first-search.
Parallel Algorithms Appl., 2000

1999
An Efficient Scheme to Solve Two Problems for Two-Terminal Series Parallel Graphs.
Inf. Process. Lett., 1999

1998
Embedding Torus on the Star Graph.
IEEE Trans. Parallel Distributed Syst., 1998

1996
Two Ranking Schemes for Efficient Computation on the Star Interconnection Network.
IEEE Trans. Parallel Distributed Syst., 1996

Congestion-free dilation-2 embedding of full binary trees on star graphs.
Proceedings of the 3rd International Conference on High Performance Computing, 1996

1995
Order Preserving Communication on a Star Network.
Parallel Comput., 1995

A Parallel Algorithm for Maximal Matching Based on Depth First Search.
Parallel Algorithms Appl., 1995

1-Approximation Algorithm for Bottleneck Disjoint Path Matching.
Inf. Process. Lett., 1995

a New Scheme for Dynamic Processor Assignment for Irregular Problems.
Proceedings of the Parallel Algorithms for Irregularly Structured Problems, 1995

1992
An Efficient Parallel Algorithm for Maximal Matching.
Proceedings of the Parallel Processing: CONPAR 92, 1992


  Loading...