Pramod Ganapathi

Orcid: 0000-0001-5090-4444

According to our database1, Pramod Ganapathi authored at least 22 papers between 2010 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
A Fast Algorithm for Aperiodic Linear Stencil Computation using Fast Fourier Transforms.
ACM Trans. Parallel Comput., December, 2023

A Unified Framework to Discover Permutation Generation Algorithms.
Comput. J., March, 2023

2022
An Algorithm for the Sequence Alignment with Gap Penalty Problem using Multiway Divide-and-Conquer and Matrix Transposition.
Inf. Process. Lett., 2022

Parallel Divide-and-Conquer Algorithms for Bubble Sort, Selection Sort and Insertion Sort.
Comput. J., 2022

Brief Announcement: Faster Stencil Computations using Gaussian Approximations.
Proceedings of the SPAA '22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11, 2022

FOURST: A code generator for FFT-based fast stencil computations.
Proceedings of the International IEEE Symposium on Performance Analysis of Systems and Software, 2022

2021
Fast Stencil Computations using Fast Fourier Transforms.
Proceedings of the SPAA '21: 33rd ACM Symposium on Parallelism in Algorithms and Architectures, 2021

Low-Span Parallel Algorithms for the Binary-Forking Model.
Proceedings of the SPAA '21: 33rd ACM Symposium on Parallelism in Algorithms and Architectures, 2021

2020
Low-Depth Parallel Algorithms for the Binary-Forking Model without Atomics.
CoRR, 2020

2019
Toward Efficient Architecture-Independent Algorithms for Dynamic Programs.
Proceedings of the High Performance Computing - 34th International Conference, 2019

Toward efficient architecture-independent algorithms for dynamic programs: poster.
Proceedings of the 24th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2019

2018
The range 1 query (R1Q) problem.
Theor. Comput. Sci., 2018

2017
Autogen: Automatic Discovery of Efficient Recursive Divide-8-Conquer Algorithms for Solving Dynamic Programming Problems.
ACM Trans. Parallel Comput., 2017

Provably Efficient Scheduling of Cache-oblivious Wavefront Algorithms.
Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, 2017

POSTER: Provably Efficient Scheduling of Cache-Oblivious Wavefront Algorithms.
Proceedings of the 22nd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2017

2016
AUTOGEN: automatic discovery of cache-oblivious parallel recursive algorithms for solving dynamic programs.
Proceedings of the 21st ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2016

The I/O Complexity of Computing Prime Tables.
Proceedings of the LATIN 2016: Theoretical Informatics, 2016

An Efficient Cache-oblivious Parallel Viterbi Algorithm.
Proceedings of the Euro-Par 2016: Parallel Processing, 2016

2015
Cache-oblivious wavefront: improving parallelism of recursive dynamic programming algorithms without losing cache-efficiency.
Proceedings of the 20th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2015

High-Performance Energy-Efficient Recursive Dynamic Programming with Matrix-Multiplication-Like Flexible Kernels.
Proceedings of the 2015 IEEE International Parallel and Distributed Processing Symposium, 2015

2014
High-performance recursive dynamic programming for bioinformatics using MM-like flexible kernels.
Proceedings of the 5th ACM Conference on Bioinformatics, 2014

2010
A Versatile Algorithm to Generate Various Combinatorial Structures
CoRR, 2010


  Loading...