scientific article; zbMATH DE number 1351079
From MaRDI portal
Publication:4267801
DOI10.4086/cjtcs.1999.008zbMath0924.68001OpenAlexW4234407907MaRDI QIDQ4267801
Publication date: 20 October 1999
Published in: Chicago Journal of Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: http://www.cs.uchicago.edu/publications/cjtcs/articles/1999/8/contents.html
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Parallel algorithms in computer science (68W10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items
Four Soviets walk the dog: improved bounds for computing the Fréchet distance ⋮ Subquadratic algorithms for algebraic 3SUM ⋮ On the least trimmed squares estimator ⋮ Open problems around exact algorithms ⋮ Necklaces, convolutions, and \(X+Y\) ⋮ Subquadratic algorithms for 3SUM ⋮ On Multidimensional and Monotone k-SUM ⋮ 3SUM, 3XOR, triangles
