default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBijendra N. Jain
Person information
- affiliation: ERNET, India
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2010
[j9]Ash Mohammad Abbas, Bijendra Nath Jain:
Path diminution in node-disjoint multipath routing for mobile ad hoc networks is unavoidable with single route discovery. Int. J. Ad Hoc Ubiquitous Comput. 5(1): 7-21 (2010)- [c28]Vaishali P. Sadaphal, Bijendra N. Jain:
Impact of colinearity of sensors selected for location estimation. HiPC 2010: 1-10
2000 – 2009
- 2009
- [c27]Vaishali P. Sadaphal, Bijendra N. Jain:
The role of colinearity of sensors in target localization using distance measurements. MSWiM 2009: 413-417 - 2008
- [j8]Vaishali P. Sadaphal, Bijendra N. Jain:
Random and Periodic Sleep Schedules for Target Detection in Sensor Networks. J. Comput. Sci. Technol. 23(3): 343-354 (2008) - [c26]Mohit Saxena, Puneet Gupta, Bijendra N. Jain:
Experimental analysis of RSSI-based location estimation in wireless sensor networks. COMSWARE 2008: 503-510 - [c25]Vaishali P. Sadaphal, Bijendra N. Jain:
Tracking target using sensor networks: target detection and route activation under energy constraints. COMSWARE 2008: 511-518 - 2007
- [c24]C. N. Kanthi, Bijendra N. Jain:
Spanner Based Distributed Channel Assignment in Wireless Mesh Networks. COMSWARE 2007 - [c23]Naresh Sharma, Vaishali P. Sadaphal, Bijendra N. Jain:
Tracking a target with a selected pair of sensors. ISWCS 2007: 722-726 - [c22]Ash Mohammad Abbas, Mansoor Alam, Bijendra Nath Jain:
Alleviating path correlation using directional antenna in node-disjoint multipath routing for mobile ad hoc networks. IWCMC 2007: 405-410 - [c21]Vaishali P. Sadaphal, Bijendra N. Jain:
Random and Periodic sleep schedules for target detection in sensor networks. MASS 2007: 1-11 - 2006
- [j7]Ash Mohammad Abbas, Bijendra Nath Jain:
Mitigating path diminution in disjoint multipath routing for mobile ad hoc networks. Int. J. Ad Hoc Ubiquitous Comput. 1(3): 137-146 (2006) - [c20]Ash Mohammad Abbas, Bijendra Nath Jain:
Mitigating overheads and path correlation in node-disjoint multipath routing for mobile ad hoc networks. COMSWARE 2006: 1-7 - [c19]Ash Mohammad Abbas, Bijendra Nath Jain:
Path diminution is unavoidable in node-disjoint multipath routing with single route discovery. COMSWARE 2006: 1-10 - [c18]Ajay Agarwal, Bijendra N. Jain:
QoS-constrained fault-tolerant routing in MANETs based on segment-backup paths. COMSWARE 2006: 1-9 - [c17]Vaishali P. Sadaphal, Bijendra N. Jain:
Spread-based heuristic for sensor selection in sensor networks. COMSWARE 2006: 1-9 - [e1]Victor Bahl, Bijendra Nath Jain, Henning Schulzrinne, Alfred Z. Spector:
Proceedings of the First International Conference on COMmunication System softWAre and MiddlewaRE (COMSWARE 2006), January 8-12, 2006, New Delhi, India. IEEE 2006, ISBN 0-7803-9574-3 [contents] - 2005
- [c16]Vaishali P. Sadaphal, Bijendra N. Jain:
Sensor Selection Heuristic in Sensor Networks. HiPC 2005: 190-200 - 2004
- [c15]Ajay Agarwal, Bijendra N. Jain:
QoS-based on-demand segmented backup routing in mobile ad hoc networks. ICON 2004: 331-335 - [c14]Ash Mohammad Abbas, Bijendra Nath Jain:
Path diminution in disjoint multipath routing for mobile ad hoc networks. PIMRC 2004: 130-134 - [c13]Seng Wai Loke, Arkady B. Zaslavsky, Bijendra N. Jain:
Wireless Marketing of Ephemeral Personal Goods: the Case of Auctioning Screen Estate for Wireless Advertisements. Wireless Information Systems 2004: 127-133 - 2003
- [c12]Nitin Pabuwal, Navendu Jain, Bijendra N. Jain:
An architectural framework to deploy scatternet-based applications over Bluetooth. ICC 2003: 1019-1023 - [c11]Ash Mohammad Abbas, Bijendra Nath Jain:
An Analytical Framework for Path Reliabilities in Mobile Ad Hoc Networks. ISCC 2003: 63-68 - 2002
- [c10]Shirshanka Das, Pavan Verma, Bijendra N. Jain, Mario Gerla:
ZRESTORE: A Link Restoration Scheme with High Aggregation and No Reservation. ONDM 2002: 295-310
1990 – 1999
- 1999
- [j6]M. V. Padmini, B. B. Madan, Bijendra N. Jain:
A Linear Array for Large Sparse Matrix Operations - I Cholesky Factorization. Parallel Algorithms Appl. 13(3): 187-215 (1999) - [j5]M. V. Padmini, B. B. Madan, Bijendra N. Jain:
A Linear Array for Large Sparse Matrix Operations - II Triangular System Solvers and Matrix Multiplication. Parallel Algorithms Appl. 13(3): 217-237 (1999) - 1998
- [j4]M. V. Padmini, B. B. Madan, Bijendra N. Jain:
Reordering for parallelism. Int. J. Comput. Math. 67(3-4): 373-390 (1998) - [j3]M. Dominic, Bijendra N. Jain:
Conditions for On-Line Scheduling of Hard Real-Time Tasks on Multiprocessors. J. Parallel Distributed Comput. 55(1): 121-137 (1998) - 1996
- [c9]M. Dominic, Bijendra N. Jain:
On-line scheduling of hard real-time tasks on multiprocessors. HiPC 1996: 392-399 - 1993
- [j2]Ashok K. Agrawala, Bijendra N. Jain:
Deterministic Model and Transient Analysis of Virtual Circuits. IEEE Trans. Software Eng. 19(2): 187-197 (1993) - [c8]Dheeraj Sanghi, Ashok K. Agrawala, Olafur Gudmundsson, Bijendra N. Jain:
Experimental Assessment of End-to-End Behavior on Internet. INFOCOM 1993: 867-874 - 1992
- [c7]Bijendra N. Jain, Ashok K. Agrawala:
Deterministic Modeling and Transient Analysis of a Network Processor with Cross Traffic. NETWORKS 1992: 141-156 - 1991
- [c6]Ravi Mittal, Bijendra N. Jain, Rakesh K. Patney:
Subtree Availability in Binary Tree Architectures. ICCI 1991: 312-322 - [c5]Ravi Mittal, Bijendra N. Jain, Rakesh K. Patney:
Link Augmented Binary (LAB)-Tree: Its Structure, Routing and Fault Tolerance Properties. IPPS 1991: 452-457
1980 – 1989
- 1989
- [c4]Bijendra N. Jain, Ravi Mittal, Rakesh K. Patney:
Fault-tolerant analysis and algorithms for a proposed augmented binary tree architecture. ICDCS 1989: 524-531 - 1988
- [j1]Bijendra N. Jain, Satish K. Tripathi:
An Analysis of Cube-Connected Cycles and Circular Shuffle Networks for Parallel Computation. J. Parallel Distributed Comput. 5(6): 741-754 (1988) - 1986
- [c3]Bijendra N. Jain, Satish K. Tripathi:
Equivalence Between Cube-Connected Cycles Networks and Circular Shuffle Networks. ICPP 1986: 8-11 - 1982
- [c2]Bijendra N. Jain:
Duplication of packets and their detection in X.25 communication protocols. ISCA 1982: 267-273 - [c1]Mohamed G. Gouda, Bijendra N. Jain:
Necessary and Sufficient Conditions to Detect Message Duplication in Protocol Hierarchies. PSTV 1982: 317
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-24 22:53 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:
