default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArtem Pelenitsyn
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j5]Vidush Singhal, Chaitanya Koparkar, Joseph Zullo, Artem Pelenitsyn, Michael Vollmer, Mike Rainey, Ryan Newton, Milind Kulkarni:
Optimizing Layout of Recursive Datatypes with Marmoset (Artifact). Dagstuhl Artifacts Ser. 10(2): 21:1-21:10 (2024)- [j4]Adhitha Dias
, Logan Anderson, Kirshanthan Sundararajah, Artem Pelenitsyn, Milind Kulkarni:
SparseAuto: An Auto-scheduler for Sparse Tensor Computations using Recursive Loop Nest Restructuring. Proc. ACM Program. Lang. 8(OOPSLA2): 527-556 (2024) - [c5]Vidush Singhal, Chaitanya Koparkar, Joseph Zullo, Artem Pelenitsyn, Michael Vollmer, Mike Rainey, Ryan Newton, Milind Kulkarni:
Optimizing Layout of Recursive Datatypes with Marmoset: Or, Algorithms {+} Data Layouts {=} Efficient Programs. ECOOP 2024: 38:1-38:28 - [c4]Durga Keerthi Mandarapu, Vani Nagarajan, Artem Pelenitsyn, Milind Kulkarni:
Arkade: k-Nearest Neighbor Search With Non-Euclidean Distances using GPU Ray Tracing. ICS 2024: 14-25 - [c3]Chaitanya S. Koparkar, Vidush Singhal, Aditya Gupta, Mike Rainey, Michael Vollmer, Artem Pelenitsyn, Sam Tobin-Hochstadt, Milind Kulkarni, Ryan R. Newton:
Garbage Collection for Mostly Serialized Heaps. ISMM 2024: 1-14 - [i4]Vidush Singhal, Chaitanya Koparkar, Joseph Zullo, Artem Pelenitsyn, Michael Vollmer, Mike Rainey, Ryan Newton, Milind Kulkarni:
Optimizing Layout of Recursive Datatypes with Marmoset. CoRR abs/2405.17590 (2024) - [i3]Pratyush Das, Adhitha Dias, Anxhelo Xhebraj, Artem Pelenitsyn, Kirshanthan Sundararajah, Milind Kulkarni:
SABLE: Staging Blocked Evaluation of Sparse Matrix Computations. CoRR abs/2407.00829 (2024) - 2023
- [c2]Artem Pelenitsyn:
Approximating Type Stability in the Julia JIT (Work in Progress). VMIL@SPLASH 2023: 83-87 - [i2]Adhitha Dias, Logan Anderson, Kirshanthan Sundararajah, Artem Pelenitsyn, Milind Kulkarni:
SparseAuto: An Auto-Scheduler for Sparse Tensor Computations Using Recursive Loop Nest Restructuring. CoRR abs/2311.09549 (2023) - 2021
- [j3]Artem Pelenitsyn, Julia Belyakova, Benjamin Chung, Ross Tate, Jan Vitek:
Type stability in Julia: avoiding performance pathologies in JIT compilation. Proc. ACM Program. Lang. 5(OOPSLA): 1-26 (2021) - [d1]Artem Pelenitsyn, Julia Belyakova, Benjamin Chung, Ross Tate, Jan Vitek:
Type Stability in Julia: Avoiding Performance Pathologies in JIT Compilation (Artifact). Zenodo, 2021
- [i1]Artem Pelenitsyn, Julia Belyakova, Benjamin Chung, Ross Tate, Jan Vitek:
Type Stability in Julia: Avoiding Performance Pathologies in JIT Compilation (Extended Version). CoRR abs/2109.01950 (2021)
2010 – 2019
- 2018
- [j2]Francesco Zappa Nardelli, Julia Belyakova, Artem Pelenitsyn, Benjamin Chung, Jeff Bezanson, Jan Vitek:
Julia subtyping: a rational reconstruction. Proc. ACM Program. Lang. 2(OOPSLA): 113:1-113:27 (2018) - [c1]Artem Pelenitsyn:
Can we learn some PL theory?: how to make use of a corpus of subtype checks. ISSTA/ECOOP Workshops 2018: 13 - 2015
- [j1]Artem Pelenitsyn:
Associated types and constraint propagation for generic programming in Scala. Program. Comput. Softw. 41(4): 224-230 (2015)
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 2025-01-21 00:05 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:
