External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

Size-Time Complexity of Boolean Networks for Prefix Computations

Gianfranco Bilardi, Franco P. Preparata. Size-Time Complexity of Boolean Networks for Prefix Computations. In Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, 25-27 May 1987, New York City, NY, USA. pages 436-442, ACM, 1987.

Authors

Gianfranco Bilardi

This author has not been identified. Look up 'Gianfranco Bilardi' in Google

Franco P. Preparata

This author has not been identified. Look up 'Franco P. Preparata' in Google
runs on