Yagati N. Lakshman

21 papers A* 1A 1B 10Journal 8
YearRankTypeTitle / Venue / Authors
2003 J jnl
Network processors applied to IPv4/IPv6 transition.
IEEE Netw.
Eric Grosse, Yagati N. Lakshman
2001 A conf
Protium, an Infrastructure for Partitioned Applications.
HotOS
Cliff Young, Yagati N. Lakshman, Tom Szymanski, John H. Reppy, David L. Presotto, Rob Pike, Girija J. Narlikar, Sape J. Mullender, Eric Grosse
2000 J jnl
Algorithms for Computing Sparse Shifts for Multivariate Polynomials.
Appl. Algebra Eng. Commun. Comput.
Dima Grigoriev, Yagati N. Lakshman
1999 B conf
Efficient Algorithms for Computing the Nearest Polynomial with a Real Root and Related Problems.
ISSAC
Markus A. Hitz, Erich L. Kaltofen, Yagati N. Lakshman
1998 J jnl
On Approximate GCDs of Univariate Polynomials.
J. Symb. Comput.
Narendra Karmarkar, Yagati N. Lakshman
1998 B conf
Software Components Using Symbolic Computation for Problem Solving Environments.
ISSAC
Yagati N. Lakshman, Bruce W. Char, Jeremy Johnson
1998 B conf
Virtual office hours using TechTalk, a Web-based mathematical collaboration tool.
ITiCSE
Jeremy Johnson, Yagati N. Lakshman, Thomas T. Hewett, Tim Souder, Tom Fitzgerald, Sara Donegan, Paul Morgovsky
1997 J jnl
Sparse Shifts for Univariate Polynomials.
Appl. Algebra Eng. Commun. Comput.
Yagati N. Lakshman, B. David Saunders
1997 J jnl
Symbolic computation tools in scientific problem solving environments.
SIGSAM Bull.
Bruce W. Char, Thomas T. Hewett, Jeremy Johnson, Yagati N. Lakshman, Ron Perline, Raji Venkatesan, Hoi Man Chang, Michael Miller, Clint Hepner
1996 B conf
Approximate Polynomial Greatest Common Divisors and Nearest Singular Polynomials.
ISSAC
Narendra Karmarkar, Yagati N. Lakshman
1996 B ed.
Proceedings of the 1996 International Symposium on Symbolic and Algebraic Computation, ISSAC '96, Zurich, Switzerland, July 24-26, 1996
ISSAC
Erwin Engeler, Bob F. Caviness, Yagati N. Lakshman
1996 J jnl
Sparse shifts for univariate polynomials.
Appl. Algebra Eng. Commun. Comput.
Yagati N. Lakshman, B. David Saunders
1995 B conf
Algorithms for Computing Sparse Shifts for Multivariate Polynomials.
ISSAC
Dima Grigoriev, Yagati N. Lakshman
1995 J jnl
Sparse Polynomial Interpolation in Nonstandard Bases.
SIAM J. Comput.
Yagati N. Lakshman, B. David Saunders
1994 B conf
On Computing Sparse Shifts for Univariate Polynomials.
ISSAC
Yagati N. Lakshman, B. David Saunders
1990 B conf
Modular Rational Sparse Multivariate Polynomial Interpolation.
ISSAC
Erich L. Kaltofen, Yagati N. Lakshman, J.-M. Wiley
1990 A* conf
On the Complexity of Computing a Gröbner Basis for the Radical of a Zero Dimensional Ideal
STOC
Yagati N. Lakshman
1990 — —
On the complexity of computing Gröbner bases for zero dimensional polynomial ideals.
Yagati N. Lakshman
1989 B conf
Solving Systems of Nonlinear Polynomial Equations Faster.
ISSAC
John F. Canny, Erich L. Kaltofen, Yagati N. Lakshman
1988 J jnl
Dagwood: a system for manipulating polynomials given by straight-line programs.
ACM Trans. Math. Softw.
Timothy S. Freeman, Gregory M. Imirzian, Erich L. Kaltofen, Yagati N. Lakshman
1988 B conf
Improved Sparse Multivariate Polynomial Interpolation Algorithms.
ISSAC
Erich L. Kaltofen, Yagati N. Lakshman