{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T04:12:05Z","timestamp":1649045525798},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[1993,6,1]],"date-time":"1993-06-01T00:00:00Z","timestamp":738892800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[1993,6]]},"DOI":"10.1007\/bf01190159","type":"journal-article","created":{"date-parts":[[2005,2,17]],"date-time":"2005-02-17T22:43:07Z","timestamp":1108680187000},"page":"615-628","source":"Crossref","is-referenced-by-count":2,"title":["Finding least-weight subsequences with fewer processors"],"prefix":"10.1007","volume":"9","author":[{"given":"Tak Wah","family":"Lam","sequence":"first","affiliation":[]},{"given":"Kwong-fai","family":"Chan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","first-page":"81","volume-title":"Proceedings of A WOC '88, Lecture Notes in Computer Science, Vol. 319","author":"R. J. Anderson","year":"1988","unstructured":"R. J. Anderson and G. L. Miller, Deterministic Parallel List Ranking,Proceedings of A WOC '88, Lecture Notes in Computer Science, Vol. 319, Springer-Verlag, Berlin, 1988, pp. 81?90."},{"issue":"2","key":"CR2","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/BF01840359","volume":"2","author":"A. Aggarwal","year":"1987","unstructured":"A. Aggarwal, M. Klawe, S. Moran, P. Shor, and R. Wilber, Geometric Applications of a Matrix-Searching Algorithm,Algorithmica,2 (2) (1987), 195?208.","journal-title":"Algorithmica"},{"key":"CR3","doi-asserted-by":"crossref","unstructured":"A. Aggarwal and J. Park, Notes on Searching in Multidimensional Arrays,Proceedings of the 29th Annual IEEE Symposium on Foundations of Computer Science, 1988, pp. 497?512.","DOI":"10.1109\/SFCS.1988.21966"},{"key":"CR4","doi-asserted-by":"crossref","unstructured":"M. J. Atallah, S. R. Kosaraju, L. L. Larmore, G. L. Miller, and and S.-H. Teng, Constructing Tress in Parallel,Proceedings of the 1989 ACM Symposium on Parallel Algorithms and Architectures, 1989, pp. 421?431.","DOI":"10.1145\/72935.72980"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1145\/321812.321815","volume":"21","author":"R. P. Brent","year":"1974","unstructured":"R. P. Brent, The Parallel Evaluation of General Arithmetic Expressions,Journal of the Association for Computing Machinery,21 (1974), 201?208.","journal-title":"Journal of the Association for Computing Machinery"},{"issue":"1","key":"CR6","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0196-6774(90)90031-9","volume":"11","author":"D. Eppstein","year":"1990","unstructured":"D. Eppstein, Sequence Comparison with Mixed Convex and Concave Costs,Journal of Algorithms,11 (1) (1990), 85?101.","journal-title":"Journal of Algorithms"},{"key":"CR7","unstructured":"D. Eppstein, Z. Galil, R. Giancarlo, and G. Italiano, Sparse Dynamic Programming,Proceedings of the First ACM-SIAM Symposium on Discrete Algorithms, 1990, pp. 513?522."},{"key":"CR8","doi-asserted-by":"crossref","unstructured":"S. Fortune and J. Wyllie, Parallelism in Random Access Machines,Proceedings of the Tenth Annual ACM Symposium on Theory of Computing, 1978, pp. 114?118.","DOI":"10.1145\/800133.804339"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/0304-3975(89)90101-1","volume":"64","author":"Z. Galil","year":"1989","unstructured":"Z. Galil and R. Giancarlo, Speeding up Dynamic Programming with Applications to Molecular Biology,Theoretical Computer Science,64 (1989), 107?118.","journal-title":"Theoretical Computer Science"},{"key":"CR10","doi-asserted-by":"crossref","first-page":"628","DOI":"10.1137\/0216043","volume":"16","author":"D. S. Hirschberg","year":"1987","unstructured":"D. S. Hirschberg and L. L. Larmore, The Least Weight Subsequence Problem,SIAM Journal on Computing,16 (1987), 628?638.","journal-title":"SIAM Journal on Computing"},{"key":"CR11","first-page":"869","volume-title":"Handbook of Theoretical Computer Science, Vol. A","author":"R. Karp","year":"1990","unstructured":"R. Karp and V. Ramachandran, A Survey of Parallel Algorithms for Shared Memory Machines, inHandbook of Theoretical Computer Science, Vol. A (J. van Leeuwen, ed.), North-Holland, Amsterdam, 1990, pp. 869?941."},{"issue":"1","key":"CR12","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1137\/0403009","volume":"3","author":"M. M. Klawe","year":"1990","unstructured":"M. M. Klawe and D. J. Kleitman, An Almost Linear Algorithm for Generalized Matrix Searching,SIAM Journal of Discrete Mathematics,3(1), (1990), 81?97.","journal-title":"SIAM Journal of Discrete Mathematics"},{"issue":"4","key":"CR13","doi-asserted-by":"crossref","first-page":"831","DOI":"10.1145\/322217.322232","volume":"27","author":"R. E. Ladner","year":"1980","unstructured":"R. E. Ladner and M. J. Fischer, Parallel Prefix Computation,Journal of the Association for Computing Machinery,27(4) (1980), 831?838.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"CR14","doi-asserted-by":"crossref","unstructured":"G. L. Miller and J. H. Reif, Parallel Tree Contraction and Its Applications,Proceedings of the 26th Annual IEEE Symposium on Foundations of Computer Science, 1985, pp. 496?503.","DOI":"10.1109\/SFCS.1985.43"},{"key":"CR15","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/0304-3975(88)90147-8","volume":"59","author":"W. Rytter","year":"1988","unstructured":"W. Rytter, Notes on Efficient Parallel Computations for Some Dynamic Programming,Theoretical Computer Science,59 (1988), 297?307.","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"CR16","doi-asserted-by":"crossref","first-page":"418","DOI":"10.1016\/0196-6774(88)90032-6","volume":"9","author":"R. Wilber","year":"1988","unstructured":"R. Wilber, The Concave Least Weight Subsequence Problem Revisited,Journal of Algorithms,9(3) (1988), 418?425.","journal-title":"Journal of Algorithms"},{"key":"CR17","doi-asserted-by":"crossref","unstructured":"F. F. Yao, Efficient Dynamic Programming Using Quadrangle Inequalities,Proceedings of the 12th ACM Symposium on Theory of Computing, 1980, pp. 429?435.","DOI":"10.1145\/800141.804691"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01190159.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01190159\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01190159","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,5]],"date-time":"2020-04-05T20:40:37Z","timestamp":1586119237000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01190159"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,6]]},"references-count":17,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1993,6]]}},"alternative-id":["BF01190159"],"URL":"https:\/\/doi.org\/10.1007\/bf01190159","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,6]]}}}