Bijan Alizadeh

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 Omid Sarbishei

> Home > Persons > Bijan Alizadeh

Publications

2009
[j1]
- view
  authority control:
- export record
  dblp key:
  - journals/tcad/SarbisheiTAF09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcad/SarbisheiTAF09
Omid Sarbishei, Mahmoud Tabandeh, Bijan Alizadeh, Masahiro Fujita:
A Formal Approach for Debugging Arithmetic Circuits. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 28(5): 742-754 (2009)
[c13]
- view
  authority control:
- export record
  dblp key:
  - conf/dac/SarbisheiAF09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/dac/SarbisheiAF09
Omid Sarbishei, Bijan Alizadeh, Masahiro Fujita:
Polynomial datapath optimization using partitioning and compensation heuristics. DAC 2009: 931-936
[c10]
- view
  authority control:
- export record
  dblp key:
  - conf/memocode/SarbisheiTAF09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/memocode/SarbisheiTAF09
Omid Sarbishei, Mahmoud Tabandeh, Bijan Alizadeh, Masahiro Fujita:
High-level optimization of integer multipliers over a finite bit-width with verification capabilities. MEMOCODE 2009: 56-65
2008
[c8]
- view
  authority control:
- export record
  dblp key:
  - conf/memocode/SarbisheiAF08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/memocode/SarbisheiAF08
Omid Sarbishei, Bijan Alizadeh, Masahiro Fujita:
Arithmetic Circuits Verification without Looking for Internal Equivalences. MEMOCODE 2008: 7-16

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.