{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:04:34Z","timestamp":1763467474796},"reference-count":29,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2002,3,1]],"date-time":"2002-03-01T00:00:00Z","timestamp":1014940800000},"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":4156,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computational Geometry"],"published-print":{"date-parts":[[2002,3]]},"DOI":"10.1016\/s0925-7721(01)00028-1","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T13:36:39Z","timestamp":1027604199000},"page":"155-165","source":"Crossref","is-referenced-by-count":3,"title":["Two-variable linear programming in parallel"],"prefix":"10.1016","volume":"21","author":[{"given":"Danny Z.","family":"Chen","sequence":"first","affiliation":[]},{"given":"Jinhui","family":"Xu","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"6","key":"10.1016\/S0925-7721(01)00028-1_BIB001","doi-asserted-by":"crossref","first-page":"1171","DOI":"10.1137\/S0097539792234858","article-title":"A deterministic poly(loglogN)-time N-processor algorithm for linear programming in fixed dimension","volume":"25","author":"Ajtai","year":"1996","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0925-7721(01)00028-1_BIB002","series-title":"Proc. of 31st Annual IEEE Symp. on Foundations of Computer Science","first-page":"574","article-title":"Parallel linear programming in fixed dimension almost surely in constant time","author":"Alon","year":"1990"},{"key":"10.1016\/S0925-7721(01)00028-1_BIB003","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1016\/S0022-0000(73)80033-9","article-title":"Time bounds for selection","volume":"7","author":"Blum","year":"1973","journal-title":"J. Comput. Syst. Sci."},{"key":"10.1016\/S0925-7721(01)00028-1_BIB004","series-title":"Proc. of 4th Annual ACM\u2013SIAM Symp. on Discrete Algorithms","first-page":"281","article-title":"On linear-time deterministic algorithms for optimization problems in fixed dimension","author":"Chazelle","year":"1993"},{"issue":"1","key":"10.1016\/S0925-7721(01)00028-1_BIB005","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1109\/71.363412","article-title":"Efficient geometric algorithms on the EREW PRAM","volume":"6","author":"Chen","year":"1995","journal-title":"IEEE Trans. Parallel Distributed Syst."},{"key":"10.1016\/S0925-7721(01)00028-1_BIB006","series-title":"Proc. of 4th Annual European Symp. on Algorithms","first-page":"234","article-title":"Parallel algorithms for partitioning sorted sets and related problems","author":"Chen","year":"1996"},{"key":"10.1016\/S0925-7721(01)00028-1_BIB007","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/0020-0190(86)90037-2","article-title":"Linear programming in O(n3d2) time","volume":"22","author":"Clarkson","year":"1986","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0925-7721(01)00028-1_BIB008","doi-asserted-by":"crossref","first-page":"488","DOI":"10.1145\/201019.201036","article-title":"A Las Vegas algorithm for linear programming when the dimension is small","volume":"42","author":"Clarkson","year":"1995","journal-title":"J. ACM"},{"key":"10.1016\/S0925-7721(01)00028-1_BIB009","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/0020-0190(88)90186-X","article-title":"An optimally efficient selection algorithm","volume":"26","author":"Cole","year":"1987","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0925-7721(01)00028-1_BIB010","doi-asserted-by":"crossref","first-page":"770","DOI":"10.1137\/0217049","article-title":"Parallel merge sort","volume":"17","author":"Cole","year":"1988","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0925-7721(01)00028-1_BIB011","series-title":"Introduction to Algorithms","author":"Cormen","year":"1990"},{"key":"10.1016\/S0925-7721(01)00028-1_BIB012","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/0020-0190(90)90026-T","article-title":"An optimal parallel algorithm for linear programming in the plane","volume":"35","author":"Deng","year":"1990","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0925-7721(01)00028-1_BIB013","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1137\/0213003","article-title":"Linear time algorithms for two- and three-variable linear programs","volume":"13","author":"Dyer","year":"1984","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0925-7721(01)00028-1_BIB014","doi-asserted-by":"crossref","first-page":"725","DOI":"10.1137\/0215052","article-title":"On a multidimensional search technique and its applications to the Euclidean one-center problem","volume":"15","author":"Dyer","year":"1986","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0925-7721(01)00028-1_BIB015","series-title":"Proc. of 11th Annual Symp. on Computational Geometry","first-page":"345","article-title":"A parallel algorithm for linear programming in fixed dimension","author":"Dyer","year":"1995"},{"key":"10.1016\/S0925-7721(01)00028-1_BIB016","series-title":"Algorithms in Combinatorial Geometry","author":"Edelsbrunner","year":"1987"},{"key":"10.1016\/S0925-7721(01)00028-1_BIB017","series-title":"Proc. of 7th Annual ACM\u2013SIAM Symp. on Discrete Algorithms","first-page":"132","article-title":"Fixed-dimensional parallel linear programming via relative epsilon-approximations","author":"Goodrich","year":"1996"},{"key":"10.1016\/S0925-7721(01)00028-1_BIB018","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1007\/PL00009325","article-title":"Bounded-independence derandomization of geometric partitioning with applications to parallel fixed-dimensional linear programming","volume":"18","author":"Goodrich","year":"1997","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/S0925-7721(01)00028-1_BIB019","series-title":"Proc. of 8th International Symp. on Algorithms and Computation","first-page":"52","article-title":"Weighted and unweighted selection algorithms for k sorted sequences","author":"Hayashi","year":"1997"},{"key":"10.1016\/S0925-7721(01)00028-1_BIB020","series-title":"An Introduction to Parallel Algorithms","author":"J\u00e1J\u00e1","year":"1992"},{"key":"10.1016\/S0925-7721(01)00028-1_BIB021","series-title":"Proc. of 24th Annual ACM Symp. on Theory of Computing","first-page":"475","article-title":"A subexponential randomized simplex algorithm","author":"Kalai","year":"1992"},{"key":"10.1016\/S0925-7721(01)00028-1_BIB022","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1007\/BF01940877","article-title":"A subexponential bound for linear programming","volume":"16","author":"Matou\u0161ek","year":"1996","journal-title":"Algorithmica"},{"issue":"4","key":"10.1016\/S0925-7721(01)00028-1_BIB023","doi-asserted-by":"crossref","first-page":"759","DOI":"10.1137\/0212052","article-title":"Linear time algorithms for linear programming in R3 and related problems","volume":"12","author":"Megiddo","year":"1983","journal-title":"SIAM J. Comput."},{"issue":"1","key":"10.1016\/S0925-7721(01)00028-1_BIB024","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1145\/2422.322418","article-title":"Linear programming in linear time when the dimension is fixed","volume":"31","author":"Megiddo","year":"1984","journal-title":"J. ACM"},{"key":"10.1016\/S0925-7721(01)00028-1_BIB025","series-title":"Combinatorial Optimization: Algorithms and Complexity","author":"Papadimitriou","year":"1982"},{"key":"10.1016\/S0925-7721(01)00028-1_BIB026","series-title":"Computational Geometry: An Introduction","author":"Preparata","year":"1985"},{"key":"10.1016\/S0925-7721(01)00028-1_BIB027","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1007\/BF02574699","article-title":"Small-dimensional linear programming and convex hulls made easy","volume":"6","author":"Seidel","year":"1991","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/S0925-7721(01)00028-1_BIB028","unstructured":"S. Sen, A deterministic poly(loglogn) time optimal CRCW PRAM algorithm for linear programming in fixed dimension, Technical Report 95-08, Department of Computer Science, University of Newcastle, 1995"},{"key":"10.1016\/S0925-7721(01)00028-1_BIB029","series-title":"Proc. of 8th ACM Symp. Parallel Algorithms and Architectures","first-page":"251","article-title":"Parallel multidimensional search using approximation algorithms: With applications to linear-programming and related problems","author":"Sen","year":"1996"}],"container-title":["Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925772101000281?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925772101000281?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T07:51:40Z","timestamp":1556524300000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0925772101000281"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,3]]},"references-count":29,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2002,3]]}},"alternative-id":["S0925772101000281"],"URL":"https:\/\/doi.org\/10.1016\/s0925-7721(01)00028-1","relation":{},"ISSN":["0925-7721"],"issn-type":[{"value":"0925-7721","type":"print"}],"subject":[],"published":{"date-parts":[[2002,3]]}}}