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.

Computational complexity of finite asynchronous cellular automata

Alberto Dennunzio, Enrico Formenti, Luca Manzoni, Giancarlo Mauri, Antonio E. Porreca. Computational complexity of finite asynchronous cellular automata. Theoretical Computer Science, 664:131-143, 2017. [doi]

Authors

Alberto Dennunzio

This author has not been identified. Look up 'Alberto Dennunzio' in Google

Enrico Formenti

This author has not been identified. Look up 'Enrico Formenti' in Google

Luca Manzoni

This author has not been identified. Look up 'Luca Manzoni' in Google

Giancarlo Mauri

This author has not been identified. Look up 'Giancarlo Mauri' in Google

Antonio E. Porreca

This author has not been identified. Look up 'Antonio E. Porreca' in Google
runs on