Author:
Hermelin Danny,Levy Avivit,Weimann Oren,Yuster Raphael
Publisher
Springer Berlin Heidelberg
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Finding MNEMON;Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security;2022-11-07
2. Efficient Dynamic Approximate Distance Oracles for Vertex-Labeled Planar Graphs;Theory of Computing Systems;2019-09-11
3. The nearest colored node in a tree;Theoretical Computer Science;2018-02
4. Efficient Vertex-Label Distance Oracles for Planar Graphs;Theory of Computing Systems;2017-12-12
5. Unifying and Strengthening Hardness for Dynamic Problems via the Online Matrix-Vector Multiplication Conjecture;Proceedings of the forty-seventh annual ACM symposium on Theory of Computing;2015-06-14