Vaughn Betz

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 Charles Chiasson

> Home > Persons > Vaughn Betz

Publications

2020
[j30]
- view
  authority control:
- export record
  dblp key:
  - journals/tvlsi/MurrayLWMWHYCKA20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tvlsi/MurrayLWMWHYCKA20
Kevin E. Murray, Jason Luu, Matthew J. P. Walker, Conor McCullough, Sen Wang, Safeen Huda, Bo Yan, Charles Chiasson, Kenneth B. Kent, Jason Helge Anderson, Jonathan Rose, Vaughn Betz:
Optimizing FPGA Logic Block Architectures for Arithmetic. IEEE Trans. Very Large Scale Integr. Syst. 28(6): 1378-1391 (2020)
2014
[c32]
- view
  authority control:
- export record
  dblp key:
  - conf/fccm/LuuMWHYCKARB14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/fccm/LuuMWHYCKARB14
Jason Luu, Conor McCullough, Sen Wang, Safeen Huda, Bo Yan, Charles Chiasson, Kenneth B. Kent, Jason Helge Anderson, Jonathan Rose, Vaughn Betz:
On Hard Adders and Carry Chains in FPGAs. FCCM 2014: 52-59
2013
[c24]
- view
  authority control:
- export record
  dblp key:
  - conf/fpl/ChiassonB13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/fpl/ChiassonB13
Charles Chiasson, Vaughn Betz:
Should FPGAS abandon the pass-gate? FPL 2013: 1-8
[c21]
- view
  authority control:
- export record
  dblp key:
  - conf/fpt/ChiassonB13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/fpt/ChiassonB13
Charles Chiasson, Vaughn Betz:
COFFE: Fully-automated transistor sizing for FPGAs. FPT 2013: 34-41

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.