The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Yagati N. Lakshman: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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. [Citation Graph (0, 0)][DBLP]
    HotOS, 2001, pp:47-52 [Conf]
  2. John F. Canny, Erich Kaltofen, Yagati N. Lakshman
    Solving Systems of Nonlinear Polynomial Equations Faster. [Citation Graph (0, 0)][DBLP]
    ISSAC, 1989, pp:121-128 [Conf]
  3. Dima Grigoriev, Yagati N. Lakshman
    Algorithms for Computing Sparse Shifts for Multivariate Polynomials. [Citation Graph (0, 0)][DBLP]
    ISSAC, 1995, pp:96-103 [Conf]
  4. Markus A. Hitz, Erich Kaltofen, Yagati N. Lakshman
    Efficient Algorithms for Computing the Nearest Polynomial with a Real Root and Related Problems. [Citation Graph (0, 0)][DBLP]
    ISSAC, 1999, pp:205-212 [Conf]
  5. Erich Kaltofen, Yagati N. Lakshman, J.-M. Wiley
    Modular Rational Sparse Multivariate Polynomial Interpolation. [Citation Graph (0, 0)][DBLP]
    ISSAC, 1990, pp:135-139 [Conf]
  6. Erich Kaltofen, Yagati N. Lakshman
    Improved Sparse Multivariate Polynomial Interpolation Algorithms. [Citation Graph (0, 0)][DBLP]
    ISSAC, 1988, pp:467-474 [Conf]
  7. Narendra Karmarkar, Yagati N. Lakshman
    Approximate Polynomial Greatest Common Divisors and Nearest Singular Polynomials. [Citation Graph (0, 0)][DBLP]
    ISSAC, 1996, pp:35-39 [Conf]
  8. Yagati N. Lakshman, Bruce W. Char, Jeremy R. Johnson
    Software Components Using Symbolic Computation for Problem Solving Environments. [Citation Graph (0, 0)][DBLP]
    ISSAC, 1998, pp:46-53 [Conf]
  9. Yagati N. Lakshman, B. David Saunders
    On Computing Sparse Shifts for Univariate Polynomials. [Citation Graph (0, 0)][DBLP]
    ISSAC, 1994, pp:108-113 [Conf]
  10. Yagati N. Lakshman
    On the Complexity of Computing a Gröbner Basis for the Radical of a Zero Dimensional Ideal [Citation Graph (0, 0)][DBLP]
    STOC, 1990, pp:555-563 [Conf]
  11. Dima Grigoriev, Yagati N. Lakshman
    Algorithms for Computing Sparse Shifts for Multivariate Polynomials. [Citation Graph (0, 0)][DBLP]
    Appl. Algebra Eng. Commun. Comput., 2000, v:11, n:1, pp:43-67 [Journal]
  12. Yagati N. Lakshman, B. David Saunders
    Sparse Shifts for Univariate Polynomia. [Citation Graph (0, 0)][DBLP]
    Appl. Algebra Eng. Commun. Comput., 1996, v:7, n:5, pp:351-364 [Journal]
  13. Yagati N. Lakshman, B. David Saunders
    Sparse Shifts for Univariate Polynomials. [Citation Graph (0, 0)][DBLP]
    Appl. Algebra Eng. Commun. Comput., 1997, v:8, n:6, pp:561-562 [Journal]
  14. Narendra Karmarkar, Yagati N. Lakshman
    On Approximate GCDs of Univariate Polynomials. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1998, v:26, n:6, pp:653-666 [Journal]
  15. Yagati N. Lakshman, B. David Saunders
    Sparse Polynomial Interpolation in Nonstandard Bases. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1995, v:24, n:2, pp:387-397 [Journal]

  16. Virtual office hours using TechTalk, a Web-based mathematical collaboration tool. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.004secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002