Jordi Cortadella

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 Steven M. Burns

> Home > Persons > Jordi Cortadella

Publications

2002
[j24]
- view
  authority control:
- export record
  dblp key:
  - journals/tcad/CortadellaKBKLSTY02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcad/CortadellaKBKLSTY02
Jordi Cortadella, Michael Kishinevsky, Steven M. Burns, Alex Kondratyev, Luciano Lavagno, Ken S. Stevens, Alexander Taubin, Alexandre Yakovlev:
Lazy transition systems and asynchronous circuit synthesis withrelative timing assumptions. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 21(2): 109-130 (2002)
1999
[c37]
- view
  authority control:
- export record
  dblp key:
  - conf/dac/StevensRBCGKR99
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/dac/StevensRBCGKR99
Ken S. Stevens, Shai Rotem, Steven M. Burns, Jordi Cortadella, Ran Ginosar, Michael Kishinevsky, Marly Roncken:
CAD Directions for High Performance Asynchronous Circuits. DAC 1999: 116-121
[c34]
- view
  authority control:
- export record
  dblp key:
  - conf/iccad/CortadellaKBS99
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/iccad/CortadellaKBS99
Jordi Cortadella, Michael Kishinevsky, Steven M. Burns, Ken S. Stevens:
Synthesis of asynchronous control circuits with automatically generated relative timing assumptions. ICCAD 1999: 324-331

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.