{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,21]],"date-time":"2024-06-21T14:14:34Z","timestamp":1718979274613},"reference-count":12,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1995,3,1]],"date-time":"1995-03-01T00:00:00Z","timestamp":794016000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1995,3]]},"DOI":"10.1016\/0020-0190(94)00201-9","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T22:04:31Z","timestamp":1027634671000},"page":"295-299","source":"Crossref","is-referenced-by-count":5,"title":["A pseudo-algorithmic separation of lines from pseudo-lines"],"prefix":"10.1016","volume":"53","author":[{"given":"William","family":"Steiger","sequence":"first","affiliation":[]},{"given":"Ileana","family":"Streinu","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(94)00201-9_BIB1","doi-asserted-by":"crossref","first-page":"792","DOI":"10.1137\/0218055","article-title":"An optimaltime algorithm for slope selection","volume":"18","author":"Cole","year":"1989","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(94)00201-9_BIB2","series-title":"Combinatorics and Algebra","article-title":"Combinatorial correspondences for Young tableaux, balanced tableaux, and maximal chains in the Bruhat order of Sn","volume":"34","author":"Edelman","year":"1984"},{"key":"10.1016\/0020-0190(94)00201-9_BIB3","series-title":"Algorithms in Combinatorial Geometry","author":"Edelsbrunner","year":"1987"},{"key":"10.1016\/0020-0190(94)00201-9_BIB4","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1016\/0304-3975(76)90078-5","article-title":"How good is the information theory bound in sorting?","volume":"1","author":"Fredman","year":"1976","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"10.1016\/0020-0190(94)00201-9_BIB5","doi-asserted-by":"crossref","DOI":"10.1137\/0212032","article-title":"Multidimensional sorting","volume":"12","author":"Goodman","year":"1983","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(94)00201-9_BIB6","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/BF02187696","article-title":"Upper bounds for configurations and polytopes in Rd","volume":"1","author":"Goodman","year":"1986","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/0020-0190(94)00201-9_BIB7","series-title":"New Trends in Discrete and Computational Geometry","article-title":"Allowable sequences and order types in discrete and computational geometry","author":"Goodman","year":"1991"},{"issue":"6","key":"10.1016\/0020-0190(94)00201-9_BIB8","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1145\/360825.360869","article-title":"Sorting X + Y","volume":"18","author":"Harper","year":"1975","journal-title":"Comm. ACM"},{"key":"10.1016\/0020-0190(94)00201-9_BIB9","series-title":"Proc. STACS","first-page":"195","article-title":"Sorting X + Y in O(n2) comparisons","author":"Lambert","year":"1991"},{"key":"10.1016\/0020-0190(94)00201-9_BIB10","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/BF02574679","article-title":"Lower bounds on the length of monotone paths in arrangements","volume":"6","author":"Matou\u0161ek","year":"1991","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/0020-0190(94)00201-9_BIB11","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF02187829","article-title":"An upper bound on the number of planar k-sets","volume":"7","author":"Pach","year":"1992","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/0020-0190(94)00201-9_BIB12","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1016\/S0195-6698(84)80039-6","article-title":"On the number of reduced decompositions of elements of Coxeter groups","volume":"5","author":"Stanley","year":"1984","journal-title":"European J. Combin"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019094002019?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019094002019?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,14]],"date-time":"2019-04-14T22:58:13Z","timestamp":1555282693000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019094002019"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,3]]},"references-count":12,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1995,3]]}},"alternative-id":["0020019094002019"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(94)00201-9","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1995,3]]}}}