✦ LIBER ✦

Tight Bounds for Searching a Sorted Array of Strings

✍ Scribed by Andersson, Arne; Hagerup, Torben; Håstad, Johan; Petersson, Ola

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Time lower bounds for parallel sorting o

✍ Yijie Han; Yoshihide Igarashi 📂 Article 📅 1989 🏛 Springer-Verlag 🌐 English ⚖ 549 KB

On the Tightness of the Alternating-Cycl

✍ Alberto Caprara 📂 Article 📅 1999 🏛 Springer US 🌐 English ⚖ 241 KB

String layouts for a redundant array of

✍ L. Newberg; D. Wolfe 📂 Article 📅 1994 🏛 Springer 🌐 English ⚖ 854 KB

Search for a bound state of three neutro

✍ K. Debertin; E. Rössle 📂 Article 📅 1968 🏛 Elsevier Science 🌐 English ⚖ 93 KB

A tight lower bound for the complexity o

✍ Colm Ó'Dúnlaing 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 876 KB

A Tight Bound for the Delaunay Triangula

✍ Amenta, Nina; Attali, Dominique; Devillers, Olivier 📂 Article 📅 2012 🏛 Springer 🌐 English ⚖ 728 KB