{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:40:41Z","timestamp":1725565241910},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540220572"},{"type":"electronic","value":"9783540247678"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24767-8_50","type":"book-chapter","created":{"date-parts":[[2010,9,11]],"date-time":"2010-09-11T00:45:04Z","timestamp":1284165904000},"page":"481-488","source":"Crossref","is-referenced-by-count":0,"title":["A Parallel Solution to Reverse Engineering Genetic Networks"],"prefix":"10.1007","author":[{"given":"Dorothy","family":"Bollman","sequence":"first","affiliation":[]},{"given":"Edusmildo","family":"Orozco","sequence":"additional","affiliation":[]},{"given":"Oscar","family":"Moreno","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"50_CR1","volume-title":"Proceedings of the 9th ACM-SIAM Symposium on Discrete Algorithms","author":"T. Akutsu","year":"1998","unstructured":"Akutsu, T., Kuahara, S., Maruyama, O., Miyano, S.: Identification of Gene Regulatory Networks by Strategic Gene Disruptions and Gene Overexpressions. In: Karloff, H. (ed.) Proceedings of the 9th ACM-SIAM Symposium on Discrete Algorithms, ACM Press, New York (1998)"},{"key":"50_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BFb0034836","volume-title":"Advances in Cryptology - ASIACRYPT \u201996","author":"E. DeWin","year":"1996","unstructured":"DeWin, E., Bosselaers, A., Vandenberghe, S., DeGersem, P., Vandewalle, J.: A fast software implementation for arithmetic operations in GF(2\n                    n\n                  ). In: Kim, K.-c., Matsumoto, T. (eds.) ASIACRYPT 1996. LNCS, vol.\u00a01163, pp. 65\u201376. Springer, Heidelberg (1996)"},{"key":"50_CR3","unstructured":"Green, E.L.: On polynomial solutions to reverse engineering problems (preprint)"},{"key":"50_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1007\/BFb0052247","volume-title":"Advances in Cryptology - CRYPTO \u201997","author":"J. Guajardo","year":"1997","unstructured":"Guajardo, J., Paar, C.: Efficient algorithms for elliptic curve cryptosystems. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol.\u00a01294, pp. 342\u2013356. Springer, Heidelberg (1997)"},{"issue":"7","key":"50_CR5","doi-asserted-by":"publisher","first-page":"749","DOI":"10.1109\/12.863045","volume":"49","author":"M. Anwarul Hasan","year":"2000","unstructured":"Anwarul Hasan, M.: Look-up table-based large finite field multiplication in memory constrained cryptosystes. IEEE Trans. Computing\u00a049(7), 749\u2013758 (2000)","journal-title":"IEEE Trans. Computing"},{"key":"50_CR6","unstructured":"Ideker, T.E., Thorsson, V., Karp, R.M.: Discovery of regulatory interactions through perturbation: Inference and experimental design. In: Pacific Symposium on Biocomputing, vol.\u00a05, pp. 302\u2013313 (2000)"},{"key":"50_CR7","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1006\/aama.2000.0717","volume":"26","author":"R. Laubenbacher","year":"2001","unstructured":"Laubenbacher, R., Stigler, B.: Dynamic networks. Adv. in Appl. Math.\u00a026, 237\u2013251 (2001)","journal-title":"Adv. in Appl. Math."},{"key":"50_CR8","unstructured":"Laubenbacher, R., Stigler, B.: Biochemical networks (preprint)"},{"key":"50_CR9","doi-asserted-by":"crossref","unstructured":"Lipson, J.: Chinese remaindering and interpolation algorithms. In: Proc. 2nd Symposium in Symbolic and Algebraic Manipulation. pp. 372\u2013391 (1971)","DOI":"10.1145\/800204.806309"},{"key":"50_CR10","unstructured":"Moreno, O., Bollman, D., Avi\u00f1o, M.: Finite dynamical systems, linear automata, and finite fields. In: 2002 WSEAS Int. Conf. on System Science, Applied Mathematics & Computer Science and Power Engineering Systems, pp. 1481\u20131483 (2002); Also to appear in the International Journal for Computer Research"},{"key":"50_CR11","unstructured":"Ortiz, H., Avi\u00f1o, M.A., Pe\u00f1a, S., Laubenbacher, R., Moreno, O.: Finite Fields are Better Boolean. In: Proc. of the Seventh Annual International Conference on Research in Computational Molecular Biology (RECOMB), vol.\u00a02003, p. 162"},{"key":"50_CR12","unstructured":"Savas, E., Koc, C.K.: Efficient methods for composite field arithmetic. Technical Report, Oregon State University (1999)"},{"key":"50_CR13","unstructured":"Sunar, B., Savas, E., Koc, C.K.: Constructing Field Representations for efficient conversion. To appear in IEEE Transactions on Computers"}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications \u2013 ICCSA 2004"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24767-8_50","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T22:06:54Z","timestamp":1558303614000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24767-8_50"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540220572","9783540247678"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24767-8_50","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}