Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDA. K. Bandyopadhyay 0001
Person information
- affiliation (PhD 1983): Jadavpur University, Calcutta, India
Other persons with the same name
- A. K. Bandyopadhyay 0002 — University of Calcutta, Institute of Radiophysics and Electronics, Kolkata, India
- Ayan Kumar Bandyopadhyay (aka: A. K. Bandyopadhyay 0003) — CSIR-Central Electronics Engineering Research Institute, Pilani, India (and 1 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2009
[p1]Susanta Mitra, Aditya Bagchi, A. K. Bandyopadhyay:
Design of a Data Model for Social Network Applications. Database Technologies: Concepts, Methodologies, Tools, and Applications 2009: 414-439- 2008
- [j8]Susanta Mitra, Aditya Bagchi, A. K. Bandyopadhyay:
Complex Query Processing on Web Graph: a Social Network Perspective. J. Digit. Inf. Manag. 6(1): 12-20 (2008) - 2007
- [j7]C. Bhanu Teja, Susanta Mitra, Aditya Bagchi, A. K. Bandyopadhyay:
Pre-processing and Path Normalization of a Web Graph used as a Social Network. J. Digit. Inf. Manag. 5(5): 262-276 (2007) - [j6]Susanta Mitra, Aditya Bagchi, A. K. Bandyopadhyay:
Design of a Data Model for Social Network Applications. J. Database Manag. 18(4): 51-79 (2007) - 2006
- [c2]Susanta Mitra, Aditya Bagchi, A. K. Bandyopadhyay:
Complex Queries on Web Graph representing a Social Network. ICDIM 2006: 430-435 - 2000
- [j5]A. K. Bandyopadhyay, J. Bandyopadhyay:
On the derivation of a correct deadlock free communication kernel for loop connected message passing architecture from its user's specification. J. Syst. Archit. 46(13): 1257-1261 (2000)
1990 – 1999
- 1997
- [j4]Amitava Mukherjee
, B. B. Bhaumik, A. K. Bandyopadhyay:
A minimal cost design for a large hierarchically clustered computer communication network considering a desired index of service. Comput. Commun. 20(6): 507-511 (1997) - 1993
- [c1]P. Pramanik, Pradip K. Das, A. K. Bandyopadhyay, D. Q. M. Fay:
A communication structure for supporting fault-tolerant and adaptive wormhole routing in a binary n-cube. PDP 1993: 418-425 - 1992
- [j3]P. Pramanik, Pradip K. Das, A. K. Bandyopadhyay, D. Q. M. Fay:
Avoidance of deadlock in loop structures - a two process solution. Microprocess. Microprogramming 34(1-5): 103-106 (1992) - 1991
- [j2]P. Pramanik, Pradip K. Das, A. K. Bandyopadhyay, D. Q. M. Fay:
A Deadlock-Free Communication Kernel for Loop Architecture. Inf. Process. Lett. 38(3): 157-161 (1991) - 1990
- [j1]P. Pramanik, Pradip K. Das, A. K. Bandyopadhyay, D. Q. M. Fay:
A deadlock-free communication kernel for loop connected message passing computer architecture. Microprocessing and Microprogramming 30(1-5): 703-712 (1990)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 01:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
