Kaustav Banerjee

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 Seid Hadi Rasouli

> Home > Persons > Kaustav Banerjee

Publications

2010
[c49]
- view
  authority control:
- export record
  dblp key:
  - conf/iccad/RasouliEB10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/iccad/RasouliEB10
Seid Hadi Rasouli, Kazuhiko Endo, Kaustav Banerjee:
Work-function variation induced fluctuation in bias-temperature-instability characteristics of emerging metal-gate devices and implications for digital design. ICCAD 2010: 714-720
2009
[c47]
- view
  authority control:
- export record
  dblp key:
  - conf/aspdac/RasouliKB09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/aspdac/RasouliKB09
Seid Hadi Rasouli, Hanpei Koike, Kaustav Banerjee:
High-speed low-power FinFET based domino logic. ASP-DAC 2009: 829-834
[c45]
- view
  authority control:
- export record
  dblp key:
  - conf/iccad/RasouliEB09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/iccad/RasouliEB09
Seid Hadi Rasouli, Kazuhiko Endo, Kaustav Banerjee:
Variability analysis of FinFET-based devices and circuits considering electrical confinement and width quantization. ICCAD 2009: 505-512
[c43]
- view
  authority control:
- export record
  dblp key:
  - conf/ispd/BanerjeeKKR09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ispd/BanerjeeKKR09
Kaustav Banerjee, Yasin Khatami, Chaitanya Kshirsagar, Seid Hadi Rasouli:
Graphene based transistors: physics, status and future perspectives. ISPD 2009: 65-66

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.