default search action
Navin M. Singhi
Person information
- affiliation: Tata Institute of Fundamental Research, Mumbai, India
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2013
- [j25]Amitava Bhattacharya, Navin M. Singhi:
Some approaches for solving the general (t, k)-design existence problem and other related problems. Discret. Appl. Math. 161(9): 1180-1186 (2013) - 2012
- [j24]Navin M. Singhi, Dwijendra K. Ray-Chaudhuri:
Studying designs via multisets. Des. Codes Cryptogr. 65(3): 365-381 (2012) - [j23]Pak Ching Li, G. H. John van Rees, Stela Hanbyeol Seo
, N. M. Singhi:
Friendship 3-hypergraphs. Discret. Math. 312(11): 1892-1899 (2012) - 2010
- [j22]Navin M. Singhi:
Projective planes I. Eur. J. Comb. 31(2): 622-643 (2010) - [i1]S. Iyengar, N. Apte, A. A. Roy, S. Sanyal, Navin M. Singhi, Wu Geng Feng:
A Multiprocessor Communication Architecture For High Speed Networks. CoRR abs/1005.2914 (2010)
2000 – 2009
- 2006
- [j21]N. M. Singhi:
Tags on subsets. Discret. Math. 306(14): 1610-1623 (2006) - [j20]Stephan Foldes
On maximal instantaneous codes. Electron. Notes Discret. Math. 27: 27-28 (2006) - 2003
- [j19]N. M. Singhi:
Tags on Subsets. Electron. Notes Discret. Math. 15: 193-195 (2003) - 2002
- [j18]N. M. Singhi, Gurusamy Rengasamy Vijayakumar, N. Usha Devi:
Set-magic labelings of infinite graphs. Ars Comb. 63 (2002)
1990 – 1999
- 1996
- [j17]N. M. Singhi, Iyengar Shriniwas, T. A. Antony:
Combinatorial Techniques and Objects in Computer Science: Fault-tolerance and Other Interesting Applications. Eur. J. Comb. 17(2-3): 97-111 (1996) - 1994
- [j16]Dwijendra K. Ray-Chaudhuri, Navin M. Singhi, S. Sanyal, P. S. Subramanian:
Theory and Design of t-Unidirectional Error-Correcting and d-Unidirectional Error-Detecting Code. IEEE Trans. Computers 43(10): 1221-1226 (1994) - 1992
- [j15]Navin M. Singhi, Gurusamy Rengasamy Vijayakumar:
Signed graphs with least eigenvalue <-2. Eur. J. Comb. 13(3): 219-220 (1992) - 1991
- [j14]Daniel R. Hughes, Navin M. Singhi:
Partitions in Matrices and Graphs. Eur. J. Comb. 12(3): 223-235 (1991) - 1990
- [j13]Mohan S. Shrikhande, Navin M. Singhi:
An elementary derivation of the annihilator polynomial for extremal (2s + 1)-designs. Discret. Math. 80(1): 93-96 (1990)
1980 – 1989
- 1988
- [j12]Michel Deza, N. M. Singhi:
Rigid pentagons in hypercubes. Graphs Comb. 4(1): 31-42 (1988) - [j11]Dwijendra K. Ray-Chaudhuri, Navin M. Singhi:
On existence and number of orthogonal arrays. J. Comb. Theory A 47(1): 28-36 (1988) - [j10]Nachimuthu Manickam, N. M. Singhi:
First distribution invariants and EKR theorems. J. Comb. Theory A 48(1): 91-103 (1988) - [j9]Dwijendra K. Ray-Chaudhuri, Navin M. Singhi:
On Existence of t-Designs with Large v and lambda. SIAM J. Discret. Math. 1(1): 98-104 (1988) - 1987
- [j8]N. M. Singhi, S. S. Shrikhande:
A Reciprocity Relation for t-Designs. Eur. J. Comb. 8(1): 59-68 (1987) - 1985
- [j7]S. S. Shrikhande, N. M. Singhi:
On a problem of Erdös and Larson. Comb. 5(4): 351-358 (1985) - [j6]Sharad S. Sane, S. S. Shrikhande, N. M. Singhi:
Maximal arcs in designs. Graphs Comb. 1(1): 97-106 (1985) - 1983
- [j5]Michel Deza, Peter Frankl, N. M. Singhi:
On Functions of Strenth t. Comb. 3(3): 331-339 (1983) - [j4]Peter Frankl, Navin M. Singhi:
Linear Dependencies among Subsets of a Finite Set. Eur. J. Comb. 4(4): 313-318 (1983) - 1982
- [j3]Ranjan N. Naik, S. B. Rao, S. S. Shrikhande, N. M. Singhi:
Intersection Graphs of k-uniform Linear Hypergraphs. Eur. J. Comb. 3(2): 159-172 (1982) - 1980
- [j2]Krishna B. Athreya, C. R. Pranesachar, Navin M. Singhi:
On the Number of Latin Rectangles and Chromatic Polynomial of L(Kr, s). Eur. J. Comb. 1(1): 9-17 (1980)
1970 – 1979
- 1974
- [j1]N. M. Singhi:
(19, 9, 4) Hadamard Designs and Their Residual Designs. J. Comb. Theory A 16(2): 241-252 (1974)
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-08-05 21:11 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: