%0 Journal Article %1 journals/jacm/BilardiP89 %A Bilardi, Gianfranco %A Preparata, Franco P. %D 1989 %J J. ACM %K dblp %N 2 %P 362-382 %T Size-time complexity of Boolean networks for prefix computations. %U http://dblp.uni-trier.de/db/journals/jacm/jacm36.html#BilardiP89 %V 36

@article{journals/jacm/BilardiP89, added-at = {2018-11-06T00:00:00.000+0100}, author = {Bilardi, Gianfranco and Preparata, Franco P.}, biburl = {https://www.bibsonomy.org/bibtex/20d65d9e924bff2c7d489636c2f8d895b/dblp}, ee = {https://doi.org/10.1145/62044.62052}, interhash = {2a75b418cbec5394a25818a30d1605a0}, intrahash = {0d65d9e924bff2c7d489636c2f8d895b}, journal = {J. ACM}, keywords = {dblp}, number = 2, pages = {362-382}, timestamp = {2018-11-07T12:10:04.000+0100}, title = {Size-time complexity of Boolean networks for prefix computations.}, url = {http://dblp.uni-trier.de/db/journals/jacm/jacm36.html#BilardiP89}, volume = 36, year = 1989 }