Y. N. Lakshman

716 total citations
17 papers, 392 citations indexed

About

Y. N. Lakshman is a scholar working on Computational Theory and Mathematics, Mathematical Physics and Information Systems. According to data from OpenAlex, Y. N. Lakshman has authored 17 papers receiving a total of 392 indexed citations (citations by other indexed papers that have themselves been cited), including 13 papers in Computational Theory and Mathematics, 3 papers in Mathematical Physics and 3 papers in Information Systems. Recurrent topics in Y. N. Lakshman's work include Polynomial and algebraic computation (9 papers), Numerical Methods and Algorithms (4 papers) and Mathematics, Computing, and Information Processing (2 papers). Y. N. Lakshman is often cited by papers focused on Polynomial and algebraic computation (9 papers), Numerical Methods and Algorithms (4 papers) and Mathematics, Computing, and Information Processing (2 papers). Y. N. Lakshman collaborates with scholars based in United States, Switzerland and France. Y. N. Lakshman's co-authors include Narendra Karmarkar, B. David Saunders, Erich Kaltofen, Erwin Engeler, B. F. Caviness, Eric H. Grosse, Jeremy Johnson, Bruce W. Char, Charles Y.F. Young and Ted H. Szymanski and has published in prestigious journals such as SIAM Journal on Computing, IEEE Network and Journal of Symbolic Computation.

In The Last Decade

Y. N. Lakshman

17 papers receiving 353 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Y. N. Lakshman United States 11 296 97 67 56 53 17 392
Tateaki Sasaki Japan 12 312 1.1× 99 1.0× 106 1.6× 28 0.5× 20 0.4× 45 367
Henri Lombardi France 14 429 1.4× 141 1.5× 79 1.2× 28 0.5× 28 0.5× 67 654
Thorsten Theobald Germany 12 220 0.7× 75 0.8× 71 1.1× 21 0.4× 28 0.5× 42 419
B. F. Caviness United States 9 329 1.1× 117 1.2× 80 1.2× 51 0.9× 17 0.3× 23 485
D. Yu. Grigor'ev Russia 6 298 1.0× 103 1.1× 60 0.9× 46 0.8× 13 0.2× 15 383
Nicolai Vorobjov United Kingdom 10 327 1.1× 90 0.9× 67 1.0× 49 0.9× 17 0.3× 27 434
Iraj Kalantari United States 10 173 0.6× 91 0.9× 22 0.3× 65 1.2× 24 0.5× 28 320
Dietmar Ratz Germany 10 294 1.0× 48 0.5× 30 0.4× 124 2.2× 13 0.2× 16 403
Éric Schost Canada 18 669 2.3× 273 2.8× 178 2.7× 50 0.9× 14 0.3× 79 813
Serge Torres France 3 258 0.9× 46 0.5× 27 0.4× 16 0.3× 9 0.2× 4 341

Countries citing papers authored by Y. N. Lakshman

Since Specialization
Citations

This map shows the geographic impact of Y. N. Lakshman's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Y. N. Lakshman with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Y. N. Lakshman more than expected).

Fields of papers citing papers by Y. N. Lakshman

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Y. N. Lakshman. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Y. N. Lakshman. The network helps show where Y. N. Lakshman may publish in the future.

Co-authorship network of co-authors of Y. N. Lakshman

This figure shows the co-authorship network connecting the top 25 collaborators of Y. N. Lakshman. A scholar is included among the top collaborators of Y. N. Lakshman based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Y. N. Lakshman. Y. N. Lakshman is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

17 of 17 papers shown
1.
Young, Charles Y.F., Y. N. Lakshman, Ted H. Szymanski, et al.. (2005). Protium, an infrastructure for partitioned applications. University of Twente Research Information. 47–52. 22 indexed citations
2.
Grosse, Eric H. & Y. N. Lakshman. (2003). Network processors applied to IPv4/IPv6 transition. IEEE Network. 17(4). 35–39. 12 indexed citations
3.
Kapur, Deepak, et al.. (2002). Computing invariants using elimination methods. 55. 97–102. 7 indexed citations
4.
Kaltofen, Erich, et al.. (1999). Efficient algorithms for computing the nearest polynomial with a real root and related problems. 205–212. 41 indexed citations
5.
Karmarkar, Narendra & Y. N. Lakshman. (1998). On Approximate GCDs of Univariate Polynomials. Journal of Symbolic Computation. 26(6). 653–666. 73 indexed citations
6.
Lakshman, Y. N., Bruce W. Char, & Jeremy Johnson. (1998). Software components using symbolic computation for problem solving environments. 46–53. 12 indexed citations
7.
Johnson, Jeremy, et al.. (1998). Virtual office hours using TechTalk, a Web-based mathematical collaboration tool. ACM SIGCSE Bulletin. 30(3). 130–133. 4 indexed citations
8.
Johnson, Jeremy, et al.. (1998). Virtual office hours using TechTalk, a Web-based mathematical collaboration tool. 130–133. 6 indexed citations
9.
Lakshman, Y. N. & B. David Saunders. (1997). Sparse Shifts for Univariate Polynomials. Applicable Algebra in Engineering Communication and Computing. 8(6). 561–562. 1 indexed citations
10.
Engeler, Erwin, B. F. Caviness, & Y. N. Lakshman. (1996). Proceedings of the 1996 international symposium on Symbolic and algebraic computation. 49 indexed citations
11.
Lakshman, Y. N. & B. David Saunders. (1996). Sparse shifts for univariate polynomials. Applicable Algebra in Engineering Communication and Computing. 7(5). 351–364. 10 indexed citations
12.
Karmarkar, Narendra & Y. N. Lakshman. (1996). Approximate polynomial greatest common divisors and nearest singular polynomials. 35–39. 60 indexed citations
13.
Lakshman, Y. N. & B. David Saunders. (1995). Sparse Polynomial Interpolation in Nonstandard Bases. SIAM Journal on Computing. 24(2). 387–397. 29 indexed citations
14.
Lakshman, Y. N., et al.. (1995). Algorithms for computing sparse shifts for multivariate polynomials. 96–103. 15 indexed citations
15.
Lakshman, Y. N. & B. David Saunders. (1994). On computing sparse shifts for univariate polynomials. 108–113. 6 indexed citations
16.
17.
Kaltofen, Erich, et al.. (1990). Modular rational sparse multivariate polynomial interpolation. 135–139. 26 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026