Arun Chauhan 0001

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Eric Holk

> Home > Persons > Arun Chauhan 0001

Publications

2015
[c30]
- view
  authority control:
- export record
  dblp key:
  - conf/lcpc/MahajanHCL15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/lcpc/MahajanHCL15
Nilesh Mahajan, Eric Holk, Arun Chauhan, Andrew Lumsdaine:
An Embedded DSL for High Performance Declarative Communication with Correctness Guarantees in C++. LCPC 2015: 206-220
2013
[c23]
- view
  authority control:
- export record
  dblp key:
  - conf/ipps/HolkPCLM13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ipps/HolkPCLM13
Eric Holk, Milinda Pathirage, Arun Chauhan, Andrew Lumsdaine, Nicholas D. Matsakis:
GPU Programming in Rust: Implementing High-Level Abstractions in a Systems-Level Language. IPDPS Workshops 2013: 315-324
2011
[c14]
- view
  authority control:
- export record
  dblp key:
  - conf/padl/HolkBWHCL11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/padl/HolkBWHCL11
Eric Holk, William E. Byrd, Jeremiah Willcock, Torsten Hoefler, Arun Chauhan, Andrew Lumsdaine:
Kanor - A Declarative Language for Explicit Communication. PADL 2011: 190-204
[c13]
- view
  authority control:
- export record
  dblp key:
  - conf/parco/HolkBMWCL11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/parco/HolkBMWCL11
Eric Holk, William E. Byrd, Nilesh Mahajan, Jeremiah Willcock, Arun Chauhan, Andrew Lumsdaine:
Declarative Parallel Programming for GPUs. PARCO 2011: 297-304

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.