Abhiram Ranade
- 1.Richard Karp and Yanjun Zhang. A randomized parallel branch-and-bound procedure. In Proceedings of the ACM Annual Symposium on Theory of Computing, pages 290-300, 1988. Google Scholar
Digital Library
- 2.Tom Leighton, Mark Newman, Abhiram Ranade, and Eric Schwabe. Dynamic Tree Embeddings on Butterflies and Hypercubes. In Proceedings of lhe A CM Symposium on Parallel Algorithms and Archilectures, pages 224-234, June 1989. Google ScholarDigital Library
- 3.Abhiram G. Ranade. A Simpler Analysis of the Karp-Zhang Parallel Branch-and-Bound Method. Technical Report UCB/CSD 90/586, University of California, August 1990. Google ScholarDigital Library
- 4.Yanjun Zhang. Parallel Algorithms for Combinatorial Search Problems. PhD thesis, University of California, 1989. UCB/CSD 89/543. Google ScholarDigital Library
Index Terms
- Optimal speedup for backtrack search on a butterfly network
Recommendations
Optimal speedup for backtrack search on a butterfly network
Special issue: ACM symposium on parallel algorithms and architecturesThe efficiency of randomized parallel backtrack search
SPDP '94: Proceedings of the 1994 6th IEEE Symposium on Parallel and Distributed ProcessingWe present a refined analysis of the randomized parallel backtrack search algorithm (RPBS) of Karp and Zhang (1993). It is shown that the total number of messages occurred in the execution of RPBS is likely to be O(hp log d) where h and d are the height ...
Random backtracking in backtrack search algorithms for satisfiability
This paper proposes the utilization of randomized backtracking within complete backtrack search algorithms for propositional satisfiability (SAT). In recent years, randomization has become pervasive in SAT algorithms. Incomplete algorithms for SAT, for ...
Comments