受强制性开放获取政策约束的文章 - Shimon Kogan了解详情
可在其他位置公开访问的文章：9 篇
查看
New diameter-reducing shortcuts and directed hopsets: Breaking the barrier
S Kogan, M Parter
Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2022
强制性开放获取政策： European Commission
查看
Beating Matrix Multiplication for n^{1/3}-Directed Shortcuts
S Kogan, M Parter
49th International Colloquium on Automata, Languages, and Programming (ICALP …, 2022
强制性开放获取政策： European Commission
查看
Having hope in hops: New spanners, preservers and lower bounds for hopsets
S Kogan, M Parter
2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS …, 2022
强制性开放获取政策： European Commission
查看
Low-congestion shortcuts in constant diameter graphs
S Kogan, M Parter
Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing …, 2021
强制性开放获取政策： European Commission
查看
Faster and unified algorithms for diameter reducing shortcuts and minimum chain covers
S Kogan, M Parter
Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2023
强制性开放获取政策： European Commission
查看
New additive emulators
S Kogan, M Parter
50th International Colloquium on Automata, Languages, and Programming (ICALP …, 2023
强制性开放获取政策： European Commission
查看
Towards Bypassing Lower Bounds for Graph Shortcuts
S Kogan, M Parter
31st Annual European Symposium on Algorithms (ESA 2023), 2023
强制性开放获取政策： European Commission
查看
The Algorithmic Power of the Greene-Kleitman Theorem
S Kogan, M Parter
32nd Annual European Symposium on Algorithms (ESA 2024), 2024
强制性开放获取政策： European Commission
查看
Giving Some Slack: Shortcuts and Transitive Closure Compressions
S Kogan, M Parter
32nd Annual European Symposium on Algorithms (ESA 2024), 2024
强制性开放获取政策： European Commission
出版信息和资助信息由计算机程序自动确定