Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Anshul Gupta
2010 – today
- 2013
[i2]Haim Avron, Alex Druinsky, Anshul Gupta: A Randomized Asynchronous Linear Solver with Provable Convergence Rate. CoRR abs/1304.6475 (2013)- 2012
- [j12]Thomas George, Anshul Gupta, Vivek Sarin: An Empirical Analysis of the Performance of Preconditioners for SPD Systems. ACM Trans. Math. Softw. 38(4): 24 (2012)
- [c30]Haim Avron, Anshul Gupta: Managing data-movement for effective shared-memory parallelization of out-of-core sparse solvers. SC 2012: 102
- [i1]Prabhanjan Kambadur, Amol Ghoting, Anshul Gupta, Andrew Lumsdaine: Extending Task Parallelism for Frequent Pattern Mining. CoRR abs/1211.1658 (2012)
- 2011
- [c29]Thomas George, Vaibhav Saxena, Anshul Gupta, Amik Singh, Anamitra R. Choudhury: Multifrontal Factorization of Sparse SPD Matrices on GPUs. IPDPS 2011: 372-383
- [c28]Sushil K. Prasad, Almadena Yu. Chtchelkanova, Sajal K. Das, Frank Dehne, Mohamed G. Gouda, Anshul Gupta, Joseph JáJá, Krishna Kant, Anita La Salle, Richard LeBlanc, Manish Lumsdaine, David A. Padua, Manish Parashar, Viktor K. Prasanna, Yves Robert, Arnold L. Rosenberg, Sartaj Sahni, Behrooz Shirazi, Alan Sussman, Charles C. Weems, Jie Wu: NSF/IEEE-TCPP curriculum initiative on parallel and distributed computing: core topics for undergraduates. SIGCSE 2011: 617-618
- [r2]Anshul Gupta: Preconditioners for Sparse Iterative Methods. Encyclopedia of Parallel Computing 2011: 1615-1624
- [r1]
- 2010
- [j11]Anshul Gupta, Thomas George: Adaptive Techniques for Improving the Performance of Incomplete Factorization Preconditioning. SIAM J. Scientific Computing 32(1): 84-110 (2010)
2000 – 2009
- 2009
- [c27]Prabhanjan Kambadur, Anshul Gupta, Torsten Hoefler, Andrew Lumsdaine: Demand-driven execution of static directed acyclic graphs using task parallelism. HiPC 2009: 284-293
- [c26]Prabhanjan Kambadur, Amol Ghoting, Anshul Gupta, Andrew Lumsdaine: Extending Task Parallelism For Frequent Pattern Mining. PARCO 2009: 289-296
- [c25]Anshul Gupta, Seid Koric, Thomas George: Sparse matrix factorization on massively parallel computers. SC 2009
- [c24]Prabhanjan Kambadur, Anshul Gupta, Amol Ghoting, Haim Avron, Andrew Lumsdaine: PFunc: modern task parallelism for modern high performance computing. SC 2009
- 2008
- [c23]Thomas George, Anshul Gupta, Vivek Sarin: A Recommendation System for Preconditioned Iterative Solvers. ICDM 2008: 803-808
- 2007
- [j10]Anshul Gupta: A Shared- and distributed-memory parallel general sparse direct solver. Appl. Algebra Eng. Commun. Comput. 18(3): 263-277 (2007)
- 2006
- [c22]Anshul Gupta, J. William Atwood: Feedback Mechanism for MPLS Path Assignment using RSVP-TE. AICT/ICIW 2006: 61
- [c21]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
- 2004
- [j9]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)
- [c20]
- 2002
- [j8]Anshul Gupta: Improved Symbolic and Numerical Factorization Algorithms for Unsymmetric Sparse Matrices. SIAM J. Matrix Analysis Applications 24(2): 529-552 (2002)
- [j7]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
- [c19]Anshul Gupta: Recent Progress in General Sparse Direct Solvers. International Conference on Computational Science (1) 2001: 823-831
- [c18]Anshul Gupta, Yanto Muliadi: An Experimental Comparison of some Direct Sparse Solver Packages. IPDPS 2001: 180
- 2000
- [c17]Anshul Gupta, Pankaj Rohatgi, Ramesh C. Agarwal: Fast practical algorithms for the Boolean-product-witness-matrix problem. ISSAC 2000: 146-152
1990 – 1999
- 1999
- [c16]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
- [c15]Gary S. Ditlow, Anshul Gupta, Richard L. Moore, David Moran, Ralph Williams, Tom Wilkins: Parallel Analysis of IC Power Distribution Networks. PPSC 1999
- [c14]Mahesh V. Joshi, George Karypis, Vipin Kumar, Anshul Gupta, Fred G. Gustavson: PSPASES: An Efficient and Scalable Parallel Sparse Direct Solver. PPSC 1999
- 1998
- [j6]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)
- [c13]Anshul Gupta, Mahesh V. Joshi, Vipin Kumar: WSSMP: A High-Performance Serial and Parallel Symmetric Sparse Linear Solver. PARA 1998: 182-194
- 1997
- [j5]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)
- [j4]Anshul Gupta, George Karypis, Vipin Kumar: Highly Scalable Parallel Algorithms for Sparse Matrix Factorization. IEEE Trans. Parallel Distrib. Syst. 8(5): 502-520 (1997)
- [c12]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
- 1996
- [c11]Anshul Gupta, Fred G. Gustavson: Fast Graph Partitioning and Its Application in Sparse Matrix Ordering. PARA 1996: 316-327
- [c10]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
- [c9]Fred G. Gustavson, Anshul Gupta: A New Parallel Algorithm for Tridiagonal Symmetric Positive Definite Systems of Equations. PARA 1996: 341-349
- 1995
- [j3]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)
- [c8]George Karypis, Anshul Gupta, Vipin Kumar: A Highly Parallel Interior Point Algorithm. PPSC 1995: 110-112
- [c7]Anshul Gupta, Vipin Kumar: Optimally Scalable Parallel Sparse Cholesky Factorization. PPSC 1995: 442-447
- [c6]Anshul Gupta, Vipin Kumar: Parallel Algorithms for Forward and Back Substitution in Direct Solution of Sparse Linear Systems. SC 1995: 74
- 1994
- [b1]Vipin Kumar, Ananth Grama, Anshul Gupta, George Karypis: Introduction to Parallel Computing. Benjamin/Cummings 1994, ISBN 0-8053-3170-0
- [c5]George Karypis, Anshul Gupta, Vipin Kumar: A parallel formulation of interior point algorithms. SC 1994: 204-213
- [c4]Anshul Gupta, Vipin Kumar: A scalable parallel algorithm for sparse Cholesky factorization. SC 1994: 793-802
- 1993
- [j2]Anshul Gupta, Vipin Kumar: Performance Properties of Large Scale Parallel Systems. J. Parallel Distrib. Comput. 19(3): 234-244 (1993)
- [j1]Anshul Gupta, Vipin Kumar: The Scalability of FFT on Parallel Computers. IEEE Trans. Parallel Distrib. Syst. 4(8): 922-932 (1993)
- [c3]Anshul Gupta, Vipin Kumar: Scalability of Parallel Algorithms for Matrix Multiplication. ICPP 1993: 115-123
- [c2]Anshul Gupta, Vipin Kumar, Ahmed H. Sameh: Performance and Scalability of Preconditioned Conjugate Gradient Methods on the CM-5. PPSC 1993: 664-674
- 1991
- [c1]Vipin Kumar, Anshul Gupta: Analysis of scalability of parallel algorithms and architectures: a survey. ICS 1991: 396-405
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-05-27 22:25 CEST by the dblp team