| 2009 |
|---|
| 20 | Demand-driven execution of static directed acyclic graphs using task parallelism. Prabhanjan Kambadur, Anshul Gupta, Torsten Hoefler, Andrew Lumsdaine. HiPC 2009, 284-293. Web SearchBibTeXDownload |
| 19 | PFunc: modern task parallelism for modern high performance computing. Prabhanjan Kambadur, Anshul Gupta, Amol Ghoting, Haim Avron, Andrew Lumsdaine. SC 2009. Web SearchBibTeXDownload |
| 2000 |
|---|
| 18 | Fast practical algorithms for the Boolean-product-witness-matrix problem. Anshul Gupta, Pankaj Rohatgi, Ramesh C. Agarwal. ISSAC 2000, 146-152. Web SearchBibTeXDownload |
| 1999 |
|---|
| 17 | PSPASES: An Efficient and Scalable Parallel Sparse Direct Solver. Mahesh V. Joshi, George Karypis, Vipin Kumar, Anshul Gupta, Fred G. Gustavson. PPSC 1999. Cited by 10Web SearchBibTeX |
| 1998 |
|---|
| 16 | The Design, Implementation, and Evaluation of a Symmetric Banded Linear Solver for Distributed-Memory Parallel Computers. Anshul Gupta, Fred G. Gustavson, Mahesh V. Joshi, Sivan Toledo. ACM Trans. Math. Softw. (24): 74-101 (1998). Web SearchBibTeXDownload |
| 15 | WSSMP: A High-Performance Serial and Parallel Symmetric Sparse Linear Solver. Anshul Gupta, Mahesh V. Joshi, Vipin Kumar. PARA 1998, 182-194. Cited by 10Web SearchBibTeXDownload |
| 1997 |
|---|
| 14 | Highly Scalable Parallel Algorithms for Sparse Matrix Factorization. Anshul Gupta, George Karypis, Vipin Kumar. IEEE Trans. Parallel Distrib. Syst. (8): 502-520 (1997). Cited by 164Web SearchBibTeXDownload |
| 13 | Design and Implementation of a Scalable Parallel Direct Solver for Sparse Symmetric Positive Definite Systems: Preliminary Results. Anshul Gupta, Fred G. Gustavson, Mahesh V. Joshi, George Karypis, Vipin Kumar. PPSC 1997. Web SearchBibTeX |
| 1996 |
|---|
| 12 | The Design, Implementation, and Evaluation of a Banded Linear Solver for Distributed-Memory Parallel Computers. Anshul Gupta, Fred G. Gustavson, Mahesh V. Joshi, Sivan Toledo. PARA 1996, 328-340. Web SearchBibTeXDownload |
| 1995 |
|---|
| 11 | Performance and Scalability of Preconditioned Conjugate Gradient Methods on Parallel Computers. Anshul Gupta, Vipin Kumar, Ahmed H. Sameh. IEEE Trans. Parallel Distrib. Syst. (6): 455-469 (1995). Cited by 66Web SearchBibTeXDownload |
| 10 | Optimally Scalable Parallel Sparse Cholesky Factorization. Anshul Gupta, Vipin Kumar. PPSC 1995, 442-447. Cited by 22Web SearchBibTeX |
| 9 | A Highly Parallel Interior Point Algorithm. George Karypis, Anshul Gupta, Vipin Kumar. PPSC 1995, 110-112. Web SearchBibTeX |
| 8 | Parallel Algorithms for Forward and Back Substitution in Direct Solution of Sparse Linear Systems. Anshul Gupta, Vipin Kumar. SC 1995. Cited by 24Web SearchBibTeXDownload |
| 1994 |
|---|
| 7 | A parallel formulation of interior point algorithms. George Karypis, Anshul Gupta, Vipin Kumar. SC 1994, 204-213. Cited by 42Web SearchBibTeXDownload |
| 6 | A scalable parallel algorithm for sparse Cholesky factorization. Anshul Gupta, Vipin Kumar. SC 1994, 793-802. Cited by 23Web SearchBibTeXDownload |
| 1993 |
|---|
| 5 | Scalability of Parallel Algorithms for Matrix Multiplication. Anshul Gupta, Vipin Kumar. ICPP 1993, 115-123. Cited by 42Web SearchBibTeX |
| 4 | The Scalability of FFT on Parallel Computers. Anshul Gupta, Vipin Kumar. IEEE Trans. Parallel Distrib. Syst. (4): 922-932 (1993). Cited by 136Web SearchBibTeXDownload |
| 3 | Performance Properties of Large Scale Parallel Systems. Anshul Gupta, Vipin Kumar. J. Parallel Distrib. Comput. (19): 234-244 (1993). Cited by 49Web SearchBibTeXDownload |
| 2 | Performance and Scalability of Preconditioned Conjugate Gradient Methods on the CM-5. Anshul Gupta, Vipin Kumar, Ahmed H. Sameh. PPSC 1993, 664-674. Web SearchBibTeX |
| 1991 |
|---|
| 1 | Analysis of scalability of parallel algorithms and architectures: a survey. Vipin Kumar, Anshul Gupta. ICS 1991, 396-405. Cited by 48Web SearchBibTeXDownload |
