{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:21:17Z","timestamp":1725549677921},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540281016"},{"type":"electronic","value":"9783540317111"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11534273_36","type":"book-chapter","created":{"date-parts":[[2010,3,12]],"date-time":"2010-03-12T13:31:47Z","timestamp":1268400707000},"page":"409-421","source":"Crossref","is-referenced-by-count":15,"title":["Subquadratic Algorithms for 3SUM"],"prefix":"10.1007","author":[{"given":"Ilya","family":"Baran","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Erik D.","family":"Demaine","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mihai","family":"P\u01cetra\u015fcu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"36_CR1","unstructured":"Albers, S., Hagerup, T.: Improved parallel integer sorting without concurrent writing. In: Proc. 3rd ACM\/SIAM Symposium on Discrete Algorithms (SODA), pp. 463\u2013472 (1992)"},{"key":"36_CR2","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. 441\u2013450 (1996)","DOI":"10.7146\/brics.v4i14.21678"},{"key":"36_CR3","doi-asserted-by":"publisher","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. Theoretical Computer Science\u00a0215, 337\u2013344 (1999)","journal-title":"Theoretical Computer Science"},{"key":"36_CR4","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press and McGraw-Hill (2001)"},{"key":"36_CR5","series-title":"LNCS","first-page":"39","volume-title":"Lecture Notes from the EEF Summer School on Massive Data Sets, BRICS","author":"E.D. Demaine","year":"2002","unstructured":"Demaine, E.D.: Cache-oblivious algorithms and data structures. In: Lecture Notes from the EEF Summer School on Massive Data Sets, BRICS. LNCS, pp. 39\u201346. University of Aarhus, Denmark (2002)"},{"key":"36_CR6","series-title":"Lecture Notes in Computer Science","first-page":"569","volume-title":"STACS 96","author":"M. Dietzfelbinger","year":"1996","unstructured":"Dietzfelbinger, M.: Universal hashing and k-wise independent random variables via integer arithmetic without primes. In: Puech, C., Reischuk, R. (eds.) STACS 1996. LNCS, vol.\u00a01046, pp. 569\u2013580. Springer, Heidelberg (1996)"},{"key":"36_CR7","unstructured":"Erickson, J.: Bounds for linear satisfiability problems. Chicago Journal of Theoretical Computer Science\u00a0(8) (1999)"},{"key":"36_CR8","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. Computational Geometry: Theory and Applications\u00a05, 165\u2013185 (1995)","journal-title":"Computational Geometry: Theory and Applications"},{"key":"36_CR9","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(nloglogn) time and linear space using addition, shift, and bit-wise boolean operations. Journal of Algorithms\u00a042, 205\u2013230 (2002); See also SODA (1997)","journal-title":"Journal of Algorithms"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11534273_36.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:10:02Z","timestamp":1605643802000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11534273_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540281016","9783540317111"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/11534273_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}