Author:
Patrascu Mihai,Roditty Liam
Cited by
33 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Space-Time Tradeoffs for Conjunctive Queries with Access Patterns;Proceedings of the 42nd ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems;2023-06-18
2. New Algorithms for All Pairs Approximate Shortest Paths;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02
3. General Space-Time Tradeoffs via Relational Queries;Lecture Notes in Computer Science;2023
4. Approximation Algorithms and Hardness for n-Pairs Shortest Paths and All-Nodes Shortest Cycles;2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS);2022-10
5. An Axiomatic Approach to Time-Dependent Shortest Path Oracles;Algorithmica;2022-01-24