Navin M. Singhi

Affiliations:
  • Tata Institute of Fundamental Research, Mumbai, India


According to our database1, Navin M. Singhi authored at least 25 papers between 1974 and 2013.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2013
Some approaches for solving the general (<i>t</i>, <i>k</i>)-design existence problem and other related problems.
Discret. Appl. Math., 2013

2012
Friendship 3-hypergraphs.
Discret. Math., 2012

Studying designs via multisets.
Des. Codes Cryptogr., 2012

2010
Projective planes I.
Eur. J. Comb., 2010

A Multiprocessor Communication Architecture For High Speed Networks
CoRR, 2010

2006
On maximal instantaneous codes.
Electron. Notes Discret. Math., 2006

2003
Tags on Subsets.
Electron. Notes Discret. Math., 2003

2002
Set-magic labelings of infinite graphs.
Ars Comb., 2002

1996
Combinatorial Techniques and Objects in Computer Science: Fault-tolerance and Other Interesting Applications.
Eur. J. Comb., 1996

1994
Theory and Design of t-Unidirectional Error-Correcting and d-Unidirectional Error-Detecting Code.
IEEE Trans. Computers, 1994

1992
Signed graphs with least eigenvalue <-2.
Eur. J. Comb., 1992

1991
Partitions in Matrices and Graphs.
Eur. J. Comb., 1991

1990
An elementary derivation of the annihilator polynomial for extremal (2s + 1)-designs.
Discret. Math., 1990

1988
On Existence of t-Designs with Large v and lambda.
SIAM J. Discret. Math., 1988

On existence and number of orthogonal arrays.
J. Comb. Theory A, 1988

First distribution invariants and EKR theorems.
J. Comb. Theory A, 1988

Rigid pentagons in hypercubes.
Graphs Comb., 1988

1987
A Reciprocity Relation for t-Designs.
Eur. J. Comb., 1987

1985
Maximal arcs in designs.
Graphs Comb., 1985

On a problem of Erdös and Larson.
Comb., 1985

1983
Linear Dependencies among Subsets of a Finite Set.
Eur. J. Comb., 1983

On Functions of Strenth t.
Comb., 1983

1982
Intersection Graphs of k-uniform Linear Hypergraphs.
Eur. J. Comb., 1982

1980
On the Number of Latin Rectangles and Chromatic Polynomial of L(K<sub>r, s</sub>).
Eur. J. Comb., 1980

1974
(19, 9, 4) Hadamard Designs and Their Residual Designs.
J. Comb. Theory A, 1974


  Loading...