A fast sparse QR factorization for solving linear least squares problems in graphics. - Abeynaya Gnanasekaran; Eric Darve (SIGGRAPH Talks, 2021)

Scalable low-rank factorization using a task-based runtime system with distributed memory. - Abeynaya Gnanasekaran; Eric Darve (PASC, 2022)

Carleman linearization based efficient quantum algorithm for higher order polynomial differential equations. - Amit Surana; Abeynaya Gnanasekaran; Tuhin Sahai (CoRR, 2022)

Hierarchical Orthogonal Factorization: Sparse Least Squares Problems. - Abeynaya Gnanasekaran; Eric Darve (J. Sci. Comput., 2022)

Hierarchical Orthogonal Factorization: Sparse Square Matrices. - Abeynaya Gnanasekaran; Eric Darve (SIAM J. Matrix Anal. Appl., 2022)

Efficient Quantum Algorithms for Nonlinear Stochastic Dynamical Systems. - Abeynaya Gnanasekaran; Amit Surana; Tuhin Sahai (QCE, 2023)

Efficient Variational Quantum Linear Solver for Structured Sparse Matrices. - Abeynaya Gnanasekaran; Amit Surana (QCE, 2024)

On the Emergence of Ergodic Dynamics in Unique Games. - Tuhin Sahai; Abeynaya Gnanasekaran (CoRR, 2024)

Variational Quantum Framework for Partial Differential Equation Constrained Optimization. - Amit Surana; Abeynaya Gnanasekaran (CoRR, 2024)

An efficient quantum algorithm for simulating polynomial dynamical systems. - Amit Surana; Abeynaya Gnanasekaran; Tuhin Sahai (Quantum Inf. Process., 2024)

Discovering Algorithms with Computational Language Processing. - Théo Bourdais; Abeynaya Gnanasekaran; Houman Owhadi; Tuhin Sahai (CoRR, 2025)

Efficient Quantum Access Model for Sparse Structured Matrices using Linear Combination of Things. - Abeynaya Gnanasekaran; Amit Surana (CoRR, 2025)