Size-Time Complexity of Boolean Networks for Prefix Computations
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter

Gianfranco Bilardi, Franco P. Preparata
Size-Time Complexity of Boolean Networks for Prefix Computations
STOC, 1987.

STOC 1987
DBLP
Scholar
DOI
Full names Links ISxN
@inproceedings{STOC-1987-BilardiP,
	author        = "Gianfranco Bilardi and Franco P. Preparata",
	booktitle     = "{Proceedings of the 19th Annual ACM Symposium on Theory of Computing}",
	doi           = "10.1145/28395.28442",
	isbn          = "0-89791-221-7",
	pages         = "436--442",
	publisher     = "{ACM}",
	title         = "{Size-Time Complexity of Boolean Networks for Prefix Computations}",
	year          = 1987,
}

Tags:



Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.