{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,20]],"date-time":"2023-01-20T20:28:13Z","timestamp":1674246493247},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1995,8,1]],"date-time":"1995-08-01T00:00:00Z","timestamp":807235200000},"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":[[1995,8]]},"DOI":"10.1007\/bf01293666","type":"journal-article","created":{"date-parts":[[2005,3,24]],"date-time":"2005-03-24T22:06:22Z","timestamp":1111701982000},"page":"154-168","source":"Crossref","is-referenced-by-count":4,"title":["Lower bounds for set intersection queries"],"prefix":"10.1007","volume":"14","author":[{"given":"P.","family":"Dietz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K.","family":"Mehlhorn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"Raman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C.","family":"Uhrig","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"637","DOI":"10.1090\/S0894-0347-1989-1001852-0","volume":"2","author":"B. Chazelle","year":"1989","unstructured":"B. Chazelle. Lower bounds on the complexity of polytope range searching.J. Amer. Math. Soc., 2:637?666, 1989.","journal-title":"J. Amer. Math. Soc."},{"key":"CR2","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1007\/BF01934990","volume":"25","author":"B. Chazelle","year":"1985","unstructured":"B. Chazelle, L. J. Guibas, and D. T. Lee. The power of geometric duality.BIT, 25:76?90, 1985.","journal-title":"BIT"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"696","DOI":"10.1145\/322276.322281","volume":"28","author":"M. L. Fredman","year":"1981","unstructured":"M. L. Fredman. A lower bound on the complexity of orthogonal range queries.J. Assoc. Comput. Mach., 28:696?705, 1981.","journal-title":"J. Assoc. Comput. Mach."},{"key":"CR4","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1145\/322290.322305","volume":"29","author":"M. L. Fredman","year":"1982","unstructured":"M. L. Fredman. The complexity of maintaining an array and its partial sums.J. Assoc. Comput. Mach, 29:250?260, 1982.","journal-title":"J. Assoc. Comput. Mach"},{"key":"CR5","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-69900-9","volume-title":"Data Structures and Algorithms, Vol. III","author":"K. Mehlhorn","year":"1984","unstructured":"K. Mehlhorn.Data Structures and Algorithms, Vol. III. Springer-Verlag, Berlin, 1984."},{"key":"CR6","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/BF01448847","volume":"100","author":"J. Neumann von","year":"1928","unstructured":"J. von Neumann. Zur Theorie der Gesellschaftspiele.Math. Ann., 100:295?320, 1928.","journal-title":"Math. Ann."},{"key":"CR7","unstructured":"P. Raghavan. Lecture Notes in Randomized Algorithms. Technical Report RC 15340, IBM, December 1989."},{"key":"CR8","volume-title":"Ten Lectures on the Probabilistic Method","author":"J. Spencer","year":"1987","unstructured":"J. Spencer.Ten Lectures on the Probabilistic Method. Society for Industrial and Applied Mathematics, Philadelphia, PA, 1987."},{"key":"CR9","doi-asserted-by":"crossref","unstructured":"A. C. Yao. Probabilistic computations: towards a unified measure of complexity.Proc. 18th IEEE FOCS, pp. 222?227, 1977.","DOI":"10.1109\/SFCS.1977.24"},{"key":"CR10","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1137\/0214022","volume":"14","author":"A. C. Yao","year":"1985","unstructured":"A. C. Yao. On the complexity of maintaining partial sums.SIAM J. Comput., 14:277?288, 1985.","journal-title":"SIAM J. Comput."},{"key":"CR11","unstructured":"D. Yellin. Data structures for set equality-testing.Proc. 3rd Annual ACM-SIAM SODA, pp. 386?392, 1992."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01293666.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01293666\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01293666","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T11:18:33Z","timestamp":1556795913000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01293666"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,8]]},"references-count":11,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1995,8]]}},"alternative-id":["BF01293666"],"URL":"https:\/\/doi.org\/10.1007\/bf01293666","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,8]]}}}