Follow
Rathish Das
Title
Cited by
Cited by
Year
Toward efficient architecture-independent algorithms for dynamic programs
M Javanmard, P Ganapathi, R Das, Z Ahmad, S Tschudi, R Chowdhury
International Conference on High Performance Computing, 143-164, 2019
182019
Flushing without cascades
MA Bender, R Das, M Farach-Colton, R Johnson, W Kuszmaul
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020
152020
Fast Stencil Computation using Fast Fourier Transforms
Z Ahmad, R Chowdhury, R Das, P Ganapathi, A Gregory, Y Zhu
Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and …, 2021
132021
Tight bounds for parallel paging and green paging
K Agrawal, MA Bender, R Das, W Kuszmaul, E Peserico, M Scquizzato
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021
132021
How to manage high-bandwidth memory automatically
R Das, K Agrawal, MA Bender, J Berry, B Moseley, CA Phillips
Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and …, 2020
132020
Green paging and parallel paging
K Agrawal, MA Bender, R Das, W Kuszmaul, E Peserico, M Scquizzato
Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and …, 2020
102020
Closing the gap between cache-oblivious and cache-adaptive analysis
MA Bender, RA Chowdhury, R Das, R Johnson, W Kuszmaul, A Lincoln, ...
Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and …, 2020
92020
Toward efficient architecture-independent algorithms for dynamic programs: poster
MM Javanmard, P Ganapathr, R Das, Z Ahmad, S Tschudi, R Chowdhury
Proceedings of the 24th Symposium on Principles and Practice of Parallel …, 2019
82019
Mitigating False Positives in Filters: to Adapt or to Cache?
MA Bender, R Das, M Farach-Colton, T Mo, D Tench, Y Ping Wang
Symposium on Algorithmic Principles of Computer Systems (APOCS), 16-24, 2021
72021
Data races and the discrete resource-time tradeoff problem with resource reuse over paths
R Das, SY Tsai, S Duppala, J Lynch, EM Arkin, R Chowdhury, ...
The 31st ACM Symposium on Parallelism in Algorithms and Architectures, 359-368, 2019
72019
Automatic hbm management: Models and algorithms
D DeLayo, K Zhang, K Agrawal, MA Bender, JW Berry, R Das, B Moseley, ...
Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and …, 2022
62022
Online parallel paging with optimal makespan
K Agrawal, MA Bender, R Das, W Kuszmaul, E Peserico, M Scquizzato
Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and …, 2022
52022
Low-span parallel algorithms for the binary-forking model
Z Ahmad, R Chowdhury, R Das, P Ganapathi, A Gregory, MM Javanmard
Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and …, 2021
52021
Shortest beer path queries in interval graphs
R Das, M He, E Kondratovsky, JI Munro, AM Naredla, K Wu
arXiv preprint arXiv:2209.14401, 2022
42022
Brief announcement: Faster stencil computations using gaussian approximations
Z Ahmad, R Chowdhury, R Das, P Ganapathi, A Gregory, Y Zhu
Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and …, 2022
42022
A fast algorithm for aperiodic linear stencil computation using Fast Fourier Transforms
Z Ahmad, R Chowdhury, R Das, P Ganapathi, A Gregory, Y Zhu
ACM Transactions on Parallel Computing 10 (4), 1-34, 2023
22023
An associativity threshold phenomenon in set-associative caches
MA Bender, R Das, M Farach-Colton, G Tagliavini
Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and …, 2023
22023
Internal masked prefix sums and its connection to fully internal measurement queries
R Das, M He, E Kondratovsky, JI Munro, K Wu
International Symposium on String Processing and Information Retrieval, 217-232, 2022
22022
Machine learning advised ski rental problem with a discount
A Bhattacharya, R Das
International Conference and Workshops on Algorithms and Computation, 213-224, 2022
22022
Algorithmic Foundation of Parallel Paging and Scheduling under Memory Constraints
R Das
State University of New York at Stony Brook, 2021
22021
The system can't perform the operation now. Try again later.
Articles 1–20