default search action
Michael Vollmer 0003
Person information
- affiliation: University of Kent, UK
- affiliation (former): Indiana University, Bloomington, IN, USA
Other persons with the same name
- Michael Vollmer 0001 — Karlsruhe Institute of Technology, Department of Informatics, Germany
- Michael Vollmer 0002 — Ruhr University Bochum, Germany
- Michael Vollmer 0004 — Tübingen University Hospital, Department of Oral and Maxillofacial Surgery, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j3]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) - [c11]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 - [c10]Chaitanya S. Koparkar
, Vidush Singhal
Garbage Collection for Mostly Serialized Heaps. ISMM 2024: 1-14 - [i2]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) - 2023
- [j2]Sarah Harris, Simon Cooksey, Michael Vollmer, Mark Batty:
Rust for Morello: Always-On Memory Safety, Even in Unsafe Code (Artifact). Dagstuhl Artifacts Ser. 9(2): 25:1-25:2 (2023) - [c9]Sarah Harris, Simon Cooksey, Michael Vollmer, Mark Batty:
Rust for Morello: Always-On Memory Safety, Even in Unsafe Code (Experience Paper). ECOOP 2023: 39:1-39:27 - [c8]Michael Vollmer:
A Language-Based Approach to Programming with Serialized Data. ELS 2023: 1 - 2022
- [c7]Danielle Marshall
Linearity and Uniqueness: An Entente Cordiale. ESOP 2022: 346-375 - 2021
- [j1]Chaitanya Koparkar, Mike Rainey, Michael Vollmer, Milind Kulkarni
Efficient tree-traversals: reconciling parallelism and dense data representations. Proc. ACM Program. Lang. 5(ICFP): 1-29 (2021) - [i1]Chaitanya Koparkar, Mike Rainey, Michael Vollmer, Milind Kulkarni, Ryan R. Newton:
Efficient Tree-Traversals: Reconciling Parallelism and Dense Data Representations. CoRR abs/2107.00522 (2021) - 2020
- [c6]Jack Hughes, Michael Vollmer, Dominic Orchard:
Deriving Distributive Laws for Graded Linear Types. Linearity&TLLA@IJCAR-FSCD 2020: 109-131
2010 – 2019
- 2019
- [c5]Michael Vollmer, Chaitanya Koparkar, Mike Rainey, Laith Sakka, Milind Kulkarni, Ryan R. Newton:
LoCal: a language for programs operating on serialized data. PLDI 2019: 48-62 - 2017
- [c4]Michael Vollmer, Sarah Spall, Buddhika Chamith, Laith Sakka, Chaitanya Koparkar, Milind Kulkarni, Sam Tobin-Hochstadt
Compiling Tree Transforms to Operate on Packed Representations. ECOOP 2017: 26:1-26:29 - [c3]Michael Vollmer, Ryan G. Scott, Madanlal Musuvathi, Ryan R. Newton:
SC-Haskell: Sequential Consistency in Languages That Minimize Mutable Shared Heap. PPoPP 2017: 283-298 - 2015
- [c2]Michael Vollmer, Bo Joel Svensson, Eric Holk, Ryan R. Newton:
Meta-programming and auto-tuning in the search for high performance GPU code. FHPC@ICFP 2015: 1-11 - [c1]Bo Joel Svensson, Michael Vollmer, Eric Holk, Trevor L. McDonell
Converting data-parallelism to task-parallelism by rewrites: purely functional programs across multiple GPUs. FHPC@ICFP 2015: 12-22
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-10-07 22:07 CEST 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: