Luc Claesen

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 P. Johannes

> Home > Persons > Luc Claesen

Publications

1992
[c19]
- view
  authority control:
- export record
  dblp key:
  - conf/glvlsi/JohannesCM92
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/glvlsi/JohannesCM92
P. Johannes, Luc J. M. Claesen, Hugo De Man:
On the use of hierarchy in timing verification with statically sensitizable paths. Great Lakes Symposium on VLSI 1992: 4-8
[c18]
- no documents available
  - no references & citations available
- export record
  dblp key:
  - conf/ifip/JohannesCM92
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ifip/JohannesCM92
P. Johannes, Luc J. M. Claesen, Hugo De Man:
Performance Through Hierarchy in Static Timing Verification. IFIP Congress (1) 1992: 703-709
1990
[c8]
- view
  authority control:
- export record
  dblp key:
  - conf/eurodac/JohannesDCM90
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/eurodac/JohannesDCM90
P. Johannes, P. Das, Luc J. M. Claesen, Hugo De Man:
SLOCOP-II: a versatile timing verification system for MOSVLSI. EURO-DAC 1990: 518-523
1989
[j4]
- view
  authority control:
- export record
  dblp key:
  - journals/integration/ClaesenSDJPM89
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/integration/ClaesenSDJPM89
Luc J. M. Claesen, J. P. Schupp, P. Das, P. Johannes, S. Perremans, Hugo De Man:
Efficient false path elimination algorithms for timing verification by event graph preprocessing. Integr. 8(2): 173-187 (1989)

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.