Subquadratic Algorithms for 3SUM
- 9 September 2007
- journal article
- Published by Springer Nature in Algorithmica
- Vol. 50 (4) , 584-596
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Static dictionaries on AC/sup 0/ RAMs: query time θ(√log n/log log n) is necessary and sufficient2002
- Randomized Sorting in O(nloglogn) Time and Linear Space Using Addition, Shift, and Bit-wise Boolean OperationsJournal of Algorithms, 2002
- Fusion trees can be implemented with AC0 instructions onlyTheoretical Computer Science, 1999
- Improved Parallel Integer Sorting without Concurrent WritingInformation and Computation, 1997
- Universal hashing and k-wise independent random variables via integer arithmetic without primesLecture Notes in Computer Science, 1996
- On a class of O(n2) problems in computational geometryComputational Geometry, 1995
- Surpassing the information theoretic bound with fusion treesJournal of Computer and System Sciences, 1993
- Introduction to AlgorithmsJournal of the Operational Research Society, 1991
- The input/output complexity of sorting and related problemsCommunications of the ACM, 1988