Pranay Chaudhuri
Professor of Computer Science

 

Department of Computer Science, Mathematics and Physics
University of the West Indies
Cave Hill Campus
PO Box 64, Bridgetown
Barbados, W.I.

 

Office
D20 Computer Science and Mathematics Building

 

Email
pchaudhuri@uwichill.edu.bb

 

Phone
+1 246 417 4736

 

Fax
+1 246 417 4597

 

 

Research Areas

Algorithm Design and Analysis, Parallel and Distributed Computing, Self-Stabilization, and Graph Theory

 

Selected Publications

 

 

Book

 

P. Chaudhuri, Parallel Algorithms: Design and Analysis, Prentice-Hall, Sydney, Australia, 1992, 314 pages, ISBN 0-13-351982-1.

 

 

Edited Book

 

S. I. Ao, J-A. Lee, O. Castillo, P. Chaudhuri, D. D. Feng (Eds.), Proceedings of the International MultiConference of Engineers and Computer Scientists 2006, IMECS '06, June 20-22, 2006, Hong Kong, China. Lecture Notes in Engineering and Computer Science, Newswood Limited 2006, ISBN 988-98671-3-3.

 

 

Book Contributions

 

P. Chaudhuri, A distributed mutual exclusion algorithm for a mesh-connected computer network, In: S. Ramani, H. Shrikumar, and S. V. Raghavan, eds., Computer Communications, Vedams Books International, New Delhi, India, 1990, pp. 652 - 658.

 

 

P. Chaudhuri, Fast parallel updating algorithms for graph searching problems, In: S. Tzafestas, P. Borne and L. Grandinetti, eds. Parallel and Distributed Computing in Engineering Systems, Elsevier Science Publishers B. V.,  Amsterdam, The Netherlands, 1992, pp. 97 - 103.

 

 

P. Chaudhuri, A self-stabilizing algorithm for analyzing activity networks, In: R. N. Mahapatra, ed., Trends in Information Technology, Tata-McGraw-Hill Publishing Co., New Delhi, India, 1998, pp. 66 - 70.

 

 

S. Jana, S. Chowdhury, D. Saha, A. Mukherjee and P. Chaudhuri, Assigning wavelengths in WDM optical networks: A novel dynamic approach, In: S. Purohit, ed., High Performance Computing, Tata-McGraw-Hill Publishing Co., New Delhi, India, 2002, pp. 261 - 268.

 

 

S. Jana, D. Saha, A. Mukherjee and P. Chaudhuri, A fast technique for assigning wavelengths in WDM all-optical networks (AONs), In: S. K. Das and S. Bhattacharya, eds., Lecture Notes in Computer Science (LNCS 2571), Springer-Verlag, Heidelburg, 2003, pp. 290 - 299.

 

 

Refereed Journals

 

P. Chaudhuri, K. Ray, and S. Ghosh, A real-time process scheduler for a ring type microcomputer network, IEEE Transactions on Industrial Electronics, 32, 1985, pp. 56 - 61.

 

 

P. Chaudhuri, Scheduler for real-time process control, Microprocessors and Microsystems, 9, 1985, pp. 114 - 117.

 

 

P. Chaudhuri and R. K. Ghosh, Parallel algorithms for analyzing activity networks, BIT, 26, 1986, pp. 418 - 429.

 

 

P. Chaudhuri, An O(log n) parallel algorithm for strong connectivity augmentation problem, Int. J. Computer Math., 22, 1987, pp. 187 - 197.

 

 

P. Chaudhuri, Algorithms for some graph problems on a distributed computational model, Information Sciences, 43, 1987, pp. 205 - 228.

 

 

P. Chaudhuri, Algorithms for finding centers and medians of trees and graphs on a parallel computation model, J. Indian Inst. Sci., 67, 1987, pp. 429 - 438.

 

 

P. Chaudhuri, Fast parallel graph searching with applications, BIT, 28, 1988, pp. 2 - 18.

 

 

R. K. Sen and P. Chaudhuri, A parallel approximate algorithm for minimum edge deletion bipartite subgraph problem, J. Combinatorics, Information & System Sci., 14, 1989, pp. 111 - 123.

 

 

P. Chaudhuri, An adaptive parallel algorithm for analyzing activity networks, Operations Research Letters, 9, 1990, pp. 31 - 34.

 

 

P. Chaudhuri, Finding and updating depth-first spanning trees of acyclic digraphs in parallel, Computer Journal, 33, 1990, pp. 247 - 251.

 

 

P. Chaudhuri, Optimal algorithm for mutual exclusion in mesh-connected computer networks, Computer Communications, 10, 1991, pp. 627 - 632.

 

 

P. Chaudhuri, Distributed processing of graphs: Fundamental cycles algorithm, Information Sciences, 60, 1992, pp. 41 - 50.

 

 

P. Chaudhuri, Parallel search algorithms for trees and graphs, Australian Computer Journal, 24, 1992, pp. 61 - 69.

 

 

