{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T19:31:00Z","timestamp":1787340660660,"version":"build-2736575974"},"reference-count":14,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"5","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Comput."],"published-print":{"date-parts":[[1988,10]]},"abstract":"<jats:p>We consider the problem of answering a series of on-line queries on a static data set. The conventional approach to such problems involves a preprocessing phase which constructs a data structure with good search behavior. The data structure representing the data set then remains fixed throughout the processing of the queries. Our approach involves dynamic or query-driven structuring of the data set; our algorithm processes the data set only when doing so is required for answering a query. A data structure constructed progressively in this fashion is called a deferred data structure.<\/jats:p>\n                  <jats:p>We develop the notion of deferred data structures by solving the problem of answering membership queries on an ordered set. We obtain a randomized algorithm which achieves asymptotically optimal performance with high probability. We then present optimal deferred data structures for the following problems in the plane: testing convex-hull membership, half-plane intersection queries and fixed-constraint multi-objective linear programming. We also apply the deferred data structuring technique to multi-dimensional dominance query problems.<\/jats:p>","DOI":"10.1137\/0217055","type":"journal-article","created":{"date-parts":[[2005,2,24]],"date-time":"2005-02-24T06:30:13Z","timestamp":1109226613000},"page":"883-902","source":"Crossref","is-referenced-by-count":12,"title":["Deferred Data Structuring"],"prefix":"10.1137","volume":"17","author":[{"given":"Richard M.","family":"Karp","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rajeev","family":"Motwani","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Prabhakar","family":"Raghavan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2006,7,31]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","unstructured":"M. Ben-Or,  Lower bounds for algebraic computation trees,  Proc. 15th Annual ACM Symposium on Theory of Computing,  1983,  80\u201386, May","DOI":"10.1145\/800061.808735"},{"key":"R2","doi-asserted-by":"publisher","DOI":"10.1145\/358841.358850"},{"key":"R3","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(73)80033-9"},{"key":"R4","doi-asserted-by":"crossref","unstructured":"B. M. Chazelle, L. J. Guibas, D. T. Lee,  The power of geometric duality,  Proc. 24th Annual IEEE Annual Symposium on Foundations of Computer Science,  1983,  217\u2013225, November","DOI":"10.1109\/SFCS.1983.75"},{"key":"R5","doi-asserted-by":"publisher","DOI":"10.1137\/0213003"},{"key":"R6","doi-asserted-by":"publisher","DOI":"10.1137\/0215021"},{"key":"R7","unstructured":"Donald E. Knuth, The art of computer programming. Volume 3, Addison-Wesley Publishing Co., Reading, Mass.London-Don Mills, Ont., 1973, 217\u2013219, Sorting and Searching56:4281"},{"key":"R8","doi-asserted-by":"publisher","DOI":"10.1137\/0212052"},{"key":"R9","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(80)90005-X"},{"key":"R10","doi-asserted-by":"crossref","unstructured":"R. Motwani, P. Raghavan,  Deferred data structures: query-driven preprocessing for geometric search problems,  Proc. 2nd Annual ACM Symposium on Computational Geometry, Yorktown Heights, NY,  1986,  303\u2013312, June","DOI":"10.1145\/10515.10548"},{"key":"R11","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-1098-6"},{"key":"R12","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(76)80029-3"},{"key":"R13","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1975.8"},{"key":"R14","unstructured":"M. I. Shamos, Ph.D. Thesis,  Computational geometry, Yale University, New Haven, CT,  1977"}],"container-title":["SIAM Journal on Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/0217055","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T18:43:07Z","timestamp":1787337787000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/0217055"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,10]]},"references-count":14,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1988,10]]}},"alternative-id":["10.1137\/0217055"],"URL":"https:\/\/doi.org\/10.1137\/0217055","relation":{},"ISSN":["0097-5397","1095-7111"],"issn-type":[{"value":"0097-5397","type":"print"},{"value":"1095-7111","type":"electronic"}],"subject":[],"published":{"date-parts":[[1988,10]]}}}