Koen van Eijk

According to our database, Koen van Eijk authored at least 6 papers between 1998 and 2002.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2002

Efficient and Effective Redundancy Removal for Million-Gate Circuits.

Michel R. C. M. Berkelaar, Koen van Eijk

Proceedings of the 2002 Design, 2002

2001

Constraint satisfaction for storage files with Fifos or stacks during scheduling.

Carlos A. Alba Pinto, Bart Mesman, Koen van Eijk, Jochen A. G. Jess

Proceedings of the Conference on Design, Automation and Test in Europe, 2001

2000

Constraint analysis for code generation: basic techniques and applications in FACTS.

Koen van Eijk, Bart Mesman, Carlos A. Alba Pinto, Qin Zhao, Marco Bekooij, Jef L. van Meerbergen, Jochen A. G. Jess

ACM Trans. Design Autom. Electr. Syst., 2000

Address Satisfaction for Storage Files with Fifos or Stacks during Scheduling of DSP Algorithms.

Carlos A. Alba Pinto, Koen van Eijk, Bart Mesman, Jochen A. G. Jess

Proceedings of the 13th Annual Symposium on Integrated Circuits and Systems Design, 2000

1999

Efficient Scheduling of DSP Code on Processors with Distributed Register Files.

Bart Mesman, Carlos A. Alba Pinto, Koen van Eijk

Proceedings of the 12th International Symposium on System Synthesis, 1999

1998

Computing observability don't cares efficiently through polarization.

Harm Arts, Michel R. C. M. Berkelaar, Koen van Eijk

IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1998