Aart J. C. Bik

Orcid: 0000-0002-0333-7413

According to our database1, Aart J. C. Bik authored at least 32 papers between 1993 and 2022.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
Compiler Support for Sparse Tensor Computations in MLIR.
ACM Trans. Archit. Code Optim., 2022

Composable and Modular Code Generation in MLIR: A Structured and Retargetable Approach to Tensor Compiler Construction.
CoRR, 2022

Structured Operations: Modular Design of Code Generators for Tensor Compilers.
Proceedings of the Languages and Compilers for Parallel Computing, 2022

2021
A Note on Exhaustive State Space Search for Efficient Code Generation.
CoRR, 2021

2012
Computing Deep Perft and Divide Numbers for Checkers.
J. Int. Comput. Games Assoc., 2012

2010
Pregel: a system for large-scale graph processing.
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2010

2008
A Case Study on Compiler Optimizations for the Intel<sup>®</sup> Core<sup>TM</sup> 2 Duo Processor.
Int. J. Parallel Program., 2008

2006
Multimedia vectorization of floating-point MIN/MAX reductions.
Concurr. Comput. Pract. Exp., 2006

2005
Practical Compiler Techniques on Efficient Multithreaded Code Generation for OpenMP Programs.
Comput. J., 2005

2002
Automatic Intra-Register Vectorization for the Intel? Architecture.
Int. J. Parallel Program., 2002

Automatic Detection of Saturation and Clipping Idioms.
Proceedings of the Languages and Compilers for Parallel Computing, 15th Workshop, 2002

1999
Incorporating Intel MMX technology into a Java JIT compiler.
Sci. Program., 1999

Automatic Nonzero Structure Analysis.
SIAM J. Comput., 1999

1998
The Automatic Generation of Sparse Primitives.
ACM Trans. Math. Softw., 1998

A prototype bytecode parallelization tool.
Concurr. Pract. Exp., 1998

1997
Iteration space partitioning.
Future Gener. Comput. Syst., 1997

javar: A Prototype Java Restructuring Compiler.
Concurr. Pract. Exp., 1997

Automatically exploiting implicit parallelism in Java.
Concurr. Pract. Exp., 1997

A Note on Native Level 1 BLAS in Java.
Concurr. Pract. Exp., 1997

Experience with Loop Parallelization in javar (A Prototype Restructuring Compiler for Java).
Proceedings of the Languages and Compilers for Parallel Computing, 1997

The Generation of Optimized Codes Using Nonzero Structure Analysis.
Proceedings of the High Performance Computing, International Symposium, 1997

1996
Automatic Data Structure Selection and Transformation for Sparse Matrix Computations.
IEEE Trans. Parallel Distributed Syst., 1996

The Use of Iteration Space Partitioning to Construct Representative Simple Sections.
J. Parallel Distributed Comput., 1996

Simple Qualitative Experiments with a Sparse Compiler.
Proceedings of the Languages and Compilers for Parallel Computing, 1996

Simple Quantitative Experiments with a Sparse Compiler.
Proceedings of the Parallel Algorithms for Irregularly Structured Problems, 1996

1995
Advanced Compiler Optimizations for Sparse Computations.
J. Parallel Distributed Comput., 1995

Annotations for a Sparse Compiler.
Proceedings of the Languages and Compilers for Parallel Computing, 1995

Construction of Representative Simple Sections.
Proceedings of the 1995 International Conference on Parallel Processing, 1995

1994
Reshaping Access Patterns for Generating Sparse Codes.
Proceedings of the Languages and Compilers for Parallel Computing, 1994

Nonzero structure analysis.
Proceedings of the 8th international conference on Supercomputing, 1994

1993
On Automatic Data Structure Selection and Code Generation for Sparse Computations.
Proceedings of the Languages and Compilers for Parallel Computing, 1993

Compilation Techniques for Sparse Matrix Computations.
Proceedings of the 7th international conference on Supercomputing, 1993


  Loading...