{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:12:50Z","timestamp":1761610370974,"version":"build-2065373602"},"reference-count":19,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":4958,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2000]]},"DOI":"10.1016\/s1571-0661(05)80337-8","type":"journal-article","created":{"date-parts":[[2005,5,25]],"date-time":"2005-05-25T08:37:08Z","timestamp":1117010228000},"page":"160-169","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":2,"special_numbering":"C","title":["On a Simple Sampling Lemma"],"prefix":"10.1016","volume":"31","author":[{"given":"Bernd","family":"G\u00e4rtner","sequence":"first","affiliation":[]},{"given":"Emo","family":"Welzl","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(05)80337-8_BIB1","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/BF02187879","article-title":"New applications of random sampling in computational geometry","volume":"2","author":"Clarkson","year":"1987","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/S1571-0661(05)80337-8_BIB2","doi-asserted-by":"crossref","DOI":"10.1007\/BF02573988","article-title":"A bound on local minima of arrangements that implies the upper bound theorem","volume":"10:","author":"Clarkson","year":"1993","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/S1571-0661(05)80337-8_BIB3","doi-asserted-by":"crossref","first-page":"488","DOI":"10.1145\/201019.201036","article-title":"Las Vegas algorithms for linear and integer programming","volume":"42","author":"Clarkson","year":"1995","journal-title":"J. ACM"},{"key":"10.1016\/S1571-0661(05)80337-8_BIB4","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1007\/BF02187740","article-title":"Applications of random sampling in computational geometry, II","volume":"4","author":"Clarkson","year":"1989","journal-title":"Discrete Comput. Geom."},{"year":"1990","author":"Cormen","series-title":"Introduction to Algorithms","key":"10.1016\/S1571-0661(05)80337-8_BIB5"},{"year":"1997","author":"de Berg","series-title":"Computational Geometry: Algorithms and Applications","key":"10.1016\/S1571-0661(05)80337-8_BIB6"},{"key":"10.1016\/S1571-0661(05)80337-8_BIB7","article-title":"Great(er) expectations","volume":"5","author":"Dubhashi","year":"1996","journal-title":"BRICS Newsletter"},{"key":"10.1016\/S1571-0661(05)80337-8_BIB8","series-title":"In Proc. 13th Sympos. Theoret. Aspects Comput. Sci., volume 1046 of Lecture Notes Comput. Sci.","first-page":"669","article-title":"Linear programming \u2014 randomization and abstract frameworks","author":"G\u00e4rtner","year":"1996"},{"key":"10.1016\/S1571-0661(05)80337-8_BIB9","article-title":"Random sampling in geometric optimization: New insights and applications","author":"G\u00e4rtner","year":"1999","journal-title":"Manuscript"},{"year":"1989","author":"Graham","series-title":"Concrete Mathematics","key":"10.1016\/S1571-0661(05)80337-8_BIB10"},{"key":"10.1016\/S1571-0661(05)80337-8_BIB11","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1007\/BF01758770","article-title":"Randomized incremental construction of Delaunay and Voronoi diagrams","volume":"7","author":"Guibas","year":"1992","journal-title":"Algorithmica"},{"key":"10.1016\/S1571-0661(05)80337-8_BIB12","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/BF02570713","article-title":"On geometric optimization with few violated constraints","volume":"14","author":"Matou\u0161ek","year":"1995","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/S1571-0661(05)80337-8_BIB13","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"},{"year":"1994","author":"Mulmuley","series-title":"Computational Geometry: An Introduction Through Randomized Algorithms","key":"10.1016\/S1571-0661(05)80337-8_BIB14"},{"key":"10.1016\/S1571-0661(05)80337-8_BIB15","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\/S1571-0661(05)80337-8_BIB16","series-title":"In J. Pach, editor, New Trends in Discrete and Computational Geometry, volume 10 of Algorithms and Combinatorics","first-page":"37","article-title":"Backwards analysis of randomized geometric algorithms","author":"Seidel","year":"1993"},{"year":"1996","author":"Seidel","series-title":"Personal communication","key":"10.1016\/S1571-0661(05)80337-8_BIB17"},{"key":"10.1016\/S1571-0661(05)80337-8_BIB18","series-title":"Proc. 9th Sympos. Theoret. Aspects Comput. Sci., volume 577 of Lecture Notes Comput. Sci.","first-page":"569","article-title":"A combinatorial bound for linear programming and related problems","author":"Sharir","year":"1992"},{"key":"10.1016\/S1571-0661(05)80337-8_BIB19","series-title":"New Results and New Trends in Computer Science, volume 555 of Lecture Notes Comput. Sci.","first-page":"359","article-title":"Smallest enclosing disks (balls and ellipsoids)","author":"Welzl","year":"1991"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105803378?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105803378?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:08:14Z","timestamp":1761610094000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066105803378"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"references-count":19,"alternative-id":["S1571066105803378"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(05)80337-8","relation":{},"ISSN":["1571-0661"],"issn-type":[{"type":"print","value":"1571-0661"}],"subject":[],"published":{"date-parts":[[2000]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"On a Simple Sampling Lemma","name":"articletitle","label":"Article Title"},{"value":"Electronic Notes in Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S1571-0661(05)80337-8","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2000 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}