{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T21:56:10Z","timestamp":1649109370231},"reference-count":17,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[2008,11,1]],"date-time":"2008-11-01T00:00:00Z","timestamp":1225497600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":1719,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2008,11]]},"DOI":"10.1016\/j.tcs.2008.08.019","type":"journal-article","created":{"date-parts":[[2008,8,15]],"date-time":"2008-08-15T10:23:35Z","timestamp":1218795815000},"page":"99-105","source":"Crossref","is-referenced-by-count":1,"title":["The unpredictable deviousness of models"],"prefix":"10.1016","volume":"408","author":[{"given":"Franco P.","family":"Preparata","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2008.08.019_b1","series-title":"The Art of Computer Programming","author":"Knuth","year":"1968"},{"key":"10.1016\/j.tcs.2008.08.019_b2","series-title":"The Design and Analysis of Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/j.tcs.2008.08.019_b3","doi-asserted-by":"crossref","unstructured":"M. Ajtai, J. Komlos, E. Szemeredi, An O(nlogn) sorting network, in: Proc. 15th ACM Symp. on Theory of Computing, 1983, pp. 1\u20139","DOI":"10.1145\/800061.808726"},{"key":"10.1016\/j.tcs.2008.08.019_b4","doi-asserted-by":"crossref","unstructured":"K. Batcher, Sorting networks and their applications, in: Proc. of the AFIPS Spring Joint Comput. Conf., 1968, pp. 307\u2013314","DOI":"10.1145\/1468075.1468121"},{"issue":"9","key":"10.1016\/j.tcs.2008.08.019_b5","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1109\/TC.1979.1675432","article-title":"Algorithms for reporting and counting geometric intersections","volume":"28","author":"Bentley","year":"1979","journal-title":"IEEE Transactions on Computers"},{"issue":"3","key":"10.1016\/j.tcs.2008.08.019_b6","doi-asserted-by":"crossref","first-page":"864","DOI":"10.1137\/S0097539796305365","article-title":"Robust proximity queries: An illustration of degree-driven algorithm design","volume":"28","author":"Liotta","year":"1998","journal-title":"SIAM Journal on Computing"},{"issue":"5","key":"10.1016\/j.tcs.2008.08.019_b7","doi-asserted-by":"crossref","first-page":"1401","DOI":"10.1137\/S0097539797329373","article-title":"Robust plane sweeps for intersecting segments","volume":"23","author":"Boissonnat","year":"2000","journal-title":"SIAM Journal on Computing"},{"issue":"4","key":"10.1016\/j.tcs.2008.08.019_b8","doi-asserted-by":"crossref","first-page":"618","DOI":"10.1137\/0205040","article-title":"Fast parallel matrix inversion algorithms","volume":"5","author":"Csanky","year":"1976","journal-title":"SIAM Journal on Computing"},{"issue":"4","key":"10.1016\/j.tcs.2008.08.019_b9","doi-asserted-by":"crossref","first-page":"685","DOI":"10.1007\/s00453-001-0033-7","article-title":"The role of arithmetic in fast parallel matrix inversion","volume":"30","author":"Codenotti","year":"2001","journal-title":"Algorithmica"},{"key":"10.1016\/j.tcs.2008.08.019_b10","unstructured":"J.W. Demmel, Trading off parallelism and numerical accuracy, CS-92-179 University of Tennessee, June 1992 (Lapack Working Note 52)"},{"key":"10.1016\/j.tcs.2008.08.019_b11","doi-asserted-by":"crossref","unstructured":"C.D. Thompson, Area\u2013time complexity for VLSI, in: Proc. 11th ACM Symp. on Theory of Computing, 1979, pp. 81\u201388","DOI":"10.1145\/800135.804401"},{"key":"10.1016\/j.tcs.2008.08.019_b12","series-title":"Introduction to Parallel Algorithms and Architectures","author":"Leighton","year":"1992"},{"issue":"5","key":"10.1016\/j.tcs.2008.08.019_b13","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1145\/358645.358660","article-title":"The cube-connected-cycles: A versatile network for parallel computation","volume":"24","author":"Preparata","year":"1981","journal-title":"Communications of the ACM"},{"issue":"2","key":"10.1016\/j.tcs.2008.08.019_b14","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1006\/jpdc.1995.1080","article-title":"Horizons of parallel computation","volume":"27","author":"Bilardi","year":"1995","journal-title":"Journal of Parallel and Distributed Computing"},{"issue":"3","key":"10.1016\/j.tcs.2008.08.019_b15","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/S0022-5193(88)80246-7","article-title":"A novel method for DNA sequence determination","volume":"135","author":"Bains","year":"1988","journal-title":"Journal of Theoretical Biology"},{"issue":"3\u20134","key":"10.1016\/j.tcs.2008.08.019_b16","doi-asserted-by":"crossref","first-page":"621","DOI":"10.1089\/106652700750050970","article-title":"Sequencing-by-Hybridization at the information-theory bound: An optimal algorithm","volume":"7","author":"Preparata","year":"2000","journal-title":"Journal of Computational Biology"},{"issue":"1","key":"10.1016\/j.tcs.2008.08.019_b17","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1109\/TCBB.2004.12","article-title":"Sequencing-by-Hybridization revisited: The analog spectrum proposal","volume":"1","author":"Preparata","year":"2004","journal-title":"IEEE\/ACM Transactions on Computational Biology and Bioinformatics"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397508005537?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397508005537?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T11:05:01Z","timestamp":1557745501000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397508005537"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,11]]},"references-count":17,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2008,11]]}},"alternative-id":["S0304397508005537"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2008.08.019","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2008,11]]}}}