✦ LIBER ✦

Cache Oblivious Algorithms for the RMQ and the RMSQ Problems

✍ Scribed by Masud Hasan; Tanaeem M. Moosa; M. Sohel Rahman

Book ID: 107508913
Publisher: Springer-Verlag
Year: 2010
Tongue: English
Weight: 202 KB
Volume: 3
Category: Article
ISSN: 1661-8270
DOI: 10.1007/s11786-010-0037-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Oblivious Algorithms for the Maximum Dir

Oblivious Algorithms for the Maximum Directed Cut Problem

✍ Feige, Uriel; Jozeph, Shlomo 📂 Article 📅 2013 🏛 Springer 🌐 English ⚖ 660 KB

Oblivious and Adaptive Strategies for th

Oblivious and Adaptive Strategies for the Majority and Plurality Problems

✍ Fan Chung; Ron Graham; Jia Mao; Andrew Yao 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 137 KB

Algorithms for the Assignment and Transp

Algorithms for the Assignment and Transportation Problems

✍ Munkres, James 📂 Article 📅 1957 🏛 Society for Industrial and Applied Mathematics ⚖ 825 KB

Algorithms for the Tits alternative and

Algorithms for the Tits alternative and related problems

✍ A.S. Detinko; D.L. Flannery; E.A. OʼBrien 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 176 KB

[ACM Press the nineteenth annual ACM sym

[ACM Press the nineteenth annual ACM symposium - San Diego, California, USA (2007.06.09-2007.06.11)] Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures - SPAA '07 - An experimental comparison of cache-oblivious and cache-conscious programs

✍ Yotov, Kamen; Roeder, Tom; Pingali, Keshav; Gunnels, John; Gustavson, Fred 📂 Article 📅 2007 🏛 ACM Press ⚖ 453 KB

Approximation algorithms for the watchma

Approximation algorithms for the watchman route and zookeeper's problems

✍ Xuehou Tan 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 261 KB

Given a simple polygon P with n vertices and a starting point s on its boundary, the watchman route problem asks for a shortest route in P through s such that each point in the interior of the polygon can be seen from at least one point along the route. In this paper, we present a simple, linear-tim