✦ LIBER ✦

Efficient worst-case data structures for range searching

✍ Scribed by J. L. Bentley; H. A. Maurer

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Efficient Data Structures for Backtrack

✍ Inês Lynce; João Marques-Silva 📂 Article 📅 2005 🏛 Springer Netherlands 🌐 English ⚖ 267 KB

Efficient data structures for backtrack

✍ Inês Lynce; João Marques-Silva 📂 Article 📅 2004 🏛 Springer Netherlands 🌐 English ⚖ 270 KB

Linear space data structures for two typ

✍ Bernard Chazelle; Herbert Edelsbrunner 📂 Article 📅 1987 🏛 Springer 🌐 English ⚖ 859 KB

Opportunistic data structures for range

✍ Chung Keung Poon; Wai Keung Yiu 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 315 KB

Efficient similarity search for market b

✍ Alexandros Nanopoulos; Yannis Manolopoulos 📂 Article 📅 2002 🏛 Springer-Verlag 🌐 English ⚖ 208 KB

Efficient algorithms for obstacle detect

✍ Phillip A. Veatch; Larry S. Davis 📂 Article 📅 1990 🏛 Elsevier Science ⚖ 75 KB