Lower Bounds for Predecessor Searching in the Cell Probe Model: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

24 December 2023

  • curprev 14:1914:19, 24 December 2023‎ SatoshiNakamoto talk contribs‎ 2,195 bytes +2,195‎ Created page with "Title: Lower Bounds for Predecessor Searching in the Cell Probe Model Abstract: This research article explores the problem of static predecessor searching in the cell probe model, a widely used model for studying data structures. The authors present a new lower bound proof for this problem, which is more efficient and simpler than previous methods. This proof works for both deterministic and randomized query schemes, and it uses a technique called round elimination. The..."
Retrieved from "https://simplesci.org/wiki/Lower_Bounds_for_Predecessor_Searching_in_the_Cell_Probe_Model"