P. Chaudhuri, Finding maximum matching in bipartite graphs in parallel, Operations Research Letters, 16, 1994, pp. 47 - 49.

 

 

P. Chaudhuri, An efficient distributed bridge finding algorithm, Information Sciences, 81, 1994, pp. 73 - 85.

 

 

P. Chaudhuri, An algorithm for distributed mutual exclusion, Information and Software Technology, 37, 1995, pp. 375 - 381.

 

P. Chaudhuri and A. Ismaeel, Algorithms for finding and updating minimum-depth spanning trees in parallel, Information Sciences, 87, 1995, pp. 171 - 183.

 

 

P. Chaudhuri, Finding centers and medians of graphs in parallel, Parallel Algorithms and Applications, 9, 1996, pp. 111 - 118.

 

 

P. Chaudhuri, Parallel updating algorithms for graph searching problems, Journal of Systems Architecture, 42, 1996, pp. 315 - 325.

 

 

P. Chaudhuri, An optimal distributed algorithm for computing bridge-connected components, Computer Journal, 40, 1997, pp. 200 - 207.

 

 

M. H. Karaata and P. Chaudhuri, A self-stabilizing algorithm for strong fairness, Computing, 60, 1998, pp.  217 - 228.

 

 

P. Chaudhuri, Algorithms for shortest-paths and some related problems on a tree-structured parallel computer, Kuwait Journal of Sci. and Engg., 25, 1998, pp. 203 - 216.

 

 

P. Chaudhuri and M. H. Karaata,  An  O(n1/3)  algorithm for distributed mutual exclusion, Journal of Systems Architecture, 45, 1998, pp. 409 – 420.

 

 

P. Chaudhuri, Parallel incremental algorithms for analyzing activity networks, Parallel Algorithms and Applications, 13, 1998, pp. 153 - 165.

 

 

P. Chaudhuri, An optimal distributed algorithm for finding articulation points in a network, Computer Communications, 21, 1998, pp. 1707 -1715.

 

 

P. Chaudhuri, An O(n2) self-stabilizing algorithm for computing bridge-connected components, Computing, 62, 1999, pp. 55 - 67.

 

 

M. H. Karaata and P. Chaudhuri, A self-stabilizing algorithm for bridge-finding, Distributed Computing, 12, 1999, pp. 47 - 53.

 

 

P. Chaudhuri, A note on self-stabilizing articulation point detection, Journal of Systems Architecture, 45, 1999, pp. 1249 - 1252.

 

 

P. Chaudhuri, A self-stabilizing algorithm detecting fundamental cycles in a graph, Journal of Computer and System Sciences, 59, 1999, pp. 84 - 93.

 

 

P. Chaudhuri, A self-stabilizing algorithm for minimum-depth search of graphs, Information Sciences, 118, 1999, pp. 241 - 249.

 

 

M. H. Karaata and P. Chaudhuri, A distributed algorithm for resource sharing under strong fairness,  Kuwait Journal of Sci. and Engg., 27, 2000, pp. 83 - 94.

 

 

P. Chaudhuri, A self-stabilizing algorithm for finding articulation nodes in a graph, International Journal of Parallel and Distributed Systems and Networks, 1, 2001, pp. 1 - 7.

 

 

P. Chaudhuri, An optimal distributed algorithm for finding a set of fundamental cycles in a graph, International Journal of Computer Systems Science and Engineering, 1, 2002, pp. 41 - 47.

 

 

M. H. Karaata and P. Chaudhuri, A dynamic self-stabilizing algorithm for constructing a transport net, Computing, 68, 2002, pp. 143 - 161.

 

 

C. A. Depradine and P. Chaudhuri, P3: A code and design conventions preprocessor for java, Software Practice & Experience, 33, 2003, pp. 61 - 76.

 

 

P. Chaudhuri and H. Thompson, A self-stabilizing graph algorithm: Finding the cutting center of a tree, Int. J. Computer Math., 81, 2004, pp. 183 - 190.

 

 

P. Chaudhuri and H. Thompson, A Message-optimal Distributed Graph Algorithm: Partial  Precedence Constrained Scheduling, J. Universal Computer Sci., 10, 2004, pp. 96 - 109.

 

 

P. Chaudhuri and H. Thompson, Self-stabilizing tree ranking, Int. J. Computer Math., 82, 2005, pp. 529 - 539.

 

 

P. Chaudhuri and T. Edward, An O(n1/2) distributed mutual exclusion algorithm using queue migration, J. Universal Computer Sci., 12, 2006, pp.140 - 159.

 

 

P. Chaudhuri and H. Thompson, A self-stabilizing distributed algorithm for edge-coloring general graphs, Australasian Journal of Combinatorics, In Press, 15 pp.

 

 

P. Chaudhuri and H. Thompson, A self-stabilizing algorithms for the st-ordering problem, International Journal of Parallel, Emergent and distributed Systems, In Press, 23 pp.