default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNripendra N. Biswas
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
1990 – 1999
- 1996
[c5]Nripendra N. Biswas, C. Srikanth, James Jacob:
Cubical CAMP for minimization of Boolean functions. VLSI Design 1996: 264-269- 1993
- [b1]Nripendra N. Biswas:
Logic design theory. Prentice Hall 1993, ISBN 978-0-13-010695-7, pp. I-XIII, 1-306 - 1992
- [j23]Sampalli Srinivas, Nripendra N. Biswas:
Design and Analysis of a Generalized Architecture for Reconfigurable m-ary Tree Structures. IEEE Trans. Computers 41(11): 1465-1478 (1992) - 1990
- [j22]James Jacob, Nripendra N. Biswas:
Further Comments on "Detection of Faults in Programmable Logic Arrays". IEEE Trans. Computers 39(1): 155-157 (1990) - [j21]Nripendra N. Biswas, Sampalli Srinivas:
A Reconfigurable Tree Architecture with Multistage Interconnection Network. IEEE Trans. Computers 39(12): 1481-1485 (1990) - [j20]Nripendra N. Biswas:
On covering distant minterms by the camp algorithm. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 9(7): 786-789 (1990)
1980 – 1989
- 1989
- [j19]B. Gurunath, Nripendra N. Biswas:
An algorithm for multiple output minimization. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 8(9): 1007-1013 (1989) - 1988
- [j18]K. S. Ramanatha, Nripendra N. Biswas:
Design of Crosspoint-Irredundant PLA's Using Minimal Number of Control Inputs. IEEE Trans. Computers 37(9): 1130-1134 (1988) - 1987
- [j17]Nripendra N. Biswas, S. Srinivas:
Simple methods for the calculation of root of a reconfigurable binary tree structure. Proc. IEEE 75(12): 1690-1692 (1987) - [j16]Nripendra N. Biswas, Sampalli Srinivas, Trishala Dharanendra:
A centrally controlled shuffle network for reconfigurable and fault-tolerant architecture. SIGARCH Comput. Archit. News 15(1): 81-87 (1987) - 1986
- [j15]Nripendra N. Biswas:
Computer-Aided Minimization Procedure for Boolean Functions. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 5(2): 303-304 (1986) - 1985
- [j14]Nripendra N. Biswas:
On Bit Steering in the Minimization of the Control Memory of Microprogrammed Processors. IEEE Trans. Computers 34(11): 1057-1061 (1985) - [c4]Prathima Agrawal, Vishwani D. Agrawal, Nripendra N. Biswas:
Multiple output minimization. DAC 1985: 674-680 - [c3]James Jacob, Nripendra N. Biswas:
: A Testable PLA Design with Minimal Hardware and Test Set. ITC 1985: 583-588 - 1984
- [c2]Nripendra N. Biswas:
Computer aided minimization procedure for boolean functions. DAC 1984: 699-702 - 1983
- [j13]K. S. Ramanatha, Nripendra N. Biswas:
An On-Line Algorithm for the Location of Cross Point Faults in Programmable Logic Arrays. IEEE Trans. Computers 32(5): 438-444 (1983) - [j12]K. S. Ramanatha, Nripendra N. Biswas:
A Design for Testability of Undetectable Crosspoint Faults in Programmable Logic Arrays. IEEE Trans. Computers 32(6): 551-557 (1983) - [j11]Chamarty D. V. P. Rao, Nripendra N. Biswas:
On the Minimization of Wordwidth in the Control Memory of a Microprogrammed Digital Computer. IEEE Trans. Computers 32(9): 863-868 (1983) - 1982
- [c1]K. S. Ramanatha, Nripendra N. Biswas:
A Design for Complete Testability of Programmable Logic Arrays. ITC 1982: 67-74 - 1981
- [j10]Ayakannu Mathialagan, Nripendra N. Biswas:
Bit Steering in the Minimization of Control Memory in Microprogrammed Digital Computers. IEEE Trans. Computers 30(2): 144-147 (1981) - 1980
- [j9]Ayakannu Mathialagan, Nripendra N. Biswas:
Optimal Interconnections in the Design of Microprocessors and Digital Systems. IEEE Trans. Computers 29(2): 145-149 (1980)
1970 – 1979
- 1979
- [j8]Anil K. Sarje, Nripendra N. Biswas:
A New Approach to 2-Asummability Testing. IEEE Trans. Computers 28(10): 798-801 (1979) - 1977
- [j7]Anil K. Sarje, Nripendra N. Biswas:
An Algorithm for Testing 2-Asummability of Boolean Functions. IEEE Trans. Computers 26(10): 1049-1053 (1977) - 1976
- [j6]C. V. S. Rao, Nripendra N. Biswas:
Further Comments on "Closure Partition Method for Minimizing Incomplete Sequential Machines". IEEE Trans. Computers 25(7): 767-768 (1976) - 1975
- [j5]C. V. S. Rao, Nripendra N. Biswas:
Minimization of Incompletely Specified Sequential Machines. IEEE Trans. Computers 24(11): 1089-1100 (1975) - 1974
- [j4]Nripendra N. Biswas:
State Minimization of Incompletely Specified Sequential Machines. IEEE Trans. Computers 23(1): 80-84 (1974) - 1973
- [j3]Nripendra N. Biswas:
Comments on "Identification of Totally Symmetric Boolean Functions". IEEE Trans. Computers 22(9): 863-864 (1973) - 1971
- [j2]Nripendra N. Biswas:
Minimization of Boolean Functions. IEEE Trans. Computers 20(8): 925-929 (1971) - 1970
- [j1]Nripendra N. Biswas:
On Identification of Totally Symmetric Boolean Functions. IEEE Trans. Computers 19(7): 645-648 (1970)
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:42 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:
