Philip Brisk

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 Sina Boroumand

> Home > Persons > Philip Brisk

Publications

2019
[c88]
- view
  authority control:
- export record
  dblp key:
  - conf/reconfig/BoroumandB19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/reconfig/BoroumandB19
Sina Boroumand, Philip Brisk:
Approximate Adder Tree Synthesis for FPGAs. ReConFig 2019: 1-8
2018
[c87]
- view
  authority control:
- export record
  dblp key:
  - conf/aspdac/BoroumandPBM18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/aspdac/BoroumandPBM18
Sina Boroumand, Hadi Parandeh-Afshar, Philip Brisk, Siamak Mohammadi:
Exploration of approximate multipliers design space using carry propagation free compressors. ASP-DAC 2018: 611-616
[c85]
- view
  authority control:
- export record
  dblp key:
  - conf/date/BoroumandPB18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/date/BoroumandPB18
Sina Boroumand, Hadi Parandeh-Afshar, Philip Brisk:
Approximate quaternary addition with the fast carry chains of FPGAs. DATE 2018: 577-580
2017
[c75]
- view
  authority control:
- export record
  dblp key:
  - conf/dft/BoroumandPBM17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/dft/BoroumandPBM17
Sina Boroumand, Hadi Parandeh-Afshar, Philip Brisk, Siamak Mohammadi:
CAL: Exploring cost, accuracy, and latency in approximate and speculative adder design. DFT 2017: 1-6

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.