✦ LIBER ✦

Improved data structures for the orthogonal range successor problem

✍ Scribed by Chih-Chiang Yu; Wing-Kai Hon; Biing-Feng Wang

Book ID: 108101015
Publisher: Elsevier Science
Year: 2011
Tongue: English
Weight: 368 KB
Volume: 44
Category: Article
ISSN: 0925-7721
DOI: 10.1016/j.comgeo.2010.09.001

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Space efficient data structures for dyna

Space efficient data structures for dynamic orthogonal range counting

✍ He, Meng; Munro, J. Ian 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 373 KB

On the average performance of orthogonal

On the average performance of orthogonal range search in multidimensional data structures

✍ Amalia Duch; Conrado Martı&#x0301;nez 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 255 KB

Improved algorithms for the range next v

Improved algorithms for the range next value problem and applications

✍ Maxime Crochemore; Costas S. Iliopoulos; Marcin Kubica; M. Sohel Rahman; German 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 356 KB

Randomized Data Structures for the Dynam

Randomized Data Structures for the Dynamic Closest-Pair Problem

✍ Golin, Mordecai; Raman, Rajeev; Schwarz, Christian; Smid, Michiel 📂 Article 📅 1998 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 544 KB

Data structures and algorithms for the s

Data structures and algorithms for the string statistics problem

✍ A. Apostolico, F. P. Preparata 📂 Article 📅 1996 🏛 Springer 🌐 English ⚖ 863 KB

Lower bounds for the addition-subtractio

Lower bounds for the addition-subtraction operations in orthogonal range queries and related problems

✍ Dan E. Willard 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 1003 KB