E-LIB Suche - Ergebnisse für: Koparkar, Chaitanya

1

A Primer on Property-Based Testing:

Koparkar, Chaitanya
XRDS: Crossroads, The ACM Magazine for Students. 30 (2023) 2 - p. 40-41 , 2023

Link: https://doi.org/10.1145/..

2

Game Development Using TIC-80:

Koparkar, Chaitanya
XRDS: Crossroads, The ACM Magazine for Students. 30 (2023) 1 - p. 76-77 , 2023

Link: https://doi.org/10.1145/..

3

Visualizing Mathematics Using Penrose:

Koparkar, Chaitanya
XRDS: Crossroads, The ACM Magazine for Students. 29 (2023) 4 - p. 62-63 , 2023

Link: https://doi.org/10.1145/..

4

Efficient Data Representation Using FlatBuffers:

Koparkar, Chaitanya
XRDS: Crossroads, The ACM Magazine for Students. 29 (2022) 2 - p. 50-51 , 2022

Link: https://doi.org/10.1145/..

5

A primer on pointer tagging:

Koparkar, Chaitanya
XRDS: Crossroads, The ACM Magazine for Students. 29 (2022) 1 - p. 66-68 , 2022

Link: https://doi.org/10.1145/..

6

Making GHC whole again or, how to perform whole-program ana..:

Koparkar, Chaitanya
XRDS: Crossroads, The ACM Magazine for Students. 28 (2022) 2 - p. 80-81 , 2022

Link: https://dl.acm.org/doi/1..

7

Efficient tree-traversals: reconciling parallelism and dens..:

Koparkar, Chaitanya ; Rainey, Mike ; Vollmer, Michael..
Proceedings of the ACM on Programming Languages. 5 (2021) ICFP - p. 1-29 , 2021

Link: https://doi.org/10.1145/..

8

Making GHC whole again or, how to perform whole-program ana..:

Koparkar, Chaitanya
XRDS: Crossroads, The ACM Magazine for Students. 28 (2021) 2 - p. 80-81 , 2021

Link: https://doi.org/10.1145/..

9

Efficient tree-traversals: reconciling parallelism and dens..:

Koparkar, Chaitanya ; Rainey, Mike ; Vollmer, Michael..
Proceedings of the ACM on Programming Languages. 5 (2021) ICFP - p. 1-29 , 2021

Link: https://dl.acm.org/doi/1..

10

LoCal: a language for programs operating on serialized data:

, In: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation,

Vollmer, Michael ; Koparkar, Chaitanya ; Rainey, Mike... - p. 48-62 , 2019

Link: https://dl.acm.org/doi/1..

11

Garbage Collection for Mostly Serialized Heaps:

, In: Proceedings of the 2024 ACM SIGPLAN International Symposium on Memory Management,

Koparkar, Chaitanya S. ; Singhal, Vidush ; Gupta, Aditya... - p. 1-14 , 2024

Link: https://dl.acm.org/doi/1..

12

Artifact for "Efficient Tree-Traversals: Reconciling Parall..:

Koparkar, Chaitanya ; Rainey, Mike ; Vollmer, Michael..
doi:10.5281/zenodo.4780569. , 2021

Link: https://zenodo.org/recor..

13

Artifact for "Efficiently Compiling Tree-Traversals: Reconc..:

Koparkar, Chaitanya ; Rainey, Mike ; Vollmer, Michael..
doi:10.5281/zenodo.4780569. , 2021

Link: https://zenodo.org/recor..

14

Efficient Tree-Traversals: Reconciling Parallelism and Dens..:

Koparkar, Chaitanya ; Rainey, Mike ; Vollmer, Michael..
http://arxiv.org/abs/2107.00522. , 2021

Link: http://arxiv.org/abs/210..

15

Artifact for "Efficient Tree-Traversals: Reconciling Parall..:

Koparkar, Chaitanya ; Rainey, Mike ; Vollmer, Michael..
doi:10.5281/zenodo.4780569. , 2021

Link: https://zenodo.org/recor..