Dayanand S. Rajan

According to our database, Dayanand S. Rajan authored at least 8 papers between 1990 and 2001.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2001

Lattice computers for approximating Euclidean space.

John Case, Dayanand S. Rajan, Anil M. Shende

J. ACM, 2001

1997

Root Lattices are Efficiently Generated.

Dayanand S. Rajan, Anil M. Shende

Int. J. Algebra Comput., 1997

1996

A characterization of root lattices.

Dayanand S. Rajan, Anil M. Shende

Discret. Math., 1996

1994

Spatial/kinematic domain and lattice computers.

John Case, Dayanand S. Rajan, Anil M. Shende

J. Exp. Theor. Artif. Intell., 1994

1993

The Adjoints to the Derivative Functor on Species.

Dayanand S. Rajan

J. Comb. Theory A, 1993

The equations D^kY = Xⁿ in combinatorial species.

Dayanand S. Rajan

Discret. Math., 1993

1992

Representing the Spatial/Kinematic Domain and Lattice Computers.

John Case, Dayanand S. Rajan, Anil M. Shende

Proceedings of the Analogical and Inductive Inference, 1992

1990

Optimally Representing Euclidean Space Discretely for Analogically Simulating Physical Phenomena.

John Case, Dayanand S. Rajan, Anil M. Shende

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1990