![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Samuel Coward
Person information
Refine list
![note](https://dblp.dagstuhl.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c11]Samuel Coward, Theo Drane, Emiliano Morini, George A. Constantinides:
Combining Power and Arithmetic Optimization via Datapath Rewriting. ARITH 2024: 24-31 - [c10]Theo Drane, Samuel Coward, Mertcan Temel, Joe Leslie-Hurd:
On the Systematic Creation of Faithfully Rounded Commutative Truncated Booth Multipliers. ARITH 2024: 108-115 - [c9]Jianyi Cheng
, Samuel Coward
, Lorenzo Chelini
, Rafael Barbalho
, Theo Drane
:
SEER: Super-Optimization Explorer for High-Level Synthesis using E-graph Rewriting. ASPLOS (2) 2024: 1029-1044 - [i16]Michael Beukman, Samuel Coward, Michael T. Matthews, Mattie Fellows, Minqi Jiang, Michael Dennis, Jakob N. Foerster:
Refining Minimax Regret for Unsupervised Environment Design. CoRR abs/2402.12284 (2024) - [i15]Michael T. Matthews, Michael Beukman, Benjamin Ellis, Mikayel Samvelyan, Matthew Thomas Jackson, Samuel Coward, Jakob N. Foerster:
Craftax: A Lightning-Fast Benchmark for Open-Ended Reinforcement Learning. CoRR abs/2402.16801 (2024) - [i14]Samuel Coward, Michael Beukman, Jakob N. Foerster:
JaxUED: A simple and useable UED library in Jax. CoRR abs/2403.13091 (2024) - [i13]Samuel Coward, Theo Drane, Emiliano Morini, George A. Constantinides:
Combining Power and Arithmetic Optimization via Datapath Rewriting. CoRR abs/2404.12336 (2024) - [i12]Theo Drane, Samuel Coward, Mertcan Temel, Joe Leslie-Hurd:
On the Systematic Creation of Faithfully Rounded Commutative Truncated Booth Multipliers. CoRR abs/2404.14069 (2024) - [i11]Samuel Coward, Theo Drane, George A. Constantinides:
ROVER: RTL Optimization via Verified E-Graph Rewriting. CoRR abs/2406.12421 (2024) - 2023
- [c8]Andy Wanna, Samuel Coward, Theo Drane, George A. Constantinides, Milos D. Ercegovac:
Multiplier Optimization via E-Graph Rewriting. ACSSC 2023: 1528-1533 - [c7]Bryce Orloski, Samuel Coward, Theo Drane:
Automatic Generation of Complete Polynomial Interpolation Design Space for Hardware Architectures. ASP-DAC 2023: 573-578 - [c6]Samuel Coward, George A. Constantinides, Theo Drane:
Automating Constraint-Aware Datapath Optimization using E-Graphs. DAC 2023: 1-6 - [c5]Samuel Coward, Emiliano Morini, Bryan Tan, Theo Drane, George A. Constantinides:
Datapath Verification via Word-Level E-Graph Rewriting. FMCAD 2023: 92-100 - [c4]Samuel Coward, George A. Constantinides, Theo Drane:
Combining E-Graphs with Abstract Interpretation. SOAP@PLDI 2023: 1-7 - [i10]Samuel Coward, George A. Constantinides, Theo Drane:
Automating Constraint-Aware Datapath Optimization using E-Graphs. CoRR abs/2303.01839 (2023) - [i9]Samuel Coward, Emiliano Morini, Bryan Tan, Theo Drane, George A. Constantinides:
Datapath Verification via Word-Level E-Graph Rewriting. CoRR abs/2308.00431 (2023) - [i8]Jianyi Cheng, Samuel Coward, Lorenzo Chelini, Rafael Barbalho, Theo Drane:
SEER: Super-Optimization Explorer for HLS using E-graph Rewriting with MLIR. CoRR abs/2308.07654 (2023) - [i7]Andy Wanna, Samuel Coward, Theo Drane, George A. Constantinides, Milos D. Ercegovac:
Multiplier Optimization via E-Graph Rewriting. CoRR abs/2312.06004 (2023) - 2022
- [j1]Samuel Coward
, Lawrence C. Paulson
, Theo Drane
, Emiliano Morini
:
Formal Verification of Transcendental Fixed- and Floating-point Algorithms using an Automatic Theorem Prover. Formal Aspects Comput. 34(2): 1-22 (2022) - [c3]Samuel Coward, George A. Constantinides, Theo Drane:
Automatic Datapath Optimization using E-Graphs. ARITH 2022: 43-50 - [c2]Oliver Flatt, Samuel Coward, Max Willsey, Zachary Tatlock, Pavel Panchekha
:
Small Proofs from Congruence Closure. FMCAD 2022: 75-83 - [i6]Samuel Coward, George A. Constantinides, Theo Drane:
Abstract Interpretation on E-Graphs. CoRR abs/2203.09191 (2022) - [i5]Samuel Coward, George A. Constantinides, Theo Drane:
Automatic Datapath Optimization using E-Graphs. CoRR abs/2204.11478 (2022) - [i4]Bryce Orloski, Samuel Coward, Theo Drane:
Automatic Generation of Complete Polynomial Interpolation Hardware Design Space. CoRR abs/2205.09504 (2022) - [i3]Samuel Coward, George A. Constantinides, Theo Drane:
Combining E-Graphs with Abstract Interpretation. CoRR abs/2205.14989 (2022) - [i2]Oliver Flatt, Samuel Coward, Max Willsey, Zachary Tatlock
, Pavel Panchekha:
Small Proofs from Congruence Closure. CoRR abs/2209.03398 (2022) - 2020
- [c1]Samuel Coward, Theo Drane, Yoav Harel:
Automatic Design Space Exploration for an Error Tolerant Application. ARITH 2020: 117-120 - [i1]Samuel Coward, Erik Visse-Martindale
, Chithrupa Ramesh:
Attention-Based Clustering: Learning a Kernel from Context. CoRR abs/2010.01040 (2020)
Coauthor Index
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
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-30 20:41 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint