Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Emile H. L. Aarts

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 Albert van der Werf

> Home > Persons > Emile H. L. Aarts

Publications

1998
[j29]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/dam/VerhaeghLAMW98
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dam/VerhaeghLAMW98
Wim F. J. Verhaegh, Paul E. R. Lippens, Emile H. L. Aarts, Jef L. van Meerbergen, Albert van der Werf:
The Complexity of Multidimensional Periodic Scheduling. Discret. Appl. Math. 89(1-3): 213-242 (1998)
1996
[j23]
- view
  authority control:
- export record
  dblp key:
  - journals/tcad/FluiterAKVW96
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcad/FluiterAKVW96
Babette van Antwerpen-de Fluiter, Emile H. L. Aarts, Jan H. M. Korst, Wim F. J. Verhaegh, Albert van der Werf:
The complexity of generalized retiming problems. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 15(11): 1340-1353 (1996)
[c20]
- view
  authority control:
- export record
  dblp key:
  - conf/europar/VerhaeghLAMW96
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/europar/VerhaeghLAMW96
Wim F. J. Verhaegh, Paul E. R. Lippens, Emile H. L. Aarts, Jef L. van Meerbergen, Albert van der Werf:
Multidimensional Periodic Scheduling Model and Complexity. Euro-Par, Vol. II 1996: 226-235
1995
[j19]
- view
  authority control:
- export record
  dblp key:
  - journals/tcad/VerhaeghLAKMW95
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcad/VerhaeghLAKMW95
Wim F. J. Verhaegh, Paul E. R. Lippens, Emile H. L. Aarts, Jan H. M. Korst, Jef L. van Meerbergen, Albert van der Werf:
Improved force-directed scheduling in high-throughput digital signal processing. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 14(8): 945-960 (1995)
1994
[c17]
- view
  authority control:
- export record
  dblp key:
  - conf/isss/WerfMAVL94
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/isss/WerfMAVL94
Albert van der Werf, Jef L. van Meerbergen, Emile H. L. Aarts, Wim F. J. Verhaegh, Paul E. R. Lippens:
Efficient timing constraint derivation for optimal retiming high speed processing units. HLSS 1994: 48-53
1993
[c15]
- no documents available
  - no references & citations available
- export record
  dblp key:
  - conf/vlsi/WerfAHMVL93
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/vlsi/WerfAHMVL93
Albert van der Werf, Emile H. L. Aarts, E. W. Heijnen, Jef L. van Meerbergen, Wim F. J. Verhaegh, Paul E. R. Lippens:
A new method for retiming multi-functional processing units. VLSI 1993: 191-200
1992
[c14]
- view
  authority control:
- export record
  dblp key:
  - conf/iccad/VerhaeghLAKWM92
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/iccad/VerhaeghLAKWM92
Wim F. J. Verhaegh, Paul E. R. Lippens, Emile H. L. Aarts, Jan H. M. Korst, Albert van der Werf, Jef L. van Meerbergen:
Efficiency improvements for force-directed scheduling. ICCAD 1992: 286-291
[c13]
- view
  authority control:
- export record
  dblp key:
  - conf/iccad/WerfPAMLV92
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/iccad/WerfPAMLV92
Albert van der Werf, M. J. H. Peek, Emile H. L. Aarts, Jef L. van Meerbergen, Paul E. R. Lippens, Wim F. J. Verhaegh:
Area optimization of multi-functional processing units. ICCAD 1992: 292-299

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.