| 2001 | ||
|---|---|---|
| c11 | Cliff Young, Yagati N. Lakshman, Tom Szymanski, John H. Reppy, David L. Presotto, Rob Pike, Girija J. Narlikar, Sape J. Mullender, Eric Grosse: Protium, an Infrastructure for Partitioned Applications. HotOS 2001: 47-52 | |
| 2000 | ||
| j6 | Dima Grigoriev, Yagati N. Lakshman: Algorithms for Computing Sparse Shifts for Multivariate Polynomials. Appl. Algebra Eng. Commun. Comput. 11(1): 43-67 (2000) | |
| 1999 | ||
| c10 | Markus A. Hitz, Erich Kaltofen, Yagati N. Lakshman: Efficient Algorithms for Computing the Nearest Polynomial with a Real Root and Related Problems. ISSAC 1999: 205-212 | |
| 1998 | ||
| j5 | Narendra Karmarkar, Yagati N. Lakshman: On Approximate GCDs of Univariate Polynomials. J. Symb. Comput. 26(6): 653-666 (1998) | |
| c9 | Yagati N. Lakshman, Bruce W. Char, Jeremy R. Johnson: Software Components Using Symbolic Computation for Problem Solving Environments. ISSAC 1998: 46-53 | |
| c8 | Jeremy R. Johnson, Yagati N. Lakshman, Thomas T. Hewett, Tim Souder, Tom Fitzgerald, Sara Donegan, Paul Morgovsky: Virtual office hours using TechTalk, a Web-based mathematical collaboration tool. ITiCSE 1998: 130-133 | |
| 1997 | ||
| j4 | Yagati N. Lakshman, B. David Saunders: Sparse Shifts for Univariate Polynomials. Appl. Algebra Eng. Commun. Comput. 8(6): 561-562 (1997) | |
| 1996 | ||
| j3 | Yagati N. Lakshman, B. David Saunders: Sparse shifts for univariate polynomials. Appl. Algebra Eng. Commun. Comput. 7(5): 351-364 (1996) | |
| c7 | Narendra Karmarkar, Yagati N. Lakshman: Approximate Polynomial Greatest Common Divisors and Nearest Singular Polynomials. ISSAC 1996: 35-39 | |
| e1 | Erwin Engeler, B. F. Caviness, Yagati N. Lakshman (Eds.): Proceedings of the 1996 International Symposium on Symbolic and Algebraic Computation, ISSAC '96, Zurich, Switzerland, July 24-26, 1996. ACM 1996, isbn 0-89791-796-0 | |
| 1995 | ||
| j2 | Yagati N. Lakshman, B. David Saunders: Sparse Polynomial Interpolation in Nonstandard Bases. SIAM J. Comput. 24(2): 387-397 (1995) | |
| c6 | Dima Grigoriev, Yagati N. Lakshman: Algorithms for Computing Sparse Shifts for Multivariate Polynomials. ISSAC 1995: 96-103 | |
| 1994 | ||
| c5 | Yagati N. Lakshman, B. David Saunders: On Computing Sparse Shifts for Univariate Polynomials. ISSAC 1994: 108-113 | |
| 1990 | ||
| c4 | Erich Kaltofen, Yagati N. Lakshman, J.-M. Wiley: Modular Rational Sparse Multivariate Polynomial Interpolation. ISSAC 1990: 135-139 | |
| c3 | Yagati N. Lakshman: On the Complexity of Computing a Gröbner Basis for the Radical of a Zero Dimensional Ideal. STOC 1990: 555-563 | |
| 1989 | ||
| c2 | John F. Canny, Erich Kaltofen, Yagati N. Lakshman: Solving Systems of Nonlinear Polynomial Equations Faster. ISSAC 1989: 121-128 | |
| 1988 | ||
| j1 | Timothy S. Freeman, Gregory M. Imirzian, Erich Kaltofen, Yagati N. Lakshman: Dagwood: a system for manipulating polynomials given by straight-line programs. ACM Trans. Math. Softw. 14(3): 218-240 (1988) | |
| c1 | Erich Kaltofen, Yagati N. Lakshman: Improved Sparse Multivariate Polynomial Interpolation Algorithms. ISSAC 1988: 467-474 | |
Colors in the list of coauthors
Last update Fri May 24 07:01:23 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page