{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T04:49:51Z","timestamp":1768279791259,"version":"3.49.0"},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1993,2,1]],"date-time":"1993-02-01T00:00:00Z","timestamp":728524800000},"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,2]]},"DOI":"10.1007\/bf01188710","type":"journal-article","created":{"date-parts":[[2005,2,17]],"date-time":"2005-02-17T22:39:58Z","timestamp":1108679998000},"page":"156-167","source":"Crossref","is-referenced-by-count":6,"title":["A faster parallel algorithm for a matrix searching problem"],"prefix":"10.1007","volume":"9","author":[{"given":"Mikhail J.","family":"Atallah","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","first-page":"497","volume-title":"Parallel Searching in Multidimensional Monotone Arrays, to appear inJ. Algorithms","author":"A. Aggarwal","year":"1988","unstructured":"A. Aggarwal and J. Park, Parallel Searching in Multidimensional Monotone Arrays, to appear inJ. Algorithms. (A preliminary version appeared inProc. 29th Annual IEEE Symp. on Foundations of Computer Science, IEEE, New York, 1988, pp. 497?512.)"},{"key":"CR2","first-page":"259","volume-title":"Parallel Searching in Generalized Monge Arrays with Applications","author":"A. Aggarwal","year":"1990","unstructured":"A. Aggarwal, D. Kravets, J. Park, and S. Sen, Parallel Searching in Generalized Monge Arrays with Applications,Proc. 2nd Annual ACM Symp. on Parallel Algorithms and Architectures, ACM, New York, 1990, pp. 259?268."},{"key":"CR3","doi-asserted-by":"crossref","first-page":"968","DOI":"10.1137\/0219066","volume":"19","author":"A. Apostolico","year":"1990","unstructured":"A. Apostolico, M. J. Atallah, L. Larmore, and H. S. McFaddin, Efficient Parallel Algorithms for String Editing and Related Problems,SIAM J. Comput.,19 (1990), 968?988.","journal-title":"SIAM J. Comput."},{"key":"CR4","doi-asserted-by":"crossref","unstructured":"M. J. Atallah and S. R. Kosaraju, An Efficient Parallel Algorithm for the Row Minima of a Totally Monotone Matrix, to appear inJ. Algorithms. (A preliminary version appeared inProc. 2nd ACM-SIAM Symp. on Discrete Algorithms, San Francisco, 1991, pp. 394?403.)","DOI":"10.1016\/0196-6774(92)90046-F"},{"key":"CR5","first-page":"421","volume-title":"Constructing Trees in Parallel","author":"M. J. Atallah","year":"1989","unstructured":"M. J. Atallah, G. L. Miller, S. R. Kosaraju, L. Larmore, and S. Teng, Constructing Trees in Parallel,Proc. 1st Annual ACM Symp. on Parallel Algorithms and Architectures, ACM, New York, 1989, pp. 421?431."},{"issue":"2","key":"CR6","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,J. Assoc. Comput. Mach.,21(2) (1974), 201?206.","journal-title":"J. Assoc. Comput. Mach."},{"key":"CR7","unstructured":"L. L. Larmore, personal communication."},{"key":"CR8","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1016\/0196-6774(81)90010-9","volume":"2","author":"Y. Shiloach","year":"1981","unstructured":"Y. Shiloach and U. Vishkin, Finding the Maximum, Merging and Sorting in a Parallel Model of Computation,J. Algorithms,2 (1981), 88?102.","journal-title":"J. Algorithms"},{"issue":"3","key":"CR9","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1137\/0204030","volume":"4","author":"L. Valiant","year":"1975","unstructured":"L. Valiant, Parallelism in Comparison Problems,SIAM J. Comput.,4(3) (1975), 348?355.","journal-title":"SIAM J. Comput."},{"key":"CR10","first-page":"429","volume-title":"Efficient Dynamic Programming Using Quadrangle Inequalities","author":"F. Yao","year":"1980","unstructured":"F. Yao, Efficient Dynamic Programming Using Quadrangle Inequalities,Proc. 12th Annual ACM Symp. on Theory of Computing, ACM, New York, 1980, pp. 429?435."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01188710.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01188710\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01188710","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,5]],"date-time":"2020-04-05T20:40:22Z","timestamp":1586119222000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01188710"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,2]]},"references-count":10,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1993,2]]}},"alternative-id":["BF01188710"],"URL":"https:\/\/doi.org\/10.1007\/bf01188710","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,2]]}}}