Proceedings of the 55th Annual ACM Symposium on Theory of Computing 2023
DOI: 10.1145/3564246.3585251
|View full text |Cite
|
Sign up to set email alerts
|

Approximate Distance Sensitivity Oracles in Subquadratic Space

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
4
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
1
1
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(4 citation statements)
references
References 27 publications
0
4
0
Order By: Relevance
“…Let st ⋄ e be a candidate departing path, then we can find it using the algorithm given in Section 5. 6.…”
Section: Querying For a Candidate Departing Pathmentioning
confidence: 99%
See 3 more Smart Citations
“…Let st ⋄ e be a candidate departing path, then we can find it using the algorithm given in Section 5. 6.…”
Section: Querying For a Candidate Departing Pathmentioning
confidence: 99%
“…Gupta and Singh [5] designed an SDO (1) with O(n n) space and O(1) query time. Recently Bilò et al [6] built the SDO(1) (described in [5]) in O(m n + n 2 ) time. Many different aspects of distance oracles have been studied in literature [3,[7][8][9][10][11][12].…”
Section: Introductionmentioning
confidence: 99%
See 2 more Smart Citations