default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAart J. C. Bik
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j19]Peiming Liu, Alexander J. Root, Anlun Xu, Yinying Li, Fredrik Kjolstad, Aart J. C. Bik:
Compiler Support for Sparse Tensor Convolutions. Proc. ACM Program. Lang. 8(OOPSLA2): 275-303 (2024)- [j18]Alexander J. Root, Bobby Yan, Peiming Liu, Christophe Gyurgyik, Aart J. C. Bik, Fredrik Kjolstad:
Compilation of Shape Operators on Sparse Arrays. Proc. ACM Program. Lang. 8(OOPSLA2): 1162-1188 (2024) - 2022
- [j17]Aart J. C. Bik, Penporn Koanantakool
, Tatiana Shpeisman, Nicolas Vasilache, Bixia Zheng, Fredrik Kjolstad:
Compiler Support for Sparse Tensor Computations in MLIR. ACM Trans. Archit. Code Optim. 19(4): 50:1-50:25 (2022) - [c17]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:
Structured Operations: Modular Design of Code Generators for Tensor Compilers. LCPC 2022: 141-156 - [i3]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:
Composable and Modular Code Generation in MLIR: A Structured and Retargetable Approach to Tensor Compiler Construction. CoRR abs/2202.03293 (2022) - [i2]Aart J. C. Bik, Penporn Koanantakool, Tatiana Shpeisman, Nicolas Vasilache, Bixia Zheng, Fredrik Kjolstad:
Compiler Support for Sparse Tensor Computations in MLIR. CoRR abs/2202.04305 (2022) - 2021
- [i1]Aart J. C. Bik:
A Note on Exhaustive State Space Search for Efficient Code Generation. CoRR abs/2107.00564 (2021)
2010 – 2019
- 2012
- [j16]Aart J. C. Bik:
Computing Deep Perft and Divide Numbers for Checkers. J. Int. Comput. Games Assoc. 35(4): 206-213 (2012) - 2010
- [c16]Grzegorz Malewicz, Matthew H. Austern, Aart J. C. Bik, James C. Dehnert, Ilan Horn, Naty Leiser, Grzegorz Czajkowski:
Pregel: a system for large-scale graph processing. SIGMOD Conference 2010: 135-146
2000 – 2009
- 2009
- [c15]Grzegorz Malewicz, Matthew H. Austern, Aart J. C. Bik, James C. Dehnert, Ilan Horn, Naty Leiser, Grzegorz Czajkowski:
Pregel: a system for large-scale graph processing. PODC 2009: 6 - [c14]Grzegorz Malewicz, Matthew H. Austern, Aart J. C. Bik, James C. Dehnert, Ilan Horn, Naty Leiser, Grzegorz Czajkowski:
Pregel: a system for large-scale graph processing. SPAA 2009: 48 - 2008
- [j15]Aart J. C. Bik, David L. Kreitzer, Xinmin Tian:
A Case Study on Compiler Optimizations for the Intel® CoreTM 2 Duo Processor. Int. J. Parallel Program. 36(6): 571-591 (2008) - 2006
- [j14]Aart J. C. Bik, Xinmin Tian, Milind Girkar:
Multimedia vectorization of floating-point MIN/MAX reductions. Concurr. Comput. Pract. Exp. 18(9): 997-1007 (2006) - 2005
- [j13]Xinmin Tian, Milind Girkar, Aart J. C. Bik, Hideki Saito:
Practical Compiler Techniques on Efficient Multithreaded Code Generation for OpenMP Programs. Comput. J. 48(5): 588-601 (2005) - 2002
- [j12]Aart J. C. Bik, Milind Girkar, Paul M. Grey, Xinmin Tian:
Automatic Intra-Register Vectorization for the Intel? Architecture. Int. J. Parallel Program. 30(2): 65-98 (2002) - [c13]Aart J. C. Bik, Milind Girkar, Paul M. Grey, Xinmin Tian:
Automatic Detection of Saturation and Clipping Idioms. LCPC 2002: 61-74
1990 – 1999
- 1999
- [j11]Aart J. C. Bik, Harry A. G. Wijshoff:
Automatic Nonzero Structure Analysis. SIAM J. Comput. 28(5): 1576-1587 (1999) - [j10]Aart J. C. Bik, Milind Girkar, Mohammad R. Haghighat:
Incorporating Intel MMX technology into a Java JIT compiler. Sci. Program. 7(1): 167-184 (1999) - 1998
- [j9]Aart J. C. Bik, Dennis Gannon:
A prototype bytecode parallelization tool. Concurr. Pract. Exp. 10(11-13): 879-885 (1998) - [j8]Aart J. C. Bik, Peter Brinkhaus, Peter M. W. Knijnenburg, Harry A. G. Wijshoff:
The Automatic Generation of Sparse Primitives. ACM Trans. Math. Softw. 24(2): 190-225 (1998) - 1997
- [j7]Aart J. C. Bik, Dennis Gannon:
Automatically exploiting implicit parallelism in Java. Concurr. Pract. Exp. 9(6): 579-619 (1997) - [j6]Aart J. C. Bik, Dennis Gannon:
A Note on Native Level 1 BLAS in Java. Concurr. Pract. Exp. 9(11): 1091-1099 (1997) - [j5]Aart J. C. Bik, Juan E. Villacis, Dennis Gannon:
javar: A Prototype Java Restructuring Compiler. Concurr. Pract. Exp. 9(11): 1181-1191 (1997) - [j4]Aart J. C. Bik, Harry A. G. Wijshoff:
Iteration space partitioning. Future Gener. Comput. Syst. 12(5): 421-429 (1997) - [c12]Bret A. Marsolf, Aart J. C. Bik, Kyle A. Gallivan, Harry A. G. Wijshoff:
The Generation of Optimized Codes Using Nonzero Structure Analysis. ISHPC 1997: 1-29 - [c11]Aart J. C. Bik, Juan E. Villacis, Dennis Gannon:
Experience with Loop Parallelization in javar (A Prototype Restructuring Compiler for Java). LCPC 1997: 355-366 - 1996
- [j3]Aart J. C. Bik, Harry A. G. Wijshoff:
The Use of Iteration Space Partitioning to Construct Representative Simple Sections. J. Parallel Distributed Comput. 34(1): 95-110 (1996) - [j2]Aart J. C. Bik, Harry A. G. Wijshoff:
Automatic Data Structure Selection and Transformation for Sparse Matrix Computations. IEEE Trans. Parallel Distributed Syst. 7(2): 109-126 (1996) - [c10]Aart J. C. Bik, Harry A. G. Wijshoff:
Iteration Space Partitioning. HPCN Europe 1996: 475-484 - [c9]Aart J. C. Bik, Harry A. G. Wijshoff:
Simple Quantitative Experiments with a Sparse Compiler. IRREGULAR 1996: 249-262 - [c8]Aart J. C. Bik, Harry A. G. Wijshoff:
Simple Qualitative Experiments with a Sparse Compiler. LCPC 1996: 466-480 - 1995
- [j1]Aart J. C. Bik, Harry A. G. Wijshoff:
Advanced Compiler Optimizations for Sparse Computations. J. Parallel Distributed Comput. 31(1): 14-24 (1995) - [c7]Aart J. C. Bik, Harry A. G. Wijshoff:
Construction of Representative Simple Sections. ICPP (2) 1995: 9-18 - [c6]Aart J. C. Bik, Harry A. G. Wijshoff:
Annotations for a Sparse Compiler. LCPC 1995: 500-514 - 1994
- [c5]Aart J. C. Bik, Harry A. G. Wijshoff:
Nonzero structure analysis. International Conference on Supercomputing 1994: 226-235 - [c4]Aart J. C. Bik, Peter M. W. Knijnenburg, Harry A. G. Wijshoff:
Reshaping Access Patterns for Generating Sparse Codes. LCPC 1994: 406-420 - 1993
- [c3]Aart J. C. Bik, Harry A. G. Wijshoff:
Compilation Techniques for Sparse Matrix Computations. International Conference on Supercomputing 1993: 416-424 - [c2]Aart J. C. Bik, Harry A. G. Wijshoff:
On Automatic Data Structure Selection and Code Generation for Sparse Computations. LCPC 1993: 57-75 - [c1]Aart J. C. Bik, Harry A. G. Wijshoff:
Advanced compiler optimizations for sparse computations. SC 1993: 430-439
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-21 21:23 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
