default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYagati N. Lakshman
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 1990
[b1]Yagati N. Lakshman:
On the complexity of computing Gröbner bases for zero dimensional polynomial ideals. Rensselaer Polytechnic Institute, USA, 1990
Journal Articles
- 2003
- [j8]Eric Grosse, Yagati N. Lakshman:
Network processors applied to IPv4/IPv6 transition. IEEE Netw. 17(4): 35-39 (2003) - 2000
- [j7]Dima Grigoriev, Yagati N. Lakshman:
Algorithms for Computing Sparse Shifts for Multivariate Polynomials. Appl. Algebra Eng. Commun. Comput. 11(1): 43-67 (2000) - 1998
- [j6]Narendra Karmarkar, Yagati N. Lakshman:
On Approximate GCDs of Univariate Polynomials. J. Symb. Comput. 26(6): 653-666 (1998) - 1997
- [j5]Yagati N. Lakshman, B. David Saunders:
Sparse Shifts for Univariate Polynomials. Appl. Algebra Eng. Commun. Comput. 8(6): 561-562 (1997) - [j4]Bruce W. Char, Thomas T. Hewett, Jeremy Johnson, Yagati N. Lakshman, Ron Perline, Raji Venkatesan, Hoi Man Chang, Michael Miller, Clint Hepner:
Symbolic computation tools in scientific problem solving environments. SIGSAM Bull. 31(3): 58 (1997) - 1996
- [j3]Yagati N. Lakshman, B. David Saunders:
Sparse shifts for univariate polynomials. Appl. Algebra Eng. Commun. Comput. 7(5): 351-364 (1996) - 1995
- [j2]Yagati N. Lakshman, B. David Saunders:
Sparse Polynomial Interpolation in Nonstandard Bases. SIAM J. Comput. 24(2): 387-397 (1995) - 1988
- [j1]Timothy S. Freeman, Gregory M. Imirzian, Erich L. Kaltofen
, Yagati N. Lakshman:
Dagwood: a system for manipulating polynomials given by straight-line programs. ACM Trans. Math. Softw. 14(3): 218-240 (1988)
Conference and Workshop Papers
- 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 - 1999
- [c10]Markus A. Hitz, Erich L. Kaltofen, Yagati N. Lakshman:
Efficient Algorithms for Computing the Nearest Polynomial with a Real Root and Related Problems. ISSAC 1999: 205-212 - 1998
- [c9]Yagati N. Lakshman, Bruce W. Char, Jeremy Johnson:
Software Components Using Symbolic Computation for Problem Solving Environments. ISSAC 1998: 46-53 - [c8]Jeremy 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 - 1996
- [c7]Narendra Karmarkar, Yagati N. Lakshman:
Approximate Polynomial Greatest Common Divisors and Nearest Singular Polynomials. ISSAC 1996: 35-39 - 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 L. 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 L. Kaltofen, Yagati N. Lakshman:
Solving Systems of Nonlinear Polynomial Equations Faster. ISSAC 1989: 121-128 - 1988
- [c1]Erich L. Kaltofen, Yagati N. Lakshman:
Improved Sparse Multivariate Polynomial Interpolation Algorithms. ISSAC 1988: 467-474
Editorship
- 1996
- [e1]Erwin Engeler, Bob F. Caviness, Yagati N. Lakshman:
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 [contents]
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
