{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,30]],"date-time":"2026-01-30T05:47:05Z","timestamp":1769752025571,"version":"3.49.0"},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2007,9,9]],"date-time":"2007-09-09T00:00:00Z","timestamp":1189296000000},"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":[[2008,4]]},"DOI":"10.1007\/s00453-007-9036-3","type":"journal-article","created":{"date-parts":[[2007,9,8]],"date-time":"2007-09-08T11:01:44Z","timestamp":1189249304000},"page":"584-596","source":"Crossref","is-referenced-by-count":56,"title":["Subquadratic Algorithms for 3SUM"],"prefix":"10.1007","volume":"50","author":[{"given":"Ilya","family":"Baran","sequence":"first","affiliation":[]},{"given":"Erik D.","family":"Demaine","sequence":"additional","affiliation":[]},{"given":"Mihai","family":"P\u01cetra\u015fcu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,9,9]]},"reference":[{"issue":"9","key":"9036_CR1","doi-asserted-by":"crossref","first-page":"1116","DOI":"10.1145\/48529.48535","volume":"31","author":"A. Aggarwal","year":"1988","unstructured":"Aggarwal, A., Vitter, J.S.: The input\/output complexity of sorting and related problems. Commun. ACM 31(9), 1116\u20131127 (1988)","journal-title":"Commun. ACM"},{"key":"9036_CR2","unstructured":"Albers, S., Hagerup, T.: Improved parallel integer sorting without concurrent writing. In: Proc. 3rd ACM\/SIAM Symposium on Discrete Algorithms (SODA), pp.\u00a0463\u2013472 (1992)"},{"key":"9036_CR3","doi-asserted-by":"crossref","unstructured":"Andersson, A., Miltersen, P.B., Riis, S., Thorup, M.: Static dictionaries on AC 0 RAMs: query time $\\Theta(\\sqrt{\\log n\/\\log\\log n})$ is necessary and sufficient. In: Proc. 37th IEEE Symposium on Foundations of Computer Science (FOCS), pp.\u00a0441\u2013450 (1996)","DOI":"10.1109\/SFCS.1996.548503"},{"issue":"1\u20132","key":"9036_CR4","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1016\/S0304-3975(98)00172-8","volume":"215","author":"A. Andersson","year":"1999","unstructured":"Andersson, A., Miltersen, P.B., Thorup, M.: Fusion trees can be implemented with AC 0 instructions only. Theor. Comput. Sci. 215(1\u20132), 337\u2013344 (1999)","journal-title":"Theor. Comput. Sci."},{"key":"9036_CR5","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press and McGraw-Hill (2001)"},{"key":"9036_CR6","unstructured":"Demaine, E.D.: Cache-oblivious algorithms and data structures. In: Lecture Notes from the EEF Summer School on Massive Data Sets, BRICS, University of Aarhus, Denmark, LNCS"},{"key":"9036_CR7","doi-asserted-by":"crossref","unstructured":"Dietzfelbinger, M.: Universal hashing and k-wise independent random variables via integer arithmetic without primes. In: Proc. 13th Symposium on Theoretical Aspects of Computer Science (STACS), pp.\u00a0569\u2013580 (1996)","DOI":"10.1007\/3-540-60922-9_46"},{"key":"9036_CR8","doi-asserted-by":"crossref","unstructured":"Erickson, J.: Bounds for linear satisfiability problems. Chic. J. Theor. Comput. Sci. (1999)","DOI":"10.4086\/cjtcs.1999.008"},{"issue":"3","key":"9036_CR9","doi-asserted-by":"crossref","first-page":"424","DOI":"10.1016\/0022-0000(93)90040-4","volume":"47","author":"M.L. Fredman","year":"1993","unstructured":"Fredman, M.L., Willard, D.E.: Surpassing the information theoretic bound with fusion trees. J.\u00a0Comput. Syst. Sci. 47(3), 424\u2013436 (1993). See also STOC\u201990","journal-title":"J.\u00a0Comput. Syst. Sci."},{"key":"9036_CR10","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/0925-7721(95)00022-2","volume":"5","author":"A. Gajentaan","year":"1995","unstructured":"Gajentaan, A., Overmars, M.H.: On a class of O(n 2) problems in computational geometry. Comput. Geom. Theory Appl. 5, 165\u2013185 (1995)","journal-title":"Comput. Geom. Theory Appl."},{"issue":"2","key":"9036_CR11","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1006\/jagm.2002.1211","volume":"42","author":"M. Thorup","year":"2002","unstructured":"Thorup, M.: Randomized sorting in O(nlog\u2009log\u2009n) time and linear space using addition, shift, and bit-wise boolean operations. J.\u00a0Algorithms 42(2), 205\u2013230 (2002). See also SODA\u201997","journal-title":"J.\u00a0Algorithms"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-007-9036-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-007-9036-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-007-9036-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T09:44:59Z","timestamp":1559123099000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-007-9036-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,9,9]]},"references-count":11,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2008,4]]}},"alternative-id":["9036"],"URL":"https:\/\/doi.org\/10.1007\/s00453-007-9036-3","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,9,9]]}}}