{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T03:08:16Z","timestamp":1648609696915},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[1994,9,1]],"date-time":"1994-09-01T00:00:00Z","timestamp":778377600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Systems Theory"],"published-print":{"date-parts":[[1994,9]]},"DOI":"10.1007\/bf01184935","type":"journal-article","created":{"date-parts":[[2005,2,18]],"date-time":"2005-02-18T08:06:57Z","timestamp":1108714017000},"page":"471-489","source":"Crossref","is-referenced-by-count":25,"title":["Branch-and-bound and backtrack search on mesh-connected arrays of processors"],"prefix":"10.1007","volume":"27","author":[{"given":"C.","family":"Kaklamanis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G.","family":"Persiano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"CR1","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/0022-0000(79)90045-X","volume":"18","author":"D. Angluin","year":"1979","unstructured":"D. Angluin and L. Valiant. Fast probabilistic algorithms for Hamiltonian circuits and matchings.J. Comput. System Sci. 18(2) (1979), 155?193.","journal-title":"J. Comput. System Sci."},{"key":"CR2","doi-asserted-by":"crossref","unstructured":"S. Bhatt and Jin-Yi Cai. Take a walk, Grow a tree.Proceedings of the 29th Annual IEEE Symposium on Foundations of Computer Science, pp. 458?469, 1988.","DOI":"10.1109\/SFCS.1988.21963"},{"key":"CR3","unstructured":"S. Bhatt, D. Greenberg, T. Leighton, and Pangfeng Liu. Tight bounds for on-line tree embeddings.Proceedings of the 2nd SIAM Symposium on Discrete Algorithms, pp. 344?350, 1991."},{"key":"CR4","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1007\/BF01199431","volume":"38","author":"D. Hilbert","year":"1891","unstructured":"D. Hilbert. Ueber die stitige Abbidungen einen Linie auf ein Flachenstiick.Math. Ann. 38 (1891), 459?480.","journal-title":"Math. Ann."},{"key":"CR5","doi-asserted-by":"crossref","unstructured":"R. Karp and Yanjun Zhang. A randomized parallel branch-and-bound procedure.Proceedings of the 20th Annual ACM Symposium on Theory of Computing, pp. 290?300, 1988.","DOI":"10.1145\/62212.62240"},{"key":"CR6","doi-asserted-by":"crossref","unstructured":"T. Leighton, M. Newman, A. Ranade, and E. Schwabe. Dynamic tree embedding in butterflies and hypercubes.Proceedings of the 1st Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 224?234, 1989.","DOI":"10.1145\/72935.72959"},{"key":"CR7","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF01199438","volume":"36","author":"G. Peano","year":"1880","unstructured":"G. Peano. Sur une courbe qui remplit toute une aire plane.Math. Ann. 36 (1880), 157?160.","journal-title":"Math. Ann."},{"key":"CR8","doi-asserted-by":"crossref","unstructured":"A. Ranade. Optimal speedup for backtrack search on a butterfly network.Proceedings of the 3rd Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 40?48, 1991.","DOI":"10.1145\/113379.113383"},{"key":"CR9","doi-asserted-by":"crossref","unstructured":"C. P. Schnorr and A. Shamir. An optimal sorting algorithm for mesh-connected computers.Proceedings of the 18th Annual ACM Symposium on Theory of Computing, pp. 255?263, 1986.","DOI":"10.1145\/12130.12156"},{"key":"CR10","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1145\/359461.359481","volume":"20","author":"C. T. Thompson","year":"1977","unstructured":"C. T. Thompson and H. T. Kung. Sorting on a mesh-connected parallel computer.Commun. ACM,20 (1977), 263?270.","journal-title":"Commun. ACM"}],"container-title":["Mathematical Systems Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01184935.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01184935\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01184935","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T12:41:23Z","timestamp":1556714483000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01184935"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,9]]},"references-count":10,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1994,9]]}},"alternative-id":["BF01184935"],"URL":"https:\/\/doi.org\/10.1007\/bf01184935","relation":{},"ISSN":["0025-5661","1433-0490"],"issn-type":[{"value":"0025-5661","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,9]]}}}