Yanjun Zhang

Home * People * Yanjun Zhang

Yanjun Zhang,

a Chinese American mathematician, computer scientist, and research scientist at Sabre Inc., in the 90s assistant professor at Southern Methodist University [1]. He received a Ph.D. on Parallel Algorithms for Combinatorial Search Problems from University of California, Berkeley in 1989 under thesis advisor Richard Karp [2]. In 1988, Yanjun Zhang and Richard Karp presented a general method for deriving randomized parallel branch-and-bound algorithms from sequential ones. They showed that with high probability the resulting algorithms attained optimal speedup to within a constant factor for large enough problems [3] [4] [5] [6].

1988 …#

• Richard Karp, Yanjun Zhang (1988). A randomized parallel branch-and-bound procedure. STOC ‘88
• Richard Karp, Yanjun Zhang (1989). On parallel evaluation of game trees. SPAA ‘89
• Yanjun Zhang (1989). Parallel Algorithms for Combinatorial Search Problems. Ph.D. thesis, University of California, Berkeley, advisor Richard Karp

1990 …#

• Richard Karp, Yanjun Zhang (1993). Randomized parallel algorithms for backtrack search and branch-and-bound computation. Journal of the ACM, Vol. 40, No. 3
• Richard Karp, Yanjun Zhang (1995). Bounded branching process and and/or tree evaluation. Random Structures & Algorithms, Vol. 7, No. 2
• Yanjun Zhang (1995). On the Optimality of Randomized Alpha-Beta Search. SIAM Journal on Computing, Vol. 24, No. 1
• Yanjun Zhang (1998). The Variance of Two Game Tree Algorithms. Journal of Algorithms, Vol. 28, No. 1
• Richard Karp, Yanjun Zhang (1998). On Parallel Evaluation of Game Trees. Journal of the ACM, Vol. 45, No. 6

2000 …#

• Yanjun Zhang, Si-Qing Zheng (2000). An Efficient Parallel VLSI Sorting Architecture. VLSI Design, Vol. 2000

External Links#

• Yanjun Zhang | LinkedIn
• The Mathematics Genealogy Project - Yanjun Zhang

References#

1. ↑ Yanjun Zhang | LinkedIn
2. ↑ The Mathematics Genealogy Project - Yanjun Zhang
3. ↑ Richard Karp, Yanjun Zhang (1988). A randomized parallel branch-and-bound procedure. STOC ‘88
4. ↑ Abhiram Ranade (1990). A Simpler Analysis of the Karp-Zhang Parallel Branch-and-Bound Method. Technical Report, University of California, Berkeley
5. ↑ Peter Sanders (1995). Fast priority queues for parallel branch-and-bound. IRREGULAR 1995
6. ↑ Tiankai Liu (2003). A Implementation of the Karp-Zhang Parallel Branch-and-Bound Algorithm. under direction of Charles Leiserson, Massachusetts Institute of Technology
7. ↑ dblp: Yanjun Zhang

Up one level