Lower and upper bounds on the switching activity in scheduled data flow graphs - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Lars Kruse, Eike Schmidt, Gerd Jochens, Wolfgang Nebel. Lower and upper bounds on the switching activity in scheduled data flow graphs. In Farid N. Najm, Jason Cong, David Blaauw, editors, Proceedings of the 1999 International Symposium on Low Power Electronics and Design, 1999, San Diego, California, USA, August 16-17, 1999. pages 115-120, ACM, 1999. [doi]

This author has not been identified. Look up 'Lars Kruse' in GoogleThis author has not been identified. Look up 'Eike Schmidt' in GoogleThis author has not been identified. Look up 'Gerd Jochens' in GoogleThis author has not been identified. Look up 'Wolfgang Nebel' in Google

runs on WebDSL