A deadlock-free communication kernel for loop connected message passing computer architecture. - P. Pramanik; Pradip K. Das; A. K. Bandyopadhyay 001; D. Q. M. Fay (Microprocessing and Microprogramming, 1990)

A Deadlock-Free Communication Kernel for Loop Architecture. - P. Pramanik; Pradip K. Das; A. K. Bandyopadhyay 001; D. Q. M. Fay (Inf. Process. Lett., 1991)

Avoidance of deadlock in loop structures - a two process solution. - P. Pramanik; Pradip K. Das; A. K. Bandyopadhyay 001; D. Q. M. Fay (Microprocess. Microprogramming, 1992)

A communication structure for supporting fault-tolerant and adaptive wormhole routing in a binary n-cube. - P. Pramanik; Pradip K. Das; A. K. Bandyopadhyay 001; D. Q. M. Fay (PDP, 1993)

A minimal cost design for a large hierarchically clustered computer communication network considering a desired index of service. - Amitava Mukherjee 001; B. B. Bhaumik; A. K. Bandyopadhyay 001 (Comput. Commun., 1997)

On the derivation of a correct deadlock free communication kernel for loop connected message passing architecture from its user's specification. - A. K. Bandyopadhyay 001; J. Bandyopadhyay (J. Syst. Archit., 2000)

Complex Queries on Web Graph representing a Social Network. - Susanta Mitra; Aditya Bagchi; A. K. Bandyopadhyay 001 (ICDIM, 2006)

Pre-processing and Path Normalization of a Web Graph used as a Social Network. - C. Bhanu Teja; Susanta Mitra; Aditya Bagchi; A. K. Bandyopadhyay 001 (J. Digit. Inf. Manag., 2007)

Design of a Data Model for Social Network Applications. - Susanta Mitra; Aditya Bagchi; A. K. Bandyopadhyay 001 (J. Database Manag., 2007)

Complex Query Processing on Web Graph: a Social Network Perspective. - Susanta Mitra; Aditya Bagchi; A. K. Bandyopadhyay 001 (J. Digit. Inf. Manag., 2008)

Design of a Data Model for Social Network Applications. - Susanta Mitra; Aditya Bagchi; A. K. Bandyopadhyay 001 (Database Technologies: Concepts, Methodologies, Tools, and Applications, 2009)