2008 |
34 | EE | Thomas George,
Anshul Gupta,
Vivek Sarin:
A Recommendation System for Preconditioned Iterative Solvers.
ICDM 2008: 803-808 |
2007 |
33 | EE | Anshul Gupta:
A Shared- and distributed-memory parallel general sparse direct solver.
Appl. Algebra Eng. Commun. Comput. 18(3): 263-277 (2007) |
32 | EE | Anshul Gupta:
A Shared- and distributed-memory parallel general sparse direct solver.
Appl. Algebra Eng. Commun. Comput. 18(3): 263-277 (2007) |
2006 |
31 | EE | Rajesh Garg,
Mario Sanchez,
Kanupriya Gulati,
Nikhil Jayakumar,
Anshul Gupta,
Sunil P. Khatri:
A design flow to optimize circuit delay by using standard cells and PLAs.
ACM Great Lakes Symposium on VLSI 2006: 217-222 |
30 | EE | Anshul Gupta,
J. William Atwood:
Feedback Mechanism for MPLS Path Assignment using RSVP-TE.
AICT/ICIW 2006: 61 |
2004 |
29 | EE | Anshul Gupta:
A Shared- and Distributed-Memory Parallel Sparse Direct Solver.
PARA 2004: 778-787 |
28 | EE | Olaf Schenk,
Stefan Röllin,
Anshul Gupta:
The effects of unsymmetric matrix permutations and scalings in semiconductor device and circuit simulation.
IEEE Trans. on CAD of Integrated Circuits and Systems 23(3): 400-411 (2004) |
2002 |
27 | EE | Anshul Gupta:
Recent advances in direct methods for solving unsymmetric sparse systems of linear equations.
ACM Trans. Math. Softw. 28(3): 301-324 (2002) |
2001 |
26 | | Anshul Gupta,
Yanto Muliadi:
An Experimental Comparison of some Direct Sparse Solver Packages.
IPDPS 2001: 180 |
25 | EE | Anshul Gupta:
Recent Progress in General Sparse Direct Solvers.
International Conference on Computational Science (1) 2001: 823-831 |
2000 |
24 | EE | Anshul Gupta,
Pankaj Rohatgi,
Ramesh C. Agarwal:
Fast practical algorithms for the Boolean-product-witness-matrix problem.
ISSAC 2000: 146-152 |
1999 |
23 | EE | Anshul Gupta,
Fred G. Gustavson,
Alexander Karaivanov,
Jerzy Wasniewski,
Plamen Y. Yalamov:
Experience with a Recursive Perturbation Based Algorithm for Symmetric Indefinite Linear Systems.
Euro-Par 1999: 1096-1103 |
22 | | Mahesh V. Joshi,
George Karypis,
Vipin Kumar,
Anshul Gupta,
Fred G. Gustavson:
PSPASES: An Efficient and Scalable Parallel Sparse Direct Solver.
PPSC 1999 |
21 | | Gary S. Ditlow,
Anshul Gupta,
Richard Moore,
David Moran,
Ralph Williams,
Tom Wilkins:
Parallel Analysis of IC Power Distribution Networks.
PPSC 1999 |
1998 |
20 | | Anshul Gupta,
Mahesh V. Joshi,
Vipin Kumar:
WSSMP: A High-Performance Serial and Parallel Symmetric Sparse Linear Solver.
PARA 1998: 182-194 |
19 | EE | Anshul Gupta,
Fred G. Gustavson,
Mahesh V. Joshi,
Sivan Toledo:
The Design, Implementation, and Evaluation of a Symmetric Banded Linear Solver for Distributed-Memory Parallel Computers.
ACM Trans. Math. Softw. 24(1): 74-101 (1998) |
1997 |
18 | | Anshul Gupta,
Fred G. Gustavson,
Mahesh V. Joshi,
George Karypis,
Vipin Kumar:
Design and Implementation of a Scalable Parallel Direct Solver for Sparse Symmetric Positive Definite Systems: Preliminary Results.
PPSC 1997 |
17 | EE | Anshul Gupta:
Fast and effective algorithms for graph partitioning and sparse-matrix ordering.
IBM Journal of Research and Development 41(1&2): 171-184 (1997) |
16 | EE | Anshul Gupta,
George Karypis,
Vipin Kumar:
Highly Scalable Parallel Algorithms for Sparse Matrix Factorization.
IEEE Trans. Parallel Distrib. Syst. 8(5): 502-520 (1997) |
1996 |
15 | | Anshul Gupta,
Fred G. Gustavson:
Fast Graph Partitioning and Its Application in Sparse Matrix Ordering.
PARA 1996: 316-327 |
14 | | Anshul Gupta,
Fred G. Gustavson,
Mahesh V. Joshi,
Sivan Toledo:
The Design, Implementation, and Evaluation of a Banded Linear Solver for Distributed-Memory Parallel Computers.
PARA 1996: 328-340 |
13 | | Fred G. Gustavson,
Anshul Gupta:
A New Parallel Algorithm for Tridiagonal Symmetric Positive Definite Systems of Equations.
PARA 1996: 341-349 |
1995 |
12 | | George Karypis,
Anshul Gupta,
Vipin Kumar:
A Highly Parallel Interior Point Algorithm.
PPSC 1995: 110-112 |
11 | | Anshul Gupta,
Vipin Kumar:
Optimally Scalable Parallel Sparse Cholesky Factorization.
PPSC 1995: 442-447 |
10 | EE | Anshul Gupta,
Vipin Kumar:
Parallel Algorithms for Forward and Back Substitution in Direct Solution of Sparse Linear Systems.
SC 1995 |
9 | EE | Anshul Gupta,
Vipin Kumar,
Ahmed H. Sameh:
Performance and Scalability of Preconditioned Conjugate Gradient Methods on Parallel Computers.
IEEE Trans. Parallel Distrib. Syst. 6(5): 455-469 (1995) |
1994 |
8 | | Vipin Kumar,
Ananth Grama,
Anshul Gupta,
George Karypis:
Introduction to Parallel Computing.
Benjamin/Cummings 1994 |
7 | EE | George Karypis,
Anshul Gupta,
Vipin Kumar:
A parallel formulation of interior point algorithms.
SC 1994: 204-213 |
6 | EE | Anshul Gupta,
Vipin Kumar:
A scalable parallel algorithm for sparse Cholesky factorization.
SC 1994: 793-802 |
1993 |
5 | | Anshul Gupta,
Vipin Kumar:
Scalability of Parallel Algorithms for Matrix Multiplication.
ICPP 1993: 115-123 |
4 | | Anshul Gupta,
Vipin Kumar,
Ahmed H. Sameh:
Performance and Scalability of Preconditioned Conjugate Gradient Methods on the CM-5.
PPSC 1993: 664-674 |
3 | EE | Anshul Gupta,
Vipin Kumar:
The Scalability of FFT on Parallel Computers.
IEEE Trans. Parallel Distrib. Syst. 4(8): 922-932 (1993) |
2 | | Anshul Gupta,
Vipin Kumar:
Performance Properties of Large Scale Parallel Systems.
J. Parallel Distrib. Comput. 19(3): 234-244 (1993) |
1991 |
1 | EE | Vipin Kumar,
Anshul Gupta:
Analysis of scalability of parallel algorithms and architectures: a survey.
ICS 1991: 396-405 |