Takashi Nakada

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 Masahiro Konishi

> Home > Persons > Takashi Nakada

Publications

2008
[j3]
- view
  authority control:
- export record
  dblp key:
  - journals/imt/NakashimaKN08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/imt/NakashimaKN08
Hiroshi Nakashima, Masahiro Konishi, Takashi Nakada:
A Simulation-Based Analysis for Worst Case Delay of Single and Multiple Interruptions. Inf. Media Technol. 3(4): 646-660 (2008)
[j2]
- view
  authority control:
- export record
  dblp key:
  - journals/ipsj/NakashimaKN08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ipsj/NakashimaKN08
Hiroshi Nakashima, Masahiro Konishi, Takashi Nakada:
A Simulation-Based Analysis for Worst Case Delay of Single and Multiple Interruptions. IPSJ Trans. Syst. LSI Des. Methodol. 1: 33-47 (2008)
2007
[j1]
- view
  authority control:
- export record
  dblp key:
  - journals/imt/KonishiNTNT07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/imt/KonishiNTNT07
Masahiro Konishi, Takashi Nakada, Tomoaki Tsumura, Hiroshi Nakashima, Hiroaki Takada:
An Efficient Analysis of Worst Case Flush Timings for Branch Predictors. Inf. Media Technol. 2(3): 734-747 (2007)
2006
[c2]
- view
  authority control:
- export record
  dblp key:
  - conf/cases/NakashimaKN06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cases/NakashimaKN06
Hiroshi Nakashima, Masahiro Konishi, Takashi Nakada:
An accurate and efficient simulation-based analysis for worst case interruption delay. CASES 2006: 2-12

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.