✦ LIBER ✦

Tight Lower Bounds for Halfspace Range Searching

✍ Scribed by Sunil Arya; David M. Mount; Jian Xia

Book ID: 113044311
Publisher: Springer
Year: 2012
Tongue: English
Weight: 700 KB
Volume: 47
Category: Article
ISSN: 0179-5376
DOI: 10.1007/s00454-012-9412-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Lower bounds for off-line range searchin

Lower bounds for off-line range searching

✍ B. Chazelle 📂 Article 📅 1997 🏛 Springer 🌐 English ⚖ 665 KB

Tight lower bounds for Shellsort

✍ Mark Allen Weiss; Robert Sedgewick 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 541 KB

Unconditional lower bounds for learning

Unconditional lower bounds for learning intersections of halfspaces

✍ Adam R. Klivans; Alexander A. Sherstov 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 444 KB

Tight Bounds for Searching a Sorted Arra

Tight Bounds for Searching a Sorted Array of Strings

✍ Andersson, Arne; Hagerup, Torben; Håstad, Johan; Petersson, Ola 📂 Article 📅 2000 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 272 KB

Tight chip area lower bounds for string

Tight chip area lower bounds for string matching

✍ O. Sydotkora; I. Vřto 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 134 KB

Tight lower bounds for minimum weight tr

Tight lower bounds for minimum weight triangulation heuristics

✍ Christos Levcopoulos; Drago Krznaric 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 643 KB