Journal of the ACM Bibliography

G. Bilardi and F. P. Preparata. Size-time complexity of Boolean networks for prefix computations. Journal of the ACM, 36(2):362-382, April 1989. [BibTeX entry]
Selected papers that cite this one


  • Journal of the ACM homepage
  • Bibliography top level
  • Journal of the ACM Author Index
  • Search the HBP database