Douglas M. Blough

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 Seong Yong Ohm

> Home > Persons > Douglas M. Blough

Publications

1999
[j15]
- view
  authority control:
- export record
  dblp key:
  - journals/tvlsi/BloughKO99
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tvlsi/BloughKO99
Douglas M. Blough, Fadi J. Kurdahi, Seong Yong Ohm:
High-level synthesis of recoverable VLSI microarchitectures. IEEE Trans. Very Large Scale Integr. Syst. 7(4): 401-410 (1999)
1997
[j13]
- view
  authority control:
- export record
  dblp key:
  - journals/tcad/BloughKO97
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcad/BloughKO97
Douglas M. Blough, Fadi J. Kurdahi, Seong Yong Ohm:
Optimal algorithms for recovery point insertion in recoverable microarchitectures. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 16(9): 945-955 (1997)
1996
[c15]
- view
  authority control:
- export record
  dblp key:
  - conf/date/OhmBK96
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/date/OhmBK96
Seong Yong Ohm, Douglas M. Blough, Fadi J. Kurdahi:
High-Level Synthesis of Recoverable Microarchitectures. ED&TC 1996: 55-62
1995
[c12]
- view
  authority control:
- export record
  dblp key:
  - conf/ftcs/BloughKO95
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ftcs/BloughKO95
Douglas M. Blough, Fadi J. Kurdahi, Seong Yong Ohm:
Optimal Recovery Point Insertion for High-Level Synthesis of Recoverable Microarchitectures. FTCS 1995: 50-59

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.