scientific article; zbMATH DE number 7378738

DOI10.4230/LIPIcs.ESA.2018.68MaRDI QIDQ5009638

Maximilian Probst

Publication date: 4 August 2021

Full work available at URL: https://arxiv.org/abs/1807.03721

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

distance oraclescell-probe lower boundsnearest colored node

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites Work

• Unnamed Item
• Ramsey partitions and proximity data structures
• Succinct data structures for nearest colored node in a tree
• Efficient vertex-label distance oracles for planar graphs
• Towards polynomial lower bounds for dynamic problems
• Time-space trade-offs for predecessor search
• Approximate distance oracles
• Automata, Languages and Programming
• Approximate Distance Oracles with Improved Query Time

This page was built for publication: