DOCSLIB.ORG
Explore
Sign Up
Log In
Upload
Search
Home
» Tags
» Predecessor problem
Predecessor problem
Persistent Predecessor Search and Orthogonal Point Location on the Word
Lecture 1 — 24 January 2017 1 Overview 2 Administrivia 3 The
On Data Structures and Memory Models
Predecessor Search
Advanced Data Structures 1 Introduction 2 Setting the Stage 3
Dynamic Integer Sets with Optimal Rank, Select, and Predecessor
MIT 6.851 Advanced Data Structures Prof
Advanced Rank/Select Data Structures: Succinctness, Bounds, and Applications
Computational Geometry Through the Information Lens Mihai Pdtracu
26 January, 2017 1 Overview 2 Y-Fast Tries
Minimal Indices for Predecessor Search ∗ Sarel Cohen , Amos Fiat, Moshik Hershcovitch, Haim Kaplan
Lower Bound Techniques for Data Structures Mihai
Predecessor Data Structures
Data Structuring Problems in the Bit Probe Model
Dynamic Elias-Fano Representation
Engineering Predecessor Data Structures for Dynamic Integer Sets
Optimal Bounds for the Predecessor Problem
Succinct Data Structures
Top View
Optimal Bounds for the Predecessor Problem and Related Problems
Succinct Dynamic Ordered Sets with Random Access
Succinct Dynamic Ordered Sets with Random Access∗