Artem Pelenitsyn

Orcid: 0000-0001-8334-8106

According to our database1, Artem Pelenitsyn authored at least 13 papers between 2015 and 2024.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Optimizing Layout of Recursive Datatypes with Marmoset (Artifact).
Dagstuhl Artifacts Ser., 2024

SABLE: Staging Blocked Evaluation of Sparse Matrix Computations.
CoRR, 2024

Optimizing Layout of Recursive Datatypes with Marmoset.
CoRR, 2024

Garbage Collection for Mostly Serialized Heaps.
Proceedings of the 2024 ACM SIGPLAN International Symposium on Memory Management, 2024

Arkade: k-Nearest Neighbor Search With Non-Euclidean Distances using GPU Ray Tracing.
Proceedings of the 38th ACM International Conference on Supercomputing, 2024

Optimizing Layout of Recursive Datatypes with Marmoset: Or, Algorithms {+} Data Layouts {=} Efficient Programs.
Proceedings of the 38th European Conference on Object-Oriented Programming, 2024

2023
SparseAuto: An Auto-Scheduler for Sparse Tensor Computations Using Recursive Loop Nest Restructuring.
CoRR, 2023

Approximating Type Stability in the Julia JIT (Work in Progress).
Proceedings of the 15th ACM SIGPLAN International Workshop on Virtual Machines and Intermediate Languages, 2023

2021
Type stability in Julia: avoiding performance pathologies in JIT compilation.
Proc. ACM Program. Lang., 2021

Type Stability in Julia: Avoiding Performance Pathologies in JIT Compilation (Extended Version).
CoRR, 2021

2018
Julia subtyping: a rational reconstruction.
Proc. ACM Program. Lang., 2018

Can we learn some PL theory?: how to make use of a corpus of subtype checks.
Proceedings of the Companion Proceedings for the ISSTA/ECOOP 2018 Workshops, 2018

2015
Associated types and constraint propagation for generic programming in Scala.
Program. Comput. Softw., 2015


  Loading...