Yagati N. Lakshman

According to our database1, Yagati N. Lakshman authored at least 18 papers between 1988 and 2003.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2003
Network processors applied to IPv4/IPv6 transition.
IEEE Netw., 2003

2001
Protium, an Infrastructure for Partitioned Applications.
Proceedings of HotOS-VIII: 8th Workshop on Hot Topics in Operating Systems, 2001

2000
Algorithms for Computing Sparse Shifts for Multivariate Polynomials.
Appl. Algebra Eng. Commun. Comput., 2000

1999
Efficient Algorithms for Computing the Nearest Polynomial with a Real Root and Related Problems.
Proceedings of the 1999 International Symposium on Symbolic and Algebraic Computation, 1999

1998
On Approximate GCDs of Univariate Polynomials.
J. Symb. Comput., 1998

Virtual office hours using TechTalk, a Web-based mathematical collaboration tool.
Proceedings of the 6th Annual Conference on the Teaching of Computing and the 3rd Annual SIGCSE Conference on Innovation and Technology in Computer Science Education, 1998

Software Components Using Symbolic Computation for Problem Solving Environments.
Proceedings of the 1998 International Symposium on Symbolic and Algebraic Computation, 1998

1997
Symbolic computation tools in scientific problem solving environments.
SIGSAM Bull., 1997

Sparse Shifts for Univariate Polynomials.
Appl. Algebra Eng. Commun. Comput., 1997

1996
Approximate Polynomial Greatest Common Divisors and Nearest Singular Polynomials.
Proceedings of the 1996 International Symposium on Symbolic and Algebraic Computation, 1996

1995
Sparse Polynomial Interpolation in Nonstandard Bases.
SIAM J. Comput., 1995

1994
On Computing Sparse Shifts for Univariate Polynomials.
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 1994

1990
On the complexity of computing Gröbner bases for zero dimensional polynomial ideals.
PhD thesis, 1990

On the Complexity of Computing a Gröbner Basis for the Radical of a Zero Dimensional Ideal
Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, 1990

Modular Rational Sparse Multivariate Polynomial Interpolation.
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 1990

1989
Solving Systems of Nonlinear Polynomial Equations Faster.
Proceedings of the ACM-SIGSAM 1989 International Symposium on Symbolic and Algebraic Computation, 1989

1988
Dagwood: a system for manipulating polynomials given by straight-line programs.
ACM Trans. Math. Softw., 1988

Improved Sparse Multivariate Polynomial Interpolation Algorithms.
Proceedings of the Symbolic and Algebraic Computation, 1988


  Loading...