scientific article; zbMATH DE number 7238988
From MaRDI portal
Publication:5116497
DOI10.4230/LIPIcs.SWAT.2018.33zbMath1477.68077arXiv1804.06932MaRDI QIDQ5116497
Yinzhan Xu, Yuzhou Gu, Lijie Chen, Erik D. Demaine, Yuancheng Yu, Virginia Vassilevska Williams
Publication date: 25 August 2020
Full work available at URL: https://arxiv.org/abs/1804.06932
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Data structures (68P05)
Related Items (2)
Upper and lower bounds for fully retroactive graph problems ⋮ How fast can we play Tetris greedily with rectangular pieces?
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Making data structures persistent
- Which problems have strongly exponential complexity?
- On a class of \(O(n^ 2)\) problems in computational geometry
- Conditional lower bounds for space/time tradeoffs
- Subquadratic algorithms for 3SUM
- Towards polynomial lower bounds for dynamic problems
- Optimal dynamic vertical ray shooting in rectilinear planar subdivisions
- Unifying and Strengthening Hardness for Dynamic Problems via the Online Matrix-Vector Multiplication Conjecture
- Matching Triangles and Basing Hardness on an Extremely Popular Conjecture
- Retroactive data structures
- Fully Retroactive Approximate Range and Nearest Neighbor Searching
- Polylogarithmic Fully Retroactive Priority Queues via Hierarchical Checkpointing
- Cloning Voronoi Diagrams via Retroactive Data Structures
- Higher Lower Bounds from the 3SUM Conjecture
- ON SOME FINE-GRAINED QUESTIONS IN ALGORITHMS AND COMPLEXITY
This page was built for publication:
