Pages that link to "Item:Q5470720"
From MaRDI portal
The following pages link to Logarithmic Lower Bounds in the Cell-Probe Model (Q5470720):
Displayed 38 items.
- Succinct data structures for searchable partial sums with optimal worst-case performance (Q719256) (← links)
- Rank/select on dynamic compressed sequences and applications (Q732036) (← links)
- Upper and lower bounds for fully retroactive graph problems (Q832892) (← links)
- Dynamic connectivity for axis-parallel rectangles (Q1016519) (← links)
- Optimal decremental connectivity in planar graphs (Q1693990) (← links)
- Dynamic planar embeddings of dynamic graphs (Q1693993) (← links)
- Dynamic path queries in linear space (Q1799220) (← links)
- A simple primal-dual approximation algorithm for 2-edge-connected spanning subgraphs (Q2019478) (← links)
- Lower bounds for matrix factorization (Q2041242) (← links)
- Constant-time dynamic weight approximation for minimum spanning forest (Q2051831) (← links)
- Lower bounds for encrypted multi-maps and searchable encryption in the leakage cell probe model (Q2096495) (← links)
- A logarithmic lower bound for oblivious RAM (for all Parameters) (Q2139649) (← links)
- Stronger lower bounds for online ORAM (Q2175940) (← links)
- On dynamic bit-probe complexity (Q2373742) (← links)
- A deterministic \(O(m \log {m})\) time algorithm for the Reeb graph (Q2391712) (← links)
- New amortized cell-probe lower bounds for dynamic problems (Q2420582) (← links)
- Trade-offs in dynamic coloring for bipartite and general graphs (Q2696273) (← links)
- Fully Functional Static and Dynamic Succinct Trees (Q2799480) (← links)
- Upper and Lower Bounds on the Power of Advice (Q2816830) (← links)
- Lower Bounds for Online Integer Multiplication and Convolution in the Cell-Probe Model (Q3012835) (← links)
- Matching Triangles and Basing Hardness on an Extremely Popular Conjecture (Q4571929) (← links)
- Lower bounds for matrix factorization (Q5092452) (← links)
- Distance-Preserving Subgraphs of Interval Graphs (Q5111726) (← links)
- (Q5121915) (← links)
- Crossing the Logarithmic Barrier for Dynamic Boolean Data Structure Lower Bounds (Q5130847) (← links)
- Succinct Partial Sums and Fenwick Trees (Q5150921) (← links)
- Steiner Shallow-Light Trees Are Exponentially Lighter than Spanning Ones (Q5502177) (← links)
- (Q5743425) (← links)
- Is there an oblivious RAM lower bound for online reads? (Q5915623) (← links)
- Is there an oblivious RAM lower bound for online reads? (Q5918328) (← links)
- Partial sums on the ultra-wide word RAM (Q5918471) (← links)
- Fully dynamic arboricity maintenance (Q5918831) (← links)
- (Q6065455) (← links)
- Deterministic Near-Optimal Approximation Algorithms for Dynamic Set Cover (Q6081760) (← links)
- Lower bound framework for differentially private and oblivious data structures (Q6138099) (← links)
- Random access in persistent strings and segment selection (Q6174650) (← links)
- Limits of breach-resistant and snapshot-oblivious RAMs (Q6190101) (← links)
- Deterministic Fault-Tolerant Connectivity Labeling Scheme (Q6202245) (← links)