Compilation Techniques for Sparse Matrix Computations. - Aart J. C. Bik; Harry A. G. Wijshoff (International Conference on Supercomputing, 1993)

On Automatic Data Structure Selection and Code Generation for Sparse Computations. - Aart J. C. Bik; Harry A. G. Wijshoff (LCPC, 1993)

Nonzero structure analysis. - Aart J. C. Bik; Harry A. G. Wijshoff (International Conference on Supercomputing, 1994)

Reshaping Access Patterns for Generating Sparse Codes. - Aart J. C. Bik; Peter M. W. Knijnenburg; Harry A. G. Wijshoff (LCPC, 1994)

Construction of Representative Simple Sections. - Aart J. C. Bik; Harry A. G. Wijshoff (ICPP (2), 1995)

Annotations for a Sparse Compiler. - Aart J. C. Bik; Harry A. G. Wijshoff (LCPC, 1995)

Advanced Compiler Optimizations for Sparse Computations. - Aart J. C. Bik; Harry A. G. Wijshoff (J. Parallel Distributed Comput., 1995)

Simple Quantitative Experiments with a Sparse Compiler. - Aart J. C. Bik; Harry A. G. Wijshoff (IRREGULAR, 1996)

Simple Qualitative Experiments with a Sparse Compiler. - Aart J. C. Bik; Harry A. G. Wijshoff (LCPC, 1996)

The Use of Iteration Space Partitioning to Construct Representative Simple Sections. - Aart J. C. Bik; Harry A. G. Wijshoff (J. Parallel Distributed Comput., 1996)

Automatic Data Structure Selection and Transformation for Sparse Matrix Computations. - Aart J. C. Bik; Harry A. G. Wijshoff (IEEE Trans. Parallel Distributed Syst., 1996)

The Generation of Optimized Codes Using Nonzero Structure Analysis. - Bret A. Marsolf; Aart J. C. Bik; Kyle A. Gallivan; Harry A. G. Wijshoff (ISHPC, 1997)

Experience with Loop Parallelization in javar (A Prototype Restructuring Compiler for Java). - Aart J. C. Bik; Juan E. Villacis; Dennis Gannon (LCPC, 1997)

A Note on Native Level 1 BLAS in Java. - Aart J. C. Bik; Dennis Gannon (Concurr. Pract. Exp., 1997)

Automatically exploiting implicit parallelism in Java. - Aart J. C. Bik; Dennis Gannon (Concurr. Pract. Exp., 1997)

javar: A Prototype Java Restructuring Compiler. - Aart J. C. Bik; Juan E. Villacis; Dennis Gannon (Concurr. Pract. Exp., 1997)

Iteration space partitioning. - Aart J. C. Bik; Harry A. G. Wijshoff (Future Gener. Comput. Syst., 1997)

A prototype bytecode parallelization tool. - Aart J. C. Bik; Dennis Gannon (Concurr. Pract. Exp., 1998)

The Automatic Generation of Sparse Primitives. - Aart J. C. Bik; Peter Brinkhaus; Peter M. W. Knijnenburg; Harry A. G. Wijshoff (ACM Trans. Math. Softw., 1998)

Automatic Nonzero Structure Analysis. - Aart J. C. Bik; Harry A. G. Wijshoff (SIAM J. Comput., 1999)

Incorporating Intel MMX technology into a Java JIT compiler. - Aart J. C. Bik; Milind Girkar; Mohammad R. Haghighat (Sci. Program., 1999)

Automatic Detection of Saturation and Clipping Idioms. - Aart J. C. Bik; Milind Girkar; Paul M. Grey; Xinmin Tian (LCPC, 2002)

Automatic Intra-Register Vectorization for the Intel? Architecture. - Aart J. C. Bik; Milind Girkar; Paul M. Grey; Xinmin Tian (Int. J. Parallel Program., 2002)

Practical Compiler Techniques on Efficient Multithreaded Code Generation for OpenMP Programs. - Xinmin Tian; Milind Girkar; Aart J. C. Bik; Hideki Saito 001 (Comput. J., 2005)

Multimedia vectorization of floating-point MIN/MAX reductions. - Aart J. C. Bik; Xinmin Tian; Milind Girkar (Concurr. Comput. Pract. Exp., 2006)

A Case Study on Compiler Optimizations for the Intel® CoreTM 2 Duo Processor. - Aart J. C. Bik; David L. Kreitzer; Xinmin Tian (Int. J. Parallel Program., 2008)

Pregel: a system for large-scale graph processing. - Grzegorz Malewicz; Matthew H. Austern; Aart J. C. Bik; James C. Dehnert; Ilan Horn; Naty Leiser; Grzegorz Czajkowski (SIGMOD Conference, 2010)

Computing Deep Perft and Divide Numbers for Checkers. - Aart J. C. Bik (J. Int. Comput. Games Assoc., 2012)

A Note on Exhaustive State Space Search for Efficient Code Generation. - Aart J. C. Bik (CoRR, 2021)

Structured Operations: Modular Design of Code Generators for Tensor Compilers. - Nicolas Vasilache; Oleksandr Zinenko; Aart J. C. Bik; Mahesh Ravishankar; Thomas Raoux; Alexander Belyaev; Matthias Springer; Tobias Gysi; Diego Caballero; Stephan Herhut; Stella Laurenzo; Albert Cohen 001 (LCPC, 2022)

Composable and Modular Code Generation in MLIR: A Structured and Retargetable Approach to Tensor Compiler Construction. - Nicolas Vasilache; Oleksandr Zinenko; Aart J. C. Bik; Mahesh Ravishankar; Thomas Raoux; Alexander Belyaev; Matthias Springer; Tobias Gysi; Diego Caballero; Stephan Herhut; Stella Laurenzo; Albert Cohen 001 (CoRR, 2022)

Compiler Support for Sparse Tensor Computations in MLIR. - Aart J. C. Bik; Penporn Koanantakool; Tatiana Shpeisman; Nicolas Vasilache; Bixia Zheng; Fredrik Kjolstad (ACM Trans. Archit. Code Optim., 2022)

Jaxpruner: A Concise Library for Sparsity Research. - Joo Hyung Lee; Wonpyo Park; Nicole Mitchell; Jonathan Pilault; Johan Samir Obando Ceron; Han-Byul Kim; Namhoon Lee; Elias Frantar; Yun Long; Amir Yazdanbakhsh; Woohyun Han; Shivani Agrawal; et al. (CPAL, 2024)

Compiler Support for Sparse Tensor Convolutions. - Peiming Liu; Alexander J. Root; Anlun Xu; Yinying Li; Fredrik Kjolstad; Aart J. C. Bik (Proc. ACM Program. Lang., 2024)

Compilation of Shape Operators on Sparse Arrays. - Alexander J. Root; Bobby Yan; Peiming Liu; Christophe Gyurgyik; Aart J. C. Bik; Fredrik Kjolstad (Proc. ACM Program. Lang., 2024)