default search action
Sibabrata Ray
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2010
- [j13]Sibabrata Ray, Mark H. Linderman, Danyang Zhang:
Supporting time-critical clients in scalable pub-sub systems. Int. J. High Perform. Comput. Netw. 6(3/4): 220-225 (2010)
2000 – 2009
- 2007
- [c19]Qunwei Zheng, Sibabrata Ray, Xiaoyan Hong, Lei Tang, Li Gao:
Integrity and its applications. ACM Southeast Regional Conference 2007: 350-354 - 2006
- [j12]Sibabrata Ray, Rajgopal Kannan, Danyang Zhang, Hong Jiang:
The Weighted Integrity Problem is Polynomial for Interval Graphs. Ars Comb. 79 (2006) - [j11]Qunwei Zheng, Sibabrata Ray, Xiaoyan Hong:
Resource allocation for restoration of compromised systems. J. Comb. Optim. 12(1-2): 35-56 (2006) - [c18]Qunwei Zheng, Xiaoyan Hong, Sibabrata Ray:
Nonlinear Resource Allocation in Restoration of Compromised Systems. ICC 2006: 429-434 - [c17]Sibabrata Ray, Mark H. Linderman, Danyang Zhang:
Supporting Time-Critical Clients in Scalable Pub-Sub Systems. IWNAS 2006: 125-132 - 2005
- [j10]Danyang Zhang, Sibabrata Ray, Rajgopal Kannan, S. Sitharama Iyengar:
Subgroup-based Source Recovery or Local Recovery for Reliable Multicasting. Int. J. Comput. Their Appl. 12(2): 101-112 (2005) - 2004
- [j9]Sibabrata Ray, Danyang Zhang, Kevin A. Kwiat:
Energy-efficient distributed authorisation server (DAS) placement for sensor networks. Int. J. High Perform. Comput. Netw. 1(4): 193-202 (2004) - [j8]Weigang Ni, Susan V. Vrbsky, Sibabrata Ray:
Pitfalls In Distributed Nonblocking Checkpointing. J. Interconnect. Networks 5(1): 47-78 (2004) - [c16]Qunwei Zheng, Xiaoyan Hong, Sibabrata Ray:
Recent advances in mobility modeling for mobile ad hoc network research. ACM Southeast Regional Conference 2004: 70-75 - [c15]Danyang Zhang, Sibabrata Ray:
A server relay recovery strategy (SRRS) for reliable multicast over Internet-like topologies. ICC 2004: 1867-1871 - [c14]Sibabrata Ray, Kevin A. Kwiat, Danyang Zhang:
Energy-efficient placement/activation algorithms for authorization servers in sensor network. ISCC 2004: 312-317 - 2003
- [j7]Rajgopal Kannan, Sudipta Sarangi, Sibabrata Ray, S. Sitharama Iyengar:
Minimal sensor integrity: Measuring the vulnerability of sensor grids. Inf. Process. Lett. 86(1): 49-55 (2003) - [j6]Rajgopal Kannan, Sibabrata Ray, Radim Bartos
:
An optical switching architecture for hierarchical group communication. J. Syst. Archit. 49(7-9): 297-314 (2003) - [c13]Danyang Zhang, Sibabrata Ray, Rajgopal Kannan, S. Sitharama Iyengar:
A Recovery Algorithm for Reliable Multicasting in Reliable Networks. ICPP 2003: 493- - [c12]Weigang Ni, Susan V. Vrbsky, Sibabrata Ray:
Low-cost Coordinated Nonblocking Checkpointing in Mobile Computing Systems. ISCC 2003: 1427-1434 - 2002
- [j5]Sibabrata Ray, Hong Jiang:
Efficient Task Partitioning Algorithms for Distributed Shared Memory Systems. Int. J. Comput. Their Appl. 9(4): 185-199 (2002) - [c11]Danyang Zhang, Sibabrata Ray, Rajgopal Kannan:
Static subgroup-based source recovery for reliable multicast in reliable networks. GLOBECOM 2002: 1445-1449 - [c10]Rajgopal Kannan, Sudipta Sarangi, Sibabrata Ray, S. Sitharama Iyengar:
Minimal Sensor Integrity in Sensor Grids. ICPP 2002: 567-571 - 2001
- [c9]Rajgopal Kannan, Sibabrata Ray:
Sorting Networks with Applications to Hierarchical Optical Interconnects. ICPP Workshops 2001: 327- - 2000
- [j4]Rajgopal Kannan, Sibabrata Ray:
MSXmin: a modular multicast ATM packet switch with low delay and hardware complexity. IEEE/ACM Trans. Netw. 8(3): 407-418 (2000) - [c8]Rajgopal Kannan, Sibabrata Ray:
A fair and efficient multicast ATM switch based on deflection routing. ICCCN 2000: 453-458 - [c7]Rajgopal Kannan, Sibabrata Ray:
A Fair and Efficient Multicast ATM Switch based on Deflection Routing. ISCC 2000: 494-499
1990 – 1999
- 1999
- [j3]Sibabrata Ray, Hong Jiang:
A reconfigurable bus structure for multiprocessors with bandwidth reuse. J. Syst. Archit. 45(11): 847-862 (1999) - 1996
- [j2]Sibabrata Ray, Hong Jiang:
Reconfigurable optical bus and performance optimization. J. Comput. Sci. Technol. 11(3): 296-312 (1996) - [j1]Sibabrata Ray, Hong Jiang, Qing Yang:
A Compiler-Directed Approach to Network Latency Reduction for Distributed Shared Memory Multiprocessors. J. Parallel Distributed Comput. 38(2): 267-276 (1996) - 1995
- [c6]Sibabrata Ray, Sarit Mukherjee:
On Optimal Placement of Erasure Nodes on a Dual Bus Network. INFOCOM 1995: 883-890 - 1994
- [c5]Sibabrata Ray, Hong Jiang:
Improved Algorithms for Partitioning Tree and Linear Task Graphs on Shared Memory Architecture. ICDCS 1994: 363-370 - [c4]Nasir D. Memon
Differential Lossless Encoding of Images Using Non-linear Predictive Techniques. ICIP (3) 1994: 841-845 - [c3]Sibabrata Ray, Hong Jiang:
Sequential and Parallel Algorithms for Partitioning Tree Task Graphs on a Shared Memory Architecure. ICPP (3) 1994: 266-269 - [c2]Sibabrata Ray, Hong Jiang, Jitender S. Deogun:
A parallel algorithm for mapping a special class of task graphs onto linear array multiprocessors. SAC 1994: 473-477 - 1990
- [c1]Subhas C. Nandy, Bhargab B. Bhattacharya, Sibabrata Ray:
Efficient algorithms for Identifying All Maximal Isothetic Empty Rectangles in VLSI Layout Design. FSTTCS 1990: 255-269
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 05:51 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: