default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEric Papenhausen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i3]Yanming Zhang, Akshith Kota, Eric Papenhausen, Klaus Mueller:
CausalChat: Interactive Causal Model Development and Refinement Using Large Language Models. CoRR abs/2410.14146 (2024)- 2023
- [i2]Darius Coelho, Nikita Gupta, Eric Papenhausen, Klaus Mueller:
Patterns of Social Vulnerability - An Interactive Dashboard to Explore Risks to Public Health on the US County Level. CoRR abs/2301.02946 (2023) - [i1]Yanming Zhang, Brette Fitzgibbon, Dino Garofolo, Akshith Kota, Eric Papenhausen, Klaus Mueller:
An Explainable AI Approach to Large Language Model Assisted Causal Model Auditing and Development. CoRR abs/2312.16211 (2023) - 2022
- [c6]Darius Coelho, Nikita Gupta, Eric Papenhausen, Klaus Mueller:
Patterns of Social Vulnerability - An Interactive Dashboard to Explore Risks to Public Health on the US County Level. VAHC 2022: 1-9 - 2021
- [j3]Klaus Mueller, Eric Papenhausen:
Using Demographic Pattern Analysis to Predict COVID-19 Fatalities on the US County Level. Digit. Gov. Res. Pract. 2(1): 12:1-12:11 (2021) - 2020
- [c5]Harper Langston, Pierre-David Letourneau, Julia Wei, Larry Weintraub, Mitchell Tong Harris, Richard Lethin, Eric Papenhausen, Meifeng Lin:
Approximate Inverse Chain Preconditioner: Iteration Count Case Study for Spectral Support Solvers. HPEC 2020: 1-8
2010 – 2019
- 2019
- [j2]Eric Papenhausen, Matthew Harper Langston, Benoît Meister, Richard Lethin, Klaus Mueller:
PUMA-V: Optimizing Parallel Code Performance Through Interactive Visualization. IEEE Computer Graphics and Applications 39(1): 84-99 (2019) - [c4]Benoît Meister, Eric Papenhausen, Benoît Pradelle:
Polyhedral Tensor Schedulers. HPCS 2019: 504-512 - 2018
- [j1]Eric Papenhausen, Klaus Mueller:
Coding Ants: Optimization of GPU code using ant colony optimization. Comput. Lang. Syst. Struct. 54: 119-138 (2018) - 2016
- [c3]Eric Papenhausen, Klaus Mueller, Harper Langston, Benoît Meister, Richard Lethin:
An Interactive Visual Tool for Code Optimization and Parallelization Based on the Polyhedral Model. ICPP Workshops 2016: 309-318 - 2015
- [c2]Eric Papenhausen, Bing Wang, Harper Langston, Muthu Manikandan Baskaran, Thomas Henretty, Taku Izubuchi, Ann Johnson, Chulwoo Jung, Meifeng Lin, Benoît Meister, Klaus Mueller, Richard Lethin:
Polyhedral user mapping and assistant visualizer tool for the r-stream auto-parallelizing compiler. VISSOFT 2015: 180-184 - 2013
- [c1]Eric Papenhausen, Bing Wang, Sungsoo Ha, Alla Zelenyuk
, Dan Imre, Klaus Mueller:
GPU-accelerated incremental correlation clustering of large data with visual feedback. IEEE BigData 2013: 63-70
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-07 01:18 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:
