default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEric Atkinson
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[b1]Eric Atkinson:
A Language and Logic for Programming and Reasoning with Partial Observability. MIT, USA, 2024- 2023
- [j5]Junrui Liu
, Yanju Chen, Eric Atkinson, Yu Feng, Rastislav Bodík:
Conflict-Driven Synthesis for Layout Engines. Proc. ACM Program. Lang. 7(PLDI): 638-659 (2023) - [i7]Eric Atkinson, Ellie Y. Cheng, Guillaume Baudart, Louis Mandel, Michael Carbin:
Verifying Performance Properties of Probabilistic Inference. CoRR abs/2307.07355 (2023) - 2022
- [j4]Eric Atkinson, Charles Yuan, Guillaume Baudart, Louis Mandel, Michael Carbin:
Semi-symbolic inference for efficient streaming probabilistic programming. Proc. ACM Program. Lang. 6(OOPSLA2): 1668-1696 (2022) - [i6]Eric Atkinson, Charles Yuan, Guillaume Baudart, Louis Mandel, Michael Carbin:
Semi-Symbolic Inference for Efficient Streaming Probabilistic Programming. CoRR abs/2209.07490 (2022) - 2021
- [j3]Eric Atkinson, Guillaume Baudart, Louis Mandel, Charles Yuan, Michael Carbin:
Statically bounded-memory delayed sampling for probabilistic streams. Proc. ACM Program. Lang. 5(OOPSLA): 1-28 (2021) - [j2]Cambridge Yang, Eric Atkinson, Michael Carbin:
Simplifying dependent reductions in the polyhedral model. Proc. ACM Program. Lang. 5(POPL): 1-33 (2021) - [i5]Eric Atkinson, Michael Carbin:
Programming and Reasoning with Partial Observability. CoRR abs/2101.04742 (2021) - [i4]Eric Atkinson, Guillaume Baudart, Louis Mandel, Charles Yuan, Michael Carbin:
Statically Bounded-Memory Delayed Sampling for Probabilistic Streams. CoRR abs/2109.12473 (2021) - 2020
- [j1]Eric Atkinson, Michael Carbin:
Programming and reasoning with partial observability. Proc. ACM Program. Lang. 4(OOPSLA): 200:1-200:28 (2020) - [c3]Guillaume Baudart, Louis Mandel, Eric Atkinson, Benjamin Sherman, Marc Pouzet, Michael Carbin:
Reactive probabilistic programming. PLDI 2020: 898-912 - [i3]Cambridge Yang, Eric Atkinson, Michael Carbin:
Simplifying Multiple-Statement Reductions with the Polyhedral Model. CoRR abs/2007.11203 (2020)
2010 – 2019
- 2019
- [c2]Yishen Chen, Ajay Brahmakshatriya, Charith Mendis, Alex Renda, Eric Atkinson, Ondrej Sýkora, Saman P. Amarasinghe, Michael Carbin:
BHive: A Benchmark Suite and Measurement Framework for Validating x86-64 Basic Block Performance Models. IISWC 2019: 167-177 - [i2]Guillaume Baudart, Louis Mandel, Eric Atkinson, Benjamin Sherman, Marc Pouzet, Michael Carbin:
Reactive Probabilistic Programming. CoRR abs/1908.07563 (2019) - 2018
- [i1]Eric Atkinson, Cambridge Yang, Michael Carbin:
Verifying Handcoded Probabilistic Inference Procedures. CoRR abs/1805.01863 (2018) - 2013
- [c1]Leo A. Meyerovich, Matthew E. Torok, Eric Atkinson, Rastislav Bodík:
Parallel schedule synthesis for attribute grammars. PPoPP 2013: 187-196
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-08-29 21:53 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:
