M. A. J. Kolsteren

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
In this paper we introduce the first divide and conquer algorithm that is capable of exact hazard-free logic minimization in a constructive way. We compare our algorithm with the method of Dill/Nowick, which was the only known method for exact hazard-free minimization. We show that our algorithm is much faster than the method proposed by Dill/Nowick by(More)
  • 1