✦ LIBER ✦

A lower bound for finding predecessors in Yao's cell probe model

✍ Scribed by M. Ajtai

Book ID: 105471305
Publisher: Springer-Verlag
Year: 1988
Tongue: English
Weight: 776 KB
Volume: 8
Category: Article
ISSN: 0209-9683
DOI: 10.1007/bf02126797

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Tighter Lower Bounds for Nearest Neighbo

Tighter Lower Bounds for Nearest Neighbor Search and Related Problems in the Cell Probe Model

✍ Omer Barkol; Yuval Rabani 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 187 KB

We prove new lower bounds for nearest neighbor search in the Hamming cube. Our lower bounds are for randomized, two-sided error, algorithms in Yao's cell probe model. Our bounds are in the form of a tradeoff among the number of cells, the size of a cell, and the search time. For example, suppose we

A lower bound for a variational model fo

A lower bound for a variational model for pattern formation in shape-memory alloys

✍ Sergio Conti 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 316 KB

A lower bound for the memory capacity in

A lower bound for the memory capacity in the Potts-Hopfield model

✍ Pablo A. Ferrari; Servet Martínez; Pierre Picco 📂 Article 📅 1992 🏛 Springer 🌐 English ⚖ 349 KB

A novel statistical model for finding pa

A novel statistical model for finding patterns in cell-cycle transcription data

✍ Yvonne E. Pittelkow; Susan R. Wilson 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 758 KB