Author:
Karp R. M.,Saks M.,Wigderson A.
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A Nearly Optimal Randomized Algorithm for Explorable Heap Selection;Integer Programming and Combinatorial Optimization;2023
2. Quantum speedup of branch-and-bound algorithms;Physical Review Research;2020-01-16
3. The ANTS problem;Distributed Computing;2016-10-18
4. Parallel exhaustive search without coordination;Proceedings of the forty-eighth annual ACM symposium on Theory of Computing;2016-06-19
5. Space-Efficient Parallel Algorithms for Combinatorial Search Problems;Mathematical Foundations of Computer Science 2013;2013