Mehrdad Najibi

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 Mahtab Niknahad

> Home > Persons > Mehrdad Najibi

Publications

2007
[c9]
- view
  authority control:
- export record
  dblp key:
  - conf/isvlsi/NajibiNP07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/isvlsi/NajibiNP07
Mehrdad Najibi, Mahtab Niknahad, Hossein Pedram:
Performance Evaluation of Asynchronous Circuits with Choice Using Abstract Probabilistic Timed Petri Nets. ISVLSI 2007: 422-427
[c8]
- view
  authority control:
- export record
  dblp key:
  - conf/isvlsi/NiknahadGNP07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/isvlsi/NiknahadGNP07
Mahtab Niknahad, Behnam Ghavami, Mehrdad Najibi, Hossein Pedram:
A Power Estimation Methodology for QDI Asynchronous Circuits based on High-Level Simulation. ISVLSI 2007: 471-472
[c7]
- view
  authority control:
- export record
  dblp key:
  - conf/patmos/GhavamiNNP07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/patmos/GhavamiNNP07
Behnam Ghavami, Mahtab Niknahad, Mehrdad Najibi, Hossein Pedram:
A Fast and Accurate Power Estimation Methodology for QDI Asynchronous Circuits. PATMOS 2007: 463-473
2006
[c5]
- view
  authority control:
- export record
  dblp key:
  - conf/issoc/NiknahadSNP06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/issoc/NiknahadSNP06
Mahtab Niknahad, Kamran Saleh, Mehrdad Najibi, Hossein Pedram:
High-Level Optimization of Asynchronous Systems Utilizing Conditional Restructuring. SoC 2006: 1-6

a service of

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.