Abstract

Recovery From Non-Decomposable Distance Oracles

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Similar Papers

Paper Title
Journal
Date
Author
Approximate distance oracles with improved stretch for sparse graphs
Liam Roditty ... Roei Tov
Theoretical Computer Science | VOL. 943
Liam Roditty, et. al.Liam Roditty ... Roei Tov
21 Nov 2022
Bounded-leg distance and reachability oracles
...
-
, et. al. ...
20 Jan 2008
Dual-failure distance and connectivity oracles
...
-
, et. al. ...
04 Jan 2009
Nearly 2-Approximate Distance Oracles in Subquadratic Time
Shiri Chechik ... Tianyi Zhang
-
Shiri Chechik, et. al.Shiri Chechik ... Tianyi Zhang
01 Jan 2021
View more papers

More From: IEEE Transactions on Information Theory

Paper Title
Journal
Date
Author
Self-Dual Negacyclic Codes With Variable Lengths and Square-Root-Like Lower Bounds on the Minimum Distances
Conghui Xie ... Zhonghua Sun
IEEE Transactions on Information Theory | VOL. 70
Conghui Xie, et. al.Conghui Xie ... Zhonghua Sun
01 Jul 2024
Constructions of Non-Expandable Cross-Bifix-Free Codes via Expandable Codes
Chunyan Qin ... Bocong Chen
IEEE Transactions on Information Theory | VOL. 70
Chunyan Qin, et. al.Chunyan Qin ... Bocong Chen
01 Jul 2024
On the Weights of Linear Codes With Prescribed Automorphisms
Gaojun Luo ... Martianus Frederic Ezerman
IEEE Transactions on Information Theory | VOL. 70
Gaojun Luo, et. al.Gaojun Luo ... Martianus Frederic Ezerman
01 Jul 2024
Corrections to “Lower Bounds on the Oracle Complexity of Nonsmooth Convex Optimization via Information Theory”
Gábor Braun ... Sebastian Pokutta
IEEE Transactions on Information Theory | VOL. 70
Gábor Braun, et. al.Gábor Braun ... Sebastian Pokutta
01 Jul 2024
View more papers