• Narmour L, Derrien S and Rajopadhye S. (2023). Automatic Algorithm-Based Fault Tolerance (AABFT) of Stencil Computations 2023 32nd International Conference on Parallel Architectures and Compilation Techniques (PACT). 10.1109/PACT58117.2023.00024. 979-8-3503-4254-3. (187-198).

    https://ieeexplore.ieee.org/document/10364587/

  • Zhao J, Bastoul C, Yi Y, Hu J, Nie W, Zhang R, Geng Z, Li C, Tachon T and Gan Z. Parallelizing Neural Network Models Effectively on GPU by Implementing Reductions Atomically. Proceedings of the International Conference on Parallel Architectures and Compilation Techniques. (451-466).

    https://doi.org/10.1145/3559009.3569656

  • Kirousis L, Kolaitis P and Livieratos J. (2019). Aggregation of Votes with Multiple Positions on Each Issue. ACM Transactions on Economics and Computation. 7:1. (1-25). Online publication date: 28-Feb-2019.

    https://doi.org/10.1145/3296675

  • Kong Y and Schoenebeck G. (2019). An Information Theoretic Framework For Designing Information Elicitation Mechanisms That Reward Truth-telling. ACM Transactions on Economics and Computation. 7:1. (1-33). Online publication date: 23-Feb-2019.

    https://doi.org/10.1145/3296670

  • Stoller S and Liu Y. (2019). Algorithm Diversity for Resilient Systems. Data and Applications Security and Privacy XXXIII. 10.1007/978-3-030-22479-0_19. (359-378).

    https://link.springer.com/10.1007/978-3-030-22479-0_19

  • Wilczek J, Monna F, Jébrane A, Chazal C, Navarro N, Couette S and Smith C. (2018). Computer-Assisted Orientation and Drawing of Archaeological Pottery. Journal on Computing and Cultural Heritage . 11:4. (1-17). Online publication date: 29-Dec-2018.

    https://doi.org/10.1145/3230672

  • Karmaker Santu S, Geigle C, Ferguson D, Cope W, Kalantzis M, Searsmith D and Zhai C. (2018). SOFSAT. ACM SIGKDD Explorations Newsletter. 20:2. (21-30). Online publication date: 11-Dec-2018.

    https://doi.org/10.1145/3299986.3299990

  • Yao Z, Ma Z, Liu Y, Amiri Sani A and Chandramowlishwaran A. (2018). Sugar. ACM SIGPLAN Notices. 53:2. (519-534). Online publication date: 30-Nov-2018.

    https://doi.org/10.1145/3296957.3173186

  • Guo P and Hu W. (2018). Potluck. ACM SIGPLAN Notices. 53:2. (271-284). Online publication date: 30-Nov-2018.

    https://doi.org/10.1145/3296957.3173185

  • Dickens III B, Gunawi H, Feldman A and Hoffmann H. (2018). StrongBox. ACM SIGPLAN Notices. 53:2. (708-721). Online publication date: 30-Nov-2018.

    https://doi.org/10.1145/3296957.3173183

  • Ginsbach P, Remmelg T, Steuwer M, Bodin B, Dubach C and O'Boyle M. (2018). Automatic Matching of Legacy Code to Heterogeneous APIs. ACM SIGPLAN Notices. 53:2. (139-153). Online publication date: 30-Nov-2018.

    https://doi.org/10.1145/3296957.3173182

  • Ginsbach P, Remmelg T, Steuwer M, Bodin B, Dubach C and O'Boyle M. Automatic Matching of Legacy Code to Heterogeneous APIs. Proceedings of the Twenty-Third International Conference on Architectural Support for Programming Languages and Operating Systems. (139-153).

    https://doi.org/10.1145/3173162.3173182

  • Su D, Cao J, Li N, Bertino E, Lyu M and Jin H. (2017). Differentially Private K-Means Clustering and a Hybrid Approach to Private Optimization. ACM Transactions on Privacy and Security. 20:4. (1-33). Online publication date: 30-Nov-2017.

    https://doi.org/10.1145/3133201

  • Björklund A, Kaski P and Kowalik Ł. (2017). Counting Thin Subgraphs via Packings Faster than Meet-in-the-Middle Time. ACM Transactions on Algorithms. 13:4. (1-26). Online publication date: 31-Oct-2017.

    https://doi.org/10.1145/3125500

  • Rullo A, Midi D, Serra E and Bertino E. (2017). Pareto Optimal Security Resource Allocation for Internet of Things. ACM Transactions on Privacy and Security. 20:4. (1-30). Online publication date: 26-Oct-2017.

    https://doi.org/10.1145/3139293

  • Liu Y, Stoller S and Lin B. (2017). From Clarity to Efficiency for Distributed Algorithms. ACM Transactions on Programming Languages and Systems. 39:3. (1-41). Online publication date: 30-Sep-2017.

    https://doi.org/10.1145/2994595

  • Ding Y, Ning L, Guan H and Shen X. (2017). Generalizations of the theory and deployment of triangular inequality for compiler-based strength reduction. ACM SIGPLAN Notices. 52:6. (33-48). Online publication date: 14-Sep-2017.

    https://doi.org/10.1145/3140587.3062377

  • Ding Y, Ning L, Guan H and Shen X. Generalizations of the theory and deployment of triangular inequality for compiler-based strength reduction. Proceedings of the 38th ACM SIGPLAN Conference on Programming Language Design and Implementation. (33-48).

    https://doi.org/10.1145/3062341.3062377

  • Ginsbach P and O'Boyle M. Discovery and exploitation of general reductions: a constraint based approach. Proceedings of the 2017 International Symposium on Code Generation and Optimization. (269-280).

    /doi/10.5555/3049832.3049862

  • Reddy C, Kruse M and Cohen A. Reduction Drawing. Proceedings of the 2016 International Conference on Parallel Architectures and Compilation. (87-97).

    https://doi.org/10.1145/2967938.2967950

  • Maleki S, Yang A and Burtscher M. (2016). Higher-order and tuple-based massively-parallel prefix sums. ACM SIGPLAN Notices. 51:6. (539-552). Online publication date: 1-Aug-2016.

    https://doi.org/10.1145/2980983.2908089

  • Maleki S, Yang A and Burtscher M. Higher-order and tuple-based massively-parallel prefix sums. Proceedings of the 37th ACM SIGPLAN Conference on Programming Language Design and Implementation. (539-552).

    https://doi.org/10.1145/2908080.2908089

  • Yuki T, Gupta G, Kim D, Pathan T and Rajopadhye S. (2013). AlphaZ: A System for Design Space Exploration in the Polyhedral Model. Languages and Compilers for Parallel Computing. 10.1007/978-3-642-37658-0_2. (17-31).

    https://link.springer.com/10.1007/978-3-642-37658-0_2

  • Rajopadhye S, Gupta S and Kim D. Alphabets. Proceedings of the 2011 IEEE International Symposium on Parallel and Distributed Processing Workshops and PhD Forum. (656-664).

    https://doi.org/10.1109/IPDPS.2011.206

  • Abbas N, Derrien S, Rajopadhye S and Quinton P. (2010). Accelerating HMMER on FPGA using parallel prefixes and reductions 2010 International Conference on Field-Programmable Technology (FPT). 10.1109/FPT.2010.5681755. 978-1-4244-8980-0. (37-44).

    http://ieeexplore.ieee.org/document/5681755/

  • Li Y and Reis G. A quantitative study of reductions in algebraic libraries. Proceedings of the 4th International Workshop on Parallel and Symbolic Computation. (98-104).

    https://doi.org/10.1145/1837210.1837226

  • Gupta G and Rajopadhye S. The Z-polyhedral model. Proceedings of the 12th ACM SIGPLAN symposium on Principles and practice of parallel programming. (237-248).

    https://doi.org/10.1145/1229428.1229478

  • Rudd J, Marsh R and Munger M. (1998). Large-scale space object tracking using APL2. ACM SIGAPL APL Quote Quad. 29:3. (154-163). Online publication date: 1-Mar-1999.

    https://doi.org/10.1145/327600.327639

  • Kádár I and Papp E. (1998). Object oriented spatial positioning systems. ACM SIGAPL APL Quote Quad. 29:3. (121-140). Online publication date: 1-Mar-1999.

    https://doi.org/10.1145/327600.327632

  • Sundram S, Tariq M and Kjolstad F. (2024). Compiling Recurrences over Dense and Sparse Arrays. Proceedings of the ACM on Programming Languages. 10.1145/3649820. 8:OOPSLA1. (250-275). Online publication date: 29-Apr-2024.

    https://dl.acm.org/doi/10.1145/3649820

  • Ginsbach P, Remmelg T, Steuwer M, Bodin B, Dubach C and O'Boyle M. (2018). Automatic Matching of Legacy Code to Heterogeneous APIs. ACM SIGPLAN Notices. 53:2. (139-153). Online publication date: 30-Nov-2018.

    https://doi.org/10.1145/3296957.3173182

  • Ginsbach P, Remmelg T, Steuwer M, Bodin B, Dubach C and O'Boyle M. Automatic Matching of Legacy Code to Heterogeneous APIs. Proceedings of the Twenty-Third International Conference on Architectural Support for Programming Languages and Operating Systems. (139-153).

    https://doi.org/10.1145/3173162.3173182

  • Ding Y, Ning L, Guan H and Shen X. (2017). Generalizations of the theory and deployment of triangular inequality for compiler-based strength reduction. ACM SIGPLAN Notices. 52:6. (33-48). Online publication date: 14-Sep-2017.

    https://doi.org/10.1145/3140587.3062377

  • Ding Y, Ning L, Guan H and Shen X. Generalizations of the theory and deployment of triangular inequality for compiler-based strength reduction. Proceedings of the 38th ACM SIGPLAN Conference on Programming Language Design and Implementation. (33-48).

    https://doi.org/10.1145/3062341.3062377

  • Ma W, Gao K and Long G. (2016). Highly Optimized Code Generation for Stencil Codes with Computation Reuse for GPUs. Journal of Computer Science and Technology. 10.1007/s11390-016-1696-5. 31:6. (1262-1274). Online publication date: 1-Nov-2016.

    http://link.springer.com/10.1007/s11390-016-1696-5

  • Reddy C, Kruse M and Cohen A. Reduction Drawing. Proceedings of the 2016 International Conference on Parallel Architectures and Compilation. (87-97).

    https://doi.org/10.1145/2967938.2967950

  • Maleki S, Yang A and Burtscher M. (2016). Higher-order and tuple-based massively-parallel prefix sums. ACM SIGPLAN Notices. 51:6. (539-552). Online publication date: 1-Aug-2016.

    https://doi.org/10.1145/2980983.2908089

  • Maleki S, Yang A and Burtscher M. Higher-order and tuple-based massively-parallel prefix sums. Proceedings of the 37th ACM SIGPLAN Conference on Programming Language Design and Implementation. (539-552).

    https://doi.org/10.1145/2908080.2908089

  • Rajopadhye S, Renganarayana L, Mills Strout M and Gautam . (2007). Computations on Iteration Spaces. The Compiler Design Handbook. 10.1201/9781420043839.ch15. (15-1-15-52). Online publication date: 7-Dec-2007.

    http://www.crcnetbase.com/doi/10.1201/9781420043839.ch15