✦ LIBER ✦

Halfplanar range search in linear space and O(n0.695) query time

✍ Scribed by Herbert Edelsbrunner; Emo Welzl

Book ID: 113162913
Publisher: Elsevier Science
Year: 1986
Tongue: English
Weight: 396 KB
Volume: 23
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(86)90088-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Range majority in constant time and line

Range majority in constant time and linear space

✍ Stephane Durocher; Meng He; J. Ian Munro; Patrick K. Nicholson; Matthew Skala 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 253 KB

Randomized Sorting in O(n log 

Randomized Sorting in O(n log log n) Time and Linear Space Using Addition, Shift, and Bit-wise Boolean Operations

✍ Mikkel Thorup 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 187 KB

A randomized sorting algorithm is presented, doing as described in the title. Implications of the techniques are discussed for dictionaries and priority queues.

Optimum detection and location estimatio

Optimum detection and location estimation of target lines in the range-time space of a search radar

✍ A. Moqiseh; S. Sharify; M.M. Nayebi 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 377 KB

Search for violation of fundamental time

Search for violation of fundamental time-reversal and space-reflection symmetries in solid-state experiments

✍ Kuenzi, S. A.; Sushkov, O. P.; Dzuba, V. A.; Cadogan, J. M. 📂 Article 📅 2002 🏛 The American Physical Society 🌐 English ⚖ 175 KB